Content deleted Content added
Egoodfellow (talk | contribs) |
Egoodfellow (talk | contribs) |
||
Line 11:
The application of document clustering can be categorized to two types, online and offline. Online applications are usually constrained by efficiency problems when compared to offline applications.
In general, there are two common algorithms. The first one is the hierarchical based algorithm, which includes single link, complete linkage, group average and Ward's method. By aggregating or dividing, documents can be clustered into hierarchical structure, which is suitable for browsing. However, such an algorithm usually suffers from efficiency problems. The other algorithm is developed using the [[K-means algorithm]] and its variants. Generally hierarchical algorithms produce more in-depth information for detailed analyses, while algorithms based around variants of the [[K-means algorithm]] is more efficient and provides sufficient information for most purposes<ref>Manning, Chris, and Hinrich Schütze,''''' Foundations of Statistical Natural Language Processing'Italic text''', MIT Press. Cambridge, MA: May 1999. Chapter 14'</ref> .
These algorithms can further be classified as hard or soft clustering algorithms. Hard clustering computes a hard assignment – each document is a member of exactly one cluster. The assignment of soft clustering algorithms is soft – a document’s assignment is a distribution over all clusters. In a soft assignment, a document has fractional membership in several clusters<ref>Manning, Chris, and Hinrich Schütze,''''' Foundations of Statistical Natural Language Processing'Italic text''', MIT Press. Cambridge, MA: May 1999. Pg 499'</ref>. [[Dimensionality reduction]] methods can be considered a subtype of soft clustering; for documents, these include [[latent semantic indexing]] ([[truncated singular value decomposition]] on term histograms)<ref>http://nlp.stanford.edu/IR-book/pdf/16flat.pdf</ref> and [[topic model]]s.
| |||