Web clustering engines organize search results by topic to provide an alternative view to the flat lists returned by conventional search engines. They are more efficient for ambiguous queries by grouping related results instead of mixing irrelevant items. The main advantages are shortcuts to related items, better topic understanding, and easier exploration of results. However, implementation issues include short descriptions, meaningful labels, similarity measures, clustering algorithms, and efficiency. Data-centric clustering uses a vector space model for text representation and agglomerative hierarchical clustering to initially cluster documents and then re-cluster selected clusters at query time to find smaller relevant clusters.
Web clustering engines organize search results by topic to provide an alternative view to the flat lists returned by conventional search engines. They are more efficient for ambiguous queries by grouping related results instead of mixing irrelevant items. The main advantages are shortcuts to related items, better topic understanding, and easier exploration of results. However, implementation issues include short descriptions, meaningful labels, similarity measures, clustering algorithms, and efficiency. Data-centric clustering uses a vector space model for text representation and agglomerative hierarchical clustering to initially cluster documents and then re-cluster selected clusters at query time to find smaller relevant clusters.
Web clustering engines organize search results by topic to provide an alternative view to the flat lists returned by conventional search engines. They are more efficient for ambiguous queries by grouping related results instead of mixing irrelevant items. The main advantages are shortcuts to related items, better topic understanding, and easier exploration of results. However, implementation issues include short descriptions, meaningful labels, similarity measures, clustering algorithms, and efficiency. Data-centric clustering uses a vector space model for text representation and agglomerative hierarchical clustering to initially cluster documents and then re-cluster selected clusters at query time to find smaller relevant clusters.
• ROLL NO: 35 WEB CLUSTERING ENGINES Contents Introduction
• Web clustering Engine organize search results by
topic this offering a complimentary view to the flat ranked list returned by the conventional search engines Why web clustering Engines ?
• Conventional engines are not much efficient in ambiguous
queries • The search results returned by conventional search engines on query will be mixed together in the list, irrelevant item occurs. • In this context of search result come into picture! Main advantages of cluster hierarchy
• It makes for shortcuts to the items that relate to the
same meaning • It allows better topic understanding • It favors system artic exploration of search results. Issues in implementation of clusters
• Short input description
• Meaningful labels • Selection of similar measure • Grouping of objects into clusters • Computation efficiency Architecture Data centric clustering algorithm
• This system uses VSM for text representation and the
clustering technique used is agglomerative hierarchical clustering (AHC). • It has an initial clustering of collection of documents in set of k clusters (scattering) • At query time the users selection clusters of interested (gather) and the system re-clustred those documents. • This process repeats until a small cluster with relevant documents is found. Conclusion
• Web clustering engines organize search results by topic
thus offering a complimentary view to the flat-ranked list returned by conventional search engines. • Due to lack of efficient methods of performance evaluation of clustering engines they are not seeking the attention of the people.