-
Khan, M.S.; Khor, S.: Enhanced Web document retrieval using automatic query expansion (2004)
0.05
0.046223853 = product of:
0.15022752 = sum of:
0.044065922 = weight(_text_:world in 2091) [ClassicSimilarity], result of:
0.044065922 = score(doc=2091,freq=4.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.36034414 = fieldWeight in 2091, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.046875 = fieldNorm(doc=2091)
0.058555353 = weight(_text_:wide in 2091) [ClassicSimilarity], result of:
0.058555353 = score(doc=2091,freq=4.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.4153836 = fieldWeight in 2091, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.046875 = fieldNorm(doc=2091)
0.038906857 = weight(_text_:web in 2091) [ClassicSimilarity], result of:
0.038906857 = score(doc=2091,freq=6.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.37471575 = fieldWeight in 2091, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=2091)
0.008699387 = product of:
0.026098162 = sum of:
0.026098162 = weight(_text_:29 in 2091) [ClassicSimilarity], result of:
0.026098162 = score(doc=2091,freq=2.0), product of:
0.11191709 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.031815533 = queryNorm
0.23319192 = fieldWeight in 2091, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.046875 = fieldNorm(doc=2091)
0.33333334 = coord(1/3)
0.30769232 = coord(4/13)
- Abstract
- The ever growing popularity of the Internet as a source of information, coupled with the accompanying growth in the number of documents made available through the World Wide Web, is leading to an increasing demand for more efficient and accurate information retrieval tools. Numerous techniques have been proposed and tried for improving the effectiveness of searching the World Wide Web for documents relevant to a given topic of interest. The specification of appropriate keywords and phrases by the user is crucial for the successful execution of a query as measured by the relevance of documents retrieved. Lack of users' knowledge an the search topic and their changing information needs often make it difficult for them to find suitable keywords or phrases for a query. This results in searches that fail to cover all likely aspects of the topic of interest. We describe a scheme that attempts to remedy this situation by automatically expanding the user query through the analysis of initially retrieved documents. Experimental results to demonstrate the effectiveness of the query expansion scheure are presented.
- Source
- Journal of the American Society for Information Science and technology. 55(2004) no.1, S.29-40
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.04
0.04311002 = product of:
0.14010756 = sum of:
0.03635253 = weight(_text_:world in 1319) [ClassicSimilarity], result of:
0.03635253 = score(doc=1319,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.29726875 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.0483057 = weight(_text_:wide in 1319) [ClassicSimilarity], result of:
0.0483057 = score(doc=1319,freq=2.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.342674 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.045391332 = weight(_text_:web in 1319) [ClassicSimilarity], result of:
0.045391332 = score(doc=1319,freq=6.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.43716836 = fieldWeight in 1319, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.010057987 = product of:
0.03017396 = sum of:
0.03017396 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.03017396 = score(doc=1319,freq=2.0), product of:
0.11141258 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.031815533 = 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.33333334 = coord(1/3)
0.30769232 = coord(4/13)
- 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
- Footnote
- Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia
-
Faaborg, A.; Lagoze, C.: Semantic browsing (2003)
0.03
0.026071563 = product of:
0.112976775 = sum of:
0.06419303 = weight(_text_:web in 1026) [ClassicSimilarity], result of:
0.06419303 = score(doc=1026,freq=12.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.6182494 = fieldWeight in 1026, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=1026)
0.038725756 = weight(_text_:software in 1026) [ClassicSimilarity], result of:
0.038725756 = score(doc=1026,freq=2.0), product of:
0.12621705 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.031815533 = queryNorm
0.30681872 = fieldWeight in 1026, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0546875 = fieldNorm(doc=1026)
0.010057987 = product of:
0.03017396 = sum of:
0.03017396 = weight(_text_:22 in 1026) [ClassicSimilarity], result of:
0.03017396 = score(doc=1026,freq=2.0), product of:
0.11141258 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.031815533 = queryNorm
0.2708308 = fieldWeight in 1026, 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=1026)
0.33333334 = coord(1/3)
0.23076923 = coord(3/13)
- Abstract
- We have created software applications that allow users to both author and use Semantic Web metadata. To create and use a layer of semantic content on top of the existing Web, we have (1) implemented a user interface that expedites the task of attributing metadata to resources on the Web, and (2) augmented a Web browser to leverage this semantic metadata to provide relevant information and tasks to the user. This project provides a framework for annotating and reorganizing existing files, pages, and sites on the Web that is similar to Vannevar Bushrsquos original concepts of trail blazing and associative indexing.
- Source
- Research and advanced technology for digital libraries : 7th European Conference, proceedings / ECDL 2003, Trondheim, Norway, August 17-22, 2003
- Theme
- Semantic Web
-
Gábor, K.; Zargayouna, H.; Tellier, I.; Buscaldi, D.; Charnois, T.: ¬A typology of semantic relations dedicated to scientific literature analysis (2016)
0.03
0.025584215 = product of:
0.11086493 = sum of:
0.03635253 = weight(_text_:world in 2933) [ClassicSimilarity], result of:
0.03635253 = score(doc=2933,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.29726875 = fieldWeight in 2933, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.0546875 = fieldNorm(doc=2933)
0.0483057 = weight(_text_:wide in 2933) [ClassicSimilarity], result of:
0.0483057 = score(doc=2933,freq=2.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.342674 = fieldWeight in 2933, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0546875 = fieldNorm(doc=2933)
0.026206696 = weight(_text_:web in 2933) [ClassicSimilarity], result of:
0.026206696 = score(doc=2933,freq=2.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.25239927 = fieldWeight in 2933, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=2933)
0.23076923 = coord(3/13)
- Content
- Vortrag, "Semantics, Analytics, Visualisation: Enhancing Scholarly Data Workshop co-located with the 25th International World Wide Web Conference April 11, 2016 - Montreal, Canada", Montreal 2016.
-
Menczer, F.: Lexical and semantic clustering by Web links (2004)
0.02
0.022913055 = product of:
0.09928991 = sum of:
0.031159312 = weight(_text_:world in 3090) [ClassicSimilarity], result of:
0.031159312 = score(doc=3090,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.25480178 = fieldWeight in 3090, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.046875 = fieldNorm(doc=3090)
0.059431206 = weight(_text_:web in 3090) [ClassicSimilarity], result of:
0.059431206 = score(doc=3090,freq=14.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.57238775 = fieldWeight in 3090, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=3090)
0.008699387 = product of:
0.026098162 = sum of:
0.026098162 = weight(_text_:29 in 3090) [ClassicSimilarity], result of:
0.026098162 = score(doc=3090,freq=2.0), product of:
0.11191709 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.031815533 = queryNorm
0.23319192 = fieldWeight in 3090, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.046875 = fieldNorm(doc=3090)
0.33333334 = coord(1/3)
0.23076923 = coord(3/13)
- Abstract
- Recent Web-searching and -mining tools are combining text and link analysis to improve ranking and crawling algorithms. The central assumption behind such approaches is that there is a correiation between the graph structure of the Web and the text and meaning of pages. Here I formalize and empirically evaluate two general conjectures drawing connections from link information to lexical and semantic Web content. The link-content conjecture states that a page is similar to the pages that link to it, and the link-cluster conjecture that pages about the same topic are clustered together. These conjectures are offen simply assumed to hold, and Web search tools are built an such assumptions. The present quantitative confirmation sheds light an the connection between the success of the latest Web-mining techniques and the small world topology of the Web, with encouraging implications for the design of better crawling algorithms.
- Date
- 9. 1.2005 19:20:29
-
Wolfram, D.; Xie, H.I.: Traditional IR for web users : a context for general audience digital libraries (2002)
0.02
0.022594225 = product of:
0.0979083 = sum of:
0.025966093 = weight(_text_:world in 2589) [ClassicSimilarity], result of:
0.025966093 = score(doc=2589,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.21233483 = fieldWeight in 2589, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.0390625 = fieldNorm(doc=2589)
0.03450407 = weight(_text_:wide in 2589) [ClassicSimilarity], result of:
0.03450407 = score(doc=2589,freq=2.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.24476713 = fieldWeight in 2589, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0390625 = fieldNorm(doc=2589)
0.03743814 = weight(_text_:web in 2589) [ClassicSimilarity], result of:
0.03743814 = score(doc=2589,freq=8.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.36057037 = fieldWeight in 2589, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=2589)
0.23076923 = coord(3/13)
- Abstract
- The emergence of general audience digital libraries (GADLs) defines a context that represents a hybrid of both "traditional" IR, using primarily bibliographic resources provided by database vendors, and "popular" IR, exemplified by public search systems available on the World Wide Web. Findings of a study investigating end-user searching and response to a GADL are reported. Data collected from a Web-based end-user survey and data logs of resource usage for a Web-based GADL were analyzed for user characteristics, patterns of access and use, and user feedback. Cross-tabulations using respondent demographics revealed several key differences in how the system was used and valued by users of different age groups. Older users valued the service more than younger users and engaged in different searching and viewing behaviors. The GADL more closely resembles traditional retrieval systems in terms of content and purpose of use, but is more similar to popular IR systems in terms of user behavior and accessibility. A model that defines the dual context of the GADL environment is derived from the data analysis and existing IR models in general and other specific contexts. The authors demonstrate the distinguishing characteristics of this IR context, and discuss implications for the development and evaluation of future GADLs to accommodate a variety of user needs and expectations.
-
Surfing versus Drilling for knowledge in science : When should you use your computer? When should you use your brain? (2018)
0.02
0.020008776 = product of:
0.086704694 = sum of:
0.020772874 = weight(_text_:world in 4564) [ClassicSimilarity], result of:
0.020772874 = score(doc=4564,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.16986786 = fieldWeight in 4564, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.03125 = fieldNorm(doc=4564)
0.027603257 = weight(_text_:wide in 4564) [ClassicSimilarity], result of:
0.027603257 = score(doc=4564,freq=2.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.1958137 = fieldWeight in 4564, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.03125 = fieldNorm(doc=4564)
0.038328562 = weight(_text_:software in 4564) [ClassicSimilarity], result of:
0.038328562 = score(doc=4564,freq=6.0), product of:
0.12621705 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.031815533 = queryNorm
0.3036718 = fieldWeight in 4564, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.03125 = fieldNorm(doc=4564)
0.23076923 = coord(3/13)
- Abstract
- For this second Special Issue of Infozine, we have invited students, teachers, researchers, and software developers to share their opinions about one or the other aspect of this broad topic: how to balance drilling (for depth) vs. surfing (for breadth) in scientific learning, teaching, research, and software design - and how the modern digital-liberal system affects our ability to strike this balance. This special issue is meant to provide a wide and unbiased spectrum of possible viewpoints on the topic, helping readers to define lucidly their own position and information use behavior.
- Content
- Editorial: Surfing versus Drilling for Knowledge in Science: When should you use your computer? When should you use your brain? Blaise Pascal: Les deux infinis - The two infinities / Philippe Hünenberger and Oliver Renn - "Surfing" vs. "drilling" in the modern scientific world / Antonio Loprieno - Of millimeter paper and machine learning / Philippe Hünenberger - From one to many, from breadth to depth - industrializing research / Janne Soetbeer - "Deep drilling" requires "surfing" / Gerd Folkers and Laura Folkers - Surfing vs. drilling in science: A delicate balance / Alzbeta Kubincová - Digital trends in academia - for the sake of critical thinking or comfort? / Leif-Thore Deck - I diagnose, therefore I am a Doctor? Will drilling computer software replace human doctors in the future? / Yi Zheng - Surfing versus drilling in fundamental research / Wilfred van Gunsteren - Using brain vs. brute force in computational studies of biological systems / Arieh Warshel - Laboratory literature boards in the digital age / Jeffrey Bode - Research strategies in computational chemistry / Sereina Riniker - Surfing on the hype waves or drilling deep for knowledge? A perspective from industry / Nadine Schneider and Nikolaus Stiefl - The use and purpose of articles and scientists / Philip Mark Lund - Can you look at papers like artwork? / Oliver Renn - Dynamite fishing in the data swamp / Frank Perabo 34 Streetlights, augmented intelligence, and information discovery / Jeffrey Saffer and Vicki Burnett - "Yes Dave. Happy to do that for you." Why AI, machine learning, and blockchain will lead to deeper "drilling" / Michiel Kolman and Sjors de Heuvel - Trends in scientific document search ( Stefan Geißler - Power tools for text mining / Jane Reed 42 Publishing and patenting: Navigating the differences to ensure search success / Paul Peters
-
Hannech, A.: Système de recherche d'information étendue basé sur une projection multi-espaces (2018)
0.02
0.018949628 = product of:
0.06158629 = sum of:
0.017989837 = weight(_text_:world in 4472) [ClassicSimilarity], result of:
0.017989837 = score(doc=4472,freq=6.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.14710988 = fieldWeight in 4472, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.015625 = fieldNorm(doc=4472)
0.019518452 = weight(_text_:wide in 4472) [ClassicSimilarity], result of:
0.019518452 = score(doc=4472,freq=4.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.1384612 = fieldWeight in 4472, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.015625 = fieldNorm(doc=4472)
0.021178208 = weight(_text_:web in 4472) [ClassicSimilarity], result of:
0.021178208 = score(doc=4472,freq=16.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.2039694 = fieldWeight in 4472, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.015625 = fieldNorm(doc=4472)
0.0028997958 = product of:
0.008699387 = sum of:
0.008699387 = weight(_text_:29 in 4472) [ClassicSimilarity], result of:
0.008699387 = score(doc=4472,freq=2.0), product of:
0.11191709 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.031815533 = queryNorm
0.07773064 = fieldWeight in 4472, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.015625 = fieldNorm(doc=4472)
0.33333334 = coord(1/3)
0.30769232 = coord(4/13)
- Abstract
- Depuis son apparition au début des années 90, le World Wide Web (WWW ou Web) a offert un accès universel aux connaissances et le monde de l'information a été principalement témoin d'une grande révolution (la révolution numérique). Il est devenu rapidement très populaire, ce qui a fait de lui la plus grande et vaste base de données et de connaissances existantes grâce à la quantité et la diversité des données qu'il contient. Cependant, l'augmentation et l'évolution considérables de ces données soulèvent d'importants problèmes pour les utilisateurs notamment pour l'accès aux documents les plus pertinents à leurs requêtes de recherche. Afin de faire face à cette explosion exponentielle du volume de données et faciliter leur accès par les utilisateurs, différents modèles sont proposés par les systèmes de recherche d'information (SRIs) pour la représentation et la recherche des documents web. Les SRIs traditionnels utilisent, pour indexer et récupérer ces documents, des mots-clés simples qui ne sont pas sémantiquement liés. Cela engendre des limites en termes de la pertinence et de la facilité d'exploration des résultats. Pour surmonter ces limites, les techniques existantes enrichissent les documents en intégrant des mots-clés externes provenant de différentes sources. Cependant, ces systèmes souffrent encore de limitations qui sont liées aux techniques d'exploitation de ces sources d'enrichissement. Lorsque les différentes sources sont utilisées de telle sorte qu'elles ne peuvent être distinguées par le système, cela limite la flexibilité des modèles d'exploration qui peuvent être appliqués aux résultats de recherche retournés par ce système. Les utilisateurs se sentent alors perdus devant ces résultats, et se retrouvent dans l'obligation de les filtrer manuellement pour sélectionner l'information pertinente. S'ils veulent aller plus loin, ils doivent reformuler et cibler encore plus leurs requêtes de recherche jusqu'à parvenir aux documents qui répondent le mieux à leurs attentes. De cette façon, même si les systèmes parviennent à retrouver davantage des résultats pertinents, leur présentation reste problématique. Afin de cibler la recherche à des besoins d'information plus spécifiques de l'utilisateur et améliorer la pertinence et l'exploration de ses résultats de recherche, les SRIs avancés adoptent différentes techniques de personnalisation de données qui supposent que la recherche actuelle d'un utilisateur est directement liée à son profil et/ou à ses expériences de navigation/recherche antérieures. Cependant, cette hypothèse ne tient pas dans tous les cas, les besoins de l'utilisateur évoluent au fil du temps et peuvent s'éloigner de ses intérêts antérieurs stockés dans son profil.
Dans d'autres cas, le profil de l'utilisateur peut être mal exploité pour extraire ou inférer ses nouveaux besoins en information. Ce problème est beaucoup plus accentué avec les requêtes ambigües. Lorsque plusieurs centres d'intérêt auxquels est liée une requête ambiguë sont identifiés dans le profil de l'utilisateur, le système se voit incapable de sélectionner les données pertinentes depuis ce profil pour répondre à la requête. Ceci a un impact direct sur la qualité des résultats fournis à cet utilisateur. Afin de remédier à quelques-unes de ces limitations, nous nous sommes intéressés dans ce cadre de cette thèse de recherche au développement de techniques destinées principalement à l'amélioration de la pertinence des résultats des SRIs actuels et à faciliter l'exploration de grandes collections de documents. Pour ce faire, nous proposons une solution basée sur un nouveau concept d'indexation et de recherche d'information appelé la projection multi-espaces. Cette proposition repose sur l'exploitation de différentes catégories d'information sémantiques et sociales qui permettent d'enrichir l'univers de représentation des documents et des requêtes de recherche en plusieurs dimensions d'interprétations. L'originalité de cette représentation est de pouvoir distinguer entre les différentes interprétations utilisées pour la description et la recherche des documents. Ceci donne une meilleure visibilité sur les résultats retournés et aide à apporter une meilleure flexibilité de recherche et d'exploration, en donnant à l'utilisateur la possibilité de naviguer une ou plusieurs vues de données qui l'intéressent le plus. En outre, les univers multidimensionnels de représentation proposés pour la description des documents et l'interprétation des requêtes de recherche aident à améliorer la pertinence des résultats de l'utilisateur en offrant une diversité de recherche/exploration qui aide à répondre à ses différents besoins et à ceux des autres différents utilisateurs. Cette étude exploite différents aspects liés à la recherche personnalisée et vise à résoudre les problèmes engendrés par l'évolution des besoins en information de l'utilisateur. Ainsi, lorsque le profil de cet utilisateur est utilisé par notre système, une technique est proposée et employée pour identifier les intérêts les plus représentatifs de ses besoins actuels dans son profil. Cette technique se base sur la combinaison de trois facteurs influents, notamment le facteur contextuel, fréquentiel et temporel des données. La capacité des utilisateurs à interagir, à échanger des idées et d'opinions, et à former des réseaux sociaux sur le Web, a amené les systèmes à s'intéresser aux types d'interactions de ces utilisateurs, au niveau d'interaction entre eux ainsi qu'à leurs rôles sociaux dans le système. Ces informations sociales sont abordées et intégrées dans ce travail de recherche. L'impact et la manière de leur intégration dans le processus de RI sont étudiés pour améliorer la pertinence des résultats.
Since its appearance in the early 90's, the World Wide Web (WWW or Web) has provided universal access to knowledge and the world of information has been primarily witness to a great revolution (the digital revolution). It quickly became very popular, making it the largest and most comprehensive database and knowledge base thanks to the amount and diversity of data it contains. However, the considerable increase and evolution of these data raises important problems for users, in particular for accessing the documents most relevant to their search queries. In order to cope with this exponential explosion of data volume and facilitate their access by users, various models are offered by information retrieval systems (IRS) for the representation and retrieval of web documents. Traditional SRIs use simple keywords that are not semantically linked to index and retrieve these documents. This creates limitations in terms of the relevance and ease of exploration of results. To overcome these limitations, existing techniques enrich documents by integrating external keywords from different sources. However, these systems still suffer from limitations that are related to the exploitation techniques of these sources of enrichment. When the different sources are used so that they cannot be distinguished by the system, this limits the flexibility of the exploration models that can be applied to the results returned by this system. Users then feel lost to these results, and find themselves forced to filter them manually to select the relevant information. If they want to go further, they must reformulate and target their search queries even more until they reach the documents that best meet their expectations. In this way, even if the systems manage to find more relevant results, their presentation remains problematic. In order to target research to more user-specific information needs and improve the relevance and exploration of its research findings, advanced SRIs adopt different data personalization techniques that assume that current research of user is directly related to his profile and / or previous browsing / search experiences.
However, this assumption does not hold in all cases, the needs of the user evolve over time and can move away from his previous interests stored in his profile. In other cases, the user's profile may be misused to extract or infer new information needs. This problem is much more accentuated with ambiguous queries. When multiple POIs linked to a search query are identified in the user's profile, the system is unable to select the relevant data from that profile to respond to that request. This has a direct impact on the quality of the results provided to this user. In order to overcome some of these limitations, in this research thesis, we have been interested in the development of techniques aimed mainly at improving the relevance of the results of current SRIs and facilitating the exploration of major collections of documents. To do this, we propose a solution based on a new concept and model of indexing and information retrieval called multi-spaces projection. This proposal is based on the exploitation of different categories of semantic and social information that enrich the universe of document representation and search queries in several dimensions of interpretations. The originality of this representation is to be able to distinguish between the different interpretations used for the description and the search for documents. This gives a better visibility on the results returned and helps to provide a greater flexibility of search and exploration, giving the user the ability to navigate one or more views of data that interest him the most. In addition, the proposed multidimensional representation universes for document description and search query interpretation help to improve the relevance of the user's results by providing a diversity of research / exploration that helps meet his diverse needs and those of other different users. This study exploits different aspects that are related to the personalized search and aims to solve the problems caused by the evolution of the information needs of the user. Thus, when the profile of this user is used by our system, a technique is proposed and used to identify the interests most representative of his current needs in his profile. This technique is based on the combination of three influential factors, including the contextual, frequency and temporal factor of the data. The ability of users to interact, exchange ideas and opinions, and form social networks on the Web, has led systems to focus on the types of interactions these users have at the level of interaction between them as well as their social roles in the system. This social information is discussed and integrated into this research work. The impact and how they are integrated into the IR process are studied to improve the relevance of the results.
- Date
- 29. 9.2018 18:57:38
-
Melucci, M.: Contextual search : a computational framework (2012)
0.02
0.01827444 = product of:
0.07918923 = sum of:
0.025966093 = weight(_text_:world in 4913) [ClassicSimilarity], result of:
0.025966093 = score(doc=4913,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.21233483 = fieldWeight in 4913, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.0390625 = fieldNorm(doc=4913)
0.03450407 = weight(_text_:wide in 4913) [ClassicSimilarity], result of:
0.03450407 = score(doc=4913,freq=2.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.24476713 = fieldWeight in 4913, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0390625 = fieldNorm(doc=4913)
0.01871907 = weight(_text_:web in 4913) [ClassicSimilarity], result of:
0.01871907 = score(doc=4913,freq=2.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.18028519 = fieldWeight in 4913, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=4913)
0.23076923 = coord(3/13)
- Abstract
- The growing availability of data in electronic form, the expansion of the World Wide Web and the accessibility of computational methods for large-scale data processing have allowed researchers in Information Retrieval (IR) to design systems which can effectively and efficiently constrain search within the boundaries given by context, thus transforming classical search into contextual search. Contextual Search: A Computational Framework introduces contextual search within a computational framework based on contextual variables, contextual factors and statistical models. It describes how statistical models can process contextual variables to infer the contextual factors underlying the current search context. It also provides background to the subject by: placing it among other surveys on relevance, interaction, context, and behaviour; providing a description of the contextual variables used for implementing the statistical models which represent and predict relevance and contextual factors; and providing an overview of the evaluation methodologies and findings relevant to this subject. Contextual Search: A Computational Framework is a highly recommended read, both for beginners who are embarking on research in this area and as a useful reference for established IR researchers.
-
Layfield, C.; Azzopardi, J,; Staff, C.: Experiments with document retrieval from small text collections using Latent Semantic Analysis or term similarity with query coordination and automatic relevance feedback (2017)
0.02
0.018120548 = product of:
0.07852237 = sum of:
0.05774752 = weight(_text_:log in 3478) [ClassicSimilarity], result of:
0.05774752 = score(doc=3478,freq=2.0), product of:
0.20389368 = queryWeight, product of:
6.4086204 = idf(docFreq=197, maxDocs=44218)
0.031815533 = queryNorm
0.2832237 = fieldWeight in 3478, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.4086204 = idf(docFreq=197, maxDocs=44218)
0.03125 = fieldNorm(doc=3478)
0.014975254 = weight(_text_:web in 3478) [ClassicSimilarity], result of:
0.014975254 = score(doc=3478,freq=2.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.14422815 = fieldWeight in 3478, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=3478)
0.0057995915 = product of:
0.017398775 = sum of:
0.017398775 = weight(_text_:29 in 3478) [ClassicSimilarity], result of:
0.017398775 = score(doc=3478,freq=2.0), product of:
0.11191709 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.031815533 = queryNorm
0.15546128 = fieldWeight in 3478, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03125 = fieldNorm(doc=3478)
0.33333334 = coord(1/3)
0.23076923 = coord(3/13)
- Abstract
- One of the problems faced by users of databases containing textual documents is the difficulty in retrieving relevant results due to the diverse vocabulary used in queries and contained in relevant documents, especially when there are only a small number of relevant documents. This problem is known as the Vocabulary Gap. The PIKES team have constructed a small test collection of 331 articles extracted from a blog and a Gold Standard for 35 queries selected from the blog's search log so the results of different approaches to semantic search can be compared. So far, prior approaches include recognising Named Entities in documents and queries, and relations including temporal relations, and represent them as `semantic layers' in a retrieval system index. In this work, we take two different approaches that do not involve Named Entity Recognition. In the first approach, we process an unannotated version of the PIKES document collection using Latent Semantic Analysis and use a combination of query coordination and automatic relevance feedback with which we outperform prior work. However, this approach is highly dependent on the underlying collection, and is not necessarily scalable to massive collections. In our second approach, we use an LSA Model generated by SEMILAR from a Wikipedia dump to generate a Term Similarity Matrix (TSM). We automatically expand the queries in the PIKES test collection with related terms from the TSM and submit them to a term-by-document matrix derived by indexing the PIKES collection using the Vector Space Model. Coupled with a combination of query coordination and automatic relevance feedback we also outperform prior work with this approach. The advantage of the second approach is that it is independent of the underlying document collection.
- Date
- 10. 3.2017 13:29:57
- Series
- Information Systems and Applications, incl. Internet/Web, and HCI; 10151
-
Poynder, R.: Web research engines? (1996)
0.01
0.012521208 = product of:
0.08138785 = sum of:
0.031159312 = weight(_text_:world in 5698) [ClassicSimilarity], result of:
0.031159312 = score(doc=5698,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.25480178 = fieldWeight in 5698, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.046875 = fieldNorm(doc=5698)
0.050228536 = weight(_text_:web in 5698) [ClassicSimilarity], result of:
0.050228536 = score(doc=5698,freq=10.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.48375595 = fieldWeight in 5698, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=5698)
0.15384616 = coord(2/13)
- Abstract
- Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages
- Source
- Information world review. 1996, no.120, S.47-48
-
Shiri, A.A.; Revie, C.: Query expansion behavior within a thesaurus-enhanced search environment : a user-centered evaluation (2006)
0.01
0.012361062 = product of:
0.0535646 = sum of:
0.01871907 = weight(_text_:web in 56) [ClassicSimilarity], result of:
0.01871907 = score(doc=56,freq=2.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.18028519 = fieldWeight in 56, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=56)
0.027661255 = weight(_text_:software in 56) [ClassicSimilarity], result of:
0.027661255 = score(doc=56,freq=2.0), product of:
0.12621705 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.031815533 = queryNorm
0.21915624 = fieldWeight in 56, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0390625 = fieldNorm(doc=56)
0.0071842764 = product of:
0.02155283 = sum of:
0.02155283 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
0.02155283 = score(doc=56,freq=2.0), product of:
0.11141258 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.031815533 = queryNorm
0.19345059 = fieldWeight in 56, 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=56)
0.33333334 = coord(1/3)
0.23076923 = coord(3/13)
- Abstract
- The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.
- Date
- 22. 7.2006 16:32:43
-
Roy, R.S.; Agarwal, S.; Ganguly, N.; Choudhury, M.: Syntactic complexity of Web search queries through the lenses of language models, networks and users (2016)
0.01
0.010434339 = product of:
0.0678232 = sum of:
0.025966093 = weight(_text_:world in 3188) [ClassicSimilarity], result of:
0.025966093 = score(doc=3188,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.21233483 = fieldWeight in 3188, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.0390625 = fieldNorm(doc=3188)
0.041857112 = weight(_text_:web in 3188) [ClassicSimilarity], result of:
0.041857112 = score(doc=3188,freq=10.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.40312994 = fieldWeight in 3188, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=3188)
0.15384616 = coord(2/13)
- Abstract
- Across the world, millions of users interact with search engines every day to satisfy their information needs. As the Web grows bigger over time, such information needs, manifested through user search queries, also become more complex. However, there has been no systematic study that quantifies the structural complexity of Web search queries. In this research, we make an attempt towards understanding and characterizing the syntactic complexity of search queries using a multi-pronged approach. We use traditional statistical language modeling techniques to quantify and compare the perplexity of queries with natural language (NL). We then use complex network analysis for a comparative analysis of the topological properties of queries issued by real Web users and those generated by statistical models. Finally, we conduct experiments to study whether search engine users are able to identify real queries, when presented along with model-generated ones. The three complementary studies show that the syntactic structure of Web queries is more complex than what n-grams can capture, but simpler than NL. Queries, thus, seem to represent an intermediate stage between syntactic and non-syntactic communication.
-
Bilal, D.; Kirby, J.: Differences and similarities in information seeking : children and adults as Web users (2002)
0.01
0.010316118 = product of:
0.06705476 = sum of:
0.044925764 = weight(_text_:web in 2591) [ClassicSimilarity], result of:
0.044925764 = score(doc=2591,freq=18.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.43268442 = fieldWeight in 2591, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=2591)
0.022129003 = weight(_text_:software in 2591) [ClassicSimilarity], result of:
0.022129003 = score(doc=2591,freq=2.0), product of:
0.12621705 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.031815533 = queryNorm
0.17532499 = fieldWeight in 2591, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.03125 = fieldNorm(doc=2591)
0.15384616 = coord(2/13)
- Abstract
- This study examined the success and information seeking behaviors of seventh-grade science students and graduate students in information science in using Yahooligans! Web search engine/directory. It investigated these users' cognitive, affective, and physical behaviors as they sought the answer for a fact-finding task. It analyzed and compared the overall patterns of children's and graduate students' Web activities, including searching moves, browsing moves, backtracking moves, looping moves, screen scrolling, target location and deviation moves, and the time they took to complete the task. The authors applied Bilal's Web Traversal Measure to quantify these users' effectiveness, efficiency, and quality of moves they made. Results were based on 14 children's Web sessions and nine graduate students' sessions. Both groups' Web activities were captured online using Lotus ScreenCam, a software package that records and replays online activities in Web browsers. Children's affective states were captured via exit interviews. Graduate students' affective states were extracted from the journal writings they kept during the traversal process. The study findings reveal that 89% of the graduate students found the correct answer to the search task as opposed to 50% of the children. Based on the Measure, graduate students' weighted effectiveness, efficiency, and quality of the Web moves they made were much higher than those of the children. Regardless of success and weighted scores, however, similarities and differences in information seeking were found between the two groups. Yahooligans! poor structure of keyword searching was a major factor that contributed to the "breakdowns" children and graduate students experienced. Unlike children, graduate students were able to recover from "breakdowns" quickly and effectively. Three main factors influenced these users' performance: ability to recover from "breakdowns", navigational style, and focus on task. Children and graduate students made recommendations for improving Yahooligans! interface design. Implications for Web user training and system design improvements are made.
-
Brambilla, M.; Ceri, S.: Designing exploratory search applications upon Web data sources (2012)
0.01
0.009920834 = product of:
0.064485416 = sum of:
0.042356417 = weight(_text_:web in 428) [ClassicSimilarity], result of:
0.042356417 = score(doc=428,freq=16.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.4079388 = fieldWeight in 428, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=428)
0.022129003 = weight(_text_:software in 428) [ClassicSimilarity], result of:
0.022129003 = score(doc=428,freq=2.0), product of:
0.12621705 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.031815533 = queryNorm
0.17532499 = fieldWeight in 428, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.03125 = fieldNorm(doc=428)
0.15384616 = coord(2/13)
- Abstract
- Search is the preferred method to access information in today's computing systems. The Web, accessed through search engines, is universally recognized as the source for answering users' information needs. However, offering a link to a Web page does not cover all information needs. Even simple problems, such as "Which theater offers an at least three-stars action movie in London close to a good Italian restaurant," can only be solved by searching the Web multiple times, e.g., by extracting a list of the recent action movies filtered by ranking, then looking for movie theaters, then looking for Italian restaurants close to them. While search engines hint to useful information, the user's brain is the fundamental platform for information integration. An important trend is the availability of new, specialized data sources-the so-called "long tail" of the Web of data. Such carefully collected and curated data sources can be much more valuable than information currently available in Web pages; however, many sources remain hidden or insulated, in the lack of software solutions for bringing them to surface and making them usable in the search context. A new class of tailor-made systems, designed to satisfy the needs of users with specific aims, will support the publishing and integration of data sources for vertical domains; the user will be able to select sources based on individual or collective trust, and systems will be able to route queries to such sources and to provide easyto-use interfaces for combining them within search strategies, at the same time, rewarding the data source owners for each contribution to effective search. Efforts such as Google's Fusion Tables show that the technology for bringing hidden data sources to surface is feasible.
- Source
- Semantic search over the Web. Eds.: R. De Virgilio, et al
- Theme
- Semantic Web
-
BOND: Assoziativ-OPAC SpiderSearch (2003)
0.01
0.009243636 = product of:
0.060083635 = sum of:
0.03242238 = weight(_text_:web in 1795) [ClassicSimilarity], result of:
0.03242238 = score(doc=1795,freq=6.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.3122631 = fieldWeight in 1795, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=1795)
0.027661255 = weight(_text_:software in 1795) [ClassicSimilarity], result of:
0.027661255 = score(doc=1795,freq=2.0), product of:
0.12621705 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.031815533 = queryNorm
0.21915624 = fieldWeight in 1795, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0390625 = fieldNorm(doc=1795)
0.15384616 = coord(2/13)
- Abstract
- Der Hersteller von Bibliothekssoftware BOND erweitert sein Produktangebot um eine innovative Neuheit, den Assoziativ-OPAC SpiderSearch. Dieser graphische Web-OPAC sucht zu einem Stichwort Assoziative, d.h. sinn- oder sprachwissenschaftlich verwandte Begriffe. Diese baut er spinnennetzartig um den zentralen Suchbegriff herum auf. Anhand der ihm angebotenen Assoziative kann sich der Leser sehr einfach und anschaulich durch den Medienbestand der Bibliothek klicken. So findet er schnell und komfortabel relevante Medien, die mit herkömmlichen Suchverfahren nur schwer recherchierbar wären. Mühsame Überlegungen über verwandte Suchbegriffe und angrenzende Themengebiete bleiben dem Benutzer erspart. Dies übernimmt SpiderSearch und navigiert den Benutzer ähnlich wie beim Surfen durch Webseiten durch sämtliche Themen, die mit dem Suchbegriff in Zusammenhang stehen. Auch aufwändiges Durchblättern einer riesigen Suchergebnisliste ist nicht nötig. Durch die im semantischen Netz vorgeschlagenen Begriffe, kann der Benutzer sein Thema genau eingrenzen und erhält in seiner Trefferliste nur passende Medien. Diese ordnet SpiderSearch nach ihrer Relevanz, so dass der Leser die benötigte Literatur einfach und komfortabel findet. Wie auch im normalen Web-OPAC enthält die Trefferliste Angaben zu Titel, Standort und Verfügbarkeit des Mediums. Zur einfachen Zuordnung der Medienart ist jedem Medium ein entsprechendes Symbol zugewiesen. Per Mausklick erhält der Benutzer Detailangaben zum Medium und optional eine Ansicht des Buchcovers. SpiderSearch ist ein Zusatzmodul zur Software BIBLIOTHECA2000 von BOND und setzt auf den Web-OPAL auf. Vor allem bei Öffentlichen Bibliotheken stößt SpiderSearch auf großes Interesse. Erste Anwender bieten Ihren Lesern bereits dieses neue Sucherlebnis.
-
AssoziativOPAC : SpiderSearch von BOND (2003)
0.01
0.009243636 = product of:
0.060083635 = sum of:
0.03242238 = weight(_text_:web in 2029) [ClassicSimilarity], result of:
0.03242238 = score(doc=2029,freq=6.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.3122631 = fieldWeight in 2029, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=2029)
0.027661255 = weight(_text_:software in 2029) [ClassicSimilarity], result of:
0.027661255 = score(doc=2029,freq=2.0), product of:
0.12621705 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.031815533 = queryNorm
0.21915624 = fieldWeight in 2029, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0390625 = fieldNorm(doc=2029)
0.15384616 = coord(2/13)
- Content
- "Der Hersteller von Bibliothekssoftware BOND erweitert sein Produktangebot um den Assoziativ-OPAC SpiderSearch. Dieser graphische Web-OPAC sucht zu einem Stichwort Assoziative, d.h. sinnoder sprachwissenschaftlich verwandte Begriffe. Diese baut er spinnennetzartig um den zentralen Suchbegriff herum auf. Anhand der ihm angebotenen Assoziative kann sich der Leser sehr einfach und anschaulich durch den Medienbestand der Bibliothek klicken. So findet er schnell und komfortabel relevante Medien, die mit herkömmlichen Suchverfahren nur schwer recherchierbar wären. Überlegungen über verwandte Suchbegriffe und angrenzende Themengebiete bleiben dem Benutzer erspart: SpiderSearch navigiert den Benutzer ähnlich wie beim Surfen durch Webseiten durch sämtliche Themen, die mit dem Suchbegriff in Zusammenhang stehen. Auch aufwändiges Durchblättern einer riesigen Suchergebnisliste ist nicht nötig. Durch die im semantischen Netz vorgeschlagenen Begriffe kann der Benutzer sein Thema genau eingrenzen und erhält in seiner Trefferliste nur passende Medien. Diese ordnet SpiderSearch nach ihrer Relevanz, so dass der Leser die benötigte Literatur einfach und komfortabel findet. Wie auch im normalen Web-OPAC enthält die Trefferliste Angaben zu Titel, Standort und Verfügbarkeit des Mediums. Zur einfachen Zuordnung der Medienart ist jedem Medium ein entsprechendes Symbol zugewiesen. Per Mausklick erhält der Benutzer Detailangaben zum Medium und optional eine Ansicht des Buchcovers. SpiderSearch ist ein Zusatzmodul zur Software BIBLIOTHECA2000 von BOND und setzt auf den Web-OPAC auf."
-
Zhang, J.; Mostafa, J.; Tripathy, H.: Information retrieval by semantic analysis and visualization of the concept space of D-Lib® magazine (2002)
0.01
0.00913722 = product of:
0.039594617 = sum of:
0.0129830465 = weight(_text_:world in 1211) [ClassicSimilarity], result of:
0.0129830465 = score(doc=1211,freq=2.0), product of:
0.122288436 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.031815533 = queryNorm
0.10616741 = fieldWeight in 1211, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.01953125 = fieldNorm(doc=1211)
0.017252035 = weight(_text_:wide in 1211) [ClassicSimilarity], result of:
0.017252035 = score(doc=1211,freq=2.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.122383565 = fieldWeight in 1211, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.01953125 = fieldNorm(doc=1211)
0.009359535 = weight(_text_:web in 1211) [ClassicSimilarity], result of:
0.009359535 = score(doc=1211,freq=2.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.09014259 = fieldWeight in 1211, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.01953125 = fieldNorm(doc=1211)
0.23076923 = coord(3/13)
- Abstract
- In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary generation algorithm to generate a set of concepts for the digital library and a technique called the max-min distance technique to cluster them. Additionally, the concepts were visualized in a spring embedding graph layout to depict the semantic relationship among them. The resulting graph layout serves as an aid to users for retrieving documents. An online archive containing the contents of D-Lib Magazine from July 1995 to May 2002 was used to test the utility of an implemented retrieval and visualization system. We believe that the method developed and tested can be applied to many different domains to help users get a better understanding of online document collections and to minimize users' cognitive load during execution of search tasks. Over the past few years, the volume of information available through the World Wide Web has been expanding exponentially. Never has so much information been so readily available and shared among so many people. Unfortunately, the unstructured nature and huge volume of information accessible over networks have made it hard for users to sift through and find relevant information. To deal with this problem, information retrieval (IR) techniques have gained more intensive attention from both industrial and academic researchers. Numerous IR techniques have been developed to help deal with the information overload problem. These techniques concentrate on mathematical models and algorithms for retrieval. Popular IR models such as the Boolean model, the vector-space model, the probabilistic model and their variants are well established.
-
Symonds, M.; Bruza, P.; Zuccon, G.; Koopman, B.; Sitbon, L.; Turner, I.: Automatic query expansion : a structural linguistic perspective (2014)
0.01
0.008188176 = product of:
0.05322314 = sum of:
0.03450407 = weight(_text_:wide in 1338) [ClassicSimilarity], result of:
0.03450407 = score(doc=1338,freq=2.0), product of:
0.14096694 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.031815533 = queryNorm
0.24476713 = fieldWeight in 1338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0390625 = fieldNorm(doc=1338)
0.01871907 = weight(_text_:web in 1338) [ClassicSimilarity], result of:
0.01871907 = score(doc=1338,freq=2.0), product of:
0.10383032 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.031815533 = queryNorm
0.18028519 = fieldWeight in 1338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=1338)
0.15384616 = coord(2/13)
- Abstract
- A user's query is considered to be an imprecise description of their information need. Automatic query expansion is the process of reformulating the original query with the goal of improving retrieval effectiveness. Many successful query expansion techniques model syntagmatic associations that infer two terms co-occur more often than by chance in natural language. However, structural linguistics relies on both syntagmatic and paradigmatic associations to deduce the meaning of a word. Given the success of dependency-based approaches to query expansion and the reliance on word meanings in the query formulation process, we argue that modeling both syntagmatic and paradigmatic information in the query expansion process improves retrieval effectiveness. This article develops and evaluates a new query expansion technique that is based on a formal, corpus-based model of word meaning that models syntagmatic and paradigmatic associations. We demonstrate that when sufficient statistical information exists, as in the case of longer queries, including paradigmatic information alone provides significant improvements in retrieval effectiveness across a wide variety of data sets. More generally, when our new query expansion approach is applied to large-scale web retrieval it demonstrates significant improvements in retrieval effectiveness over a strong baseline system, based on a commercial search engine.
-
Hancock-Beaulieu, M.; Walker, S.: ¬An evaluation of automatic query expansion in an online library catalogue (1992)
0.01
0.0077737053 = product of:
0.10105816 = sum of:
0.10105816 = weight(_text_:log in 2731) [ClassicSimilarity], result of:
0.10105816 = score(doc=2731,freq=2.0), product of:
0.20389368 = queryWeight, product of:
6.4086204 = idf(docFreq=197, maxDocs=44218)
0.031815533 = queryNorm
0.49564147 = fieldWeight in 2731, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.4086204 = idf(docFreq=197, maxDocs=44218)
0.0546875 = fieldNorm(doc=2731)
0.07692308 = coord(1/13)
- Abstract
- An automatic query expansion (AQE) facility in anonline catalogue was evaluated in an operational library setting. The OKAPI experimental system had other features including: ranked output 'best match' keyword searching, automatic stemming, spelling normalisation and cross referencing as well as relevance feedback. A combination of transaction log analysis, search replays, questionnaires and interviews was used for data collection. Findings show that contrary to previous results, AQE was beneficial in a substantial number of searches. Use intentions, the effectiveness of the 'best match' search and user interaction were identified as the main factors affecting the take-up of the query expansion facility
