首页    期刊浏览 2025年02月18日 星期二
登录注册

文章基本信息

  • 标题:Cluster-based information retrieval by using (K-means)-hierarchical parallel genetic algorithms approac
  • 本地全文:下载
  • 作者:Sarah Hussein Toman ; Mohammed Hamzah Abed ; Zinah Hussein Toman
  • 期刊名称:TELKOMNIKA (Telecommunication Computing Electronics and Control)
  • 印刷版ISSN:2302-9293
  • 出版年度:2021
  • 卷号:19
  • 期号:1
  • DOI:10.12928/telkomnika.v19i1.16734
  • 语种:English
  • 出版社:Universitas Ahmad Dahlan
  • 摘要:Cluster-based information retrieval is one of the information retrieval (IR) tools that organize, extract features and categorize the web documents according to their similarity. Unlike traditional approaches, cluster-based IR is fast in processing large datasets of document. To improve the quality of retrieved documents, increase the efficiency of IR and reduce irrelevant documents from user search. In this paper, we proposed a (K-means)-hierarchical parallel genetic algorithms approach (HPGA) that combines the K-means clustering algorithm with hybrid PG of multi-deme and master/slave PG algorithms. K-means uses to cluster the population to k subpopulations then take most clusters relevant to the query to manipulate in a parallel way by the two levels of genetic parallelism, thus, irrelevant documents will not be included in subpopulations, as a way to improve the quality of results. Three common datasets (NLP, CISI, and CACM) are used to compute the recall, precision, and F-measure averages. Finally, we compared the precision values of three datasets with Genetic-IR and classic-IR. The proposed approach precision improvements with IR-GA were 45% in the CACM, 27% in the CISI, and 25% in the NLP. While, by comparing with Classic-IR, (K-means)-HPGA got 47% in CACM, 28% in CISI, and 34% in NLP.
  • 关键词:cluster-based IR;HPGA;information retrieval;K-means;web document clustering
国家哲学社会科学文献中心版权所有