-
Kanaeva, Z.: Ranking: Google und CiteSeer (2005)
0.01
0.007509168 = product of:
0.056318756 = sum of:
0.01906849 = weight(_text_:und in 3276) [ClassicSimilarity], result of:
0.01906849 = score(doc=3276,freq=6.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.2968967 = fieldWeight in 3276, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=3276)
0.037250265 = sum of:
0.009767379 = weight(_text_:information in 3276) [ClassicSimilarity], result of:
0.009767379 = score(doc=3276,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1920054 = fieldWeight in 3276, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=3276)
0.027482886 = weight(_text_:22 in 3276) [ClassicSimilarity], result of:
0.027482886 = score(doc=3276,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.2708308 = fieldWeight in 3276, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=3276)
0.13333334 = coord(2/15)
- Abstract
- Im Rahmen des klassischen Information Retrieval wurden verschiedene Verfahren für das Ranking sowie die Suche in einer homogenen strukturlosen Dokumentenmenge entwickelt. Die Erfolge der Suchmaschine Google haben gezeigt dass die Suche in einer zwar inhomogenen aber zusammenhängenden Dokumentenmenge wie dem Internet unter Berücksichtigung der Dokumentenverbindungen (Links) sehr effektiv sein kann. Unter den von der Suchmaschine Google realisierten Konzepten ist ein Verfahren zum Ranking von Suchergebnissen (PageRank), das in diesem Artikel kurz erklärt wird. Darüber hinaus wird auf die Konzepte eines Systems namens CiteSeer eingegangen, welches automatisch bibliographische Angaben indexiert (engl. Autonomous Citation Indexing, ACI). Letzteres erzeugt aus einer Menge von nicht vernetzten wissenschaftlichen Dokumenten eine zusammenhängende Dokumentenmenge und ermöglicht den Einsatz von Banking-Verfahren, die auf den von Google genutzten Verfahren basieren.
- Date
- 20. 3.2005 16:23:22
- Source
- Information - Wissenschaft und Praxis. 56(2005) H.2, S.87-92
-
Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000)
0.00
0.0045852624 = product of:
0.06877893 = sum of:
0.06877893 = sum of:
0.01381316 = weight(_text_:information in 3445) [ClassicSimilarity], result of:
0.01381316 = score(doc=3445,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.27153665 = fieldWeight in 3445, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.109375 = fieldNorm(doc=3445)
0.05496577 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
0.05496577 = score(doc=3445,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.5416616 = fieldWeight in 3445, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=3445)
0.06666667 = coord(1/15)
- Date
- 25. 8.2005 17:42:22
- Source
- Library and information research news. 24(2000) no.77, S.30-34
-
Behnert, C.; Plassmeier, K.; Borst, T.; Lewandowski, D.: Evaluierung von Rankingverfahren für bibliothekarische Informationssysteme (2019)
0.00
0.003396225 = product of:
0.025471685 = sum of:
0.022018395 = weight(_text_:und in 5023) [ClassicSimilarity], result of:
0.022018395 = score(doc=5023,freq=8.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.34282678 = fieldWeight in 5023, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=5023)
0.00345329 = product of:
0.00690658 = sum of:
0.00690658 = weight(_text_:information in 5023) [ClassicSimilarity], result of:
0.00690658 = score(doc=5023,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.13576832 = fieldWeight in 5023, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=5023)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- Dieser Beitrag beschreibt eine Studie zur Entwicklung und Evaluierung von Rankingverfahren für bibliothekarische Informationssysteme. Dazu wurden mögliche Faktoren für das Relevanzranking ausgehend von den Verfahren in Websuchmaschinen identifiziert, auf den Bibliothekskontext übertragen und systematisch evaluiert. Mithilfe eines Testsystems, das auf dem ZBW-Informationsportal EconBiz und einer web-basierten Software zur Evaluierung von Suchsystemen aufsetzt, wurden verschiedene Relevanzfaktoren (z. B. Popularität in Verbindung mit Aktualität) getestet. Obwohl die getesteten Rankingverfahren auf einer theoretischen Ebene divers sind, konnten keine einheitlichen Verbesserungen gegenüber den Baseline-Rankings gemessen werden. Die Ergebnisse deuten darauf hin, dass eine Adaptierung des Rankings auf individuelle Nutzer bzw. Nutzungskontexte notwendig sein könnte, um eine höhere Performance zu erzielen.
- Source
- Information - Wissenschaft und Praxis. 70(2019) H.1, S.14-23
-
Stock, M.; Stock, W.G.: Internet-Suchwerkzeuge im Vergleich (IV) : Relevance Ranking nach "Popularität" von Webseiten: Google (2001)
0.00
0.0025739179 = product of:
0.019304384 = sum of:
0.01634442 = weight(_text_:und in 5771) [ClassicSimilarity], result of:
0.01634442 = score(doc=5771,freq=6.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.2544829 = fieldWeight in 5771, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=5771)
0.002959963 = product of:
0.005919926 = sum of:
0.005919926 = weight(_text_:information in 5771) [ClassicSimilarity], result of:
0.005919926 = score(doc=5771,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.116372846 = fieldWeight in 5771, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=5771)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- In unserem Retrievaltest von Suchwerkzeugen im World Wide Web (Password 11/2000) schnitt die Suchmaschine Google am besten ab. Im Vergleich zu anderen Search Engines setzt Google kaum auf Informationslinguistik, sondern auf Algorithmen, die sich aus den Besonderheiten der Web-Dokumente ableiten lassen. Kernstück der informationsstatistischen Technik ist das "PageRank"- Verfahren (benannt nach dem Entwickler Larry Page), das aus der Hypertextstruktur des Web die "Popularität" von Seiten anhand ihrer ein- und ausgehenden Links berechnet. Google besticht durch das Angebot intuitiv verstehbarer Suchbildschirme sowie durch einige sehr nützliche "Kleinigkeiten" wie die Angabe des Rangs einer Seite, Highlighting, Suchen in der Seite, Suchen innerhalb eines Suchergebnisses usw., alles verstaut in einer eigenen Befehlsleiste innerhalb des Browsers. Ähnlich wie RealNames bietet Google mit dem Produkt "AdWords" den Aufkauf von Suchtermen an. Nach einer Reihe von nunmehr vier Password-Artikeln über InternetSuchwerkzeugen im Vergleich wollen wir abschließend zu einer Bewertung kommen. Wie ist der Stand der Technik bei Directories und Search Engines aus informationswissenschaftlicher Sicht einzuschätzen? Werden die "typischen" Internetnutzer, die ja in der Regel keine Information Professionals sind, adäquat bedient? Und können auch Informationsfachleute von den Suchwerkzeugen profitieren?
-
Furner, J.: ¬A unifying model of document relatedness for hybrid search engines (2003)
0.00
0.0019651123 = product of:
0.029476684 = sum of:
0.029476684 = sum of:
0.005919926 = weight(_text_:information in 2717) [ClassicSimilarity], result of:
0.005919926 = score(doc=2717,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.116372846 = fieldWeight in 2717, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2717)
0.023556758 = weight(_text_:22 in 2717) [ClassicSimilarity], result of:
0.023556758 = score(doc=2717,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.23214069 = fieldWeight in 2717, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2717)
0.06666667 = coord(1/15)
- Abstract
- Previous work an search-engine design has indicated that information-seekers may benefit from being given the opportunity to exploit multiple sources of evidence of document relatedness. Few existing systems, however, give users more than minimal control over the selections that may be made among methods of exploitation. By applying the methods of "document network analysis" (DNA), a unifying, graph-theoretic model of content-, collaboration-, and context-based systems (CCC) may be developed in which the nature of the similarities between types of document relatedness and document ranking are clarified. The usefulness of the approach to system design suggested by this model may be tested by constructing and evaluating a prototype system (UCXtra) that allows searchers to maintain control over the multiple ways in which document collections may be ranked and re-ranked.
- Date
- 11. 9.2004 17:32:22
-
Lanvent, A.: Licht im Daten Chaos (2004)
0.00
9.378026E-4 = product of:
0.014067038 = sum of:
0.014067038 = weight(_text_:und in 2806) [ClassicSimilarity], result of:
0.014067038 = score(doc=2806,freq=10.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.219024 = fieldWeight in 2806, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.03125 = fieldNorm(doc=2806)
0.06666667 = coord(1/15)
- Content
- "Bitte suchen Sie alle Unterlagen, die im PC zum Ibelshäuser-Vertrag in Sprockhövel gespeichert sind. Finden Sie alles, was wir haben - Dokumente, Tabellen, Präsentationen, Scans, E-Mails. Und erledigen Sie das gleich! « Wer diese Aufgabe an das Windows-eigene Suchmodul vergibt, wird zwangsläufig enttäuscht. Denn das Betriebssystem beherrscht weder die formatübergreifende Recherche noch die Kontextsuche, die für solche komplexen Aufträge nötig sind. Professionelle Desktop-Suchmaschinen erledigen Aufgaben dieser Art jedoch im Handumdrehen - genauer gesagt in einer einzigen Sekunde. Spitzenprogramme wie Global Brain benötigen dafür nicht einmal umfangreiche Abfrageformulare. Es genügt, einen Satz im Eingabefeld zu formulieren, der das Thema der gewünschten Dokumente eingrenzt. Dabei suchen die Programme über alle Laufwerke, die sich auf dem System einbinden lassen - also auch im Netzwerk-Ordner (Shared Folder), sofern dieser freigegeben wurde. Allen Testkandidaten - mit Ausnahme von Search 32 - gemeinsam ist, dass sie weitaus bessere Rechercheergebnisse abliefern als Windows, deutlich schneller arbeiten und meist auch in den Online-Postfächern stöbern. Wer schon öfter vergeblich über die Windows-Suche nach wichtigen Dokumenten gefahndet hat, kommt angesichts der Qualität der Search-Engines kaum mehr um die Anschaffung eines Desktop-Suchtools herum. Aber Microsoft will nachbessern. Für den Windows-XP-Nachfolger Longhorn wirbt der Hersteller vor allem mit dem Hinweis auf das neue Dateisystem WinFS, das sämtliche Files auf der Festplatte über Meta-Tags indiziert und dem Anwender damit lange Suchläufe erspart. So sollen sich anders als bei Windows XP alle Dateien zu bestimmten Themen in wenigen Sekunden auflisten lassen - unabhängig vom Format und vom physikalischen Speicherort der Files. Für die Recherche selbst ist dann weder der Dateiname noch das Erstelldatum ausschlaggebend. Anhand der kontextsensitiven Suche von WinFS kann der Anwender einfach einen Suchbefehl wie »Vertragsabschluss mit Firma XYZ, Neunkirchen/Saar« eingeben, der dann ohne Umwege zum Ziel führt."
- Footnote
- Darin auch 2 Teilbeiträge: (1) Know-how - Suchverfahren; (2) Praxis - Windows-Suche und Indexdienst
-
Chakrabarti, S.; Dom, B.; Kumar, S.R.; Raghavan, P.; Rajagopalan, S.; Tomkins, A.; Kleinberg, J.M.; Gibson, D.: Neue Pfade durch den Internet-Dschungel : Die zweite Generation von Web-Suchmaschinen (1999)
0.00
8.387961E-4 = product of:
0.012581941 = sum of:
0.012581941 = weight(_text_:und in 3) [ClassicSimilarity], result of:
0.012581941 = score(doc=3,freq=2.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.19590102 = fieldWeight in 3, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=3)
0.06666667 = coord(1/15)
- Content
- Ausnutzen der Hyperlinks für verbesserte Such- und Findeverfahren; Darstellung des HITS-Algorithmus
-
Ding, Y.; Chowdhury, G.; Foo, S.: Organsising keywords in a Web search environment : a methodology based on co-word analysis (2000)
0.00
4.4124527E-4 = product of:
0.0066186786 = sum of:
0.0066186786 = product of:
0.013237357 = sum of:
0.013237357 = weight(_text_:information in 105) [ClassicSimilarity], result of:
0.013237357 = score(doc=105,freq=10.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2602176 = fieldWeight in 105, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=105)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- The rapid development of the Internet and World Wide Web has caused some critical problem for information retrieval. Researchers have made several attempts to solve these problems. Thesauri and subject heading lists as traditional information retrieval tools have been criticised for their efficiency to tackle these newly emerging problems. This paper proposes an information retrieval tool generated by cocitation analysis, comprising keyword clusters with relationships based on the co-occurrences of keywords in the literature. Such a tool can play the role of an associative thesaurus that can provide information about the keywords in a domain that might be useful for information searching and query expansion
-
Dominich, S.; Skrop, A.: PageRank and interaction information retrieval (2005)
0.00
4.4124527E-4 = product of:
0.0066186786 = sum of:
0.0066186786 = product of:
0.013237357 = sum of:
0.013237357 = weight(_text_:information in 3268) [ClassicSimilarity], result of:
0.013237357 = score(doc=3268,freq=10.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2602176 = fieldWeight in 3268, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=3268)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- The PageRank method is used by the Google Web search engine to compute the importance of Web pages. Two different views have been developed for the Interpretation of the PageRank method and values: (a) stochastic (random surfer): the PageRank values can be conceived as the steady-state distribution of a Markov chain, and (b) algebraic: the PageRank values form the eigenvector corresponding to eigenvalue 1 of the Web link matrix. The Interaction Information Retrieval (1**2 R) method is a nonclassical information retrieval paradigm, which represents a connectionist approach based an dynamic systems. In the present paper, a different Interpretation of PageRank is proposed, namely, a dynamic systems viewpoint, by showing that the PageRank method can be formally interpreted as a particular case of the Interaction Information Retrieval method; and thus, the PageRank values may be interpreted as neutral equilibrium points of the Web.
- Source
- Journal of the American Society for Information Science and Technology. 56(2005) no.1, S.63-69
-
Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014)
0.00
4.4124527E-4 = product of:
0.0066186786 = sum of:
0.0066186786 = product of:
0.013237357 = sum of:
0.013237357 = weight(_text_:information in 2799) [ClassicSimilarity], result of:
0.013237357 = score(doc=2799,freq=10.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2602176 = fieldWeight in 2799, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2799)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- With ever increasing information being available to the end users, search engines have become the most powerful tools for obtaining useful information scattered on the Web. However, it is very common that even most renowned search engines return result sets with not so useful pages to the user. Research on semantic search aims to improve traditional information search and retrieval methods where the basic relevance criteria rely primarily on the presence of query keywords within the returned pages. This work is an attempt to explore different relevancy ranking approaches based on semantics which are considered appropriate for the retrieval of relevant information. In this paper, various pilot projects and their corresponding outcomes have been investigated based on methodologies adopted and their most distinctive characteristics towards ranking. An overview of selected approaches and their comparison by means of the classification criteria has been presented. With the help of this comparison, some common concepts and outstanding features have been identified.
- Source
- Information processing and management. 50(2014) no.2, S.416-425
-
Thelwall, M.; Vaughan, L.: New versions of PageRank employing alternative Web document models (2004)
0.00
3.4178712E-4 = product of:
0.0051268064 = sum of:
0.0051268064 = product of:
0.010253613 = sum of:
0.010253613 = weight(_text_:information in 674) [ClassicSimilarity], result of:
0.010253613 = score(doc=674,freq=6.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.20156369 = fieldWeight in 674, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=674)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Introduces several new versions of PageRank (the link based Web page ranking algorithm), based on an information science perspective on the concept of the Web document. Although the Web page is the typical indivisible unit of information in search engine results and most Web information retrieval algorithms, other research has suggested that aggregating pages based on directories and domains gives promising alternatives, particularly when Web links are the object of study. The new algorithms introduced based on these alternatives were used to rank four sets of Web pages. The ranking results were compared with human subjects' rankings. The results of the tests were somewhat inconclusive: the new approach worked well for the set that includes pages from different Web sites; however, it does not work well in ranking pages that are from the same site. It seems that the new algorithms may be effective for some tasks but not for others, especially when only low numbers of links are involved or the pages to be ranked are from the same site or directory.
-
Bauckhage, C.: Marginalizing over the PageRank damping factor (2014)
0.00
3.2888478E-4 = product of:
0.0049332716 = sum of:
0.0049332716 = product of:
0.009866543 = sum of:
0.009866543 = weight(_text_:information in 928) [ClassicSimilarity], result of:
0.009866543 = score(doc=928,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.19395474 = fieldWeight in 928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.078125 = fieldNorm(doc=928)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- In this note, we show how to marginalize over the damping parameter of the PageRank equation so as to obtain a parameter-free version known as TotalRank. Our discussion is meant as a reference and intended to provide a guided tour towards an interesting result that has applications in information retrieval and classification.
-
White, R.W.; Jose, J.M.; Ruthven, I.: Using top-ranking sentences to facilitate effective information access (2005)
0.00
3.2888478E-4 = product of:
0.0049332716 = sum of:
0.0049332716 = product of:
0.009866543 = sum of:
0.009866543 = weight(_text_:information in 3881) [ClassicSimilarity], result of:
0.009866543 = score(doc=3881,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.19395474 = fieldWeight in 3881, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=3881)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Web searchers typically fall to view search results beyond the first page nor fully examine those results presented to them. In this article we describe an approach that encourages a deeper examination of the contents of the document set retrieved in response to a searcher's query. The approach shifts the focus of perusal and interaction away from potentially uninformative document surrogates (such as titles, sentence fragments, and URLs) to actual document content, and uses this content to drive the information seeking process. Current search interfaces assume searchers examine results document-by-document. In contrast our approach extracts, ranks, and presents the contents of the top-ranked document set. We use query-relevant topranking sentences extracted from the top documents at retrieval time as fine-grained representations of topranked document content and, when combined in a ranked list, an overview of these documents. The interaction of the searcher provides implicit evidence that is used to reorder the sentences where appropriate. We evaluate our approach in three separate user studies, each applying these sentences in a different way. The findings of these studies show that top-ranking sentences can facilitate effective information access.
- Source
- Journal of the American Society for Information Science and Technology. 56(2005) no.10, S.1113-1125
-
Lempel, R.; Moran, S.: SALSA: the stochastic approach for link-structure analysis (2001)
0.00
3.2888478E-4 = product of:
0.0049332716 = sum of:
0.0049332716 = product of:
0.009866543 = sum of:
0.009866543 = weight(_text_:information in 10) [ClassicSimilarity], result of:
0.009866543 = score(doc=10,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.19395474 = fieldWeight in 10, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=10)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Today, when searching for information on the WWW, one usually performs a query through a term-based search engine. These engines return, as the query's result, a list of Web pages whose contents matches the query. For broad-topic queries, such searches often result in a huge set of retrieved documents, many of which are irrelevant to the user. However, much information is contained in the link-structure of the WWW. Information such as which pages are linked to others can be used to augment search algorithms. In this context, Jon Kleinberg introduced the notion of two distinct types of Web pages: hubs and authorities. Kleinberg argued that hubs and authorities exhibit a mutually reinforcing relationship: a good hub will point to many authorities, and a good authority will be pointed at by many hubs. In light of this, he dervised an algoirthm aimed at finding authoritative pages. We present SALSA, a new stochastic approach for link-structure analysis, which examines random walks on graphs derived from the link-structure. We show that both SALSA and Kleinberg's Mutual Reinforcement approach employ the same metaalgorithm. We then prove that SALSA is quivalent to a weighted in degree analysis of the link-sturcutre of WWW subgraphs, making it computationally more efficient than the Mutual reinforcement approach. We compare that results of applying SALSA to the results derived through Kleinberg's approach. These comparisions reveal a topological Phenomenon called the TKC effectwhich, in certain cases, prevents the Mutual reinforcement approach from identifying meaningful authorities.
- Source
- ACM transactions on information systems. 19(2001) no.2, S.131-160
-
Ding, Y.; Yan, E.; Frazho, A.; Caverlee, J.: PageRank for ranking authors in co-citation networks (2009)
0.00
2.79068E-4 = product of:
0.0041860198 = sum of:
0.0041860198 = product of:
0.0083720395 = sum of:
0.0083720395 = weight(_text_:information in 3161) [ClassicSimilarity], result of:
0.0083720395 = score(doc=3161,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.16457605 = fieldWeight in 3161, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=3161)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- This paper studies how varied damping factors in the PageRank algorithm influence the ranking of authors and proposes weighted PageRank algorithms. We selected the 108 most highly cited authors in the information retrieval (IR) area from the 1970s to 2008 to form the author co-citation network. We calculated the ranks of these 108 authors based on PageRank with the damping factor ranging from 0.05 to 0.95. In order to test the relationship between different measures, we compared PageRank and weighted PageRank results with the citation ranking, h-index, and centrality measures. We found that in our author co-citation network, citation rank is highly correlated with PageRank with different damping factors and also with different weighted PageRank algorithms; citation rank and PageRank are not significantly correlated with centrality measures; and h-index rank does not significantly correlate with centrality measures but does significantly correlate with other measures. The key factors that have impact on the PageRank of authors in the author co-citation network are being co-cited with important authors.
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.11, S.2229-2243
-
Bilal, D.: Ranking, relevance judgment, and precision of information retrieval on children's queries : evaluation of Google, Yahoo!, Bing, Yahoo! Kids, and ask Kids (2012)
0.00
2.6310782E-4 = product of:
0.0039466172 = sum of:
0.0039466172 = product of:
0.0078932345 = sum of:
0.0078932345 = weight(_text_:information in 393) [ClassicSimilarity], result of:
0.0078932345 = score(doc=393,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1551638 = fieldWeight in 393, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03125 = fieldNorm(doc=393)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- This study employed benchmarking and intellectual relevance judgment in evaluating Google, Yahoo!, Bing, Yahoo! Kids, and Ask Kids on 30 queries that children formulated to find information for specific tasks. Retrieved hits on given queries were benchmarked to Google's and Yahoo! Kids' top-five ranked hits retrieved. Relevancy of hits was judged on a graded scale; precision was calculated using the precision-at-ten metric (P@10). Yahoo! and Bing produced a similar percentage in hit overlap with Google (nearly 30%), but differed in the ranking of hits. Ask Kids retrieved 11% in hit overlap with Google versus 3% by Yahoo! Kids. The engines retrieved 26 hits across query clusters that overlapped with Yahoo! Kids' top-five ranked hits. Precision (P) that the engines produced across the queries was P = 0.48 for relevant hits, and P = 0.28 for partially relevant hits. Precision by Ask Kids was P = 0.44 for relevant hits versus P = 0.21 by Yahoo! Kids. Bing produced the highest total precision (TP) of relevant hits (TP = 0.86) across the queries, and Yahoo! Kids yielded the lowest (TP = 0.47). Average precision (AP) of relevant hits was AP = 0.56 by leading engines versus AP = 0.29 by small engines. In contrast, average precision of partially relevant hits was AP = 0.83 by small engines versus AP = 0.33 by leading engines. Average precision of relevant hits across the engines was highest on two-word queries and lowest on one-word queries. Google performed best on natural language queries; Bing did the same (P = 0.69) on two-word queries. The findings have implications for search engine ranking algorithms, relevance theory, search engine design, research design, and information literacy.
- Source
- Journal of the American Society for Information Science and Technology. 63(2012) no.9, S.1879-1896
-
Meghabghab, G.: Google's Web page ranking applied to different topological Web graph structures (2001)
0.00
2.3255666E-4 = product of:
0.0034883497 = sum of:
0.0034883497 = product of:
0.0069766995 = sum of:
0.0069766995 = weight(_text_:information in 6028) [ClassicSimilarity], result of:
0.0069766995 = score(doc=6028,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.13714671 = fieldWeight in 6028, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=6028)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- This research is part of the ongoing study to better understand web page ranking on the web. It looks at a web page as a graph structure or a web graph, and tries to classify different web graphs in the new coordinate space: (out-degree, in-degree). The out-degree coordinate od is defined as the number of outgoing web pages from a given web page. The in-degree id coordinate is the number of web pages that point to a given web page. In this new coordinate space a metric is built to classify how close or far different web graphs are. Google's web ranking algorithm (Brin & Page, 1998) on ranking web pages is applied in this new coordinate space. The results of the algorithm has been modified to fit different topological web graph structures. Also the algorithm was not successful in the case of general web graphs and new ranking web algorithms have to be considered. This study does not look at enhancing web ranking by adding any contextual information. It only considers web links as a source to web page ranking. The author believes that understanding the underlying web page as a graph will help design better ranking web algorithms, enhance retrieval and web performance, and recommends using graphs as a part of visual aid for browsing engine designers
- Source
- Journal of the American Society for Information Science and technology. 52(2001) no.9, S.736-747
-
Watters, C.; Amoudi, A.: Geosearcher : location-based ranking of search engine results (2003)
0.00
2.3255666E-4 = product of:
0.0034883497 = sum of:
0.0034883497 = product of:
0.0069766995 = sum of:
0.0069766995 = weight(_text_:information in 5152) [ClassicSimilarity], result of:
0.0069766995 = score(doc=5152,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.13714671 = fieldWeight in 5152, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=5152)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Waters and Amoudi describe GeoSearcher, a prototype ranking program that arranges search engine results along a geo-spatial dimension without the provision of geo-spatial meta-tags or the use of geo-spatial feature extraction. GeoSearcher uses URL analysis, IptoLL, Whois, and the Getty Thesaurus of Geographic Names to determine site location. It accepts the first 200 sites returned by a search engine, identifies the coordinates, calculates their distance from a reference point and ranks in ascending order by this value. For any retrieved site the system checks if it has already been located in the current session, then sends the domain name to Whois to generate a return of a two letter country code and an area code. With no success the name is stripped one level and resent. If this fails the top level domain is tested for being a country code. Any remaining unmatched names go to IptoLL. Distance is calculated using the center point of the geographic area and a provided reference location. A test run on a set of 100 URLs from a search was successful in locating 90 sites. Eighty three pages could be manually found and 68 had sufficient information to verify location determination. Of these 65 ( 95%) had been assigned reasonably correct geographic locations. A random set of URLs used instead of a search result, yielded 80% success.
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.2, S.140-151
-
Radev, D.; Fan, W.; Qu, H.; Wu, H.; Grewal, A.: Probabilistic question answering on the Web (2005)
0.00
1.9733087E-4 = product of:
0.002959963 = sum of:
0.002959963 = product of:
0.005919926 = sum of:
0.005919926 = weight(_text_:information in 3455) [ClassicSimilarity], result of:
0.005919926 = score(doc=3455,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.116372846 = fieldWeight in 3455, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=3455)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Journal of the American Society for Information Science and Technology. 56(2005) no.6, S.571-583
-
Thelwall, M.: Can Google's PageRank be used to find the most important academic Web pages? (2003)
0.00
1.9733087E-4 = product of:
0.002959963 = sum of:
0.002959963 = product of:
0.005919926 = sum of:
0.005919926 = weight(_text_:information in 4457) [ClassicSimilarity], result of:
0.005919926 = score(doc=4457,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.116372846 = fieldWeight in 4457, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=4457)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Google's PageRank is an influential algorithm that uses a model of Web use that is dominated by its link structure in order to rank pages by their estimated value to the Web community. This paper reports on the outcome of applying the algorithm to the Web sites of three national university systems in order to test whether it is capable of identifying the most important Web pages. The results are also compared with simple inlink counts. It was discovered that the highest inlinked pages do not always have the highest PageRank, indicating that the two metrics are genuinely different, even for the top pages. More significantly, however, internal links dominated external links for the high ranks in either method and superficial reasons accounted for high scores in both cases. It is concluded that PageRank is not useful for identifying the top pages in a site and that it must be combined with a powerful text matching techniques in order to get the quality of information retrieval results provided by Google.
