Add to ORKGThis article describes an improvement for K-means algorithm and its application in the form of a system that clusters search results retrieved from Wikipedia. The proposed algorithm eliminates K-means disadvantages and allows one to create a cluster hierarchy. The main contributions of this paper include the following: (1) The concept of an improved K-means algorithm and its application for hierarchical clustering. (2) Description of the WikiClusterSearch system that employs the proposed algorithm to organize Wikipedia search results into clusters
This thesis presents new methods for classification and thematic grouping of billions of web pages, ...
In today’s era of World Wide Web, there is a tremendous proliferation in the amount of...
People use web search engines to fill a wide variety of navigational, informational and transactiona...
The No-K-Means clustering algorithm is used for Search Results Clustering. It clusters using a simil...
In present days world wide web provides a platform for users to satisfy their information needs, for...
As the storage capacity and the processing speed of search engine is growing to keep up with the con...
We develop a new algorithm for clustering search results. Differently from many other clustering sys...
WikiSearch is an information retrieval system (based on the vector space model) that can be used for...
Date: I hereby declare that all information in this document has been obtained and presented in acco...
Working with huge amount of data and learning from it by extracting useful information is one of the...
Clustering is currently more and more applied on hyperlinked documents, especially for web search re...
A search engine usually returns a long list of web search results corresponding to a query from the ...
Clustering is the power full technique for segment relevant data into different levels. This study h...
Today, various types of vast amount of information have been publishing on the World Wide Web. To di...
Abstract- Unlabeled document collections are becoming increasingly common and mining such databases ...
This thesis presents new methods for classification and thematic grouping of billions of web pages, ...
In today’s era of World Wide Web, there is a tremendous proliferation in the amount of...
People use web search engines to fill a wide variety of navigational, informational and transactiona...
The No-K-Means clustering algorithm is used for Search Results Clustering. It clusters using a simil...
In present days world wide web provides a platform for users to satisfy their information needs, for...
As the storage capacity and the processing speed of search engine is growing to keep up with the con...
We develop a new algorithm for clustering search results. Differently from many other clustering sys...
WikiSearch is an information retrieval system (based on the vector space model) that can be used for...
Date: I hereby declare that all information in this document has been obtained and presented in acco...
Working with huge amount of data and learning from it by extracting useful information is one of the...
Clustering is currently more and more applied on hyperlinked documents, especially for web search re...
A search engine usually returns a long list of web search results corresponding to a query from the ...
Clustering is the power full technique for segment relevant data into different levels. This study h...
Today, various types of vast amount of information have been publishing on the World Wide Web. To di...
Abstract- Unlabeled document collections are becoming increasingly common and mining such databases ...
This thesis presents new methods for classification and thematic grouping of billions of web pages, ...
In today’s era of World Wide Web, there is a tremendous proliferation in the amount of...
People use web search engines to fill a wide variety of navigational, informational and transactiona...