Get Thesis Now !

PROJECT TOPIC:  APPLICATION OF SUFFIX TREE CLUSTERING ALGORITHM ON DOCUMENT CLUSTERING
Department:  Computer Science
AMOUNT:  20000
FORMAT:   MS WORD
PAGES:  95 pages, abstract, chapter 1-5 , APENDIX A source code and APENDIX B output, well reserached and supervised
  Algorithm
Get Complete Work

Abstract Preview

ABSTRACT

Most search engines in use today present the user a single ordered list of documents matching the search query. An alternative to a single ordered list is to cluster the search results and present a list of clusters to the user. The user selects which cluster appears most relevant and the search results in that cluster are then displayed in a list under the assumption that documents which is similar to each other are likely to be relevant to the same query. We have built a system that clusters search results from the file system. We allow the user to issue a search query and we return the results as a set of coherent clusters. The suffix tree clustering algorithm was used to efficiently determine documents which share common phrases. The nodes in the suffix tree define the initial cluster and to increase the number of documents in each cluster, clusters which are sufficiently similar are merged. The proposed system adopted structured system analysis and design (SSAD) methodology. The experimental results shows that suffix tree clustering algorithm can be used to cluster documents efficiently the proposed system was implemented using PHP5 and my Sql database.

Download