• DocumentCode
    2013366
  • Title

    Efficient algorithm for handling dangling pages using hypothetical node

  • Author

    Singh, Ashutosh Kumar ; Kumar, P. Ravi ; Leng, Alex Goh K wang

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Curtin Univ. of Technol., Miri, Malaysia
  • fYear
    2010
  • fDate
    16-18 Aug. 2010
  • Firstpage
    44
  • Lastpage
    49
  • Abstract
    Dangling pages are one of the major drawbacks of page rank algorithm which is used by different search engines to calculate the page rank. The number of these pages increasing with web as the source of knowledge. However search engines are the main tools used in knowledge extraction or Information retrieval from the Web. We proposed an algorithm to handle these pages using a hypothetical node and comparing it with page rank algorithm.
  • Keywords
    Internet; information retrieval; search engines; Web; dangling pages; hypothetical node; information retrieval; knowledge extraction; page rank algorithm; search engines; Robots; Dangling Pages; Link rot; PageRank; Penalty Pages; zero-one-gap;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Digital Content, Multimedia Technology and its Applications (IDC), 2010 6th International Conference on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-7607-7
  • Electronic_ISBN
    978-8-9886-7827-5
  • Type

    conf

  • Filename
    5568585
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2013366