Loading...

Novel meta-heuristic algorithms for clustering web documents

Mahdavi, M ; Sharif University of Technology | 2008

285 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.amc.2007.12.058
  3. Publisher: 2008
  4. Abstract:
  5. Clustering the web documents is one of the most important approaches for mining and extracting knowledge from the web. Recently, one of the most attractive trends in clustering the high dimensional web pages has been tilt toward the learning and optimization approaches. In this paper, we propose novel hybrid harmony search (HS) based algorithms for clustering the web documents that finds a globally optimal partition of them into a specified number of clusters. By modeling clustering as an optimization problem, first, we propose a pure harmony search-based clustering algorithm that finds near global optimal clusters within a reasonable time. Then, we hybridize K-means and harmony clustering in two ways to achieve better clustering. Experimental results reveal that the proposed algorithms can find better clusters when compared to similar methods and also illustrate the robustness of the hybrid clustering algorithms. © 2007 Elsevier Inc. All rights reserved
  6. Keywords:
  7. Cluster analysis ; Knowledge acquisition ; Optimization ; Web services ; Document clustering ; Harmony search ; Heuristic algorithms
  8. Source: Applied Mathematics and Computation ; Volume 201, Issue 1-2 , 2008 , Pages 441-451 ; 00963003 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0096300307012209