The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Survey of Link Analysis Ranking
|
|
Author(s): Antonis Sidiropoulos (Aristotle University of Thessaloniki, Greece), Dimitrios Katsaros (Aristotle University of Thessaloniki, Greece, and University of Thessaly, Volos, Greece)and Yannis Manolopoulos (Aristotle University of Thessaloniki, Greece)
Copyright: 2008
Pages: 6
Source title:
Encyclopedia of Networked and Virtual Organizations
Source Author(s)/Editor(s): Goran D. Putnik (University of Minho, Portugal)and Maria Manuela Cruz-Cunha (Polytechnic Institute of Cavado and Ave, Portugal)
DOI: 10.4018/978-1-59904-885-7.ch208
Purchase
|
Abstract
During the past decade, the World Wide Web became the most popular network in the World. WWW grows with a very fast speed, thus the information that can be found through it is huge. In the early 90s, the first search engines for the WWW appeared. The user could give some keywords and the system returned a number of URLs (uniform resource locators) that contained the keywords. The order of the URLs in the return list was initially based on the number of the keyword occurrences in each URL. Some more sophisticated systems were taking into account the importance and the frequency of the keywords. As WWW was growing, a simple keyword search could match hundreds of thousands of pages. A human can only check the first twenty or even some more of the URLs that the search engine returns. Consequently, the ordering of the search results became very important. The most important URLs that are related with the search keywords should be ranked first. The link analysis ranking (LAR) is an objective way to sort search results. There are many advantages of the LAR over older methods. First of all the ranking is feasible without getting any feedback from the users. It is also not necessary to store the content of the URLs, but only the links. Another advantage is that it is difficult for the site developers to cheat by repeating keywords in the documents and moreover it may be pre-computed for all URLs. There are even more benefits using LAR to sort the search results that make it the best method used so far.
Related Content
|
Kumar Shalender, Babita Singla.
© 2024.
11 pages.
|
|
R. Akash, V. Suganya.
© 2024.
32 pages.
|
|
Prathmesh Singh, Arnav Upadhyaya, Nripendra Singh.
© 2024.
14 pages.
|
|
Arpan Anand, Priya Jindal.
© 2024.
13 pages.
|
|
Surjit Singha, K. P. Jaheer Mukthar.
© 2024.
26 pages.
|
|
M. Vaishali, V. Kiruthiga.
© 2024.
14 pages.
|
|
Ranjit Singha, Surjit Singha.
© 2024.
21 pages.
|
|
|