Refined shared nearest neighbors graph for combining multiple data clusterings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2810, Issue , 2003, Pages 307-318

  Ayad, Hanan ^a   Kamel, Mohamed ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALTERNATIVE CLUSTERING; CLUSTER ENSEMBLES; CO-ASSOCIATION MATRIX; COMBINING METHOD; DATA PATTERNS; NATURAL CLUSTERS; NEAREST NEIGHBORS; SHARED NEAREST NEIGHBORS;

CLUSTERING ALGORITHMS;

EID: 35248825625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45231-7_29     Document Type: Article

References (16)

1. J. Ghosh. Multiclassifier systems: Back to the future. In J. Kittler F. Roli, editor, Multiple Classifier Systems: Third International Workshop, MCS 2002, Proceedings. LNCS 2364, Pages 1-15, Cagliari, Italy, June 2002. Springer.
2. K. Kittler, M. Hatef, R.P.W Duin, and J. Matas. On combining classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(3):226-239, March 1998.
3. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining partitionings. In Conference on Artificial Intelligence (AAAI 2002), pages 93-98, Edmonton, July 2002. AAAI/MIT Press.
4. A. Fred and A.K. Jain. Data clustering using evidence accumulation. In Proceedings of the 16th International Conference on Pattern Recognition. ICPR 2002, volume 4, pages 276-280, Quebec City, Quebec, Canada, August 2002.
5. Y. Qian and C. Suen. Clustering combination method. In International Conference on Pattern Recognition. ICPR 2000, volume 2, pages 732-735, Barcelona, Spain, September 2000.
6. H. Ayad and M. Kamel. Finding natural clusters using multi-clusterer combiner based on shared nearest neighbors. In Multiple Classifier Systems: Fourth International Workshop, MCS 2003, Guildford, Surrey, United Kingdom, June 11-13. Proceedings. To Appear, 2003.
7. R.A. Jarvis and E.A. Patrick. Clustering using a similarity measure based on shared nearest neighbors. IEEE Transactions on Computers, C-22(11):1025-1034, November 1973.
8. L. Ertoz, M. Steinbach, and V. Kumar. Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. Technical report, Department of Computer Science, University of Minnesota, 2002.
9. L. Ertoz, M. Steinbach, and V. Kumar. A new shared nearest neighbor clustering algorithm and its applications. In Workshop on Clustering High Dimensional Data and its Applications at 2nd SIAM International Conference on Data Mining, Arlington, VA, 2002.
10. George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report TR 95-035, Department of Computer Science and Engineering, University of Minnesota, 1995.
11. George Karypis and Vipin Kumar. Multilevel k-way partitioning scheme for irregular graphs. Technical Report TR 95-064, Department of Computer Science and Engineering, University of Minnesota, 1995.
12. George Karypis and Vipin Kumar. Multilevel algorithms for multi-constraint graph partitioning. In Conference on High Performance Networking and Computing. Proceedings of the 1998 ACM/IEEE conference on Supercomputing, San Jose, CA, 1998.
13. A. Strehl and J. Ghosh. Relationship-based clustering and visualization for high dimensional data mining. INFORMS Journal on Computing, pages 1-23, 2002.
14. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In KDD Workshop on Text Mining, 2000.
15. Paul Horton and Kenta Nakai. A probablistic classification system for predicting the cellular localization sites of proteins. Intelligent Systems in Molecular Biology, pages 109-115, 1996.
16. F. Alimoglu. Combining multiple classifiers for pen-based handwritten digit recognition. Master's thesis, Institute of Graduate Studies in Science and Engineering, Bogazici University, 1996.