Auto-assemblage for Suffix Tree Clustering 

Abstract

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. Dataset is the collection of the text documents. The paper focuses on the steps for document clustering by using the Suffix Tree Clustering Algorithm. The algorithm steps are display by the screen shots that is taken from the running tool.  

Authors and Affiliations

Pushplata , Mr. Ram Chatterjee

Keywords

Related Articles

Small Signal Stability Investigation of SMIB System Using Variable Structure Control 

This paper aims at investigation of small signal stability for a synchronous machine connected to the infinite bus system by variable structure control. Power systems inherently being non linear, so first the linea...

BF-PSO optimized PID Controller design using ISE, IAE, IATE and MSE error criteria

A PID controller is designed using ISE, IAE, ITAE and MSE error criteria for stable linear time invariant continuous system. A BF-PSO PID controller is designed for the plant to meet the desired performance specification...

A survey on cost effective multi-cloud storage in cloud computing 

As novel storage model, cloud storage has gain attentions from both the academics and industrial communities. However along with variant advantages, it also brings new challenges in maintaining data integrity and h...

A Survey on Coverage Problems in Wireless Sensor Networks  

Wireless sensor networks are a rapidly growing area for research and commercial development. Wireless sensor networks are used to monitor a given field of interest for changes in the environment. They are very us...

INTERLEAVED FORWARD ERROR CORRECTING (FEC) CODES BASED ON BINAR SHUFFLE ALGORITHM (B.S.A)  

Forward Error Correcting (FEC) is one of the technique is used for controlling errors without sending any retransmission to sender. Example of forward error correcting codes are hamming, lower-density parity-ch...

Download PDF file
  • EP ID EP93646
  • DOI -
  • Views 145
  • Downloads 0

How To Cite

Pushplata, Mr. Ram Chatterjee (2012). Auto-assemblage for Suffix Tree Clustering . International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 1(4), 600-608. https://europub.co.uk/articles/-A-93646