Web text mining using harmony search

Rana Forsati, Mehrdad Mahdavi

Research output: Chapter in Book/Report/Conference proceedingChapter

12 Citations (Scopus)

Abstract

The Harmony Search (HS) algorithm in recent years has been applied in many applications in computer science and engineering. This chapter is intended to review the application of the HS method in the area of web document clustering. Clustering is a problem of great practical importance that has been the focus of substantial research in several domains for decades. It is defined as the problem of partitioning data objects into groups, such that objects in the same group are similar, while objects in different groups are dissimilar. Due to the high-dimension and sparseness properties of documents the problem of clustering becomes more challenging when we apply it on web documents. Two algorithms in literature were proposed for clustering web documents with HS which will be reviewed in this chapter. Also three hybridization of HS based clustering with K-means algorithm will be reviewed. It will be shown that the HS method can outperform other methods in terms of solution quality and computational time.

Original languageEnglish (US)
Title of host publicationRecent Advances In Harmony Search Algorithm
Pages51-64
Number of pages14
DOIs
StatePublished - Feb 8 2010

Publication series

NameStudies in Computational Intelligence
Volume270
ISSN (Print)1860-949X

Fingerprint

Computer science

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Forsati, R., & Mahdavi, M. (2010). Web text mining using harmony search. In Recent Advances In Harmony Search Algorithm (pp. 51-64). (Studies in Computational Intelligence; Vol. 270). https://doi.org/10.1007/978-3-642-04317-8_5
Forsati, Rana ; Mahdavi, Mehrdad. / Web text mining using harmony search. Recent Advances In Harmony Search Algorithm. 2010. pp. 51-64 (Studies in Computational Intelligence).
@inbook{89b92fc61cb74f5bb72c6c5c02e0c376,
title = "Web text mining using harmony search",
abstract = "The Harmony Search (HS) algorithm in recent years has been applied in many applications in computer science and engineering. This chapter is intended to review the application of the HS method in the area of web document clustering. Clustering is a problem of great practical importance that has been the focus of substantial research in several domains for decades. It is defined as the problem of partitioning data objects into groups, such that objects in the same group are similar, while objects in different groups are dissimilar. Due to the high-dimension and sparseness properties of documents the problem of clustering becomes more challenging when we apply it on web documents. Two algorithms in literature were proposed for clustering web documents with HS which will be reviewed in this chapter. Also three hybridization of HS based clustering with K-means algorithm will be reviewed. It will be shown that the HS method can outperform other methods in terms of solution quality and computational time.",
author = "Rana Forsati and Mehrdad Mahdavi",
year = "2010",
month = "2",
day = "8",
doi = "10.1007/978-3-642-04317-8_5",
language = "English (US)",
isbn = "9783642043161",
series = "Studies in Computational Intelligence",
pages = "51--64",
booktitle = "Recent Advances In Harmony Search Algorithm",

}

Forsati, R & Mahdavi, M 2010, Web text mining using harmony search. in Recent Advances In Harmony Search Algorithm. Studies in Computational Intelligence, vol. 270, pp. 51-64. https://doi.org/10.1007/978-3-642-04317-8_5

Web text mining using harmony search. / Forsati, Rana; Mahdavi, Mehrdad.

Recent Advances In Harmony Search Algorithm. 2010. p. 51-64 (Studies in Computational Intelligence; Vol. 270).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Web text mining using harmony search

AU - Forsati, Rana

AU - Mahdavi, Mehrdad

PY - 2010/2/8

Y1 - 2010/2/8

N2 - The Harmony Search (HS) algorithm in recent years has been applied in many applications in computer science and engineering. This chapter is intended to review the application of the HS method in the area of web document clustering. Clustering is a problem of great practical importance that has been the focus of substantial research in several domains for decades. It is defined as the problem of partitioning data objects into groups, such that objects in the same group are similar, while objects in different groups are dissimilar. Due to the high-dimension and sparseness properties of documents the problem of clustering becomes more challenging when we apply it on web documents. Two algorithms in literature were proposed for clustering web documents with HS which will be reviewed in this chapter. Also three hybridization of HS based clustering with K-means algorithm will be reviewed. It will be shown that the HS method can outperform other methods in terms of solution quality and computational time.

AB - The Harmony Search (HS) algorithm in recent years has been applied in many applications in computer science and engineering. This chapter is intended to review the application of the HS method in the area of web document clustering. Clustering is a problem of great practical importance that has been the focus of substantial research in several domains for decades. It is defined as the problem of partitioning data objects into groups, such that objects in the same group are similar, while objects in different groups are dissimilar. Due to the high-dimension and sparseness properties of documents the problem of clustering becomes more challenging when we apply it on web documents. Two algorithms in literature were proposed for clustering web documents with HS which will be reviewed in this chapter. Also three hybridization of HS based clustering with K-means algorithm will be reviewed. It will be shown that the HS method can outperform other methods in terms of solution quality and computational time.

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

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

U2 - 10.1007/978-3-642-04317-8_5

DO - 10.1007/978-3-642-04317-8_5

M3 - Chapter

SN - 9783642043161

T3 - Studies in Computational Intelligence

SP - 51

EP - 64

BT - Recent Advances In Harmony Search Algorithm

ER -

Forsati R, Mahdavi M. Web text mining using harmony search. In Recent Advances In Harmony Search Algorithm. 2010. p. 51-64. (Studies in Computational Intelligence). https://doi.org/10.1007/978-3-642-04317-8_5