-
Frederichs, A.: Natürlichsprachige Abfrage und 3-D-Visualisierung von Wissenszusammenhängen (2007)
0.00
0.002425875 = product of:
0.018194063 = sum of:
0.015727427 = weight(_text_:und in 566) [ClassicSimilarity], result of:
0.015727427 = score(doc=566,freq=8.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.24487628 = fieldWeight in 566, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0390625 = fieldNorm(doc=566)
0.0024666358 = product of:
0.0049332716 = sum of:
0.0049332716 = weight(_text_:information in 566) [ClassicSimilarity], result of:
0.0049332716 = score(doc=566,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.09697737 = fieldWeight in 566, 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=566)
0.5 = coord(1/2)
0.13333334 = coord(2/15)
- Abstract
- Eine der größten Herausforderungen für alle technischen Anwendungen ist die sogenannte Mensch-Maschine-Schnittstelle, also der Problemkreis, wie der bedienende Mensch mit der zu bedienenden Technik kommunizieren kann. Waren die Benutzungsschnittstellen bis Ende der Achtziger Jahre vor allem durch die Notwendigkeit des Benutzers geprägt, sich an die Erfordernisse der Maschine anzupassen, so wurde mit Durchsetzung grafischer Benutzungsoberflächen zunehmend versucht, die Bedienbarkeit so zu gestalten, dass ein Mensch auch ohne größere Einarbeitung in die Lage versetzt werden sollte, seine Befehle der Technik - letztlich also dem Computer - zu übermitteln. Trotz aller Fortschritte auf diesem Gebiet blieb immer die Anforderung, der Mensch solle auf die ihm natürlichste Art und Weise kommunizieren können, mit menschlicher Sprache. Diese Anforderung gilt gerade auch für das Retrieval von Informationen: Warum ist es nötig, die Nutzung von Booleschen Operatoren zu erlernen, nur um eine Suchanfrage stellen zu können? Ein anderes Thema ist die Frage nach der Visualisierung von Wissenszusammenhängen, die sich der Herausforderung stellt, in einem geradezu uferlos sich ausweitenden Informationsangebot weiterhin den Überblick behalten und relevante Informationen schnellstmöglich finden zu können.
- Series
- Schriften der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare (VÖB); Bd. 2
- Source
- Wa(h)re Information: 29. Österreichischer Bibliothekartag Bregenz, 19.-23.9.2006. Hrsg.: Harald Weigel
-
Renker, L.: Exploration von Textkorpora : Topic Models als Grundlage der Interaktion (2015)
0.00
0.0013870286 = product of:
0.020805428 = sum of:
0.020805428 = weight(_text_:und in 2380) [ClassicSimilarity], result of:
0.020805428 = score(doc=2380,freq=14.0), product of:
0.06422601 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.028978055 = queryNorm
0.32394084 = fieldWeight in 2380, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0390625 = fieldNorm(doc=2380)
0.06666667 = coord(1/15)
- Abstract
- Das Internet birgt schier endlose Informationen. Ein zentrales Problem besteht heutzutage darin diese auch zugänglich zu machen. Es ist ein fundamentales Domänenwissen erforderlich, um in einer Volltextsuche die korrekten Suchanfragen zu formulieren. Das ist jedoch oftmals nicht vorhanden, so dass viel Zeit aufgewandt werden muss, um einen Überblick des behandelten Themas zu erhalten. In solchen Situationen findet sich ein Nutzer in einem explorativen Suchvorgang, in dem er sich schrittweise an ein Thema heranarbeiten muss. Für die Organisation von Daten werden mittlerweile ganz selbstverständlich Verfahren des Machine Learnings verwendet. In den meisten Fällen bleiben sie allerdings für den Anwender unsichtbar. Die interaktive Verwendung in explorativen Suchprozessen könnte die menschliche Urteilskraft enger mit der maschinellen Verarbeitung großer Datenmengen verbinden. Topic Models sind ebensolche Verfahren. Sie finden in einem Textkorpus verborgene Themen, die sich relativ gut von Menschen interpretieren lassen und sind daher vielversprechend für die Anwendung in explorativen Suchprozessen. Nutzer können damit beim Verstehen unbekannter Quellen unterstützt werden. Bei der Betrachtung entsprechender Forschungsarbeiten fiel auf, dass Topic Models vorwiegend zur Erzeugung statischer Visualisierungen verwendet werden. Das Sensemaking ist ein wesentlicher Bestandteil der explorativen Suche und wird dennoch nur in sehr geringem Umfang genutzt, um algorithmische Neuerungen zu begründen und in einen umfassenden Kontext zu setzen. Daraus leitet sich die Vermutung ab, dass die Verwendung von Modellen des Sensemakings und die nutzerzentrierte Konzeption von explorativen Suchen, neue Funktionen für die Interaktion mit Topic Models hervorbringen und einen Kontext für entsprechende Forschungsarbeiten bieten können.
- Footnote
- Masterthesis zur Erlangung des akademischen Grades Master of Science (M.Sc.) vorgelegt an der Fachhochschule Köln / Fakultät für Informatik und Ingenieurswissenschaften im Studiengang Medieninformatik.
- Imprint
- Gummersbach : Fakultät für Informatik und Ingenieurswissenschaften
-
Symonds, M.; Bruza, P.; Zuccon, G.; Koopman, B.; Sitbon, L.; Turner, I.: Automatic query expansion : a structural linguistic perspective (2014)
0.00
3.6770437E-4 = product of:
0.005515565 = sum of:
0.005515565 = product of:
0.01103113 = sum of:
0.01103113 = weight(_text_:information in 1338) [ClassicSimilarity], result of:
0.01103113 = score(doc=1338,freq=10.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.21684799 = fieldWeight in 1338, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=1338)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- 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.
- Source
- Journal of the Association for Information Science and Technology. 65(2014) no.8, S.1577-1596
-
Niemi, T.; Jämsen , J.: ¬A query language for discovering semantic associations, part I : approach and formal definition of query primitives (2007)
0.00
3.2888478E-4 = product of:
0.0049332716 = sum of:
0.0049332716 = product of:
0.009866543 = sum of:
0.009866543 = weight(_text_:information in 591) [ClassicSimilarity], result of:
0.009866543 = score(doc=591,freq=8.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.19395474 = fieldWeight in 591, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=591)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- In contemporary query languages, the user is responsible for navigation among semantically related data. Because of the huge amount of data and the complex structural relationships among data in modern applications, it is unrealistic to suppose that the user could know completely the content and structure of the available information. There are several query languages whose purpose is to facilitate navigation in unknown structures of databases. However, the background assumption of these languages is that the user knows how data are related to each other semantically in the structure at hand. So far only little attention has been paid to how unknown semantic associations among available data can be discovered. We address this problem in this article. A semantic association between two entities can be constructed if a sequence of relationships expressed explicitly in a database can be found that connects these entities to each other. This sequence may contain several other entities through which the original entities are connected to each other indirectly. We introduce an expressive and declarative query language for discovering semantic associations. Our query language is able, for example, to discover semantic associations between entities for which only some of the characteristics are known. Further, it integrates the manipulation of semantic associations with the manipulation of documents that may contain information on entities in semantic associations.
- Content
- Part II: Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1686-1700.
- Source
- Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1559-1568
-
Niemi, T.; Jämsen, J.: ¬A query language for discovering semantic associations, part II : sample queries and query evaluation (2007)
0.00
2.848226E-4 = product of:
0.004272339 = sum of:
0.004272339 = product of:
0.008544678 = sum of:
0.008544678 = weight(_text_:information in 580) [ClassicSimilarity], result of:
0.008544678 = score(doc=580,freq=6.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.16796975 = fieldWeight in 580, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=580)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- In our query language introduced in Part I (Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1559-1568) the user can formulate queries to find out (possibly complex) semantic relationships among entities. In this article we demonstrate the usage of our query language and discuss the new applications that it supports. We categorize several query types and give sample queries. The query types are categorized based on whether the entities specified in a query are known or unknown to the user in advance, and whether text information in documents is utilized. Natural language is used to represent the results of queries in order to facilitate correct interpretation by the user. We discuss briefly the issues related to the prototype implementation of the query language and show that an independent operation like Rho (Sheth et al., 2005; Anyanwu & Sheth, 2002, 2003), which presupposes entities of interest to be known in advance, is exceedingly inefficient in emulating the behavior of our query language. The discussion also covers potential problems, and challenges for future work.
- Source
- Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1686-1700
-
Järvelin, A.; Keskustalo, H.; Sormunen, E.; Saastamoinen, M.; Kettunen, K.: Information retrieval from historical newspaper collections in highly inflectional languages : a query expansion approach (2016)
0.00
2.3255666E-4 = product of:
0.0034883497 = sum of:
0.0034883497 = product of:
0.0069766995 = sum of:
0.0069766995 = weight(_text_:information in 3223) [ClassicSimilarity], result of:
0.0069766995 = score(doc=3223,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.13714671 = fieldWeight in 3223, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=3223)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Journal of the Association for Information Science and Technology. 67(2016) no.12, S.2928-2946
-
Colace, F.; Santo, M. De; Greco, L.; Napoletano, P.: Weighted word pairs for query expansion (2015)
0.00
2.3021935E-4 = product of:
0.00345329 = sum of:
0.00345329 = product of:
0.00690658 = sum of:
0.00690658 = weight(_text_:information in 2687) [ClassicSimilarity], result of:
0.00690658 = score(doc=2687,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.13576832 = fieldWeight in 2687, 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=2687)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Information processing and management. 51(2015) no.1, S.179-193
