Publication:
A Hybrid Approach For Web Search Result Clustering Based On Genetic Algorithm With K-means

Simple item page
dc.contributor.authorNorita Md Norwawien_US
dc.contributor.authorBourair Al-attaren_US
dc.contributor.authorAhmed J. Allamien_US
dc.contributor.authorAli Thoulfikar A. Imeeren_US
dc.contributor.authorYusor Fadhil Alasadien_US
dc.contributor.authorHawraa M. Kadhimen_US
dc.date.accessioned2024-05-29T01:59:42Z
dc.date.available2024-05-29T01:59:42Z
dc.date.issued2021-06-15
dc.date.submitted2022-1-28
dc.description.abstractNowadays, search engines tend to use the latest technologies in enhancing the personalization of web searches, which leads to a better understanding of user needs. One of these technologies is web search results clustering which returns meaningful labeled clusters from a set of Web snippets retrieved from any Web search engine for a given user’s query. Search result clustering aims to improve searching for information from the potentially huge amount of search results. These search results consist of URLs, titles, and snippets (descriptions or summaries) of web pages. Dealing with search results is considered as treating large-scale data, which indeed has a significant impact on effectiveness and efficiency. However, unlike traditional text mining, queries and snippets tend to be shorter which leads to more ambiguity. K-means tend to converge to local optima and depend on the initial value of cluster centers. In the past, many heuristic algorithms have been introduced to overcome this local optima problem. Nevertheless, these algorithms suffer several shortcomings. In this paper, we present an efficient hybrid web search results clustering algorithm referred to as G-K-M, whereby, we combine K-means with a modified genetic algorithm. The AOL standard dataset is used for evaluating web data log clustering. ODP-239 and MORESQUE are used as the main gold standards for the evaluation of search results clustering algorithms. The experimental results show that the proposed approach demonstrates its significant advantages over traditional clustering. Besides, results show that proposed methods are promising approaches that can make search results more understandable to the users and yield promising benefits in terms of personalization.en_US
dc.identifier.citationAl-Attar, B., Allami, A. J., Imeer, A. T. A., Alasadi, Y. F., Norita, M. D., Norwawi, & Kadhim, H. M. (2021). A hybrid approach for web search result clustering based on genetic algorithm with k-means. Journal of Theoretical and Applied Information Technology, 99(11), 2722-2733.en_US
dc.identifier.epage2733
dc.identifier.issn1992-8645
dc.identifier.issue11
dc.identifier.other1368-89
dc.identifier.spage2722
dc.identifier.urihttp://www.jatit.org/volumes/Vol99No11/19Vol99No11.pdf
dc.identifier.urihttps://oarep.usim.edu.my/handle/123456789/10079
dc.identifier.volume99
dc.language.isoenen_US
dc.publisherLittle Lion Scientificen_US
dc.relation.ispartofJournal of Theoretical and Applied Information Technologyen_US
dc.titleA Hybrid Approach For Web Search Result Clustering Based On Genetic Algorithm With K-meansen_US
dc.typeArticleen_US
dspace.entity.typePublication

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A Hybrid Approach For Web Search Result Clustering Based On Genetic Algorithm With K-means.pdf
Size:
310.35 KB
Format:
Adobe Portable Document Format
Download

Collections

Scopus