-
Boyack, K.W.; Wylie,B.N.; Davidson, G.S.: Information Visualization, Human-Computer Interaction, and Cognitive Psychology : Domain Visualizations (2002)
0.03
0.030441348 = product of:
0.12176539 = sum of:
0.083452724 = weight(_text_:computer in 1352) [ClassicSimilarity], result of:
0.083452724 = score(doc=1352,freq=4.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.5710171 = fieldWeight in 1352, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.078125 = fieldNorm(doc=1352)
0.038312666 = product of:
0.07662533 = sum of:
0.07662533 = weight(_text_:22 in 1352) [ClassicSimilarity], result of:
0.07662533 = score(doc=1352,freq=4.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.54716086 = fieldWeight in 1352, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=1352)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Date
- 22. 2.2003 17:25:39
22. 2.2003 18:17:40
- Series
- Lecture notes in computer science; 2539
-
Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983)
0.03
0.030135395 = product of:
0.12054158 = sum of:
0.082613975 = weight(_text_:computer in 2134) [ClassicSimilarity], result of:
0.082613975 = score(doc=2134,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.56527805 = fieldWeight in 2134, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.109375 = fieldNorm(doc=2134)
0.037927605 = product of:
0.07585521 = sum of:
0.07585521 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
0.07585521 = score(doc=2134,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.5416616 = fieldWeight in 2134, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=2134)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Date
- 30. 3.2001 13:32:22
- Source
- Computer journal. 26(1983), S.239-246
-
Faaborg, A.; Lagoze, C.: Semantic browsing (2003)
0.03
0.030111834 = product of:
0.12044734 = sum of:
0.041306987 = weight(_text_:computer in 1026) [ClassicSimilarity], result of:
0.041306987 = score(doc=1026,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.28263903 = fieldWeight in 1026, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0546875 = fieldNorm(doc=1026)
0.07914035 = sum of:
0.041212745 = weight(_text_:resources in 1026) [ClassicSimilarity], result of:
0.041212745 = score(doc=1026,freq=2.0), product of:
0.14598069 = queryWeight, product of:
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.039991006 = queryNorm
0.28231642 = fieldWeight in 1026, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.0546875 = fieldNorm(doc=1026)
0.037927605 = weight(_text_:22 in 1026) [ClassicSimilarity], result of:
0.037927605 = score(doc=1026,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = 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.25 = coord(2/8)
- 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.
- Series
- Lecture notes in computer science; vol.2769
- Source
- Research and advanced technology for digital libraries : 7th European Conference, proceedings / ECDL 2003, Trondheim, Norway, August 17-22, 2003
-
Chen, H.; Zhang, Y.; Houston, A.L.: Semantic indexing and searching using a Hopfield net (1998)
0.03
0.027440326 = product of:
0.109761305 = sum of:
0.035405993 = weight(_text_:computer in 5704) [ClassicSimilarity], result of:
0.035405993 = score(doc=5704,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.24226204 = fieldWeight in 5704, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=5704)
0.07435531 = weight(_text_:network in 5704) [ClassicSimilarity], result of:
0.07435531 = score(doc=5704,freq=4.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.41750383 = fieldWeight in 5704, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=5704)
0.25 = coord(2/8)
- Abstract
- Presents a neural network approach to document semantic indexing. Reports results of a study to apply a Hopfield net algorithm to simulate human associative memory for concept exploration in the domain of computer science and engineering. The INSPEC database, consisting of 320.000 abstracts from leading periodical articles was used as the document test bed. Benchmark tests conformed that 3 parameters: maximum number of activated nodes; maximum allowable error; and maximum number of iterations; were useful in positively influencing network convergence behaviour without negatively impacting central processing unit performance. Another series of benchmark tests was performed to determine the effectiveness of various filtering techniques in reducing the negative impact of noisy input terms. Preliminary user tests conformed expectations that the Hopfield net is potentially useful as an associative memory technique to improve document recall and precision by solving discrepancies between indexer vocabularies and end user vocabularies
-
Drexel, G.: Knowledge engineering for intelligent information retrieval (2001)
0.02
0.021995785 = product of:
0.08798314 = sum of:
0.035405993 = weight(_text_:computer in 4043) [ClassicSimilarity], result of:
0.035405993 = score(doc=4043,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.24226204 = fieldWeight in 4043, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=4043)
0.052577145 = weight(_text_:network in 4043) [ClassicSimilarity], result of:
0.052577145 = score(doc=4043,freq=2.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.29521978 = fieldWeight in 4043, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=4043)
0.25 = coord(2/8)
- Abstract
- This paper presents a clustered approach to designing an overall ontological model together with a general rule-based component that serves as a mapping device. By observational criteria, a multi-lingual team of experts excerpts concepts from general communication in the media. The team, then, finds equivalent expressions in English, German, French, and Spanish. On the basis of a set of ontological and lexical relations, a conceptual network is built up. Concepts are thought to be universal. Objects unique in time and space are identified by names and will be explained by the universals as their instances. Our approach relies on multi-relational descriptions of concepts. It provides a powerful tool for documentation and conceptual language learning. First and foremost, our multi-lingual, polyhierarchical ontology fills the gap of semantically-based information retrieval by generating enhanced and improved queries for internet search
- Series
- Lecture notes in computer science; vol.2004
-
Jun, W.: ¬A knowledge network constructed by integrating classification, thesaurus and metadata in a digital library (2003)
0.02
0.021688832 = product of:
0.08675533 = sum of:
0.07010286 = weight(_text_:network in 1254) [ClassicSimilarity], result of:
0.07010286 = score(doc=1254,freq=8.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.3936264 = fieldWeight in 1254, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.03125 = fieldNorm(doc=1254)
0.016652463 = product of:
0.033304926 = sum of:
0.033304926 = weight(_text_:resources in 1254) [ClassicSimilarity], result of:
0.033304926 = score(doc=1254,freq=4.0), product of:
0.14598069 = queryWeight, product of:
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.039991006 = queryNorm
0.22814612 = fieldWeight in 1254, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.03125 = fieldNorm(doc=1254)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Abstract
- Knowledge management in digital libraries is a universal problem. Keyword-based searching is applied everywhere no matter whether the resources are indexed databases or full-text Web pages. In keyword matching, the valuable content description and indexing of the metadata, such as the subject descriptors and the classification notations, are merely treated as common keywords to be matched with the user query. Without the support of vocabulary control tools, such as classification systems and thesauri, the intelligent labor of content analysis, description and indexing in metadata production are seriously wasted. New retrieval paradigms are needed to exploit the potential of the metadata resources. Could classification and thesauri, which contain the condensed intelligence of generations of librarians, be used in a digital library to organize the networked information, especially metadata, to facilitate their usability and change the digital library into a knowledge management environment? To examine that question, we designed and implemented a new paradigm that incorporates a classification system, a thesaurus and metadata. The classification and the thesaurus are merged into a concept network, and the metadata are distributed into the nodes of the concept network according to their subjects. The abstract concept node instantiated with the related metadata records becomes a knowledge node. A coherent and consistent knowledge network is thus formed. It is not only a framework for resource organization but also a structure for knowledge navigation, retrieval and learning. We have built an experimental system based on the Chinese Classification and Thesaurus, which is the most comprehensive and authoritative in China, and we have incorporated more than 5000 bibliographic records in the computing domain from the Peking University Library. The result is encouraging. In this article, we review the tools, the architecture and the implementation of our experimental system, which is called Vision.
-
Rekabsaz, N. et al.: Toward optimized multimodal concept indexing (2016)
0.02
0.021525284 = product of:
0.08610114 = sum of:
0.059009988 = weight(_text_:computer in 2751) [ClassicSimilarity], result of:
0.059009988 = score(doc=2751,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.40377006 = fieldWeight in 2751, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.078125 = fieldNorm(doc=2751)
0.027091147 = product of:
0.054182295 = sum of:
0.054182295 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
0.054182295 = score(doc=2751,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.38690117 = fieldWeight in 2751, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=2751)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Date
- 1. 2.2016 18:25:22
- Series
- Lecture notes in computer science ; 9398
-
Kozikowski, P. et al.: Support of part-whole relations in query answering (2016)
0.02
0.021525284 = product of:
0.08610114 = sum of:
0.059009988 = weight(_text_:computer in 2754) [ClassicSimilarity], result of:
0.059009988 = score(doc=2754,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.40377006 = fieldWeight in 2754, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.078125 = fieldNorm(doc=2754)
0.027091147 = product of:
0.054182295 = sum of:
0.054182295 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
0.054182295 = score(doc=2754,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.38690117 = fieldWeight in 2754, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=2754)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Date
- 1. 2.2016 18:25:22
- Series
- Lecture notes in computer science ; 9398
-
Marx, E. et al.: Exploring term networks for semantic search over RDF knowledge graphs (2016)
0.02
0.021525284 = product of:
0.08610114 = sum of:
0.059009988 = weight(_text_:computer in 3279) [ClassicSimilarity], result of:
0.059009988 = score(doc=3279,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.40377006 = fieldWeight in 3279, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.078125 = fieldNorm(doc=3279)
0.027091147 = product of:
0.054182295 = sum of:
0.054182295 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
0.054182295 = score(doc=3279,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.38690117 = fieldWeight in 3279, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=3279)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Series
- Communications in computer and information science; 672
- Source
- Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
-
Kopácsi, S. et al.: Development of a classification server to support metadata harmonization in a long term preservation system (2016)
0.02
0.021525284 = product of:
0.08610114 = sum of:
0.059009988 = weight(_text_:computer in 3280) [ClassicSimilarity], result of:
0.059009988 = score(doc=3280,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.40377006 = fieldWeight in 3280, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.078125 = fieldNorm(doc=3280)
0.027091147 = product of:
0.054182295 = sum of:
0.054182295 = weight(_text_:22 in 3280) [ClassicSimilarity], result of:
0.054182295 = score(doc=3280,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.38690117 = fieldWeight in 3280, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=3280)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Series
- Communications in computer and information science; 672
- Source
- Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
-
Bettencourt, N.; Silva, N.; Barroso, J.: Semantically enhancing recommender systems (2016)
0.02
0.021340847 = product of:
0.08536339 = sum of:
0.035405993 = weight(_text_:computer in 3374) [ClassicSimilarity], result of:
0.035405993 = score(doc=3374,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.24226204 = fieldWeight in 3374, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=3374)
0.04995739 = product of:
0.09991478 = sum of:
0.09991478 = weight(_text_:resources in 3374) [ClassicSimilarity], result of:
0.09991478 = score(doc=3374,freq=16.0), product of:
0.14598069 = queryWeight, product of:
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.039991006 = queryNorm
0.68443835 = fieldWeight in 3374, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.046875 = fieldNorm(doc=3374)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Abstract
- As the amount of content and the number of users in social relationships is continually growing in the Internet, resource sharing and access policy management is difficult, time-consuming and error-prone. Cross-domain recommendation of private or protected resources managed and secured by each domain's specific access rules is impracticable due to private security policies and poor sharing mechanisms. This work focus on exploiting resource's content, user's preferences, users' social networks and semantic information to cross-relate different resources through their meta information using recommendation techniques that combine collaborative-filtering techniques with semantics annotations, by generating associations between resources. The semantic similarities established between resources are used on a hybrid recommendation engine that interprets user and resources' semantic information. The recommendation engine allows the promotion and discovery of unknown-unknown resources to users that could not even know about the existence of those resources thus providing means to solve the cross-domain recommendation of private or protected resources.
- Series
- Communications in computer and information science; 631
-
Baofu, P.: ¬The future of information architecture : conceiving a better way to understand taxonomy, network, and intelligence (2008)
0.02
0.020694586 = product of:
0.08277834 = sum of:
0.061962765 = weight(_text_:network in 2257) [ClassicSimilarity], result of:
0.061962765 = score(doc=2257,freq=4.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.34791988 = fieldWeight in 2257, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=2257)
0.02081558 = product of:
0.04163116 = sum of:
0.04163116 = weight(_text_:resources in 2257) [ClassicSimilarity], result of:
0.04163116 = score(doc=2257,freq=4.0), product of:
0.14598069 = queryWeight, product of:
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.039991006 = queryNorm
0.28518265 = fieldWeight in 2257, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.0390625 = fieldNorm(doc=2257)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Abstract
- The Future of Information Architecture examines issues surrounding why information is processed, stored and applied in the way that it has, since time immemorial. Contrary to the conventional wisdom held by many scholars in human history, the recurrent debate on the explanation of the most basic categories of information (eg space, time causation, quality, quantity) has been misconstrued, to the effect that there exists some deeper categories and principles behind these categories of information - with enormous implications for our understanding of reality in general. To understand this, the book is organised in to four main parts: Part I begins with the vital question concerning the role of information within the context of the larger theoretical debate in the literature. Part II provides a critical examination of the nature of data taxonomy from the main perspectives of culture, society, nature and the mind. Part III constructively invesitgates the world of information network from the main perspectives of culture, society, nature and the mind. Part IV proposes six main theses in the authors synthetic theory of information architecture, namely, (a) the first thesis on the simpleness-complicatedness principle, (b) the second thesis on the exactness-vagueness principle (c) the third thesis on the slowness-quickness principle (d) the fourth thesis on the order-chaos principle, (e) the fifth thesis on the symmetry-asymmetry principle, and (f) the sixth thesis on the post-human stage.
- LCSH
- Information resources
- Subject
- Information resources
-
Fieldhouse, M.; Hancock-Beaulieu, M.: ¬The design of a graphical user interface for a highly interactive information retrieval system (1996)
0.02
0.0150676975 = product of:
0.06027079 = sum of:
0.041306987 = weight(_text_:computer in 6958) [ClassicSimilarity], result of:
0.041306987 = score(doc=6958,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.28263903 = fieldWeight in 6958, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0546875 = fieldNorm(doc=6958)
0.018963803 = product of:
0.037927605 = sum of:
0.037927605 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
0.037927605 = score(doc=6958,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = 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.5 = coord(1/2)
0.25 = coord(2/8)
- 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
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.02
0.0150676975 = product of:
0.06027079 = sum of:
0.041306987 = weight(_text_:computer in 1319) [ClassicSimilarity], result of:
0.041306987 = score(doc=1319,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.28263903 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.018963803 = product of:
0.037927605 = sum of:
0.037927605 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.037927605 = score(doc=1319,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = 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.5 = coord(1/2)
0.25 = coord(2/8)
- Date
- 1. 8.1996 22:08:06
- Source
- Computer networks and ISDN systems. 30(1998) nos.1/7, S.621-623
-
Qu, R.; Fang, Y.; Bai, W.; Jiang, Y.: Computing semantic similarity based on novel models of semantic representation using Wikipedia (2018)
0.01
0.014633282 = product of:
0.05853313 = sum of:
0.04381429 = weight(_text_:network in 5052) [ClassicSimilarity], result of:
0.04381429 = score(doc=5052,freq=2.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.2460165 = fieldWeight in 5052, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=5052)
0.014718837 = product of:
0.029437674 = sum of:
0.029437674 = weight(_text_:resources in 5052) [ClassicSimilarity], result of:
0.029437674 = score(doc=5052,freq=2.0), product of:
0.14598069 = queryWeight, product of:
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.039991006 = queryNorm
0.20165458 = fieldWeight in 5052, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.0390625 = fieldNorm(doc=5052)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Abstract
- Computing Semantic Similarity (SS) between concepts is one of the most critical issues in many domains such as Natural Language Processing and Artificial Intelligence. Over the years, several SS measurement methods have been proposed by exploiting different knowledge resources. Wikipedia provides a large domain-independent encyclopedic repository and a semantic network for computing SS between concepts. Traditional feature-based measures rely on linear combinations of different properties with two main limitations, the insufficient information and the loss of semantic information. In this paper, we propose several hybrid SS measurement approaches by using the Information Content (IC) and features of concepts, which avoid the limitations introduced above. Considering integrating discrete properties into one component, we present two models of semantic representation, called CORM and CARM. Then, we compute SS based on these models and take the IC of categories as a supplement of SS measurement. The evaluation, based on several widely used benchmarks and a benchmark developed by ourselves, sustains the intuitions with respect to human judgments. In summary, our approaches are more efficient in determining SS between concepts and have a better human correlation than previous methods such as Word2Vec and NASARI.
-
Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004)
0.01
0.01291517 = product of:
0.05166068 = sum of:
0.035405993 = weight(_text_:computer in 2419) [ClassicSimilarity], result of:
0.035405993 = score(doc=2419,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.24226204 = fieldWeight in 2419, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.016254688 = product of:
0.032509375 = sum of:
0.032509375 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
0.032509375 = score(doc=2419,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.23214069 = fieldWeight in 2419, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Date
- 16.11.2008 16:22:48
- Series
- Lecture notes in computer science; vol.3232
-
Kwok, K.L.: ¬A network approach to probabilistic information retrieval (1995)
0.01
0.011383288 = product of:
0.0910663 = sum of:
0.0910663 = weight(_text_:network in 5696) [ClassicSimilarity], result of:
0.0910663 = score(doc=5696,freq=6.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.51133573 = fieldWeight in 5696, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=5696)
0.125 = coord(1/8)
- 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
-
Buccio, E. Di; Melucci, M.; Moro, F.: Detecting verbose queries and improving information retrieval (2014)
0.01
0.011084656 = product of:
0.08867725 = sum of:
0.08867725 = weight(_text_:property in 2695) [ClassicSimilarity], result of:
0.08867725 = score(doc=2695,freq=2.0), product of:
0.25336683 = queryWeight, product of:
6.335595 = idf(docFreq=212, maxDocs=44218)
0.039991006 = queryNorm
0.3499955 = fieldWeight in 2695, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.335595 = idf(docFreq=212, maxDocs=44218)
0.0390625 = fieldNorm(doc=2695)
0.125 = coord(1/8)
- Abstract
- Although most of the queries submitted to search engines are composed of a few keywords and have a length that ranges from three to six words, more than 15% of the total volume of the queries are verbose, introduce ambiguity and cause topic drifts. We consider verbosity a different property of queries from length since a verbose query is not necessarily long, it might be succinct and a short query might be verbose. This paper proposes a methodology to automatically detect verbose queries and conditionally modify queries. The methodology proposed in this paper exploits state-of-the-art classification algorithms, combines concepts from a large linguistic database and uses a topic gisting algorithm we designed for verbose query modification purposes. Our experimental results have been obtained using the TREC Robust track collection, thirty topics classified by difficulty degree, four queries per topic classified by verbosity and length, and human assessment of query verbosity. Our results suggest that the methodology for query modification conditioned to query verbosity detection and topic gisting is significantly effective and that query modification should be refined when topic difficulty and query verbosity are considered since these two properties interact and query verbosity is not straightforwardly related to query length.
-
Calegari, S.; Sanchez, E.: Object-fuzzy concept network : an enrichment of ontologies in semantic information retrieval (2008)
0.01
0.010953573 = product of:
0.08762858 = sum of:
0.08762858 = weight(_text_:network in 2393) [ClassicSimilarity], result of:
0.08762858 = score(doc=2393,freq=8.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.492033 = fieldWeight in 2393, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=2393)
0.125 = coord(1/8)
- Abstract
- This article shows how a fuzzy ontology-based approach can improve semantic documents retrieval. After formally defining a fuzzy ontology and a fuzzy knowledge base, a special type of new fuzzy relationship called (semantic) correlation, which links the concepts or entities in a fuzzy ontology, is discussed. These correlations, first assigned by experts, are updated after querying or when a document has been inserted into a database. Moreover, in order to define a dynamic knowledge of a domain adapting itself to the context, it is shown how to handle a tradeoff between the correct definition of an object, taken in the ontology structure, and the actual meaning assigned by individuals. The notion of a fuzzy concept network is extended, incorporating database objects so that entities and documents can similarly be represented in the network. Information retrieval (IR) algorithm, using an object-fuzzy concept network (O-FCN), is introduced and described. This algorithm allows us to derive a unique path among the entities involved in the query to obtain maxima semantic associations in the knowledge domain. Finally, the study has been validated by querying a database using fuzzy recall, fuzzy precision, and coefficient variant measures in the crisp and fuzzy cases.
-
Fowler, R.H.; Wilson, B.A.; Fowler, W.A.L.: Information navigator : an information system using associative networks for display and retrieval (1992)
0.01
0.009294414 = product of:
0.07435531 = sum of:
0.07435531 = weight(_text_:network in 919) [ClassicSimilarity], result of:
0.07435531 = score(doc=919,freq=4.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.41750383 = fieldWeight in 919, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=919)
0.125 = coord(1/8)
- 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.
