Auto-Assemblage for Suffix Tree Clustering
Due to explosive growth of extracting the information from large repository of data, to get effective results, clustering is used. Clustering makes the searching efficient for better search results. Clustering is the process of grouping of similar type content. Document Clustering; organize the documents of similar type contents into groups. Partitioned and Hierarchical clustering algorithms are mainly used for clustering the documents. In this paper, k-means describe the partitioned clustering algorithm and further hierarchical clustering defines the Agglomerative hierarchical clustering and Divisive hierarchical clustering. The paper presents the tool, which describe the algorithmic steps that are used in Suffix Tree Clustering (STC) algorithm for clustering the documents. STC is a search result clustering, which perform the clustering on the dataset.