-
Priss, U.: Description logic and faceted knowledge representation (1999)
0.06
0.05744878 = product of:
0.11489756 = sum of:
0.09581695 = weight(_text_:term in 2655) [ClassicSimilarity], result of:
0.09581695 = score(doc=2655,freq=4.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.4374403 = fieldWeight in 2655, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.046875 = fieldNorm(doc=2655)
0.019080611 = product of:
0.038161222 = sum of:
0.038161222 = weight(_text_:22 in 2655) [ClassicSimilarity], result of:
0.038161222 = score(doc=2655,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = queryNorm
0.23214069 = fieldWeight in 2655, 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=2655)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The term "facet" was introduced into the field of library classification systems by Ranganathan in the 1930's [Ranganathan, 1962]. A facet is a viewpoint or aspect. In contrast to traditional classification systems, faceted systems are modular in that a domain is analyzed in terms of baseline facets which are then synthesized. In this paper, the term "facet" is used in a broader meaning. Facets can describe different aspects on the same level of abstraction or the same aspect on different levels of abstraction. The notion of facets is related to database views, multicontexts and conceptual scaling in formal concept analysis [Ganter and Wille, 1999], polymorphism in object-oriented design, aspect-oriented programming, views and contexts in description logic and semantic networks. This paper presents a definition of facets in terms of faceted knowledge representation that incorporates the traditional narrower notion of facets and potentially facilitates translation between different knowledge representation formalisms. A goal of this approach is a modular, machine-aided knowledge base design mechanism. A possible application is faceted thesaurus construction for information retrieval and data mining. Reasoning complexity depends on the size of the modules (facets). A more general analysis of complexity will be left for future research.
- Date
- 22. 1.2016 17:30:31
-
Vickery, B.C.: Ontologies (1997)
0.04
0.039117105 = product of:
0.15646842 = sum of:
0.15646842 = weight(_text_:term in 4891) [ClassicSimilarity], result of:
0.15646842 = score(doc=4891,freq=6.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.71433705 = fieldWeight in 4891, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0625 = fieldNorm(doc=4891)
0.25 = coord(1/4)
- Abstract
- Discusses the emergence of the term 'ontology' in knowledge engineering (and now in information science) with a definition of the term as currently used. Ontology is the study of what exists and what must be assumed to exist in order to achieve a cogent description or reality. The term has seen extensive application to artificial intelligence. Describes the process of building an ontology and the uses of such tools in knowledge engineering. Concludes by comparing ontologies with similar tools used in information science
-
Wright, L.W.; Nardini, H.K.G.; Aronson, A.R.; Rindflesch, T.C.: Hierarchical concept indexing of full-text documents in the Unified Medical Language System Information sources Map (1999)
0.03
0.027245669 = product of:
0.054491337 = sum of:
0.0070626684 = product of:
0.028250674 = sum of:
0.028250674 = weight(_text_:based in 2111) [ClassicSimilarity], result of:
0.028250674 = score(doc=2111,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.19973516 = fieldWeight in 2111, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=2111)
0.25 = coord(1/4)
0.047428668 = product of:
0.094857335 = sum of:
0.094857335 = weight(_text_:assessment in 2111) [ClassicSimilarity], result of:
0.094857335 = score(doc=2111,freq=2.0), product of:
0.25917634 = queryWeight, product of:
5.52102 = idf(docFreq=480, maxDocs=44218)
0.04694356 = queryNorm
0.36599535 = fieldWeight in 2111, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.52102 = idf(docFreq=480, maxDocs=44218)
0.046875 = fieldNorm(doc=2111)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Full-text documents are a vital and rapidly growing part of online biomedical information. A single large document can contain as much information as a small database, but normally lacks the tight structure and consistent indexing of a database. Retrieval systems will often miss highly relevant parts of a document if the document as a whole appears irrelevant. Access to full-text information is further complicated by the need to search separately many disparate information resources. This research explores how these problems can be addressed by the combined use of 2 techniques: 1) natural language processing for automatic concept-based indexing of full text, and 2) methods for exploiting the structure and hierarchy of full-text documents. We describe methods for applying these techniques to a large collection of full-text documents drawn from the Health Services / Technology Assessment Text (HSTAT) database at the NLM and examine how this hierarchical concept indexing can assist both document- and source-level retrieval in the context of NLM's Information Source Map project
-
Semantic knowledge and semantic representations (1995)
0.02
0.017985666 = product of:
0.071942665 = sum of:
0.071942665 = weight(_text_:frequency in 3568) [ClassicSimilarity], result of:
0.071942665 = score(doc=3568,freq=2.0), product of:
0.27643865 = queryWeight, product of:
5.888745 = idf(docFreq=332, maxDocs=44218)
0.04694356 = queryNorm
0.2602482 = fieldWeight in 3568, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.888745 = idf(docFreq=332, maxDocs=44218)
0.03125 = fieldNorm(doc=3568)
0.25 = coord(1/4)
- Content
- G. Gainotti, M.C. Silveri, A. Daniele, L. Giustolisi, Neuroanatomical Correlates of Category-specific Semantic Disorders: A Critical Survey. J. S. Snowden, H. L. Griffiths, D. Neary, Autobiographical Experience and Word Meaning. L. Cipolotti, E.K. Warrington, Towards a Unitary Account of Access Dysphasia: A Single Case Study. E. Forde, G.W. Humphreys, Refractory Semantics in Global Aphasia: On Semantic Organisation and the Access-Storage Distinction in Neuropsychology. A. E. Hillis, A. Caramazza, The Compositionality of Lexical Semantic Representations: Clues from Semantic Errors in Object Naming. H.E. Moss, L.K. Tyler, Investigating Semantic Memory Impairments: The Contribution of Semantic Priming. K.R. Laws, S.A. Humber, D.J.C. Ramsey, R.A. McCarthy, Probing Sensory and Associative Semantics for Animals and Objects in Normal Subjects. K.R. Laws, J.J. Evans, J. R. Hodges, R.A. McCarthy, Naming without Knowing and Appearance without Associations: Evidence for Constructive Processes in Semantic Memory? J. Powell, J. Davidoff, Selective Impairments of Object-knowledge in a Case of Acquired Cortical Blindness. J.R. Hodges, N. Graham, K. Patterson, Charting the Progression in Semantic Dementia: Implications for the Organisation of Semantic Memory. E. Funnell, Objects and Properties: A Study of the Breakdown of Semantic Memory. L.J. Tippett, S. McAuliffe, M. J. Farrar, Preservation of Categorical Knowledge in Alzheimer's Disease: A Computational Account. G. W. Humphreys, C. Lamote, T.J. Lloyd-Jones, An Interactive Activation Approach to Object Processing: Effects of Structural Similarity, Name Frequency, and Task in Normality and Pathology.
-
Järvelin, K.; Kristensen, J.; Niemi, T.; Sormunen, E.; Keskustalo, H.: ¬A deductive data model for query expansion (1996)
0.02
0.015656754 = product of:
0.03131351 = sum of:
0.0122329 = product of:
0.0489316 = sum of:
0.0489316 = weight(_text_:based in 2230) [ClassicSimilarity], result of:
0.0489316 = score(doc=2230,freq=6.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.34595144 = fieldWeight in 2230, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=2230)
0.25 = coord(1/4)
0.019080611 = product of:
0.038161222 = sum of:
0.038161222 = weight(_text_:22 in 2230) [ClassicSimilarity], result of:
0.038161222 = score(doc=2230,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = 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.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- We present a deductive data model for concept-based query expansion. It is based on three abstraction levels: the conceptual, linguistic and occurrence levels. Concepts and relationships among them are represented at the conceptual level. The expression level represents natural language expressions for concepts. Each expression has one or more matching models at the occurrence level. Each model specifies the matching of the expression in database indices built in varying ways. The data model supports a concept-based query expansion and formulation tool, the ExpansionTool, for environments providing heterogeneous IR systems. Expansion is controlled by adjustable matching reliability.
- 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
-
Rolland-Thomas, P.: Thesaural codes : an appraisal of their use in the Library of Congress Subject Headings (1993)
0.01
0.011292135 = product of:
0.04516854 = sum of:
0.04516854 = weight(_text_:term in 549) [ClassicSimilarity], result of:
0.04516854 = score(doc=549,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.20621133 = fieldWeight in 549, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.03125 = fieldNorm(doc=549)
0.25 = coord(1/4)
- Abstract
- LCSH is known as such since 1975. It always has created headings to serve the LC collections instead of a theoretical basis. It started to replace cross reference codes by thesaural codes in 1986, in a mechanical fashion. It was in no way transformed into a thesaurus. Its encyclopedic coverage, its pre-coordinate concepts make it substantially distinct, considering that thesauri usually map a restricted field of knowledge and use uniterms. The questions raised are whether the new symbols comply with thesaurus standards and if they are true to one or to several models. Explanations and definitions from other lists of subject headings and thesauri, literature in the field of classification and subject indexing will provide some answers. For instance, see refers from a subject heading not used to another or others used. Exceptionally it will lead from a specific term to a more general one. Some equate a see reference with the equivalence relationship. Such relationships are pointed by USE in LCSH. See also references are made from the broader subject to narrower parts of it and also between associated subjects. They suggest lateral or vertical connexions as well as reciprocal relationships. They serve a coordination purpose for some, lay down a methodical search itinerary for others. Since their inception in the 1950's thesauri have been devised for indexing and retrieving information in the fields of science and technology. Eventually they attended to a number of social sciences and humanities. Research derived from thesauri was voluminous. Numerous guidelines are designed. They did not discriminate between the "hard" sciences and the social sciences. RT relationships are widely but diversely used in numerous controlled vocabularies. LCSH's aim is to achieve a list almost free of RT and SA references. It thus restricts relationships to BT/NT, USE and UF. This raises the question as to whether all fields of knowledge can "fit" in the Procrustean bed of RT/NT, i.e., genus/species relationships. Standard codes were devised. It was soon realized that BT/NT, well suited to the genus/species couple could not signal a whole-part relationship. In LCSH, BT and NT function as reciprocals, the whole-part relationship is taken into account by ISO. It is amply elaborated upon by authors. The part-whole connexion is sometimes studied apart. The decision to replace cross reference codes was an improvement. Relations can now be distinguished through the distinct needs of numerous fields of knowledge are not attended to. Topic inclusion, and topic-subtopic, could provide the missing link where genus/species or whole/part are inadequate. Distinct codes, BT/NT and whole/part, should be provided. Sorting relationships with mechanical means can only lead to confusion.
-
Schmitz-Esser, W.: Language of general communication and concept compatibility (1996)
0.01
0.007950256 = product of:
0.031801023 = sum of:
0.031801023 = product of:
0.063602045 = sum of:
0.063602045 = weight(_text_:22 in 6089) [ClassicSimilarity], result of:
0.063602045 = score(doc=6089,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = queryNorm
0.38690117 = fieldWeight in 6089, 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=6089)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Pages
- S.11-22
-
Giunchiglia, F.; Villafiorita, A.; Walsh, T.: Theories of abstraction (1997)
0.01
0.006360204 = product of:
0.025440816 = sum of:
0.025440816 = product of:
0.05088163 = sum of:
0.05088163 = weight(_text_:22 in 4476) [ClassicSimilarity], result of:
0.05088163 = score(doc=4476,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = queryNorm
0.30952093 = fieldWeight in 4476, 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=4476)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 1.10.2018 14:13:22
-
Priss, U.: Faceted knowledge representation (1999)
0.01
0.0055651786 = product of:
0.022260714 = sum of:
0.022260714 = product of:
0.04452143 = sum of:
0.04452143 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
0.04452143 = score(doc=2654,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = queryNorm
0.2708308 = fieldWeight in 2654, 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=2654)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 22. 1.2016 17:30:31
-
Fischer, D.H.: From thesauri towards ontologies? (1998)
0.00
0.0017656671 = product of:
0.0070626684 = sum of:
0.0070626684 = product of:
0.028250674 = sum of:
0.028250674 = weight(_text_:based in 2176) [ClassicSimilarity], result of:
0.028250674 = score(doc=2176,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.19973516 = fieldWeight in 2176, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=2176)
0.25 = coord(1/4)
0.25 = coord(1/4)
- Abstract
- The ISO 2788 guidelines for monolingual thesauri contain a differentiation of "the hierarchical relationship" into "generic", "partitive", and "instance", which, for purposes of document retrieval, was deemed adequate. However, ontologies, designed as language inventories for a wider scope of knowledge representation, are based on all these and some more logical differentiations. Rereading the ISO 2788 standard and inspecting the published Cyc Upper Ontology, it is argued that the adoption of the document-retrieval definition of subsumption generally prevents the conception or use of a thesaurus as a substructure of an ontology of the new kind as constructed for AI applications. When a thesaurus is used for fact description and inference on fact descriptions, the instance-of relationship too should be reconsidered: It may also link concepts and metaconcepts, and then its distinction from subsumption is needed. The treatment of the instance-of relationship in thesauri, the Cyc Upper Ontology, and WordNet is described from this perspective
-
Nagao, M.: Knowledge and inference (1990)
0.00
0.0014713892 = product of:
0.005885557 = sum of:
0.005885557 = product of:
0.023542227 = sum of:
0.023542227 = weight(_text_:based in 3304) [ClassicSimilarity], result of:
0.023542227 = score(doc=3304,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.16644597 = fieldWeight in 3304, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=3304)
0.25 = coord(1/4)
0.25 = coord(1/4)
- Abstract
- Knowledge and Inference discusses an important problem for software systems: How do we treat knowledge and ideas on a computer and how do we use inference to solve problems on a computer? The book talks about the problems of knowledge and inference for the purpose of merging artificial intelligence and library science. The book begins by clarifying the concept of ""knowledge"" from many points of view, followed by a chapter on the current state of library science and the place of artificial intelligence in library science. Subsequent chapters cover central topics in the artificial intelligence: search and problem solving, methods of making proofs, and the use of knowledge in looking for a proof. There is also a discussion of how to use the knowledge system. The final chapter describes a popular expert system. It describes tools for building expert systems using an example based on Expert Systems-A Practical Introduction by P. Sell (Macmillian, 1985). This type of software is called an ""expert system shell."" This book was written as a textbook for undergraduate students covering only the basics but explaining as much detail as possible.
-
Noy, N.F.: Knowledge representation for intelligent information retrieval in experimental sciences (1997)
0.00
0.0011771114 = product of:
0.0047084456 = sum of:
0.0047084456 = product of:
0.018833783 = sum of:
0.018833783 = weight(_text_:based in 694) [ClassicSimilarity], result of:
0.018833783 = score(doc=694,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.13315678 = fieldWeight in 694, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.03125 = fieldNorm(doc=694)
0.25 = coord(1/4)
0.25 = coord(1/4)
- Abstract
- More and more information is available on-line every day. The greater the amount of on-line information, the greater the demand for tools that process and disseminate this information. Processing electronic information in the form of text and answering users' queries about that information intelligently is one of the great challenges in natural language processing and information retrieval. The research presented in this talk is centered on the latter of these two tasks: intelligent information retrieval. In order for information to be retrieved, it first needs to be formalized in a database or knowledge base. The ontology for this formalization and assumptions it is based on are crucial to successful intelligent information retrieval. We have concentrated our effort on developing an ontology for representing knowledge in the domains of experimental sciences, molecular biology in particular. We show that existing ontological models cannot be readily applied to represent this domain adequately. For example, the fundamental notion of ontology design that every "real" object is defined as an instance of a category seems incompatible with the universe where objects can change their category as a result of experimental procedures. Another important problem is representing complex structures such as DNA, mixtures, populations of molecules, etc., that are very common in molecular biology. We present extensions that need to be made to an ontology to cover these issues: the representation of transformations that change the structure and/or category of their participants, and the component relations and spatial structures of complex objects. We demonstrate examples of how the proposed representations can be used to improve the quality and completeness of answers to user queries; discuss techniques for evaluating ontologies and show a prototype of an Information Retrieval System that we developed.
