-
Priss, U.: Faceted knowledge representation (1999)
0.02
0.021757921 = product of:
0.043515842 = sum of:
0.043515842 = sum of:
0.007754412 = weight(_text_:a in 2654) [ClassicSimilarity], result of:
0.007754412 = score(doc=2654,freq=8.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.17835285 = fieldWeight in 2654, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=2654)
0.03576143 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
0.03576143 = score(doc=2654,freq=2.0), product of:
0.13204344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.037706986 = 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)
- Abstract
- Faceted Knowledge Representation provides a formalism for implementing knowledge systems. The basic notions of faceted knowledge representation are "unit", "relation", "facet" and "interpretation". Units are atomic elements and can be abstract elements or refer to external objects in an application. Relations are sequences or matrices of 0 and 1's (binary matrices). Facets are relational structures that combine units and relations. Each facet represents an aspect or viewpoint of a knowledge system. Interpretations are mappings that can be used to translate between different representations. This paper introduces the basic notions of faceted knowledge representation. The formalism is applied here to an abstract modeling of a faceted thesaurus as used in information retrieval.
- Date
- 22. 1.2016 17:30:31
- Type
- a
-
Priss, U.: Description logic and faceted knowledge representation (1999)
0.02
0.020580957 = product of:
0.041161913 = sum of:
0.041161913 = sum of:
0.010509259 = weight(_text_:a in 2655) [ClassicSimilarity], result of:
0.010509259 = score(doc=2655,freq=20.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.24171482 = fieldWeight in 2655, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=2655)
0.030652655 = weight(_text_:22 in 2655) [ClassicSimilarity], result of:
0.030652655 = score(doc=2655,freq=2.0), product of:
0.13204344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.037706986 = 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)
- 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
- Type
- a
-
Hesse, W.; Verrijn-Stuart, A.: Towards a theory of information systems : the FRISCO approach (1999)
0.00
0.0023983994 = product of:
0.004796799 = sum of:
0.004796799 = product of:
0.009593598 = sum of:
0.009593598 = weight(_text_:a in 3059) [ClassicSimilarity], result of:
0.009593598 = score(doc=3059,freq=24.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.22065444 = fieldWeight in 3059, product of:
4.8989797 = tf(freq=24.0), with freq of:
24.0 = termFreq=24.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=3059)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Information Systems (IS) is among the most widespread terms in the Computer Science field but a well founded, widely accepted theory of IS is still missing. With the Internet publication of the FRISCO report, the IFIP task group "FRamework of Information System COncepts" has taken a first step towards such a theory. Among the major achievements of this report are: (1) it builds on a solid basis formed by semiotics and ontology, (2) it defines a compendium of about 100 core IS concepts in a coherent and consistent way, (3) it goes beyond the common narrow view of information systems as pure technical artefacts by adopting an interdisciplinary, socio-technical view on them. In the autumn of 1999, a first review of the report and its impact was undertaken at the ISCO-4 conference in Leiden. In a workshop specifically devoted to the subject, the original aims and goals of FRISCO were confirmed to be still valid and the overall approach and achievements of the report were acknowledged. On the other hand, the workshop revealed some misconceptions, errors and weaknesses of the report in its present form, which are to be removed through a comprehensive revision now under way. This paper reports on the results of the Leiden conference and the current revision activities. It also points out some important consequences of the FRISCO approach as a whole.
-
Rindflesch, T.C.; Aronson, A.R.: Semantic processing in information retrieval (1993)
0.00
0.0013707994 = product of:
0.0027415988 = sum of:
0.0027415988 = product of:
0.0054831975 = sum of:
0.0054831975 = weight(_text_:a in 4121) [ClassicSimilarity], result of:
0.0054831975 = score(doc=4121,freq=4.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12611452 = fieldWeight in 4121, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=4121)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Intuition suggests that one way to enhance the information retrieval process would be the use of phrases to characterize the contents of text. A number of researchers, however, have noted that phrases alone do not improve retrieval effectiveness. In this paper we briefly review the use of phrases in information retrieval and then suggest extensions to this paradigm using semantic information. We claim that semantic processing, which can be viewed as expressing relations between the concepts represented by phrases, will in fact enhance retrieval effectiveness. The availability of the UMLS® domain model, which we exploit extensively, significantly contributes to the feasibility of this processing.
- Type
- a