Suffix Tree Clustering Algorithm
(Redirected from Suffix Tree Clustering)
Jump to navigation
Jump to search
See: Partitional Clustering Algorithm, Suffix Tree, K-Means Clustering Algorithm.
References
2006
- (Yoo & Hu) ⇒ Illhoi Yoo, and Xiaohua Hu. (2006). “A Comprehensive Comparison Study of Document Clustering for a Biomedical Digital Library MEDLINE.” In: Proceedings of the 6th ACM/IEEE-CS Joint Conference on Digital Libraries.
- QUOTE: ... In this paper, we perform a comprehensive comparison study of various document clustering approaches such as three hierarchical methods (single-link, complete-link, and complete link), Bisecting K-means, K-means, and Suffix Tree Clustering in terms of the efficiency, the effectiveness, and the scalability.