-
Gödert, W.: Inhaltliche Dokumenterschließung, Information Retrieval und Navigation in Informationsräumen (1995)
0.03
0.026591558 = product of:
0.09971834 = sum of:
0.017793551 = weight(_text_:und in 4438) [ClassicSimilarity], result of:
0.017793551 = score(doc=4438,freq=4.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.27704588 = fieldWeight in 4438, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=4438)
0.025447812 = product of:
0.050895624 = sum of:
0.050895624 = weight(_text_:bibliothekswesen in 4438) [ClassicSimilarity], result of:
0.050895624 = score(doc=4438,freq=2.0), product of:
0.12917466 = queryWeight, product of:
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.028978055 = queryNorm
0.39400625 = fieldWeight in 4438, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.0625 = fieldNorm(doc=4438)
0.5 = coord(1/2)
0.050895624 = weight(_text_:bibliothekswesen in 4438) [ClassicSimilarity], result of:
0.050895624 = score(doc=4438,freq=2.0), product of:
0.12917466 = queryWeight, product of:
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.028978055 = queryNorm
0.39400625 = fieldWeight in 4438, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.0625 = fieldNorm(doc=4438)
0.0055813594 = product of:
0.011162719 = sum of:
0.011162719 = weight(_text_:information in 4438) [ClassicSimilarity], result of:
0.011162719 = score(doc=4438,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.21943474 = fieldWeight in 4438, 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=4438)
0.5 = coord(1/2)
0.26666668 = coord(4/15)
- Abstract
- Examines the advantages and disadvantages of precoordinated, postcoordinated and automatic indexing with regard to existing information storage systems, such as card catalogues, OPACs, CR-ROM databases, and online databases. Presents a general model of document content representation and concludes that the library profession needs to address the development of databank design models, relevance feedback methods and automatic indexing assessment methods, to make indexing more effective
- Source
- Zeitschrift für Bibliothekswesen und Bibliographie. 42(1995) H.2, S.137-155
-
Gödert, W.; Lepsky, K.: Semantische Umfeldsuche im Information Retrieval (1998)
0.02
0.023819279 = product of:
0.08932229 = sum of:
0.01906849 = weight(_text_:und in 606) [ClassicSimilarity], result of:
0.01906849 = score(doc=606,freq=6.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.2968967 = fieldWeight in 606, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=606)
0.022266837 = product of:
0.044533674 = sum of:
0.044533674 = weight(_text_:bibliothekswesen in 606) [ClassicSimilarity], result of:
0.044533674 = score(doc=606,freq=2.0), product of:
0.12917466 = queryWeight, product of:
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.028978055 = queryNorm
0.34475547 = fieldWeight in 606, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.0546875 = fieldNorm(doc=606)
0.5 = coord(1/2)
0.044533674 = weight(_text_:bibliothekswesen in 606) [ClassicSimilarity], result of:
0.044533674 = score(doc=606,freq=2.0), product of:
0.12917466 = queryWeight, product of:
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.028978055 = queryNorm
0.34475547 = fieldWeight in 606, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.457672 = idf(docFreq=1392, maxDocs=44218)
0.0546875 = fieldNorm(doc=606)
0.00345329 = product of:
0.00690658 = sum of:
0.00690658 = weight(_text_:information in 606) [ClassicSimilarity], result of:
0.00690658 = score(doc=606,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.13576832 = fieldWeight in 606, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=606)
0.5 = coord(1/2)
0.26666668 = coord(4/15)
- Abstract
- Sachliche Suchen in bibliothekarischen Online-Katalogen enden häufig mit unbefriedigenden Ergebnissen. Als eine Ursache dafür kann angesehen werden, daß die Gestaltung des Suchprozesses das semantische Umfeld einer Suchanfrage nicht mit einbezieht, daß in Übertragung der Verhältnisse in konventionellen Katalogen am Paradigma des Wort-Matching zwischen Suchwort und Indexat festgehalten wird. Es wird statt dessen das Konzept einer semantischen Umfeldsuche entwickelt und gezeigt, welche Rolle die Verwendung strukturierten Vokabulars dafür spielen kann. Insbesondere wird dargestellt, welche Möglichkeiten Verfahren der wörterbuchgestützten maschinellen Indexierung in diesem Zusammenhang spielen können. Die Ausführungen werden durch Beispiele illustriert
- Source
- Zeitschrift für Bibliothekswesen und Bibliographie. 45(1998) H.4, S.401-423
-
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
-
Fieldhouse, M.; Hancock-Beaulieu, M.: ¬The design of a graphical user interface for a highly interactive information retrieval system (1996)
0.00
0.0026296957 = product of:
0.039445434 = sum of:
0.039445434 = sum of:
0.011962548 = weight(_text_:information in 6958) [ClassicSimilarity], result of:
0.011962548 = score(doc=6958,freq=6.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.23515764 = fieldWeight in 6958, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=6958)
0.027482886 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
0.027482886 = score(doc=6958,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.2708308 = fieldWeight in 6958, 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=6958)
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
-
Shapiro, C.D.; Yan, P.-F.: Generous tools : thesauri in digital libraries (1996)
0.00
0.0023887705 = product of:
0.017915778 = sum of:
0.011009198 = weight(_text_:und in 3132) [ClassicSimilarity], result of:
0.011009198 = score(doc=3132,freq=2.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.17141339 = fieldWeight in 3132, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=3132)
0.00690658 = product of:
0.01381316 = sum of:
0.01381316 = weight(_text_:information in 3132) [ClassicSimilarity], result of:
0.01381316 = score(doc=3132,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.27153665 = fieldWeight in 3132, 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=3132)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- The Electronic Libraries and Information Highways MITRE Sponsored Research project aims to help searchers working in digital libraries increase their chance of matching the language of authors. Focuses on whether query formulation can be improved through the addition of semantic knowledge that is interactively gathered from a thesaurus that exists in a distributed, interoperating, cooperative environment. A prototype, ELVIS, was built that improves information retrieval through query expansion and is based on publicly available Z39.50 standard thesauri integrated with networked information discovery and retrieval tools
- Imprint
- Medford, NJ : Information Today
- Theme
- Konzeption und Anwendung des Prinzips Thesaurus
-
Järvelin, K.; Kristensen, J.; Niemi, T.; Sormunen, E.; Keskustalo, H.: ¬A deductive data model for query expansion (1996)
0.00
0.0019651123 = product of:
0.029476684 = sum of:
0.029476684 = sum of:
0.005919926 = weight(_text_:information in 2230) [ClassicSimilarity], result of:
0.005919926 = score(doc=2230,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.116372846 = fieldWeight in 2230, 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=2230)
0.023556758 = weight(_text_:22 in 2230) [ClassicSimilarity], result of:
0.023556758 = score(doc=2230,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.23214069 = fieldWeight in 2230, 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=2230)
0.06666667 = coord(1/15)
- Source
- Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (ACM SIGIR '96), Zürich, Switzerland, August 18-22, 1996. Eds.: H.P. Frei et al
-
Chen, H.; Martinez, J.; Kirchhoff, A.; Ng, T.D.; Schatz, B.R.: Alleviating search uncertainty through concept associations : automatic indexing, co-occurence analysis, and parallel computing (1998)
0.00
0.0018163302 = product of:
0.013622476 = sum of:
0.009436456 = weight(_text_:und in 5202) [ClassicSimilarity], result of:
0.009436456 = score(doc=5202,freq=2.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.14692576 = fieldWeight in 5202, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=5202)
0.0041860198 = product of:
0.0083720395 = sum of:
0.0083720395 = weight(_text_:information in 5202) [ClassicSimilarity], result of:
0.0083720395 = score(doc=5202,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.16457605 = fieldWeight in 5202, 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=5202)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- In this article, we report research on an algorithmic approach to alleviating search uncertainty in a large information space. Grounded on object filtering, automatic indexing, and co-occurence analysis, we performed a large-scale experiment using a parallel supercomputer (SGI Power Challenge) to analyze 400.000+ abstracts in an INSPEC computer engineering collection. Two system-generated thesauri, one based on a combined object filtering and automatic indexing method, and the other based on automatic indexing only, were compaed with the human-generated INSPEC subject thesaurus. Our user evaluation revealed that the system-generated thesauri were better than the INSPEC thesaurus in 'concept recall', but in 'concept precision' the 3 thesauri were comparable. Our analysis also revealed that the terms suggested by the 3 thesauri were complementary and could be used to significantly increase 'variety' in search terms the thereby reduce search uncertainty
- Source
- Journal of the American Society for Information Science. 49(1998) no.3, S.206-216
- Theme
- Konzeption und Anwendung des Prinzips Thesaurus
-
Spiteri, L.F.: ¬The essential elements of faceted thesauri (1999)
0.00
0.0018163302 = product of:
0.013622476 = sum of:
0.009436456 = weight(_text_:und in 5362) [ClassicSimilarity], result of:
0.009436456 = score(doc=5362,freq=2.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.14692576 = fieldWeight in 5362, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=5362)
0.0041860198 = product of:
0.0083720395 = sum of:
0.0083720395 = weight(_text_:information in 5362) [ClassicSimilarity], result of:
0.0083720395 = score(doc=5362,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.16457605 = fieldWeight in 5362, 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=5362)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- The goal of this study is to evaluate, compare, and contrast how facet analysis is used to construct the systematic or faceted displays of a selection of information retrieval thesauri. More specifically, the study seeks to examine which principles of facet analysis are used in the thesauri, and the extent to which different thesauri apply these principles in the same way. A measuring instrument was designed for the purpose of evaluating the structure of faceted thesauri. This instrument was applied to fourteen faceted information retrieval thesauri. The study reveals that the thesauri do not share a common definition of what constitutes a facet. In some cases, the thesauri apply both enumerative-style classification and facet analysis to arrange their indexing terms. A number of the facets used in the thesauri are not homogeneous or mutually exclusive. The principle of synthesis is used in only 50% of the thesauri, and no one citation order is used consistently by the thesauri.
- Theme
- Konzeption und Anwendung des Prinzips Thesaurus
-
Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995)
0.00
0.0016375937 = product of:
0.024563905 = sum of:
0.024563905 = sum of:
0.0049332716 = weight(_text_:information in 5697) [ClassicSimilarity], result of:
0.0049332716 = score(doc=5697,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.09697737 = fieldWeight in 5697, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=5697)
0.019630633 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
0.019630633 = score(doc=5697,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.19345059 = fieldWeight in 5697, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=5697)
0.06666667 = coord(1/15)
- Date
- 22. 2.1996 13:14:10
- Source
- Information processing and management. 31(1995) no.4, S.605-620
-
Efthimiadis, E.N.: End-users' understanding of thesaural knowledge structures in interactive query expansion (1994)
0.00
0.0010469672 = product of:
0.015704507 = sum of:
0.015704507 = product of:
0.031409014 = sum of:
0.031409014 = weight(_text_:22 in 5693) [ClassicSimilarity], result of:
0.031409014 = score(doc=5693,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.30952093 = fieldWeight in 5693, 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=5693)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Date
- 30. 3.2001 13:35:22
-
Otto, A.: Ordnungssysteme als Wissensbasis für die Suche in textbasierten Datenbeständen : dargestellt am Beispiel einer soziologischen Bibliographie (1998)
0.00
0.0010273112 = product of:
0.015409667 = sum of:
0.015409667 = weight(_text_:und in 6625) [ClassicSimilarity], result of:
0.015409667 = score(doc=6625,freq=12.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.23992877 = fieldWeight in 6625, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.03125 = fieldNorm(doc=6625)
0.06666667 = coord(1/15)
- Abstract
- Es wird eine Methode vorgestellt, wie sich Ordnungssysteme für die Suche in textbasierten Datenbeständen verwenden lassen. "Ordnungssystem" wird hier als Oberbegriff für beliebige geordnete Begriffssammlungen verwendet. Dies sind beispielsweise Thesauri, Klassifikationen und formale Systematiken. Weil Thesauri dabei die leistungsfähigsten Ordnungssysteme sind, finden sie eine besondere Berücksichtigung. Der Beitrag ist streng praxisbezogenen und auf die Nutzerschnittstelle konzentriert. Die Basis für die Nutzerschnittstelle bilden Ordnungssysteme, die über eine WWW-Schnittstelle angeboten werden. Je nach Fachgebiet kann der Nutzer ein spezielles Ordnungssystem für die Suche auswählen. Im Unterschied zu klassischen Verfahren werden die Ordnungssysteme nicht zur ausschließlichen Suche in Deskriptorenfeldern, sondern für die Suche in einem Basic Index verwendet. In der Anwendung auf den Basic Index sind die Ordnungssysteme quasi "entkoppelt" von der ursprünglichen Datenbank und den Deskriptorenfeldern, für die das Ordnungssystem entwickelt wurde. Die Inhalte einer Datenbank spielen bei der Wahl der Ordnungssysteme zunächst keine Rolle. Sie machen sich erst bei der Suche in der Anzahl der Treffer bemerkbar: so findet ein rechtswissenschaftlicher Thesaurus natürlicherweise in einer Medizin-Datenbank weniger relevante Dokumente als in einer Rechts-Datenbank, weil das im Rechts-Thesaurus abgebildete Begriffsgut eher in einer Rechts-Datenbank zu finden ist. Das Verfahren ist modular aufgebaut und sieht in der Konzeption nachgeordnete semantische Retrievalverfahren vor, die zu einer Verbesserung von Retrievaleffektivität und -effizienz führen werden. So werden aus einer Ergebnismenge, die ausschließlich durch exakten Zeichenkettenabgleich gefunden wurde, in einem nachfolgenden Schritt durch eine semantische Analyse diejenigen Dokumente herausgefiltert, die für die Suchfrage relevant sind. Die WWW-Nutzerschnittstelle und die Verwendung bereits bestehender Ordnungssysteme führen zu einer Minimierung des Arbeitsaufwands auf Nutzerseite. Die Kosten für eine Suche lassen sich sowohl auf der Input-Seite verringern, indem eine aufwendige "manuelle" Indexierung entfällt, als auch auf der Output-Seite, indem den Nutzern leicht bedienbare Suchoptionen zur Verfügung gestellt werden
-
Lund, K.; Burgess, C.; Atchley, R.A.: Semantic and associative priming in high-dimensional semantic space (1995)
0.00
9.1609627E-4 = product of:
0.013741443 = sum of:
0.013741443 = product of:
0.027482886 = sum of:
0.027482886 = weight(_text_:22 in 2151) [ClassicSimilarity], result of:
0.027482886 = score(doc=2151,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.2708308 = fieldWeight in 2151, 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=2151)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Proceedings of the Seventeenth Annual Conference of the Cognitive Science Society: July 22 - 25, 1995, University of Pittsburgh / ed. by Johanna D. Moore and Jill Fain Lehmann
-
Talja, S.; Keso, H.; Pietilainen, T.: ¬The production of context in information seeking research : a metatheoretical view (1999)
0.00
5.58136E-4 = product of:
0.0083720395 = sum of:
0.0083720395 = product of:
0.016744079 = sum of:
0.016744079 = weight(_text_:information in 6249) [ClassicSimilarity], result of:
0.016744079 = score(doc=6249,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.3291521 = fieldWeight in 6249, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.09375 = fieldNorm(doc=6249)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Information processing and management. 35(1999) no.6, S.751-763
-
Fowler, R.H.; Wilson, B.A.; Fowler, W.A.L.: Information navigator : an information system using associative networks for display and retrieval (1992)
0.00
5.2208843E-4 = product of:
0.007831326 = sum of:
0.007831326 = product of:
0.015662652 = sum of:
0.015662652 = weight(_text_:information in 919) [ClassicSimilarity], result of:
0.015662652 = score(doc=919,freq=14.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.3078936 = fieldWeight in 919, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=919)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Document retrieval is a highly interactive process dealing with large amounts of information. Visual representations can provide both a means for managing the complexity of large information structures and an interface style well suited to interactive manipulation. The system we have designed utilizes visually displayed graphic structures and a direct manipulation interface style to supply an integrated environment for retrieval. A common visually displayed network structure is used for query, document content, and term relations. A query can be modified through direct manipulation of its visual form by incorporating terms from any other information structure the system displays. An associative thesaurus of terms and an inter-document network provide information about a document collection that can complement other retrieval aids. Visualization of these large data structures makes use of fisheye views and overview diagrams to help overcome some of the inherent difficulties of orientation and navigation in large information structures.
-
Hemmje, M.: LyberWorld - a 3D graphical user interface for fulltext retrieval (1995)
0.00
5.147861E-4 = product of:
0.0077217915 = sum of:
0.0077217915 = product of:
0.015443583 = sum of:
0.015443583 = weight(_text_:information in 2385) [ClassicSimilarity], result of:
0.015443583 = score(doc=2385,freq=10.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.3035872 = fieldWeight in 2385, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=2385)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- LyberWorld is a prototype IR user interface. It implements visualizations of an abstract information space: fulltext. The video demonstrates a visual user interface for the probabilistic fulltext retrieval system INQUERY. Visualizations are used to communicate information search and browsing activities in a natural way by applying metaphors of spatial navigation in abstract information spaces. Visualization tools for exploring information spaces and judging relevance of information items are introduced and an example session demonstrates the prototype. The presence of a spatial model in the user's mind is regarded as an essential contribution towards natural interaction and reduction of cognitive costs during retrieval dialogues.
-
Hemmje, M.; Kunkel, C.; Willett, A.: LyberWorld - a visualization user interface supporting fulltext retrieval (1994)
0.00
4.8335994E-4 = product of:
0.007250399 = sum of:
0.007250399 = product of:
0.014500798 = sum of:
0.014500798 = weight(_text_:information in 2384) [ClassicSimilarity], result of:
0.014500798 = score(doc=2384,freq=12.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2850541 = fieldWeight in 2384, 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=2384)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- LyberWorld is a prototype IR user interface. It implements visualizations of an abstract information space-fulltext. The paper derives a model for such visualizations and an exemplar user interface design is implemented for the probabilistic fulltext retrieval system INQUERY. Visualizations are used to communicate information search and browsing activities in a natural way by applying metaphors of spatial navigation in abstract information spaces. Visualization tools for exploring information spaces and judging relevance of information items are introduced and an example session demonstrates the prototype. The presence of a spatial model in the user's mind and interaction with a system's corresponding display methods is regarded as an essential contribution towards natural interaction and reduction of cognitive costs during e.g. query construction, orientation within the database content, relevance judgement and orientation within the retrieval context.
- Source
- Proceeding SIGIR '94: Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
-
Robertson, A.M.; Willett, P.: Applications of n-grams in textual information systems (1998)
0.00
4.5571616E-4 = product of:
0.006835742 = sum of:
0.006835742 = product of:
0.013671484 = sum of:
0.013671484 = weight(_text_:information in 4715) [ClassicSimilarity], result of:
0.013671484 = score(doc=4715,freq=6.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2687516 = fieldWeight in 4715, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=4715)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Provides an introduction to the use of n-grams in textual information systems, where an n-gram is a string of n, usually adjacent, characters, extracted from a section of continuous text. Applications that can be implemented efficiently and effectively using sets of n-grams include spelling errors detection and correction, query expansion, information retrieval with serial, inverted and signature files, dictionary look up, text compression, and language identification
-
Kwok, K.L.: ¬A network approach to probabilistic information retrieval (1995)
0.00
3.9466174E-4 = product of:
0.005919926 = sum of:
0.005919926 = product of:
0.011839852 = sum of:
0.011839852 = weight(_text_:information in 5696) [ClassicSimilarity], result of:
0.011839852 = score(doc=5696,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.23274569 = fieldWeight in 5696, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=5696)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Shows how probabilistic information retrieval based on document components may be implemented as a feedforward (feedbackward) artificial neural network. The network supports adaptation of connection weights as well as the growing of new edges between queries and terms based on user relevance feedback data for training, and it reflects query modification and expansion in information retrieval. A learning rule is applied that can also be viewed as supporting sequential learning using a harmonic sequence learning rate. Experimental results with 4 standard small collections and a large Wall Street Journal collection show that small query expansion levels of about 30 terms can achieve most of the gains at the low-recall high-precision region, while larger expansion levels continue to provide gains at the high-recall low-precision region of a precision recall curve
- Source
- ACM transactions on information systems. 13(1995) no.3, S.324-353
-
Oakes, M.P.; Taylor, M.J.: Automated assistance in the formulation of search statements for bibliographic databases (1998)
0.00
3.9466174E-4 = product of:
0.005919926 = sum of:
0.005919926 = product of:
0.011839852 = sum of:
0.011839852 = weight(_text_:information in 6419) [ClassicSimilarity], result of:
0.011839852 = score(doc=6419,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.23274569 = fieldWeight in 6419, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.09375 = fieldNorm(doc=6419)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Information processing and management. 34(1998) no.6, S.645-668
-
Järvelin, K.; Niemi, T.: Deductive information retrieval based on classifications (1993)
0.00
3.9466174E-4 = product of:
0.005919926 = sum of:
0.005919926 = product of:
0.011839852 = sum of:
0.011839852 = weight(_text_:information in 2229) [ClassicSimilarity], result of:
0.011839852 = score(doc=2229,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.23274569 = fieldWeight in 2229, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2229)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Modern fact databses contain abundant data classified through several classifications. Typically, users msut consult these classifications in separate manuals or files, thus making their effective use difficult. Contemporary database systems do little support deductive use of classifications. In this study we show how deductive data management techniques can be applied to the utilization of data value classifications. Computation of transitive class relationships is of primary importance here. We define a representation of classifications which supports transitive computation and present an operation-oriented deductive query language tailored for classification-based deductive information retrieval. The operations of this language are on the same abstraction level as relational algebra operations and can be integrated with these to form a powerful and flexible query language for deductive information retrieval. We define the integration of these operations and demonstrate the usefulness of the language in terms of several sample queries
- Source
- Journal of the American Society for Information Science. 44(1993) no.10, S.557-578
