Semi-supervised probabilistic distance clustering and the uncertainty of classification

Studies in Classification, Data Analysis, and Knowledge Organization

Volumn , Issue , 2010, Pages 3-20

  Iyigun, Cem ^b   Ben Israel, Adi ^a  

^a RUTGERS UNIVERSITY   (United States)

^b NONE

Author keywords

Breast cancer data; Classification; Classification uncertainty; Clustering; Contour approximation of data; Diabetes data; Entropy; Home range; Kullback Leibler divergence; Probabilistic clustering; Semi supervised learning

Indexed keywords

BREAST CANCER DATA; CLUSTERING; CONTOUR APPROXIMATION OF DATA; HOME RANGE; KULLBACK LEIBLER DIVERGENCE; PROBABILISTIC CLUSTERING; SEMI-SUPERVISED LEARNING;

CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; DISEASES; ENTROPY;

SUPERVISED LEARNING;

EID: 84879593272     PISSN: 14318814     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-642-01044-6-1     Document Type: Conference Paper

References (28)

1. Aczél, J. (1984). Measuring information beyond communication theory - Why some generalized information measures may be useful, others not. Aequationes Mathematicae, 27, 1-19.
2. Arav, M. (2008). Contour approximation of data and the harmonic mean. Journal of Mathematical Inequalities, 2, 161-167.
3. Bar-Hillel, A., Hertz, T., Shental, N., &Weinshall, D. (2005). Learning a mahalanobis metric from equivalence constraints. Journal of Machine Learning Research, 6, 937-965.
4. Ben-Israel, A., & Iyigun, C. (2008). Probabilistic distance clustering. Journal of Classification, 25, 5-26.
5. Ben-Tal, A., Ben-Israel, A., & Teboulle, M. (1991). Certainty equivalents and information measures: Duality and extremal principles. Journal of Mathematical Analysis and Applications, 157, 211-236.
6. Ben-Tal, A., & Teboulle, M. (1987). Penalty functions and duality in stochastic programming via φ-divergence functionals. Mathematics of Operations Research, 12, 224-240.
7. Bezdek, J. C. (1981). Pattern recognition with fuzzy objective function algorithms. New York: Plenum.
8. Chapelle, O., Schölkopf, B., & Zien, A. (Eds.) (2006). Semi-supervised learning. Cambridge MA: MIT Press.
9. Csiszár, I. (1978). Information measures: A critical survey. In Trans. 7th Prague Conf. on Info. Th., Statist., Decis. Funct., Random Processes and 8th European Meeting of Statist. (Vol. B, pp. 73-86). Prague: Academia.
10. Dixon, K. R., & Chapman, J. A. (1980). Harmonic mean measure of animal activity areas. Ecology, 61, 1040-1044.
11. Grira, N., Crucianu, M., & Boujemaa, N. (2005). Unsupervised and semi-supervised clustering: A brief survey. In A Review of Machine Learning Techniques for Processing Multimedia Content. Report of the MUSCLE European Network of Excellence.
12. Höppner, F., Klawonn, F., Kruse, R., & Runkler, T. (1999). Fuzzy cluster analysis. New York: Wiley.
13. Iyigun, C., & Ben-Israel, A. (2008). Probabilistic distance clustering adjusted for cluster size. Probability in the Engineering and Informational Sciences, 22, 1-19.
14. Iyigun, C., & Ben-Israel, A. (2009). Contour approximation of data: The dual problem. Linear Algebra and Its Applications, 430, 2771-2780.
15. Jain, A. K., Murty, M. N., & Flynn, P. J. (1999). Data clustering: A review. ACM Computing Surveys, 31, 264-323.
16. Kuhn, H.W. (1967). On a pair of dual nonlinear programs. In J. Abadie (Ed.), Methods of nonlinear programming (pp. 38-54). Amsterdam: North-Holland.
17. Kuhn, H. W. (1973). A note on Fermat's problem. Mathematical Programming, 4, 98-107.
18. Kullback, S. (1959). Information theory and statistics. New York: Wiley.
19. Kullback, S., & Leibler, R. A. (1951). On information and sufficiency. Annals of Mathematical Statistics, 22, 79-86.
20. Lim, T.-S., Loh, W.-Y., & Shih, Y.-S. (2000). A comparison of prediction accuracy, complexity, and training time of thirty three old and new classification algorithms. Machine Learning, 40, 203-228.
21. Luce, R. D. (1959). Individual choice behavior. New York: Wiley.
22. Mangasarian, O. L., Setiono, R., &Wolberg,W. H. (1999). Pattern recognition via linear programming: theory and application to medical diagnosis. In T. Coleman, & Y. Li (Eds.) Large-scale numerical optimization (pp. 22-30). Philadelphia: SIAM Publications.
23. Merz, C., & Murphy, P. (1996). UCI repository of machine learning databases. Irvine, CA: Department of Information and Computer Science, University of California. Retrieved from http://www.ics.uci.edu/mlearn/ MLRepository.html.
24. Teboulle, M. (2007). A unified continuous optimization framework for center-based clustering methods. Journal of Machine Learning Research, 8, 65-102.
25. Weiszfeld, E. (1937). Sur le point par lequel la somme des distances de n points donnés est minimum. Tohoku Mathematical Journal, 43, 355-386.
26. Wolberg, W. H., & Mangasarian, O. L. (1990). Multisurface method of pattern separation for medical diagnosis applied to breast cytology. Proceedings of the National Academy of Sciences of USA 87, 9193-9196.
27. Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2003). Distance metrice learning with application to clustering with side-information. In Advances in neural information processing systems (Vol. 15). Cambridge MA: MIT Press.
28. Yellott, J. I. Jr. (2001). Luce's Choice Axiom. In N. J. Smelser, & P. B. Baltes (Eds.), International Encyclopedia of the Social and Behavioral Sciences (pp. 9094-9097). Oxford: Elsevier. ISBN 0-08-043076-7.