Unsupervised data pruning for clustering of noisy data

Knowledge-Based Systems

Volumn 21, Issue 7, 2008, Pages 612-616

  Hong, Yi ^a   Kwong, Sam ^a   Chang, Yuchou ^b   Ren, Qingsheng ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b BRIGHAM YOUNG UNIVERSITY   (United States)

^c SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Clustering analysis; Clustering ensembles; Data pruning

Indexed keywords

BOOLEAN FUNCTIONS; CLUSTERING ALGORITHMS; FLOW OF SOLIDS; LABELING; LABELS; LEARNING ALGORITHMS; LEARNING SYSTEMS;

CLUSTERING ANALYSIS; CLUSTERING ENSEMBLES; DATA PRUNING;

CLUSTER ANALYSIS;

ALGORITHMS; CLASSIFICATION; DATA PROCESSING; LABELING;

EID: 50949097414     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2008.03.052     Document Type: Article

References (21)

1. A. Angelova, Y. Abu-Mostafa, P. Perona, Pruning training sets for learning of object categories, in: IEEE Conference on Computer Vision and Pattern Recognition, 2005, pp. 494-501.
2. J. Kubica, A. Moore, Probabilistic noise identification and data cleaning, Technical Report CMU-RI-TR-02-26, CMU, 2002.
3. X. Zhu, X. Wu, Y. Yang, Error detection and impact-sensitive instance ranking in noisy data, in: National Conference on Artificial Intelligence, 2004, pp. 378-384.
4. Brodley C.E., and Friedl M.A. Identifying mislabeled training instances. Journal of Artificial Intelligence Research 11 (1999) 131-167
5. C.E. Brodley, M.A. Friedl, Identifying and eliminating mislabeled training instances, in: National Conference on Artificial Intelligence, 1996, pp. 799-805.
6. D. Gamberger, N. Lavrac, G. Groselj, Experiments with noisy filtering in a medical domain, in: International Conference on Machine Learning, 1999, pp. 143-151.
7. I. Dagan, S.P. Engelson, Committee-based sampling for training probabilistic classifier, in: International Conference on Machine Learning, 1995, pp. 150-157.
8. Freund Y., Seung H.S., Shamir E., and Tishby N. Selective sampling using the query by committee algorithm. Machine Learning 28 (1997) 133-168
9. Arning A., Agrawal R., and Raghavan P. A linear method for deviation detection in large databases. Knowledge Discovery and Data Mining (1996) 164-169
10. John G.H. Robust decision trees: removing outliers from databases. Knowledge Discovery and Data Mining (1995) 174-179
11. Guyon I., Matic N., and Vapnik V. Discovering informative patterns and data cleaning. Knowledge Discovery and Data Mining (1996) 181-203
12. X. Zhu, X. Wu, S. Chen, Eliminating class noise in large datasets, in: International Conference on Machine Learning, 2003, pp. 920-927.
13. Strehl A., and Ghosh J. Clustering ensembles - a knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research 3 (2002) 583-617
14. Fred A., and Jain A.K. Combining multiple clusterings using evidence accumulation. IEEE Transactions on Pattern Analysis and Machine Intelligence 27 (2005) 835-850
15. X.Z. Fern, C.E. Brodley, Clustering ensembles for high dimensional data clustering, in: International Conference on Machine Learning, 2003, pp. 186-193.
16. C. Blake, C. Merz, UCI repository of machine learning databases. Available from: .
17. W.M. Rand, Objective criteria for the evaluation of clustering methods, Journal of American Statistical Association, 66, 846-850.
18. Y. Hong, S. Kwong, Y. Chang, Q. Ren, Clustering ensembles guided unsupervised feature selection using population based incremental learning algorithm, Pattern Recognition, in press.
19. Hong Y., Kwong S., Chang Y., and Ren Q. Consensus unsupervised feature ranking from multiple views. Pattern Recognition Letters 29 5 (2008) 595-602
20. Ho T.K. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 8 (1998) 832-844
21. Y. Hong, S. Kwong, Learning assignment order of instances for constrained clustering algorithm, IEEE Transactions on System, Man and Cybernetics, Part B, submitted for publication.