-
Pfeifer, U.; Pennekamp, S.: Incremental processing of vague queries in interactive retrieval systems (1997)
0.01
0.0140277175 = product of:
0.07013859 = sum of:
0.012581941 = weight(_text_:und in 735) [ClassicSimilarity], result of:
0.012581941 = score(doc=735,freq=2.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.19590102 = fieldWeight in 735, 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=735)
0.05197529 = weight(_text_:informationswissenschaft in 735) [ClassicSimilarity], result of:
0.05197529 = score(doc=735,freq=2.0), product of:
0.13053758 = queryWeight, product of:
4.504705 = idf(docFreq=1328, maxDocs=44218)
0.028978055 = queryNorm
0.3981634 = fieldWeight in 735, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.504705 = idf(docFreq=1328, maxDocs=44218)
0.0625 = fieldNorm(doc=735)
0.0055813594 = product of:
0.011162719 = sum of:
0.011162719 = weight(_text_:information in 735) [ClassicSimilarity], result of:
0.011162719 = score(doc=735,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.21943474 = fieldWeight in 735, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=735)
0.5 = coord(1/2)
0.2 = coord(3/15)
- Abstract
- The application of information retrieval techniques in interactive environments requires systems capable of effeciently processing vague queries. To reach reasonable response times, new data structures and algorithms have to be developed. In this paper we describe an approach taking advantage of the conditions of interactive usage and special access paths. To have a reference we investigate text queries and compared our algorithms to the well known 'Buckley/Lewit' algorithm. We achieved significant improvements for the response times
- Series
- Schriften zur Informationswissenschaft; Bd.30
- Source
- Hypertext - Information Retrieval - Multimedia '97: Theorien, Modelle und Implementierungen integrierter elektronischer Informationssysteme. Proceedings HIM '97. Hrsg.: N. Fuhr u.a
-
Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986)
0.01
0.0052403 = product of:
0.0786045 = sum of:
0.0786045 = sum of:
0.015786469 = weight(_text_:information in 402) [ClassicSimilarity], result of:
0.015786469 = score(doc=402,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.3103276 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.06281803 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
0.06281803 = score(doc=402,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.61904186 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.06666667 = coord(1/15)
- Source
- Information processing and management. 22(1986) no.6, S.465-476
-
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
-
Losada, D.E.; Barreiro, A.: Emebedding term similarity and inverse document frequency into a logical model of information retrieval (2003)
0.00
0.0031463658 = product of:
0.047195483 = sum of:
0.047195483 = sum of:
0.015786469 = weight(_text_:information in 1422) [ClassicSimilarity], result of:
0.015786469 = score(doc=1422,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.3103276 = fieldWeight in 1422, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=1422)
0.031409014 = weight(_text_:22 in 1422) [ClassicSimilarity], result of:
0.031409014 = score(doc=1422,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.30952093 = fieldWeight in 1422, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1422)
0.06666667 = coord(1/15)
- Abstract
- We propose a novel approach to incorporate term similarity and inverse document frequency into a logical model of information retrieval. The ability of the logic to handle expressive representations along with the use of such classical notions are promising characteristics for IR systems. The approach proposed here has been efficiently implemented and experiments against test collections are presented.
- Date
- 22. 3.2003 19:27:23
- Footnote
- Beitrag eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.285-301
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.00
0.0027530699 = product of:
0.041296046 = sum of:
0.041296046 = sum of:
0.01381316 = weight(_text_:information in 1319) [ClassicSimilarity], result of:
0.01381316 = score(doc=1319,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.27153665 = fieldWeight in 1319, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.027482886 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.027482886 = score(doc=1319,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.2708308 = fieldWeight in 1319, 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=1319)
0.06666667 = coord(1/15)
- Abstract
- Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
- Date
- 1. 8.1996 22:08:06
-
Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (1999)
0.00
0.002746075 = product of:
0.020595562 = sum of:
0.013345163 = weight(_text_:und in 5777) [ClassicSimilarity], result of:
0.013345163 = score(doc=5777,freq=4.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.20778441 = fieldWeight in 5777, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=5777)
0.007250399 = product of:
0.014500798 = sum of:
0.014500798 = weight(_text_:information in 5777) [ClassicSimilarity], result of:
0.014500798 = score(doc=5777,freq=12.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2850541 = fieldWeight in 5777, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=5777)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- This book discusses many of the key design issues for building search engines and emphazises the important role that applied mathematics can play in improving information retrieval. The authors discuss not only important data structures, algorithms, and software but also user-centered issues such as interfaces, manual indexing, and document preparation. They also present some of the current problems in information retrieval that many not be familiar to applied mathematicians and computer scientists and some of the driving computational methods (SVD, SDD) for automated conceptual indexing
- Classification
- ST 230 [Informatik # Monographien # Software und -entwicklung # Software allgemein, (Einführung, Lehrbücher, Methoden der Programmierung) Software engineering, Programmentwicklungssysteme, Softwarewerkzeuge]
- RSWK
- Suchmaschine / Information Retrieval
Suchmaschine / Information Retrieval / Mathematisches Modell (HEBIS)
- RVK
- ST 230 [Informatik # Monographien # Software und -entwicklung # Software allgemein, (Einführung, Lehrbücher, Methoden der Programmierung) Software engineering, Programmentwicklungssysteme, Softwarewerkzeuge]
- Subject
- Suchmaschine / Information Retrieval
Suchmaschine / Information Retrieval / Mathematisches Modell (HEBIS)
-
Weller, K.; Stock, W.G.: Transitive meronymy : automatic concept-based query expansion using weighted transitive part-whole relations (2008)
0.00
0.0027270732 = product of:
0.020453047 = sum of:
0.015569357 = weight(_text_:und in 1835) [ClassicSimilarity], result of:
0.015569357 = score(doc=1835,freq=4.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.24241515 = fieldWeight in 1835, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=1835)
0.0048836893 = product of:
0.009767379 = sum of:
0.009767379 = weight(_text_:information in 1835) [ClassicSimilarity], result of:
0.009767379 = score(doc=1835,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1920054 = fieldWeight in 1835, 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=1835)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- Transitive Meronymie. Automatische begriffsbasierte Suchanfrageerweiterung unter Nutzung gewichteter transitiver Teil-Ganzes-Relationen. Unsere theoretisch orientierte Arbeit isoliert transitive Teil-Ganzes-Beziehungen. Wir diskutieren den Einsatz der Meronymie bei der automatischen begriffsbasierten Suchanfrageerweiterung im Information Retrieval. Aus praktischen Gründen schlagen wir vor, die Bestandsrelationen zu spezifizieren und die einzelnen Arten mit unterschiedlichen Gewichtungswerten zu versehen, die im Retrieval genutzt werden. Für das Design von Wissensordnungen ist bedeutsam, dass innerhalb der Begriffsleiter einer Abstraktionsrelation ein Begriff alle seine Teile (sowie alle transitiven Teile der Teile) an seine Unterbegriffe vererbt.
- Source
- Information - Wissenschaft und Praxis. 59(2008) H.3, S.165-170
-
Faloutsos, C.: Signature files (1992)
0.00
0.00262015 = product of:
0.03930225 = sum of:
0.03930225 = sum of:
0.0078932345 = weight(_text_:information in 3499) [ClassicSimilarity], result of:
0.0078932345 = score(doc=3499,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1551638 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.031409014 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
0.031409014 = score(doc=3499,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.30952093 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.06666667 = coord(1/15)
- Date
- 7. 5.1999 15:22:48
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Bornmann, L.; Mutz, R.: From P100 to P100' : a new citation-rank approach (2014)
0.00
0.00262015 = product of:
0.03930225 = sum of:
0.03930225 = sum of:
0.0078932345 = weight(_text_:information in 1431) [ClassicSimilarity], result of:
0.0078932345 = score(doc=1431,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1551638 = fieldWeight in 1431, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=1431)
0.031409014 = weight(_text_:22 in 1431) [ClassicSimilarity], result of:
0.031409014 = score(doc=1431,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.30952093 = fieldWeight in 1431, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1431)
0.06666667 = coord(1/15)
- Date
- 22. 8.2014 17:05:18
- Source
- Journal of the Association for Information Science and Technology. 65(2014) no.9, S.1939-1943
-
Crestani, F.; Dominich, S.; Lalmas, M.; Rijsbergen, C.J.K. van: Mathematical, logical, and formal methods in information retrieval : an introduction to the special issue (2003)
0.00
0.0025371704 = product of:
0.038057555 = sum of:
0.038057555 = sum of:
0.014500798 = weight(_text_:information in 1451) [ClassicSimilarity], result of:
0.014500798 = score(doc=1451,freq=12.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2850541 = fieldWeight in 1451, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=1451)
0.023556758 = weight(_text_:22 in 1451) [ClassicSimilarity], result of:
0.023556758 = score(doc=1451,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.23214069 = fieldWeight in 1451, 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=1451)
0.06666667 = coord(1/15)
- Abstract
- Research an the use of mathematical, logical, and formal methods, has been central to Information Retrieval research for a long time. Research in this area is important not only because it helps enhancing retrieval effectiveness, but also because it helps clarifying the underlying concepts of Information Retrieval. In this article we outline some of the major aspects of the subject, and summarize the papers of this special issue with respect to how they relate to these aspects. We conclude by highlighting some directions of future research, which are needed to better understand the formal characteristics of Information Retrieval.
- Date
- 22. 3.2003 19:27:36
- Footnote
- Einführung zu den Beiträgen eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.281-284
-
Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004)
0.00
0.0025371704 = product of:
0.038057555 = sum of:
0.038057555 = sum of:
0.014500798 = weight(_text_:information in 2419) [ClassicSimilarity], result of:
0.014500798 = score(doc=2419,freq=12.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2850541 = fieldWeight in 2419, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.023556758 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
0.023556758 = score(doc=2419,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = 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.06666667 = coord(1/15)
- Abstract
- The digital library system Daffodil is targeted at strategic support of users during the information search process. For searching, exploring and managing digital library objects it provides user-customisable information seeking patterns over a federation of heterogeneous digital libraries. In this paper evaluation results with respect to retrieval effectiveness, efficiency and user satisfaction are presented. The analysis focuses on strategic support for the scientific work-flow. Daffodil supports the whole work-flow, from data source selection over information seeking to the representation, organisation and reuse of information. By embedding high level search functionality into the scientific work-flow, the user experiences better strategic system support due to a more systematic work process. These ideas have been implemented in Daffodil followed by a qualitative evaluation. The evaluation has been conducted with 28 participants, ranging from information seeking novices to experts. The results are promising, as they support the chosen model.
- Date
- 16.11.2008 16:22:48
-
Song, D.; Bruza, P.D.: Towards context sensitive information inference (2003)
0.00
0.0023994963 = product of:
0.035992444 = sum of:
0.035992444 = sum of:
0.01636181 = weight(_text_:information in 1428) [ClassicSimilarity], result of:
0.01636181 = score(doc=1428,freq=22.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.32163754 = fieldWeight in 1428, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=1428)
0.019630633 = weight(_text_:22 in 1428) [ClassicSimilarity], result of:
0.019630633 = score(doc=1428,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = 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.06666667 = coord(1/15)
- Abstract
- Humans can make hasty, but generally robust judgements about what a text fragment is, or is not, about. Such judgements are termed information inference. This article furnishes an account of information inference from a psychologistic stance. By drawing an theories from nonclassical logic and applied cognition, an information inference mechanism is proposed that makes inferences via computations of information flow through an approximation of a conceptual space. Within a conceptual space information is represented geometrically. In this article, geometric representations of words are realized as vectors in a high dimensional semantic space, which is automatically constructed from a text corpus. Two approaches were presented for priming vector representations according to context. The first approach uses a concept combination heuristic to adjust the vector representation of a concept in the light of the representation of another concept. The second approach computes a prototypical concept an the basis of exemplar trace texts and moves it in the dimensional space according to the context. Information inference is evaluated by measuring the effectiveness of query models derived by information flow computations. Results show that information flow contributes significantly to query model effectiveness, particularly with respect to precision. Moreover, retrieval effectiveness compares favorably with two probabilistic query models, and another based an semantic association. More generally, this article can be seen as a contribution towards realizing operational systems that mimic text-based human reasoning.
- Date
- 22. 3.2003 19:35:46
- Footnote
- Beitrag eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.321-334
-
Ravana, S.D.; Rajagopal, P.; Balakrishnan, V.: Ranking retrieval systems using pseudo relevance judgments (2015)
0.00
0.0023159073 = product of:
0.034738608 = sum of:
0.034738608 = sum of:
0.0069766995 = weight(_text_:information in 2591) [ClassicSimilarity], result of:
0.0069766995 = score(doc=2591,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.13714671 = fieldWeight in 2591, 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=2591)
0.027761906 = weight(_text_:22 in 2591) [ClassicSimilarity], result of:
0.027761906 = score(doc=2591,freq=4.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.27358043 = fieldWeight in 2591, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2591)
0.06666667 = coord(1/15)
- Abstract
- Purpose In a system-based approach, replicating the web would require large test collections, and judging the relevancy of all documents per topic in creating relevance judgment through human assessors is infeasible. Due to the large amount of documents that requires judgment, there are possible errors introduced by human assessors because of disagreements. The paper aims to discuss these issues. Design/methodology/approach This study explores exponential variation and document ranking methods that generate a reliable set of relevance judgments (pseudo relevance judgments) to reduce human efforts. These methods overcome problems with large amounts of documents for judgment while avoiding human disagreement errors during the judgment process. This study utilizes two key factors: number of occurrences of each document per topic from all the system runs; and document rankings to generate the alternate methods. Findings The effectiveness of the proposed method is evaluated using the correlation coefficient of ranked systems using mean average precision scores between the original Text REtrieval Conference (TREC) relevance judgments and pseudo relevance judgments. The results suggest that the proposed document ranking method with a pool depth of 100 could be a reliable alternative to reduce human effort and disagreement errors involved in generating TREC-like relevance judgments. Originality/value Simple methods proposed in this study show improvement in the correlation coefficient in generating alternate relevance judgment without human assessors while contributing to information retrieval evaluation.
- Date
- 20. 1.2015 18:30:22
18. 9.2018 18:22:56
- Source
- Aslib journal of information management. 67(2015) no.6, S.700-714
-
Fan, W.; Fox, E.A.; Pathak, P.; Wu, H.: ¬The effects of fitness functions an genetic programming-based ranking discovery for Web search (2004)
0.00
0.0022540248 = product of:
0.03381037 = sum of:
0.03381037 = sum of:
0.010253613 = weight(_text_:information in 2239) [ClassicSimilarity], result of:
0.010253613 = score(doc=2239,freq=6.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.20156369 = fieldWeight in 2239, 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=2239)
0.023556758 = weight(_text_:22 in 2239) [ClassicSimilarity], result of:
0.023556758 = score(doc=2239,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.23214069 = fieldWeight in 2239, 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=2239)
0.06666667 = coord(1/15)
- Abstract
- Genetic-based evolutionary learning algorithms, such as genetic algorithms (GAs) and genetic programming (GP), have been applied to information retrieval (IR) since the 1980s. Recently, GP has been applied to a new IR taskdiscovery of ranking functions for Web search-and has achieved very promising results. However, in our prior research, only one fitness function has been used for GP-based learning. It is unclear how other fitness functions may affect ranking function discovery for Web search, especially since it is weIl known that choosing a proper fitness function is very important for the effectiveness and efficiency of evolutionary algorithms. In this article, we report our experience in contrasting different fitness function designs an GP-based learning using a very large Web corpus. Our results indicate that the design of fitness functions is instrumental in performance improvement. We also give recommendations an the design of fitness functions for genetic-based information retrieval experiments.
- Date
- 31. 5.2004 19:22:06
- Source
- Journal of the American Society for Information Science and technology. 55(2004) no.7, S.628-636
-
Campos, L.M. de; Fernández-Luna, J.M.; Huete, J.F.: Implementing relevance feedback in the Bayesian network retrieval model (2003)
0.00
0.0022540248 = product of:
0.03381037 = sum of:
0.03381037 = sum of:
0.010253613 = weight(_text_:information in 825) [ClassicSimilarity], result of:
0.010253613 = score(doc=825,freq=6.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.20156369 = fieldWeight in 825, 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=825)
0.023556758 = weight(_text_:22 in 825) [ClassicSimilarity], result of:
0.023556758 = score(doc=825,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = 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.06666667 = coord(1/15)
- Abstract
- Relevance Feedback consists in automatically formulating a new query according to the relevance judgments provided by the user after evaluating a set of retrieved documents. In this article, we introduce several relevance feedback methods for the Bayesian Network Retrieval ModeL The theoretical frame an which our methods are based uses the concept of partial evidences, which summarize the new pieces of information gathered after evaluating the results obtained by the original query. These partial evidences are inserted into the underlying Bayesian network and a new inference process (probabilities propagation) is run to compute the posterior relevance probabilities of the documents in the collection given the new query. The quality of the proposed methods is tested using a preliminary experimentation with different standard document collections.
- Date
- 22. 3.2003 19:30:19
- Footnote
- Beitrag eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.302-313
-
Kelledy, F.; Smeaton, A.F.: Signature files and beyond (1996)
0.00
0.0021285866 = product of:
0.031928796 = sum of:
0.031928796 = sum of:
0.0083720395 = weight(_text_:information in 6973) [ClassicSimilarity], result of:
0.0083720395 = score(doc=6973,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.16457605 = fieldWeight in 6973, 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=6973)
0.023556758 = weight(_text_:22 in 6973) [ClassicSimilarity], result of:
0.023556758 = score(doc=6973,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.23214069 = fieldWeight in 6973, 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=6973)
0.06666667 = coord(1/15)
- Source
- Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
-
Witschel, H.F.: Global term weights in distributed environments (2008)
0.00
0.0021285866 = product of:
0.031928796 = sum of:
0.031928796 = sum of:
0.0083720395 = weight(_text_:information in 2096) [ClassicSimilarity], result of:
0.0083720395 = score(doc=2096,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.16457605 = fieldWeight in 2096, 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=2096)
0.023556758 = weight(_text_:22 in 2096) [ClassicSimilarity], result of:
0.023556758 = score(doc=2096,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.23214069 = fieldWeight in 2096, 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=2096)
0.06666667 = coord(1/15)
- Abstract
- This paper examines the estimation of global term weights (such as IDF) in information retrieval scenarios where a global view on the collection is not available. In particular, the two options of either sampling documents or of using a reference corpus independent of the target retrieval collection are compared using standard IR test collections. In addition, the possibility of pruning term lists based on frequency is evaluated. The results show that very good retrieval performance can be reached when just the most frequent terms of a collection - an "extended stop word list" - are known and all terms which are not in that list are treated equally. However, the list cannot always be fully estimated from a general-purpose reference corpus, but some "domain-specific stop words" need to be added. A good solution for achieving this is to mix estimates from small samples of the target retrieval collection with ones derived from a reference corpus.
- Date
- 1. 8.2008 9:44:22
- Source
- Information processing and management. 44(2008) no.3, S.1049-1061
-
Dominich, S.: Mathematical foundations of information retrieval (2001)
0.00
0.002114309 = product of:
0.031714633 = sum of:
0.031714633 = sum of:
0.012083998 = weight(_text_:information in 1753) [ClassicSimilarity], result of:
0.012083998 = score(doc=1753,freq=12.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.23754507 = fieldWeight in 1753, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=1753)
0.019630633 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
0.019630633 = score(doc=1753,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.19345059 = fieldWeight in 1753, 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=1753)
0.06666667 = coord(1/15)
- Abstract
- This book offers a comprehensive and consistent mathematical approach to information retrieval (IR) without which no implementation is possible, and sheds an entirely new light upon the structure of IR models. It contains the descriptions of all IR models in a unified formal style and language, along with examples for each, thus offering a comprehensive overview of them. The book also creates mathematical foundations and a consistent mathematical theory (including all mathematical results achieved so far) of IR as a stand-alone mathematical discipline, which thus can be read and taught independently. Also, the book contains all necessary mathematical knowledge on which IR relies, to help the reader avoid searching different sources. The book will be of interest to computer or information scientists, librarians, mathematicians, undergraduate students and researchers whose work involves information retrieval.
- Date
- 22. 3.2008 12:26:32
- LCSH
- Information storage and retrieval
- Subject
- Information storage and retrieval
-
Soulier, L.; Jabeur, L.B.; Tamine, L.; Bahsoun, W.: On ranking relevant entities in heterogeneous networks using a language-based model (2013)
0.00
0.0019664785 = product of:
0.029497176 = sum of:
0.029497176 = sum of:
0.009866543 = weight(_text_:information in 664) [ClassicSimilarity], result of:
0.009866543 = score(doc=664,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.19395474 = fieldWeight in 664, 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=664)
0.019630633 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
0.019630633 = score(doc=664,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = 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.06666667 = coord(1/15)
- Abstract
- A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi-type information entity network. Evidence sources, namely content-based and network-based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model-based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.
- Date
- 22. 3.2013 19:34:49
- Source
- Journal of the American Society for Information Science and Technology. 64(2013) no.3, S.500-515
-
Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996)
0.00
0.0019651123 = product of:
0.029476684 = sum of:
0.029476684 = sum of:
0.005919926 = weight(_text_:information in 5123) [ClassicSimilarity], result of:
0.005919926 = score(doc=5123,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.116372846 = fieldWeight in 5123, 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=5123)
0.023556758 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
0.023556758 = score(doc=5123,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.23214069 = fieldWeight in 5123, 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=5123)
0.06666667 = coord(1/15)
- Abstract
- Traces the development of text searching and retrieval software designed to cope with the increasing demands made by the storage and handling of large amounts of data, recorded on high data storage media, from CD-ROM to multi gigabyte storage media and online information services, with particular reference to the need to cope with graphics as well as conventional ASCII text. Includes details of: Boolean searching, fuzzy searching and matching; relevance ranking; proximity searching and improved strategies for dealing with text searching in very large databases. Concludes that the best searching tools for CD-ROM publishers are those optimized for searching and retrieval on CD-ROM. CD-ROM drives have relatively lower random seek times than hard discs and so the software most appropriate to the medium is that which can effectively arrange the indexes and text on the CD-ROM to avoid continuous random access searching. Lists and reviews a selection of software packages designed to achieve the sort of results required for rapid CD-ROM searching
- Date
- 12. 9.1996 13:56:22
