Density-Based cluster algorithms in low-Dimensional and high-Dimensional applications

Proceedings of the 2nd International Workshop on "Text-Based Information Retrieval", TIR 2005 - In Conjunction with the 28th Annual German Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 45-55

  Stein, Benno ^a   Busch, Michael ^b  

^a BAUHAUS UNIVERSITY WEIMAR   (Germany)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Density based cluster analysis; Document categorization; High dimensional data

Indexed keywords

ALGORITHMIC PROPERTIES; CLUSTER ALGORITHMS; DENSITY-BASED; DENSITY-BASED ALGORITHM; DOCUMENT CATEGORIZATION; GEOMETRIC DATA ANALYSIS; HIGH DIMENSIONAL DATA; ROBUST APPROACHES;

ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; INFORMATION RETRIEVAL;

CLUSTERING ALGORITHMS;

EID: 38149105983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (41)

1. Mikhail Alexandrov, Alexander F. Gelbukh, and Paolo Rosso. An approach to clustering abstracts. In NLDB, pages 275-285, 2005.
2. Thomas Bailey and John Cowles. Cluster Definition by the Optimization of Simple Measures. IEEE Transactions on Pattern Analysis and Machine Intelligence, September 1983.
3. J. C. Bezdek and N. R. Pal. Cluster Validation with Generalized Dunn's Indices. In N. Kasabov and G. Coghill, editors, Proceedings of the 2nd international two-stream conference on ANNES, pages 190-193, Piscataway, NJ, 1995. IEEE Press.
4. Michael Busch. Analyse dichtebasierter Clusteralgorithmen am Beispiel von DBSCAN und MajorClust. Study work, Paderborn University, Institut for Computer Science, March 2005.
5. D.L. Davies and D.W. Bouldin. A Cluster Separation Measure. IEEE Transactions on Pattern Analysis and Machine Learning, 1(2), 1979.
6. Scott C. Deerwester, Susan T. Dumais, Thomas K. Landauer, GeorgeW. Furnas, and Richard A. Harshman. Indexing by Latent Semantic Analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
7. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD96), 1996.
8. B. S. Everitt. Cluster analysis. New York, Toronto, 1993.
9. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of the nineteenth design automation conference, pages 175-181. IEEE Press, 1982. ISBN 0-89791-020-6.
10. K. Florek, J. Lukaszewiez, J. Perkal, H. Steinhaus, and S. Zubrzchi. Sur la liason et la division des points d'un ensemble fini. Colloquium Methematicum, 2, 1951.
11. D. B. Fogel and L. J. Fogel. Special Issue on Evolutionary Computation. IEEE Transaction of Neural Networks, 1994.
12. Antonin Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Beatrice Yormark, editor, SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June18-21, 1984, pages 47-57. ACM Press, 1984.
13. Eui-Hong Han and George Karypis. Centroid-Based Document Classification: Analysis and Experimental Results. Technical Report 00-017, Univercity of Minnesota, Department of Computer Science/Army HPC Research Center, March 2000.
14. Eui-Hong Han, George Karypis, and Vipin Kumar. Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 53-65, Minneapolis, USA, 2001. Univercity of Minnesota, Department of Computer Science/Army HPC Research Center.
15. Makoto Iwayama and Takenobu Tokunaga. Cluster-based text categorization: a comparison of category search strategies. In Edward A. Fox, Peter Ingwersen, and Raya Fidel, editors, Proceedings of SIGIR-95, 18th ACM International Conference on Research and Development in Information Retrieval, pages 273-281, Seattle, USA, 1995. ACM Press, New York, US.
16. Anil K. Jain and Richard C. Dubes. Algorithms for Clustering in Data. Prentice Hall, Englewood Cliffs, NJ, 1990. ISBN 0-13-022278-X.
17. S. C. Johnson. Hierarchical clustering schemes. Psychometrika, 32, 1967.
18. G. Karypis, E.-H. Han, and V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. Technical Report Paper No. 432, University of Minnesota, Minneapolis, 1999.
19. George Karypis and Vipin Kumar. Analysis of multilevel graph partitioning. In Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), page 29. ACM Press, 1995. ISBN 0-89791-816-9. doi: http://doi.acm.org/ 10.1145/224170.224229.
20. Leonard Kaufman and Peter J. Rousseuw. Finding Groups in Data. Wiley, 1990.
21. B.W. Kernighan and S. Lin. Partitioning Graphs. Bell Laboratories Record, January 1970.
22. R. W. Klein and R. C. Dubes. Experiments in Projection and Clustering by Simulated Annealing. Pattern Recognition, 22:213-220, 1989.
23. T. Kohonen. Self Organization and Assoziative Memory. Springer, 1990.
24. T. Kohonen, S. Kaski, K. Lagus, J. Salojrvi, J. Honkela, V. Paatero, and A. Saarela. Self organization of a massive document collection. In IEEE Transactions on Neural Networks, volume 11, may 2000.
25. Thomas Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.
26. David D. Lewis. Reuters-21578 Text Categorization Test Collection. http://www.research.att.com/∼lewis 1994.
27. J. B. MacQueen. Some Methods for Classification and Analysis of Multivariate Observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pages 281-297, 1967.
28. Alistair Morrison, Greg Ross, and Matthew Chalmers. Fast Multidimensional Scaling through Sampling, Springs and Ixnterpolation. Information Visualization, 2(1):68-77, 2003.
29. V. V. Raghavan and K. Birchand. A Clustering Strategy Based on a Formalism of the Reproduction Process in a Natural System. In Proceedings of the Second International Conference on Information Storage and Retrieval, pages 10-22, 1979.
30. Tom Roxborough and Arunabha. Graph Clustering using Multiway Ratio Cut. In Stephen North, editor, Graph Drawing, Lecture Notes in Computer Science, Springer, 1996.
31. Reinhard Sablowski and Arne Frick. Automatic Graph Clustering. In Stephan North, editor, Graph Drawing, Lecture Notes in Computer Science, Springer, 1996.
32. P. H. A. Sneath. The application of computers to taxonomy. J. Gen. Microbiol., 17, 1957.
33. Benno Stein and Sven Meyer zu Eißen. Document Categorization with MAJORCLUST. In Amit Basu and Soumitra Dutta, editors, Proceedings of the 12th Workshop on Information Technology and Systems (WITS 02), Barcelona Spain, pages 91-96. Technical University of Barcelona, December 2002.
34. Benno Stein and Oliver Niggemann. On the Nature of Structure and its Identification. In Peter Widmayer, Gabriele Neyer, and Stefan Eidenbenz, editors, Graph-Theoretic Concepts in Computer Science, volume 1665 LNCS of Lecture Notes in Computer Science, pages 122-134. Springer, June 1999. ISBN 3-540-66731-8.
35. Benno Stein, Sven Meyer zu Eißen, and FrankWißbrock. On Cluster Validity and the Information Need of Users. In M. H. Hanza, editor, Proceedings of the 3rd IASTED International Conference on Artificial Intelligence and Applications (AIA 03), Benalmádena, Spain, pages 216-221, Anaheim, Calgary, Zurich, September 2003. ACTA Press. ISBN 0-88986-390-3.
36. Michael Steinbach, George Karypis, and Vipin Kumar. A comparison of document clustering techniques. Technical Report 00-034, Department of Computer Science and Egineering, University of Minnesota, 2000.
37. Roger Weber, Hans-J. Schek, and Stephen Blott. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In Proceedings of the 24th VLDB Conference New York, USA, pages 194-205, 1998.
38. ZhenyuWu and Richard Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, November 1993.
39. J. T. Yan and P. Y. Hsiao. A fuzzy clustering algorithm for graph bisection. Information Processing Letters, 52, 1994.
40. C. T. Zahn. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters. IEEE Transactions on computers, C-20(1), 1971.
41. Ying Zaho and George Karypis. Criterion Functions for Document Clustering: Experiments and Analysis. Technical Report 01-40, Univercity of Minnesota, Department of Computer Science/Army HPC Research Center, Feb 2002.