scholarly journals Web Search Result Clustering based on Cuckoo Search and Consensus Clustering

Author(s):  
Alam Mansaf ◽  
Sadaf Kishwar
PLoS ONE ◽  
2021 ◽  
Vol 16 (1) ◽  
pp. e0245264
Author(s):  
Ali Sabah ◽  
Sabrina Tiun ◽  
Nor Samsiah Sani ◽  
Masri Ayob ◽  
Adil Yaseen Taha

Existing text clustering methods utilize only one representation at a time (single view), whereas multiple views can represent documents. The multiview multirepresentation method enhances clustering quality. Moreover, existing clustering methods that utilize more than one representation at a time (multiview) use representation with the same nature. Hence, using multiple views that represent data in a different representation with clustering methods is reasonable to create a diverse set of candidate clustering solutions. On this basis, an effective dynamic clustering method must consider combining multiple views of data including semantic view, lexical view (word weighting), and topic view as well as the number of clusters. The main goal of this study is to develop a new method that can improve the performance of web search result clustering (WSRC). An enhanced multiview multirepresentation consensus clustering ensemble (MMCC) method is proposed to create a set of diverse candidate solutions and select a high-quality overlapping cluster. The overlapping clusters are obtained from the candidate solutions created by different clustering methods. The framework to develop the proposed MMCC includes numerous stages: (1) acquiring the standard datasets (MORESQUE and Open Directory Project-239), which are used to validate search result clustering algorithms, (2) preprocessing the dataset, (3) applying multiview multirepresentation clustering models, (4) using the radius-based cluster number estimation algorithm, and (5) employing the consensus clustering ensemble method. Results show an improvement in clustering methods when multiview multirepresentation is used. More importantly, the proposed MMCC model improves the overall performance of WSRC compared with all single-view clustering models.


2018 ◽  
pp. 4661-4666
Author(s):  
Xuehua Shen ◽  
Cheng Xiang Zhai
Keyword(s):  

2018 ◽  
Vol 7 (3.3) ◽  
pp. 90
Author(s):  
Sumathi Rani Manukonda ◽  
Asst.Prof Kmit ◽  
Narayanguda . ◽  
Hyderabad . ◽  
Nomula Divya ◽  
...  

Clustering the document in data mining is one of the traditional approach in which the same documents that are more relevant are grouped together. Document clustering take part in achieving accuracy that retrieve information for systems that identifies the nearest neighbors of the document. Day to day the massive quantity of data is being generated and it is clustered. According to particular sequence to improve the cluster qualityeven though different clustering methods have been introduced, still many challenges exist for the improvement of document clustering. For web search purposea document in group is efficiently arranged for the result retrieval.The users accordingly search query in an organized way. Hierarchical clustering is attained by document clustering.To the greatest algorithms for groupingdo not concentrate on the semantic approach, hence resulting to the unsatisfactory output clustering. The involuntary approach of organizing documents of web like Google, Yahoo is often considered as a reference. A distinct method to identify the existing group of similar things in the previously organized documents and retrieves effective document classifier for new documents. In this paper the main concentration is on hierarchical clustering and k-means algorithms, hence prove that k-means and its variant are efficient than hierarchical clustering along with this by implementing greedy fast k-means algorithm (GFA) for cluster document in efficient way is considered.  


2009 ◽  
pp. 3501-3506 ◽  
Author(s):  
Ronny Lempel ◽  
Fabrizio Silvestri
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document