Topical Clustering of Search Results using Suffix Tree Clustering
| Autor: | Sunil D. Jejurkar, Vivek Kshirsagar |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Computer science
Best-first search 02 engineering and technology Suffix tree clustering computer.software_genre Search engine Search algorithm 020204 information systems 0202 electrical engineering electronic engineering information engineering Database search engine Cluster analysis Linear search Incremental heuristic search Web search query Information retrieval Search analytics Search engine indexing Iterative deepening depth-first search Spamdexing Data stream clustering Jump search Beam search 020201 artificial intelligence & image processing Data mining Metasearch engine computer |
| Zdroj: | International Journal of Computer Applications. 144:29-33 |
| ISSN: | 0975-8887 |
| DOI: | 10.5120/ijca2016910503 |
| Popis: | world, with the increased use of internet the large volume of data is stored on World Wide Web. To use this large data the different search engines are provided. But the accuracy of the data is again based on the appropriate search query submitted by the user to search engine. Depending on the search query the search engine retrieves the massive amount of relevant data by using different algorithms such as page rank algorithm or relevancy algorithm. Further, the returned results decide the performance as well as the efficiency of the search engine. Search result clustering problem means clustering the search results returned by the search engine. In this paper a comparative analysis of Suffix Tree Clustering algorithms is done to decide the how accurately it clusters the search results i.e. an empirical analysis which is done by using standard datasets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|