Solving Hanging Relevancy Using Genetic Algorithm

被引：0
|
作者：
Singh, Ashutosh Kumar [1 ]
Kumar, Ravi P. [1 ]
Leng, Alex Goh Kwang [1 ]
机构：
[1] Curtin Univ, Dept Elect & Comp Engn, Miri, Malaysia
来源：
2012 2ND INTERNATIONAL CONFERENCE ON UNCERTAINTY REASONING AND KNOWLEDGE ENGINEERING (URKE) | 2012年
关键词：
Hanging Pages; Hanging Relevancy; PageRank; Genetic Algorithm;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Continuous growth of hanging pages with Web makes a significant problem for ranking in the information retrieval. Exclusion of these pages in ranking calculation can give biased/inconsistent result. On the other hand inclusion of these pages will reduce the speed significantly. However most of the IR ranking algorithms exclude the hanging pages. But there are relevant and important hanging pages on the Web and they cannot be ignored because of the complexity in computation and time. In our proposed method, we include the relevant hanging pages in the ranking. Relevancy or non-relevancy of hanging pages is achieved by application of Genetic Algorithm (GA).
引用
收藏
页码：9 / 12
页数：4
相关论文
共 50 条
  • [41] Solving traveling salesman problems using generalized chromosome genetic algorithm
    Yang, Jinhui
    Wu, Chunguo
    Lee, Heow Pueh
    Liang, Yanchun
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2008, 18 (07) : 887 - 892
  • [42] SOLVING JOINT REPLENISHMENT PROBLEM WITH DETERIORATING ITEMS USING GENETIC ALGORITHM
    Li, Chengyan
    Xu, Xiaofei
    Zhan, Dechen
    JOURNAL OF ADVANCED MANUFACTURING SYSTEMS, 2009, 8 (01) : 47 - 56
  • [43] Solving flow shop scheduling problem using a parallel genetic algorithm
    Akhshabi, Mostafa
    Haddadnia, Javad
    Akhshabi, Mohammad
    FIRST WORLD CONFERENCE ON INNOVATION AND COMPUTER SCIENCES (INSODE 2011), 2012, 1 : 351 - 355
  • [44] Solving the Linear Ordering Problem Using a Genetic Algorithm with Local Search
    Cergibozan, C.
    Tasan, A. S.
    NEW GLOBAL PERSPECTIVES ON INDUSTRIAL ENGINEERING AND MANAGEMENT, 2019, : 135 - 141
  • [45] Solving the 0/1 knapsack problem using an adaptive genetic algorithm
    Ezziane, Z
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 2002, 16 (01): : 23 - 30
  • [46] Solving Full NxNxN Rubik's Supercube Using Genetic Algorithm
    Swita, Robert
    Suszynski, Zbigniew
    INTERNATIONAL JOURNAL OF COMPUTER GAMES TECHNOLOGY, 2023, 2023
  • [47] Solving optical skin simulation model parameters using genetic algorithm
    Valisuo, Petri
    Mantere, Timo
    Alander, Jarmo
    PROCEEDINGS OF THE 2009 2ND INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS, VOLS 1-4, 2009, : 376 - 380
  • [48] A method of solving scheduling problems using improved guided genetic algorithm
    Ou, Gyouhi
    Tamura, Hiroki
    Tanno, Koichi
    Tang, Zheng
    IEEJ Transactions on Electronics, Information and Systems, 2008, 128 (08) : 1351 - 1357
  • [49] Solving the Dial-a-Ride Problem Using an Adapted Genetic Algorithm
    Zelic, Stjepan
    Durasevic, Marko
    Jakobovic, Domagoj
    Planinic, Lucija
    AIXIA 2021 - ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, 13196 : 689 - 699
  • [50] An Idea of Using Genetic Algorithm for Solving the Problem of River Ports Location
    Iwan, Stanislaw
    SCIENTIFIC JOURNALS OF THE MARITIME UNIVERSITY OF SZCZECIN-ZESZYTY NAUKOWE AKADEMII MORSKIEJ W SZCZECINIE, 2006, 9 (81): : 45 - 55
12345