-
Xiong, C.: Knowledge based text representations for information retrieval (2016)
0.13
0.1285784 = product of:
0.2571568 = sum of:
0.049051 = product of:
0.147153 = sum of:
0.147153 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
0.147153 = score(doc=5820,freq=2.0), product of:
0.3927445 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046325076 = queryNorm
0.3746787 = fieldWeight in 5820, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=5820)
0.33333334 = coord(1/3)
0.20810577 = weight(_text_:2f in 5820) [ClassicSimilarity], result of:
0.20810577 = score(doc=5820,freq=4.0), product of:
0.3927445 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046325076 = queryNorm
0.5298757 = fieldWeight in 5820, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=5820)
0.5 = coord(2/4)
- Content
- Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. Vgl.: https%3A%2F%2Fwww.cs.cmu.edu%2F~cx%2Fpapers%2Fknowledge_based_text_representation.pdf&usg=AOvVaw0SaTSvhWLTh__Uz_HtOtl3.
-
Farazi, M.: Faceted lightweight ontologies : a formalization and some experiments (2010)
0.12
0.12262751 = product of:
0.24525502 = sum of:
0.061313756 = product of:
0.18394126 = sum of:
0.18394126 = weight(_text_:3a in 4997) [ClassicSimilarity], result of:
0.18394126 = score(doc=4997,freq=2.0), product of:
0.3927445 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046325076 = queryNorm
0.46834838 = fieldWeight in 4997, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=4997)
0.33333334 = coord(1/3)
0.18394126 = weight(_text_:2f in 4997) [ClassicSimilarity], result of:
0.18394126 = score(doc=4997,freq=2.0), product of:
0.3927445 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046325076 = queryNorm
0.46834838 = fieldWeight in 4997, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=4997)
0.5 = coord(2/4)
- Content
- PhD Dissertation at International Doctorate School in Information and Communication Technology. Vgl.: https%3A%2F%2Fcore.ac.uk%2Fdownload%2Fpdf%2F150083013.pdf&usg=AOvVaw2n-qisNagpyT0lli_6QbAQ.
-
Huo, W.: Automatic multi-word term extraction and its application to Web-page summarization (2012)
0.12
0.11977936 = product of:
0.23955873 = sum of:
0.2207295 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.2207295 = score(doc=563,freq=2.0), product of:
0.3927445 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046325076 = queryNorm
0.56201804 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.018829225 = product of:
0.03765845 = sum of:
0.03765845 = weight(_text_:22 in 563) [ClassicSimilarity], result of:
0.03765845 = score(doc=563,freq=2.0), product of:
0.16222252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046325076 = queryNorm
0.23214069 = fieldWeight in 563, 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=563)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Content
- A Thesis presented to The University of Guelph In partial fulfilment of requirements for the degree of Master of Science in Computer Science. Vgl. Unter: http://www.inf.ufrgs.br%2F~ceramisch%2Fdownload_files%2Fpublications%2F2009%2Fp01.pdf.
- Date
- 10. 1.2013 19:22:47
-
Stojanovic, N.: Ontology-based Information Retrieval : methods and tools for cooperative query answering (2005)
0.10
0.098102 = product of:
0.196204 = sum of:
0.049051 = product of:
0.147153 = sum of:
0.147153 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
0.147153 = score(doc=701,freq=2.0), product of:
0.3927445 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046325076 = queryNorm
0.3746787 = fieldWeight in 701, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=701)
0.33333334 = coord(1/3)
0.147153 = weight(_text_:2f in 701) [ClassicSimilarity], result of:
0.147153 = score(doc=701,freq=2.0), product of:
0.3927445 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046325076 = queryNorm
0.3746787 = fieldWeight in 701, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=701)
0.5 = coord(2/4)
- Content
- Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.
-
Kirk, J.: Theorising information use : managers and their work (2002)
0.01
0.0142422225 = product of:
0.05696889 = sum of:
0.05696889 = weight(_text_:social in 560) [ClassicSimilarity], result of:
0.05696889 = score(doc=560,freq=2.0), product of:
0.1847249 = queryWeight, product of:
3.9875789 = idf(docFreq=2228, maxDocs=44218)
0.046325076 = queryNorm
0.30839854 = fieldWeight in 560, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9875789 = idf(docFreq=2228, maxDocs=44218)
0.0546875 = fieldNorm(doc=560)
0.25 = coord(1/4)
- Imprint
- Sydney : University of Technology / Faculty of Humanities and Social Sciences
-
Thornton, K: Powerful structure : inspecting infrastructures of information organization in Wikimedia Foundation projects (2016)
0.01
0.01220762 = product of:
0.04883048 = sum of:
0.04883048 = weight(_text_:social in 3288) [ClassicSimilarity], result of:
0.04883048 = score(doc=3288,freq=2.0), product of:
0.1847249 = queryWeight, product of:
3.9875789 = idf(docFreq=2228, maxDocs=44218)
0.046325076 = queryNorm
0.26434162 = fieldWeight in 3288, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9875789 = idf(docFreq=2228, maxDocs=44218)
0.046875 = fieldNorm(doc=3288)
0.25 = coord(1/4)
- Abstract
- This dissertation investigates the social and technological factors of collaboratively organizing information in commons-based peer production systems. To do so, it analyzes the diverse strategies that members of Wikimedia Foundation (WMF) project communities use to organize information. Key findings from this dissertation show that conceptual structures of information organization are encoded into the infrastructure of WMF projects. The fact that WMF projects are commons-based peer production systems means that we can inspect the code that enables these systems, but a specific type of technical literacy is required to do so. I use three methods in this dissertation. I conduct a qualitative content analysis of the discussions surrounding the design, implementation and evaluation of the category system; a quantitative analysis using descriptive statistics of patterns of editing among editors who contributed to the code of templates for information boxes; and a close reading of the infrastructure used to create the category system, the infobox templates, and the knowledge base of structured data.
-
Gordon, T.J.; Helmer-Hirschberg, O.: Report on a long-range forecasting study (1964)
0.01
0.008876181 = product of:
0.035504725 = sum of:
0.035504725 = product of:
0.07100945 = sum of:
0.07100945 = weight(_text_:22 in 4204) [ClassicSimilarity], result of:
0.07100945 = score(doc=4204,freq=4.0), product of:
0.16222252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046325076 = queryNorm
0.4377287 = fieldWeight in 4204, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=4204)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 22. 6.2018 13:24:08
22. 6.2018 13:54:52
-
Francu, V.: Multilingual access to information using an intermediate language (2003)
0.01
0.0073936307 = product of:
0.029574523 = sum of:
0.029574523 = product of:
0.059149045 = sum of:
0.059149045 = weight(_text_:aspects in 1742) [ClassicSimilarity], result of:
0.059149045 = score(doc=1742,freq=4.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.28249177 = fieldWeight in 1742, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.03125 = fieldNorm(doc=1742)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- While being theoretically so widely available, information can be restricted from a more general use by linguistic barriers. The linguistic aspects of the information languages and particularly the chances of an enhanced access to information by means of multilingual access facilities will make the substance of this thesis. The main problem of this research is thus to demonstrate that information retrieval can be improved by using multilingual thesaurus terms based on an intermediate or switching language to search with. Universal classification systems in general can play the role of switching languages for reasons dealt with in the forthcoming pages. The Universal Decimal Classification (UDC) in particular is the classification system used as example of a switching language for our objectives. The question may arise: why a universal classification system and not another thesaurus? Because the UDC like most of the classification systems uses symbols. Therefore, it is language independent and the problems of compatibility between such a thesaurus and different other thesauri in different languages are avoided. Another question may still arise? Why not then, assign running numbers to the descriptors in a thesaurus and make a switching language out of the resulting enumerative system? Because of some other characteristics of the UDC: hierarchical structure and terminological richness, consistency and control. One big problem to find an answer to is: can a thesaurus be made having as a basis a classification system in any and all its parts? To what extent this question can be given an affirmative answer? This depends much on the attributes of the universal classification system which can be favourably used to this purpose. Examples of different situations will be given and discussed upon beginning with those classes of UDC which are best fitted for building a thesaurus structure out of them (classes which are both hierarchical and faceted)...
- Content
- Inhalt: INFORMATION LANGUAGES: A LINGUISTIC APPROACH MULTILINGUAL ASPECTS IN INFORMATION STORAGE AND RETRIEVAL COMPATIBILITY AND CONVERTIBILITY OF INFORMATION LANGUAGES CURRENT TRENDS IN MULTILINGUAL ACCESS BUILDING UDC-BASED MULTILINGUAL THESAURI ONLINE APPLICATIONS OF THE UDC-BASED MULTILINGUAL THESAURI THE IMPACT OF SPECIFICITY ON THE RETRIEVAL POWER OF A UDC-BASED MULTILINGUAL THESAURUS FINAL REMARKS AND GENERAL CONCLUSIONS Proefschrift voorgelegd tot het behalen van de graad van doctor in de Taal- en Letterkunde aan de Universiteit Antwerpen. - Vgl.: http://dlist.sir.arizona.edu/1862/.
-
Eckert, K.: Thesaurus analysis and visualization in semantic search applications (2007)
0.01
0.0065351077 = product of:
0.026140431 = sum of:
0.026140431 = product of:
0.052280862 = sum of:
0.052280862 = weight(_text_:aspects in 3222) [ClassicSimilarity], result of:
0.052280862 = score(doc=3222,freq=2.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.2496898 = fieldWeight in 3222, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.0390625 = fieldNorm(doc=3222)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- The use of thesaurus-based indexing is a common approach for increasing the performance of information retrieval. In this thesis, we examine the suitability of a thesaurus for a given set of information and evaluate improvements of existing thesauri to get better search results. On this area, we focus on two aspects: 1. We demonstrate an analysis of the indexing results achieved by an automatic document indexer and the involved thesaurus. 2. We propose a method for thesaurus evaluation which is based on a combination of statistical measures and appropriate visualization techniques that support the detection of potential problems in a thesaurus. In this chapter, we give an overview of the context of our work. Next, we briefly outline the basics of thesaurus-based information retrieval and describe the Collexis Engine that was used for our experiments. In Chapter 3, we describe two experiments in automatically indexing documents in the areas of medicine and economics with corresponding thesauri and compare the results to available manual annotations. Chapter 4 describes methods for assessing thesauri and visualizing the result in terms of a treemap. We depict examples of interesting observations supported by the method and show that we actually find critical problems. We conclude with a discussion of open questions and future research in Chapter 5.
-
Garfield, E.: ¬An algorithm for translating chemical names to molecular formulas (1961)
0.01
0.0065351077 = product of:
0.026140431 = sum of:
0.026140431 = product of:
0.052280862 = sum of:
0.052280862 = weight(_text_:aspects in 3465) [ClassicSimilarity], result of:
0.052280862 = score(doc=3465,freq=2.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.2496898 = fieldWeight in 3465, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.0390625 = fieldNorm(doc=3465)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- This dissertation discusses, explains, and demonstrates a new algorithm for translating chemica l nomenclature into molecular formulas. In order to place the study in its proper context and perspective the historical development of nomenclature is first discussed, aa well as other related aspects of the chemical information problem. The relationship of nomenclature to modern linguistic studies is then introduced. Tire relevance of structural linguistic procedures to the study of chemical nomenclature is shown. The methods of the linguist are illustrated by examples from chemical discourse. The algorithm is then explained, first for the human translator and then for use by a computer. Flow diagrams for the computer syntactic analysis, dictionary Iook-up routine, and furmula calculation routine are included. The sampling procedure for testing the algorithm is explained and finalIy, conclusions are drawn with respect to the general validity of the method and the dirsction that might be taken for future research. A summary of modern chemical nomenclature practice is appened primarily for use by the reader who is not familiar with chemical nomenclature.
-
Schwarz, K.: Domain model enhanced search : a comparison of taxonomy, thesaurus and ontology (2005)
0.01
0.005228086 = product of:
0.020912344 = sum of:
0.020912344 = product of:
0.041824687 = sum of:
0.041824687 = weight(_text_:aspects in 4569) [ClassicSimilarity], result of:
0.041824687 = score(doc=4569,freq=2.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.19975184 = fieldWeight in 4569, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.03125 = fieldNorm(doc=4569)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- The results of this thesis are intended to support the information architect in designing a solution for improved search in a corporate environment. Specifically we have examined the type of search problems that require a domain model to enhance the search process. There are several approaches to modeling a domain. We have considered 3 different types of domain modeling schemes; taxonomy, thesaurus and ontology. The intention is to support the information architect in making an informed choice between one or more of these schemes. In our opinion the main criteria for this choice are the modeling characteristics of a scheme and the suitability for application in the search process. The second chapter is a discussion of modeling characteristics of each scheme, followed by a comparison between them. This should give an information architect an idea of which aspects of a domain can be modeled with each scheme. What is missing here is an indication of the effort required to model a domain with each scheme. There are too many factors that influence the amount of required effort, ranging from measurable factors like domain size and resource characteristics to cultural matters such as the willingness to share knowledge and the existence of a project champion in the team to keep the project running. The third chapter shows what role domain models can play in each part of the search process. This gives an idea of the problems that domain models can solve. We have split the search process into individual parts to show that domain models can be applied very differently in the process. The fourth chapter makes recommendations about the suitability of each individualdomain modeling scheme for improving search. Each scheme has particular characteristics that make it especially suitable for a domain or a search problem. In the appendix each case study is described in detail. These descriptions are intended to serve as a benchmark. The current problem of the enterprise can be compared to those described to see which case study is most similar, which solution was chosen, which problems arose and how they were dealt with. An important issue that we have not touched upon in this thesis is that of maintenance. The real problems of a domain model are revealed when it is applied in a search system and its deficits and wrong assumptions become clear. Adaptation and maintenance are always required. Unfortunately we have not been able to glean sufficient information about maintenance issues from our case studies to draw any meaningful conclusions.
-
Tzitzikas, Y.: Collaborative ontology-based information indexing and retrieval (2002)
0.01
0.005228086 = product of:
0.020912344 = sum of:
0.020912344 = product of:
0.041824687 = sum of:
0.041824687 = weight(_text_:aspects in 2281) [ClassicSimilarity], result of:
0.041824687 = score(doc=2281,freq=2.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.19975184 = fieldWeight in 2281, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.03125 = fieldNorm(doc=2281)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- An information system like the Web is a continuously evolving system consisting of multiple heterogeneous information sources, covering a wide domain of discourse, and a huge number of users (human or software) with diverse characteristics and needs, that produce and consume information. The challenge nowadays is to build a scalable information infrastructure enabling the effective, accurate, content based retrieval of information, in a way that adapts to the characteristics and interests of the users. The aim of this work is to propose formally sound methods for building such an information network based on ontologies which are widely used and are easy to grasp by ordinary Web users. The main results of this work are: - A novel scheme for indexing and retrieving objects according to multiple aspects or facets. The proposed scheme is a faceted scheme enriched with a method for specifying the combinations of terms that are valid. We give a model-theoretic interpretation to this model and we provide mechanisms for inferring the valid combinations of terms. This inference service can be exploited for preventing errors during the indexing process, which is very important especially in the case where the indexing is done collaboratively by many users, and for deriving "complete" navigation trees suitable for browsing through the Web. The proposed scheme has several advantages over the hierarchical classification schemes currently employed by Web catalogs, namely, conceptual clarity (it is easier to understand), compactness (it takes less space), and scalability (the update operations can be formulated more easily and be performed more effciently). - A exible and effecient model for building mediators over ontology based information sources. The proposed mediators support several modes of query translation and evaluation which can accommodate various application needs and levels of answer quality. The proposed model can be used for providing users with customized views of Web catalogs. It can also complement the techniques for building mediators over relational sources so as to support approximate translation of partially ordered domain values.
-
Markó, K.G.: Foundation, implementation and evaluation of the MorphoSaurus system (2008)
0.00
0.0045745755 = product of:
0.018298302 = sum of:
0.018298302 = product of:
0.036596604 = sum of:
0.036596604 = weight(_text_:aspects in 4415) [ClassicSimilarity], result of:
0.036596604 = score(doc=4415,freq=2.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.17478286 = fieldWeight in 4415, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.02734375 = fieldNorm(doc=4415)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- The proper handling of acronyms plays a crucial role in medical texts, e.g. in patient records, as well as in scientific literature. Chapter six presents an approach, in which acronyms are automatically acquired from (bio-) medical literature. Furthermore, acronyms and their definitions in different languages are linked to each other using the MorphoSaurus text processing system. Automatic word sense disambiguation is still one of the most challenging tasks in Natural Language Processing. In Chapter seven, cross-lingual considerations lead to a new methodology for automatic disambiguation applied to subwords. Beginning with Chapter eight, a series of applications based onMorphoSaurus are introduced. Firstly, the implementation of the subword approach within a crosslanguage information retrieval setting for the medical domain is described and evaluated on standard test document collections. In Chapter nine, this methodology is extended to multilingual information retrieval in the Web, for which user queries are translated into target languages based on the segmentation into subwords and their interlingual mappings. The cross-lingual, automatic assignment of document descriptors to documents is the topic of Chapter ten. A large-scale evaluation of a heuristic, as well as a statistical algorithm is carried out using a prominent medical thesaurus as a controlled vocabulary. In Chapter eleven, it will be shown how MorphoSaurus can be used to map monolingual, lexical resources across different languages. As a result, a large multilingual medical lexicon with high coverage and complete lexical information is built and evaluated against a comparable, already available and commonly used lexical repository for the medical domain. Chapter twelve sketches a few applications based on MorphoSaurus. The generality and applicability of the subword approach to other domains is outlined, and proof-of-concepts in real-world scenarios are presented. Finally, Chapter thirteen recapitulates the most important aspects of MorphoSaurus and the potential benefit of its employment in medical information systems is carefully assessed, both for medical experts in their everyday life, but also with regard to health care consumers and their existential information needs.
-
Geisriegler, E.: Enriching electronic texts with semantic metadata : a use case for the historical Newspaper Collection ANNO (Austrian Newspapers Online) of the Austrian National Libraryhek (2012)
0.00
0.0039227554 = product of:
0.015691021 = sum of:
0.015691021 = product of:
0.031382043 = sum of:
0.031382043 = weight(_text_:22 in 595) [ClassicSimilarity], result of:
0.031382043 = score(doc=595,freq=2.0), product of:
0.16222252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046325076 = queryNorm
0.19345059 = fieldWeight in 595, 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=595)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 3. 2.2013 18:00:22
-
Makewita, S.M.: Investigating the generic information-seeking function of organisational decision-makers : perspectives on improving organisational information systems (2002)
0.00
0.0039227554 = product of:
0.015691021 = sum of:
0.015691021 = product of:
0.031382043 = sum of:
0.031382043 = weight(_text_:22 in 642) [ClassicSimilarity], result of:
0.031382043 = score(doc=642,freq=2.0), product of:
0.16222252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046325076 = queryNorm
0.19345059 = fieldWeight in 642, 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=642)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 22. 7.2022 12:16:58
-
Vocht, L. De: Exploring semantic relationships in the Web of Data : Semantische relaties verkennen in data op het web (2017)
0.00
0.0032675539 = product of:
0.0130702155 = sum of:
0.0130702155 = product of:
0.026140431 = sum of:
0.026140431 = weight(_text_:aspects in 4232) [ClassicSimilarity], result of:
0.026140431 = score(doc=4232,freq=2.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.1248449 = fieldWeight in 4232, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.01953125 = fieldNorm(doc=4232)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- When we speak about finding relationships between resources, it is necessary to dive deeper in the structure. The graph structure of linked data where the semantics give meaning to the relationships between resources enable the execution of pathfinding algorithms. The assigned weights and heuristics are base components of such algorithms and ultimately define (the order) which resources are included in a path. These paths explain indirect connections between resources. Our third technique proposes an algorithm that optimizes the choice of resources in terms of serendipity. Some optimizations guard the consistence of candidate-paths where the coherence of consecutive connections is maximized to avoid trivial and too arbitrary paths. The implementation uses the A* algorithm, the de-facto reference when it comes to heuristically optimized minimal cost paths. The effectiveness of paths was measured based on common automatic metrics and surveys where the users could indicate their preference for paths, generated each time in a different way. Finally, all our techniques are applied to a use case about publications in digital libraries where they are aligned with information about scientific conferences and researchers. The application to this use case is a practical example because the different aspects of exploratory search come together. In fact, the techniques also evolved from the experiences when implementing the use case. Practical details about the semantic model are explained and the implementation of the search system is clarified module by module. The evaluation positions the result, a prototype of a tool to explore scientific publications, researchers and conferences next to some important alternatives.
-
Kiren, T.: ¬A clustering based indexing technique of modularized ontologies for information retrieval (2017)
0.00
0.003138204 = product of:
0.012552816 = sum of:
0.012552816 = product of:
0.025105633 = sum of:
0.025105633 = weight(_text_:22 in 4399) [ClassicSimilarity], result of:
0.025105633 = score(doc=4399,freq=2.0), product of:
0.16222252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046325076 = queryNorm
0.15476047 = fieldWeight in 4399, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=4399)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 20. 1.2015 18:30:22
