Selection of Cluster Hierarchy Depth in Hierarchical Clustering Using K-Means Algorithm

Many papers have shown that the hierarchical clustering method takes good-performance, but is limited because of its quadratic time complexity. In contrast, with a large number of variables, K-means has a time complexity that is linear in the number of documents, but is thought to produce inferior c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Shinwon Lee, Wonhee Lee, Sungjong Chung, Dongun An, Ingeun Bok, Hongjin Ryu
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Clustering algorithms Clustering methods Information analysis Information retrieval Information technology Merging Metasearch Natural languages Partitioning algorithms Speech
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!