-
Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004)
0.01
0.009250606 = product of:
0.018501213 = sum of:
0.018501213 = product of:
0.037002426 = sum of:
0.037002426 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
0.037002426 = score(doc=2419,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.23214069 = fieldWeight in 2419, 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=2419)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 16.11.2008 16:22:48
-
Campos, L.M. de; Fernández-Luna, J.M.; Huete, J.F.: Implementing relevance feedback in the Bayesian network retrieval model (2003)
0.01
0.009250606 = product of:
0.018501213 = sum of:
0.018501213 = product of:
0.037002426 = sum of:
0.037002426 = weight(_text_:22 in 825) [ClassicSimilarity], result of:
0.037002426 = score(doc=825,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.23214069 = fieldWeight in 825, 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=825)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 3.2003 19:30:19
-
Henzinger, M.R.: Link analysis in Web information retrieval (2000)
0.01
0.008927646 = product of:
0.017855292 = sum of:
0.017855292 = product of:
0.035710584 = sum of:
0.035710584 = weight(_text_:b in 801) [ClassicSimilarity], result of:
0.035710584 = score(doc=801,freq=4.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.22143513 = fieldWeight in 801, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.03125 = fieldNorm(doc=801)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Content
- The goal of information retrieval is to find all documents relevant for a user query in a collection of documents. Decades of research in information retrieval were successful in developing and refining techniques that are solely word-based (see e.g., [2]). With the advent of the web new sources of information became available, one of them being the hyperlinks between documents and records of user behavior. To be precise, hypertexts (i.e., collections of documents connected by hyperlinks) have existed and have been studied for a long time. What was new was the large number of hyperlinks created by independent individuals. Hyperlinks provide a valuable source of information for web information retrieval as we will show in this article. This area of information retrieval is commonly called link analysis. Why would one expect hyperlinks to be useful? Ahyperlink is a reference of a web page B that is contained in a web page A. When the hyperlink is clicked on in a web browser, the browser displays page B. This functionality alone is not helpful for web information retrieval. However, the way hyperlinks are typically used by authors of web pages can give them valuable information content. Typically, authors create links because they think they will be useful for the readers of the pages. Thus, links are usually either navigational aids that, for example, bring the reader back to the homepage of the site, or links that point to pages whose content augments the content of the current page. The second kind of links tend to point to high-quality pages that might be on the same topic as the page containing the link.
-
Chen, H.; Lally, A.M.; Zhu, B.; Chau, M.: HelpfulMed : Intelligent searching for medical information over the Internet (2003)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 1615) [ClassicSimilarity], result of:
0.031563994 = score(doc=1615,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 1615, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=1615)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Fuhr, N.: Theorie des Information Retrieval I : Modelle (2004)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 2912) [ClassicSimilarity], result of:
0.031563994 = score(doc=2912,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 2912, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=2912)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Information-Retrieval-(IR-)Modelle spezifizieren, wie zur einer gegebenen Anfrage die Antwortdokumente aus einer Dokumentenkollektion bestimmt werden. Dabei macht jedes Modell bestimmte Annahmen über die Struktur von Dokumenten und Anfragen und definiert dann die so genannte Retrievalfunktion, die das Retrievalgewicht eines Dokumentes bezüglich einer Anfrage bestimmt - im Falle des Booleschen Retrieval etwa eines der Gewichte 0 oder 1. Die Dokumente werden dann nach fallenden Gewichten sortiert und dem Benutzer präsentiert. Zunächst sollen hier einige grundlegende Charakteristika von Retrievalmodellen beschrieben werden, bevor auf die einzelnen Modelle näher eingegangen wird. Wie eingangs erwähnt, macht jedes Modell Annahmen über die Struktur von Dokumenten und Fragen. Ein Dokument kann entweder als Menge oder Multimenge von so genannten Termen aufgefasst werden, wobei im zweiten Fall das Mehrfachvorkommen berücksichtigt wird. Dabei subsummiert 'Term' einen Suchbegriff, der ein einzelnes Wort, ein mehrgliedriger Begriff oder auch ein komplexes Freitextmuster sein kann. Diese Dokumentrepräsentation wird wiederum auf eine so genannte Dokumentbeschreibung abgebildet, in der die einzelnen Terme gewichtet sein können; dies ist Aufgabe der in Kapitel B 5 beschriebenen Indexierungsmodelle. Im Folgenden unterscheiden wir nur zwischen ungewichteter (Gewicht eines Terms ist entweder 0 oderl) und gewichteter Indexierung (das Gewicht ist eine nichtnegative reelle Zahl). Ebenso wie bei Dokumenten können auch die Terme in der Frage entweder ungewichtet oder gewichtet sein. Daneben unterscheidet man zwischen linearen (Frage als Menge von Termen, ungewichtet oder gewichtet) und Booleschen Anfragen.
-
Chen, Z.; Meng, X.; Fowler, R.H.; Zhu, B.: Real-time adaptive feature and document learning for Web search (2001)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 5209) [ClassicSimilarity], result of:
0.031563994 = score(doc=5209,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 5209, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=5209)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Dannenberg, R.B.; Birmingham, W.P.; Pardo, B.; Hu, N.; Meek, C.; Tzanetakis, G.: ¬A comparative evaluation of search techniques for query-by-humming using the MUSART testbed (2007)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 269) [ClassicSimilarity], result of:
0.031563994 = score(doc=269,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 269, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=269)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Chen, Z.; Fu, B.: On the complexity of Rocchio's similarity-based relevance feedback algorithm (2007)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 578) [ClassicSimilarity], result of:
0.031563994 = score(doc=578,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 578, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=578)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Symonds, M.; Bruza, P.; Zuccon, G.; Koopman, B.; Sitbon, L.; Turner, I.: Automatic query expansion : a structural linguistic perspective (2014)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 1338) [ClassicSimilarity], result of:
0.031563994 = score(doc=1338,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 1338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=1338)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Xu, B.; Lin, H.; Lin, Y.: Assessment of learning to rank methods for query expansion (2016)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 2929) [ClassicSimilarity], result of:
0.031563994 = score(doc=2929,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 2929, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=2929)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Fuhr, N.: Modelle im Information Retrieval (2023)
0.01
0.007890998 = product of:
0.015781997 = sum of:
0.015781997 = product of:
0.031563994 = sum of:
0.031563994 = weight(_text_:b in 800) [ClassicSimilarity], result of:
0.031563994 = score(doc=800,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.19572285 = fieldWeight in 800, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.0390625 = fieldNorm(doc=800)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Information-Retrieval-Modelle -(IR-Modelle) spezifizieren, wie zu einer gegebenen Anfrage die Antwortdokumente aus einer Dokumentenkollektion bestimmt werden. Ausgangsbasis jedes Modells sind dabei zunächst bestimmte Annahmen über die Wissensrepräsentation (s. Teil B Methoden und Systeme der Inhaltserschließung) von Fragen und Dokumenten. Hier bezeichnen wir die Elemente dieser Repräsentationen als Terme, wobei es aus der Sicht des Modells egal ist, wie diese Terme aus dem Dokument (und analog aus der von Benutzenden eingegebenen Anfrage) abgeleitet werden: Bei Texten werden hierzu häufig computerlinguistische Methoden eingesetzt, aber auch komplexere automatische oder manuelle Erschließungsverfahren können zur Anwendung kommen. Repräsentationen besitzen ferner eine bestimmte Struktur. Ein Dokument wird meist als Menge oder Multimenge von Termen aufgefasst, wobei im zweiten Fall das Mehrfachvorkommen berücksichtigt wird. Diese Dokumentrepräsentation wird wiederum auf eine sogenannte Dokumentbeschreibung abgebildet, in der die einzelnen Terme gewichtet sein können. Im Folgenden unterscheiden wir nur zwischen ungewichteter (Gewicht eines Terms ist entweder 0 oder 1) und gewichteter Indexierung (das Gewicht ist eine nichtnegative reelle Zahl). Analog dazu gibt es eine Fragerepräsentation; legt man eine natürlichsprachige Anfrage zugrunde, so kann man die o. g. Verfahren für Dokumenttexte anwenden. Alternativ werden auch grafische oder formale Anfragesprachen verwendet, wobei aus Sicht der Modelle insbesondere deren logische Struktur (etwa beim Booleschen Retrieval) relevant ist. Die Fragerepräsentation wird dann in eine Fragebeschreibung überführt.
-
Burgin, R.: ¬The retrieval effectiveness of 5 clustering algorithms as a function of indexing exhaustivity (1995)
0.01
0.0077088396 = product of:
0.015417679 = sum of:
0.015417679 = product of:
0.030835358 = sum of:
0.030835358 = weight(_text_:22 in 3365) [ClassicSimilarity], result of:
0.030835358 = score(doc=3365,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.19345059 = fieldWeight in 3365, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=3365)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 2.1996 11:20:06
-
Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995)
0.01
0.0077088396 = product of:
0.015417679 = sum of:
0.015417679 = product of:
0.030835358 = sum of:
0.030835358 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
0.030835358 = score(doc=5697,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.19345059 = fieldWeight in 5697, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=5697)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 2.1996 13:14:10
-
Song, D.; Bruza, P.D.: Towards context sensitive information inference (2003)
0.01
0.0077088396 = product of:
0.015417679 = sum of:
0.015417679 = product of:
0.030835358 = sum of:
0.030835358 = weight(_text_:22 in 1428) [ClassicSimilarity], result of:
0.030835358 = score(doc=1428,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.19345059 = fieldWeight in 1428, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=1428)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 3.2003 19:35:46
-
Baloh, P.; Desouza, K.C.; Hackney, R.: Contextualizing organizational interventions of knowledge management systems : a design science perspectiveA domain analysis (2012)
0.01
0.0077088396 = product of:
0.015417679 = sum of:
0.015417679 = product of:
0.030835358 = sum of:
0.030835358 = weight(_text_:22 in 241) [ClassicSimilarity], result of:
0.030835358 = score(doc=241,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.19345059 = fieldWeight in 241, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=241)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 11. 6.2012 14:22:34
-
Soulier, L.; Jabeur, L.B.; Tamine, L.; Bahsoun, W.: On ranking relevant entities in heterogeneous networks using a language-based model (2013)
0.01
0.0077088396 = product of:
0.015417679 = sum of:
0.015417679 = product of:
0.030835358 = sum of:
0.030835358 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
0.030835358 = score(doc=664,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.19345059 = fieldWeight in 664, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=664)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 3.2013 19:34:49
-
Efthimiadis, E.N.: Interactive query expansion : a user-based evaluation in a relevance feedback environment (2000)
0.01
0.0063127987 = product of:
0.012625597 = sum of:
0.012625597 = product of:
0.025251195 = sum of:
0.025251195 = weight(_text_:b in 5701) [ClassicSimilarity], result of:
0.025251195 = score(doc=5701,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.15657827 = fieldWeight in 5701, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.03125 = fieldNorm(doc=5701)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- A user-centered investigation of interactive query expansion within the context of a relevance feedback system is presented in this article. Data were collected from 25 searches using the INSPEC database. The data collection mechanisms included questionnaires, transaction logs, and relevance evaluations. The results discuss issues that relate to query expansion, retrieval effectiveness, the correspondence of the on-line-to-off-line relevance judgments, and the selection of terms for query expansion by users (interactive query expansion). The main conclusions drawn from the results of the study are that: (1) one-third of the terms presented to users in a list of candidate terms for query expansion was identified by the users as potentially useful for query expansion. (2) These terms were mainly judged as either variant expressions (synonyms) or alternative (related) terms to the initial query terms. However, a substantial portion of the selected terms were identified as representing new ideas. (3) The relationships identified between the five best terms selected by the users for query expansion and the initial query terms were that: (a) 34% of the query expansion terms have no relationship or other type of correspondence with a query term; (b) 66% of the remaining query expansion terms have a relationship to the query terms. These relationships were: narrower term (46%), broader term (3%), related term (17%). (4) The results provide evidence for the effectiveness of interactive query expansion. The initial search produced on average three highly relevant documents; the query expansion search produced on average nine further highly relevant documents. The conclusions highlight the need for more research on: interactive query expansion, the comparative evaluation of automatic vs. interactive query expansion, the study of weighted Webbased or Web-accessible retrieval systems in operational environments, and for user studies in searching ranked retrieval systems in general
-
Henzinger, M.R.: Hyperlink analysis for the Web (2001)
0.01
0.0063127987 = product of:
0.012625597 = sum of:
0.012625597 = product of:
0.025251195 = sum of:
0.025251195 = weight(_text_:b in 8) [ClassicSimilarity], result of:
0.025251195 = score(doc=8,freq=2.0), product of:
0.16126883 = queryWeight, product of:
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.045518078 = queryNorm
0.15657827 = fieldWeight in 8, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.542962 = idf(docFreq=3476, maxDocs=44218)
0.03125 = fieldNorm(doc=8)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Content
- Information retrieval is a computer science subfield whose goal is to find all documents relevant to a user query in a given collection of documents. As such, information retrieval should really be called document retrieval. Before the advent of the Web, IR systems were typically installed in libraries for use mostly by reference librarians. The retrieval algorithm for these systems was usually based exclusively on analysis of the words in the document. The Web changed all this. Now each Web user has access to various search engines whose retrieval algorithms often use not only the words in the documents but also information like the hyperlink structure of the Web or markup language tags. How are hyperlinks useful? The hyperlink functionality alone-that is, the hyperlink to Web page B that is contained in Web page A-is not directly useful in information retrieval. However, the way Web page authors use hyperlinks can give them valuable information content. Authors usually create hyperlinks they think will be useful to readers. Some may be navigational aids that, for example, take the reader back to the site's home page; others provide access to documents that augment the content of the current page. The latter tend to point to highquality pages that might be on the same topic as the page containing the hyperlink. Web information retrieval systems can exploit this information to refine searches for relevant documents. Hyperlink analysis significantly improves the relevance of the search results, so much so that all major Web search engines claim to use some type of hyperlink analysis. However, the search engines do not disclose details about the type of hyperlink analysis they perform- mostly to avoid manipulation of search results by Web-positioning companies. In this article, I discuss how hyperlink analysis can be applied to ranking algorithms, and survey other ways Web search engines can use this analysis.
-
Khoo, C.S.G.; Wan, K.-W.: ¬A simple relevancy-ranking strategy for an interface to Boolean OPACs (2004)
0.01
0.0053961873 = product of:
0.010792375 = sum of:
0.010792375 = product of:
0.02158475 = sum of:
0.02158475 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
0.02158475 = score(doc=2509,freq=2.0), product of:
0.15939656 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045518078 = queryNorm
0.1354154 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02734375 = fieldNorm(doc=2509)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Source
- Electronic library. 22(2004) no.2, S.112-120
