Li Yan
School of Engineer, Honghe University, Mengzi, 661100, People Republic of China
Wei Gao
School of Information Science and Technology, Yunnan Normal University, Kunming, 650500, People Republic of China
JunSheng Li
School of Engineer, Honghe University, Mengzi, 661100, People Republic of China
ABSTRACT
As the extension of Gao et al. (2013), we present the partitioning scheme made of dyadic cubes, the approximation result is thereby obtained concern such partitioning. It is highlighted in this study that AUC criterion multi-dividing ontology algorithm with tree ontology structure and specific split rule has good statistic characteristics, and show that the algorithm under these partitioning schemes are convergent.
PDF References Citation
How to cite this article
Li Yan, Wei Gao and JunSheng Li, 2013. Piecewise Function Approximation and Vertex Partitioning Schemes for
Multi-dividing Ontology Algorithm in Auc Criterion Setting (II). Journal of Applied Sciences, 13: 3257-3262.
DOI: 10.3923/jas.2013.3257.3262
URL: https://scialert.net/abstract/?doi=jas.2013.3257.3262
DOI: 10.3923/jas.2013.3257.3262
URL: https://scialert.net/abstract/?doi=jas.2013.3257.3262
REFERENCES
- Breiman, L., J. Friedman, R.A. Olshen and C.J. Stone, 1984. Classification and Regression Trees. Wadsworth International Group, USA., ISBN-10: 0534980546, Pages: 368.
Direct Link