Finding natural clusters using multi-clusterer combiner based on shared nearest neighbors

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

Volumn 2709, Issue , 2003, Pages 166-175

  Ayad, Hanan ^a   Kamel, Mohamed ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BALANCING FACTOR; MULTIPLE CLASSIFIERS; NATURAL CLUSTERS; NEAREST NEIGHBORHOOD; NUMBER OF CLUSTERS; RELATIVE WEIGHTS; SHARED NEAREST NEIGHBORS; WEIGHTED GRAPH;

CLUSTERING ALGORITHMS;

EID: 35248893423     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44938-8_17     Document Type: Article

References (15)

1. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
2. B. S. Everitt, S. Landau, and M. Leese. Cluster Analysis. Arnold and Oxford University Press Inc., fourth edition, 2001.
3. Y. Qian and C. Suen. Clustering combination method. In International Conference on Pattern Recognition. ICPR 2000, volume 2, Barcelona, Spain, September 2000.
4. J. Ghosh. Multiclassifier systems: Back to the future. In J. Kittler F. Roli, editor, Multiple Classifier Systems: Third International Workshop, MCS 2002, Proceedings, volume 2364, Cagliari, Italy, June 2002. Springer.
5. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining partitionings. In Conference on Artificial Intelligence (AAAI 2002), Edmonton, July 2002. AAAI/MIT Press.
6. A. Fred and A.K. Jain. Data clustering using evidence accumulation. In Proceedings of the 16th International Conference on Pattern Recognition. ICPR 2002, Quebec City, Quebec, Canada, August 2002.
7. H. Ayad and M. Kamel. Topic discovery from text using aggregation of different clustering methods. In R. Cohen and B. Spencer, editors, Advances in Artificial Intelligence: 15th Conference of the Canadian Society for Computational Studies of Intelligence. Proceedings, AI 2002 Calgary, Canada, May 27-29 2002.
8. R.A. Jarvis and E.A. Patrick. Clustering using a similarity measure based on shared nearest neighbors. IEEE Transactions on Computers, C-22(11), November 1973.
9. 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.
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. Relationship-based Clustering and Cluster Ensembles for High-dimensional Data Mining. PhD thesis, The University of Texas at Austin, May 2002.
14. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In KDD Workshop on Text Mining, 2000.
15. O. L. Mangasarian and W. H. Wolberg. Cancer diagnosis via linear programming. SIAM News, 23(5):1-18, September 1990.