In this paper we compare the performance of several popular clustering algorithms, including k-means, fuzzy c-means, hierarchical agglomerative, and graph partitioning. The novelty of this work is that the objects to be clustered are represented by graphs rather than the usual case of numeric feature vectors. We apply these techniques to web documents, which are represented by graphs instead of vectors, in order to perform web document clustering. Web documents are structured information sources and thus appropriate for modeling by graphs. We will examine the performance of each clustering algorithm when the web documents are represented as both graphs and vectors. This will allow us to investigate the applicability of each algorithm to the problem of web document clustering. © Springer-Verlag 2004.
CITATION STYLE
Schenker, A., Last, M., Bunke, H., & Kandel, A. (2004). Comparison of algorithms for web document clustering using graph representations of data. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3138, 190–197. https://doi.org/10.1007/978-3-540-27868-9_19
Mendeley helps you to discover research relevant for your work.