Web page clustering using harmony search optimization

Rana Forsati, Mehrdad Mahdavi, Mohammadreza Kangavari, Banafsheh Safarkhani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Citations (Scopus)

Abstract

Clustering has become an increasingly important task in modern application domains. Targeting useful and relevant information on the World Wide Web is a topical and highly complicated research area. Clustering techniques have been applied to categorize documents on web and extracting knowledge from the web. In this paper we propose novel clustering algorithms based on Harmony Search (HS) optimization method that deals with web document clustering. By modeling clustering as an optimization problem, first, we propose a pure HS based clustering algorithm that finds near global optimal clusters within a reasonable time. Then we hybridize K-means and harmony clustering to achieve better clustering. Experimental results on five different data sets reveal that the proposed algorithms can find better clusters when compared to similar methods and the quality of clusters is comparable. Also proposed algorithms converge to the best known optimum faster than other methods.

Original languageEnglish (US)
Title of host publicationIEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008
Pages1601-1604
Number of pages4
DOIs
StatePublished - Sep 22 2008
EventIEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008 - Niagara Falls, ON, Canada
Duration: May 4 2008May 7 2008

Publication series

NameCanadian Conference on Electrical and Computer Engineering
ISSN (Print)0840-7789

Other

OtherIEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008
CountryCanada
CityNiagara Falls, ON
Period5/4/085/7/08

Fingerprint

Clustering algorithms
Websites
World Wide Web

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Forsati, R., Mahdavi, M., Kangavari, M., & Safarkhani, B. (2008). Web page clustering using harmony search optimization. In IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008 (pp. 1601-1604). [4564812] (Canadian Conference on Electrical and Computer Engineering). https://doi.org/10.1109/CCECE.2008.4564812
Forsati, Rana ; Mahdavi, Mehrdad ; Kangavari, Mohammadreza ; Safarkhani, Banafsheh. / Web page clustering using harmony search optimization. IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008. 2008. pp. 1601-1604 (Canadian Conference on Electrical and Computer Engineering).
@inproceedings{38107e557f854b9cbcbead83afee718c,
title = "Web page clustering using harmony search optimization",
abstract = "Clustering has become an increasingly important task in modern application domains. Targeting useful and relevant information on the World Wide Web is a topical and highly complicated research area. Clustering techniques have been applied to categorize documents on web and extracting knowledge from the web. In this paper we propose novel clustering algorithms based on Harmony Search (HS) optimization method that deals with web document clustering. By modeling clustering as an optimization problem, first, we propose a pure HS based clustering algorithm that finds near global optimal clusters within a reasonable time. Then we hybridize K-means and harmony clustering to achieve better clustering. Experimental results on five different data sets reveal that the proposed algorithms can find better clusters when compared to similar methods and the quality of clusters is comparable. Also proposed algorithms converge to the best known optimum faster than other methods.",
author = "Rana Forsati and Mehrdad Mahdavi and Mohammadreza Kangavari and Banafsheh Safarkhani",
year = "2008",
month = "9",
day = "22",
doi = "10.1109/CCECE.2008.4564812",
language = "English (US)",
isbn = "9781424416431",
series = "Canadian Conference on Electrical and Computer Engineering",
pages = "1601--1604",
booktitle = "IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008",

}

Forsati, R, Mahdavi, M, Kangavari, M & Safarkhani, B 2008, Web page clustering using harmony search optimization. in IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008., 4564812, Canadian Conference on Electrical and Computer Engineering, pp. 1601-1604, IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008, Niagara Falls, ON, Canada, 5/4/08. https://doi.org/10.1109/CCECE.2008.4564812

Web page clustering using harmony search optimization. / Forsati, Rana; Mahdavi, Mehrdad; Kangavari, Mohammadreza; Safarkhani, Banafsheh.

IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008. 2008. p. 1601-1604 4564812 (Canadian Conference on Electrical and Computer Engineering).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Web page clustering using harmony search optimization

AU - Forsati, Rana

AU - Mahdavi, Mehrdad

AU - Kangavari, Mohammadreza

AU - Safarkhani, Banafsheh

PY - 2008/9/22

Y1 - 2008/9/22

N2 - Clustering has become an increasingly important task in modern application domains. Targeting useful and relevant information on the World Wide Web is a topical and highly complicated research area. Clustering techniques have been applied to categorize documents on web and extracting knowledge from the web. In this paper we propose novel clustering algorithms based on Harmony Search (HS) optimization method that deals with web document clustering. By modeling clustering as an optimization problem, first, we propose a pure HS based clustering algorithm that finds near global optimal clusters within a reasonable time. Then we hybridize K-means and harmony clustering to achieve better clustering. Experimental results on five different data sets reveal that the proposed algorithms can find better clusters when compared to similar methods and the quality of clusters is comparable. Also proposed algorithms converge to the best known optimum faster than other methods.

AB - Clustering has become an increasingly important task in modern application domains. Targeting useful and relevant information on the World Wide Web is a topical and highly complicated research area. Clustering techniques have been applied to categorize documents on web and extracting knowledge from the web. In this paper we propose novel clustering algorithms based on Harmony Search (HS) optimization method that deals with web document clustering. By modeling clustering as an optimization problem, first, we propose a pure HS based clustering algorithm that finds near global optimal clusters within a reasonable time. Then we hybridize K-means and harmony clustering to achieve better clustering. Experimental results on five different data sets reveal that the proposed algorithms can find better clusters when compared to similar methods and the quality of clusters is comparable. Also proposed algorithms converge to the best known optimum faster than other methods.

UR - http://www.scopus.com/inward/record.url?scp=51849105280&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51849105280&partnerID=8YFLogxK

U2 - 10.1109/CCECE.2008.4564812

DO - 10.1109/CCECE.2008.4564812

M3 - Conference contribution

SN - 9781424416431

T3 - Canadian Conference on Electrical and Computer Engineering

SP - 1601

EP - 1604

BT - IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008

ER -

Forsati R, Mahdavi M, Kangavari M, Safarkhani B. Web page clustering using harmony search optimization. In IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008. 2008. p. 1601-1604. 4564812. (Canadian Conference on Electrical and Computer Engineering). https://doi.org/10.1109/CCECE.2008.4564812