Search (20 results, page 1 of 1)

0.022623584 = product of:
  0.06787075 = sum of:
    0.031644072 = product of:
      0.063288145 = sum of:
        0.063288145 = weight(_text_:theory in 5061) [ClassicSimilarity], result of:
          0.063288145 = score(doc=5061,freq=4.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.3898493 = fieldWeight in 5061, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.046875 = fieldNorm(doc=5061)
      0.5 = coord(1/2)
    0.036226675 = product of:
      0.07245335 = sum of:
        0.07245335 = weight(_text_:methods in 5061) [ClassicSimilarity], result of:
          0.07245335 = score(doc=5061,freq=6.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.4616232 = fieldWeight in 5061, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.046875 = fieldNorm(doc=5061)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

This is the first textbook on formal concept analysis. It gives a systematic presentation of the mathematical foundations and their relation to applications in computer science, especially data analysis and knowledge processing. Above all, it presents graphical methods for representing conceptual systems that have proved themselves in communicating knowledge. Theory and graphical representation are thus closely coupled together. The mathematical foundations are treated thouroughly and illuminated by means of numerous examples. Since computers are being used ever more widely for knowledge processing, formal methods for conceptual analysis are gaining in importance. This book makes the basic theory for such methods accessible in a compact form

0.019240541 = product of:
  0.057721622 = sum of:
    0.029834319 = product of:
      0.059668638 = sum of:
        0.059668638 = weight(_text_:theory in 2204) [ClassicSimilarity], result of:
          0.059668638 = score(doc=2204,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.36755344 = fieldWeight in 2204, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0625 = fieldNorm(doc=2204)
      0.5 = coord(1/2)
    0.027887305 = product of:
      0.05577461 = sum of:
        0.05577461 = weight(_text_:methods in 2204) [ClassicSimilarity], result of:
          0.05577461 = score(doc=2204,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.35535768 = fieldWeight in 2204, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.0625 = fieldNorm(doc=2204)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

With the continuously growing amount of Internet accessible information resources, locating relevant information in the WWW becomes increasingly difficult. Recent developments provide scalable mechanisms for maintaing indexes of network accessible information. In order to implement sophisticated retrieval engines, a means of automatic analysis and classification of document meta information has to be found. Proposes the use of methods from the mathematical theory of concept analysis to analyze and interactively explore the information space defined by wide area resource discovery services

0.016575389 = product of:
  0.049726166 = sum of:
    0.032296598 = product of:
      0.064593196 = sum of:
        0.064593196 = weight(_text_:theory in 5083) [ClassicSimilarity], result of:
          0.064593196 = score(doc=5083,freq=6.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.39788827 = fieldWeight in 5083, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5083)
      0.5 = coord(1/2)
    0.017429566 = product of:
      0.034859132 = sum of:
        0.034859132 = weight(_text_:methods in 5083) [ClassicSimilarity], result of:
          0.034859132 = score(doc=5083,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.22209854 = fieldWeight in 5083, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5083)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

In this paper, we discuss Conceptual Knowledge Discovery in Databases (CKDD) in its connection with Data Analysis. Our approach is based on Formal Concept Analysis, a mathematical theory which has been developed and proven useful during the last 20 years. Formal Concept Analysis has led to a theory of conceptual information systems which has been applied by using the management system TOSCANA in a wide range of domains. In this paper, we use such an application in database marketing to demonstrate how methods and procedures of CKDD can be applied in Data Analysis. In particular, we show the interplay and integration of data mining and data analysis techniques based on Formal Concept Analysis. The main concern of this paper is to explain how the transition from data to knowledge can be supported by a TOSCANA system. To clarify the transition steps we discuss their correspondence to the five levels of knowledge representation established by R. Brachman and to the steps of empirically grounded theory building proposed by A. Strauss and J. Corbin

0.014872484 = product of:
  0.04461745 = sum of:
    0.026105028 = product of:
      0.052210055 = sum of:
        0.052210055 = weight(_text_:theory in 5095) [ClassicSimilarity], result of:
          0.052210055 = score(doc=5095,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.32160926 = fieldWeight in 5095, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5095)
      0.5 = coord(1/2)
    0.018512422 = product of:
      0.037024844 = sum of:
        0.037024844 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.037024844 = score(doc=5095,freq=2.0), product of:
            0.1367084 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03903913 = queryNorm
            0.2708308 = fieldWeight in 5095, 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=5095)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

This paper presents an abstract formalization of the notion of "facets". Facets are relational structures of units, relations and other facets selected for a certain purpose. Facets can be used to structure large knowledge representation systems into a hierarchical arrangement of consistent and independent subsystems (facets) that facilitate flexibility and combinations of different viewpoints or aspects. This paper describes the basic notions, facet characteristics and construction mechanisms. It then explicates the theory in an example of a faceted information retrieval system (FaIR)

Date

22. 1.2016 17:47:06

0.014431859 = product of:
  0.043295577 = sum of:
    0.018646449 = product of:
      0.037292898 = sum of:
        0.037292898 = weight(_text_:theory in 4766) [ClassicSimilarity], result of:
          0.037292898 = score(doc=4766,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.2297209 = fieldWeight in 4766, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4766)
      0.5 = coord(1/2)
    0.024649128 = product of:
      0.049298257 = sum of:
        0.049298257 = weight(_text_:methods in 4766) [ClassicSimilarity], result of:
          0.049298257 = score(doc=4766,freq=4.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.31409478 = fieldWeight in 4766, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4766)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

Current best-match ranking (BMR) systems perform well but cannot handle word mismatch between a query and a document. The best known alternative ranking method, hierarchical clustering-based ranking (HCR), seems to be more robust than BMR with respect to this problem, but it is hampered by theoretical and practical limitations. We present an approach to document ranking that explicitly addresses the word mismatch problem by exploiting interdocument similarity information in a novel way. Document ranking is seen as a query-document transformation driven by a conceptual representation of the whole document collection, into which the query is merged. Our approach is nased on the theory of concept (or Galois) lattices, which, er argue, provides a powerful, well-founded, and conputationally-tractable framework to model the space in which documents and query are represented and to compute such a transformation. We compared information retrieval using concept lattice-based ranking (CLR) to BMR and HCR. The results showed that HCR was outperformed by CLR as well as BMR, and suggested that, of the two best methods, BMR achieved better performance than CLR on the whole document set, whereas CLR compared more favorably when only the first retrieved documents were used for evaluation. We also evaluated the three methods' specific ability to rank documents that did not match the query, in which case the speriority of CLR over BMR and HCR was apparent

0.0144304065 = product of:
  0.04329122 = sum of:
    0.022375738 = product of:
      0.044751476 = sum of:
        0.044751476 = weight(_text_:theory in 5088) [ClassicSimilarity], result of:
          0.044751476 = score(doc=5088,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.27566507 = fieldWeight in 5088, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.046875 = fieldNorm(doc=5088)
      0.5 = coord(1/2)
    0.020915478 = product of:
      0.041830957 = sum of:
        0.041830957 = weight(_text_:methods in 5088) [ClassicSimilarity], result of:
          0.041830957 = score(doc=5088,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.26651827 = fieldWeight in 5088, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.046875 = fieldNorm(doc=5088)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

We give an overview over the computational tools for conceptional structures that have emerged from the theory of Formal Concept Analysis, with emphasis on basic ideas rather than technical details. We describe what we mean by conceptual computations, and try to convince the reader that an elaborate formalization is a necessary precondition. Claiming that Formal Concept Analysis provides such a formal background, we present as examples two well known algorithms in very simple pseudo code. These earl be used for navigating in a lattice, thereby supporting some prototypical tasks of conceptual computation. We refer to some of the many more advanced methods, discuss how to compute with limited precision and explain why in the case of incomplete knowledge the conceptual approach is more efficient than a combinatorial one. Utilizing this efficiency requires skillful use of the formalism. We present two results that lead in this direction

0.0087016765 = product of:
  0.052210055 = sum of:
    0.052210055 = product of:
      0.10442011 = sum of:
        0.10442011 = weight(_text_:theory in 3138) [ClassicSimilarity], result of:
          0.10442011 = score(doc=3138,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.6432185 = fieldWeight in 3138, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.109375 = fieldNorm(doc=3138)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Source

Applications of combinatorics and graph theory to the biological and social sciences. Ed.: F. Roberts

0.008133798 = product of:
  0.048802786 = sum of:
    0.048802786 = product of:
      0.09760557 = sum of:
        0.09760557 = weight(_text_:methods in 594) [ClassicSimilarity], result of:
          0.09760557 = score(doc=594,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.62187594 = fieldWeight in 594, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.109375 = fieldNorm(doc=594)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

0.007116368 = product of:
  0.04269821 = sum of:
    0.04269821 = product of:
      0.08539642 = sum of:
        0.08539642 = weight(_text_:29 in 4305) [ClassicSimilarity], result of:
          0.08539642 = score(doc=4305,freq=2.0), product of:
            0.13732746 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03903913 = queryNorm
            0.6218451 = fieldWeight in 4305, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.125 = fieldNorm(doc=4305)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Date

13. 7.2008 19:29:59

0.0069718263 = product of:
  0.041830957 = sum of:
    0.041830957 = product of:
      0.083661914 = sum of:
        0.083661914 = weight(_text_:methods in 5262) [ClassicSimilarity], result of:
          0.083661914 = score(doc=5262,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.53303653 = fieldWeight in 5262, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.09375 = fieldNorm(doc=5262)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Source

Information and classification: concepts, methods and applications. Proceedings of the 16th Annual Conference of the Gesellschaft für Klassifikation, University of Dortmund, April 1-3, 1992. Ed.: O. Opitz u.a

0.006215483 = product of:
  0.037292898 = sum of:
    0.037292898 = product of:
      0.074585795 = sum of:
        0.074585795 = weight(_text_:theory in 3084) [ClassicSimilarity], result of:
          0.074585795 = score(doc=3084,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.4594418 = fieldWeight in 3084, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.078125 = fieldNorm(doc=3084)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Source

Conceptual structures: theory, tools and applications. 6th International Conference on conceptual Structures, ICCS'98, Montpellier, France, August, 10-12, 1998, Proceedings. Ed.: M.L. Mugnier u. M. Chein

0.0049723866 = product of:
  0.029834319 = sum of:
    0.029834319 = product of:
      0.059668638 = sum of:
        0.059668638 = weight(_text_:theory in 618) [ClassicSimilarity], result of:
          0.059668638 = score(doc=618,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.36755344 = fieldWeight in 618, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0625 = fieldNorm(doc=618)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

A lattice theoretical description of concept hierarchies is developed using for attributes the terms "given", "negated", "open" and "impossible" as the truth-values of a four-valued logic. Similar to the theory of B. Ganter and R. Wille so does this framework permit a precise representation of the usual interdependences in a field of related concepts - such as superconcepts, subconcept, contrary concepts etc. -, whenever the concepts under consideration can be sufficiently described by the presence or absence of certain attributes ...

0.0046478845 = product of:
  0.027887305 = sum of:
    0.027887305 = product of:
      0.05577461 = sum of:
        0.05577461 = weight(_text_:methods in 620) [ClassicSimilarity], result of:
          0.05577461 = score(doc=620,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.35535768 = fieldWeight in 620, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.0625 = fieldNorm(doc=620)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Source

Behavior research methods instruments and computers. 25(1993) no.2, S.314-317

0.0044077197 = product of:
  0.026446318 = sum of:
    0.026446318 = product of:
      0.052892637 = sum of:
        0.052892637 = weight(_text_:22 in 3142) [ClassicSimilarity], result of:
          0.052892637 = score(doc=3142,freq=2.0), product of:
            0.1367084 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03903913 = queryNorm
            0.38690117 = fieldWeight in 3142, 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=3142)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Date

26. 2.2008 15:58:22

0.004066899 = product of:
  0.024401393 = sum of:
    0.024401393 = product of:
      0.048802786 = sum of:
        0.048802786 = weight(_text_:methods in 3033) [ClassicSimilarity], result of:
          0.048802786 = score(doc=3033,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.31093797 = fieldWeight in 3033, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3033)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Source

Classification, data analysis, and knowledge organization: models and methods with applications. Proc. of the 14th annual conf. of the Gesellschaft für Klassifikation, Univ. of Marburg, 12.-14.3.1990. Ed.: H.-H. Bock u. P. Ihm

0.0037292899 = product of:
  0.022375738 = sum of:
    0.022375738 = product of:
      0.044751476 = sum of:
        0.044751476 = weight(_text_:theory in 2737) [ClassicSimilarity], result of:
          0.044751476 = score(doc=2737,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.27566507 = fieldWeight in 2737, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.046875 = fieldNorm(doc=2737)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

In recent years, knowledge structuring is assuming important roles in several real world applications such as decision support, cooperative problem solving, e-commerce, Semantic Web and, even in planning systems. Ontologies play an important role in supporting automated processes to access information and are at the core of new strategies for the development of knowledge-based systems. Yet, developing an ontology is a time-consuming task which often needs an accurate domain expertise to tackle structural and logical difficulties in the definition of concepts as well as conceivable relationships. This work presents an ontology-based retrieval approach, that supports data organization and visualization and provides a friendly navigation model. It exploits the fuzzy extension of the Formal Concept Analysis theory to elicit conceptualizations from datasets and generate a hierarchy-based representation of extracted knowledge. An intuitive graphical interface provides a multi-facets view of the built ontology. Through a transparent query-based retrieval, final users navigate across concepts, relations and population.

0.0035261759 = product of:
  0.021157054 = sum of:
    0.021157054 = product of:
      0.04231411 = sum of:
        0.04231411 = weight(_text_:22 in 1901) [ClassicSimilarity], result of:
          0.04231411 = score(doc=1901,freq=2.0), product of:
            0.1367084 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03903913 = queryNorm
            0.30952093 = fieldWeight in 1901, 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=1901)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Source

Knowledge organization. 22(1995) no.2, S.78-81

0.0030854037 = product of:
  0.018512422 = sum of:
    0.018512422 = product of:
      0.037024844 = sum of:
        0.037024844 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.037024844 = score(doc=2654,freq=2.0), product of:
            0.1367084 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03903913 = 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.16666667 = coord(1/6)

Date

22. 1.2016 17:30:31

0.0020334495 = product of:
  0.012200696 = sum of:
    0.012200696 = product of:
      0.024401393 = sum of:
        0.024401393 = weight(_text_:methods in 5089) [ClassicSimilarity], result of:
          0.024401393 = score(doc=5089,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.15546899 = fieldWeight in 5089, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.02734375 = fieldNorm(doc=5089)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Content

Concepts & Language: Knowledge organization by procedures of natural language processing. A case study using the method GABEK (J. Zelger, J. Gadner) - Computer aided narrative analysis using conceptual graphs (H. Schärfe, P. 0hrstrom) - Pragmatic representation of argumentative text: a challenge for the conceptual graph approach (H. Irandoust, B. Moulin) - Conceptual graphs as a knowledge representation core in a complex language learning environment (G. Angelova, A. Nenkova, S. Boycheva, T. Nikolov) - Conceptual Modeling and Ontologies: Relationships and actions in conceptual categories (Ch. Landauer, K.L. Bellman) - Concept approximations for formal concept analysis (J. Saquer, J.S. Deogun) - Faceted information representation (U. Priß) - Simple concept graphs with universal quantifiers (J. Tappe) - A framework for comparing methods for using or reusing multiple ontologies in an application (J. van ZyI, D. Corbett) - Designing task/method knowledge-based systems with conceptual graphs (M. Leclère, F.Trichet, Ch. Choquet) - A logical ontology (J. Farkas, J. Sarbo) - Algorithms and Tools: Fast concept analysis (Ch. Lindig) - A framework for conceptual graph unification (D. Corbett) - Visual CP representation of knowledge (H.D. Pfeiffer, R.T. Hartley) - Maximal isojoin for representing software textual specifications and detecting semantic anomalies (Th. Charnois) - Troika: using grids, lattices and graphs in knowledge acquisition (H.S. Delugach, B.E. Lampkin) - Open world theorem prover for conceptual graphs (J.E. Heaton, P. Kocura) - NetCare: a practical conceptual graphs software tool (S. Polovina, D. Strang) - CGWorld - a web based workbench for conceptual graphs management and applications (P. Dobrev, K. Toutanova) - Position papers: The edition project: Peirce's existential graphs (R. Mülller) - Mining association rules using formal concept analysis (N. Pasquier) - Contextual logic summary (R Wille) - Information channels and conceptual scaling (K.E. Wolff) - Spatial concepts - a rule exploration (S. Rudolph) - The TEXT-TO-ONTO learning environment (A. Mädche, St. Staab) - Controlling the semantics of metadata on audio-visual documents using ontologies (Th. Dechilly, B. Bachimont) - Building the ontological foundations of a terminology from natural language to conceptual graphs with Ribosome, a knowledge extraction system (Ch. Jacquelinet, A. Burgun) - CharGer: some lessons learned and new directions (H.S. Delugach) - Knowledge management using conceptual graphs (W.K. Pun)

0.0018646449 = product of:
  0.011187869 = sum of:
    0.011187869 = product of:
      0.022375738 = sum of:
        0.022375738 = weight(_text_:theory in 691) [ClassicSimilarity], result of:
          0.022375738 = score(doc=691,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.13783254 = fieldWeight in 691, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0234375 = fieldNorm(doc=691)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

Computer scientists create models of a perceived reality. Through AI techniques, these models aim at providing the basic support for emulating cognitive behavior such as reasoning and learning, which is one of the main goals of the Al research effort. Such computer models are formed through the interaction of various acquisition and inference mechanisms: perception, concept learning, conceptual clustering, hypothesis testing, probabilistic inference, etc., and are represented using different paradigms tightly linked to the processes that use them. Among these paradigms let us cite: biological models (neural nets, genetic programming), logic-based models (first-order logic, modal logic, rule-based systems), virtual reality models (object systems, agent systems), probabilistic models (Bayesian nets, fuzzy logic), linguistic models (conceptual dependency graphs, language-based rep resentations), etc. One of the strengths of the Conceptual Graph (CG) theory is its versatility in terms of the representation paradigms under which it falls. It can be viewed and therefore used, under different representation paradigms, which makes it a popular choice for a wealth of applications. Its full coupling with different cognitive processes lead to the opening of the field toward related research communities such as the Description Logic, Formal Concept Analysis, and Computational Linguistic communities. We now see more and more research results from one community enrich the other, laying the foundations of common philosophical grounds from which a successful synergy can emerge. ICCS 2000 embodies this spirit of research collaboration. It presents a set of papers that we believe, by their exposure, will benefit the whole community. For instance, the technical program proposes tracks on Conceptual Ontologies, Language, Formal Concept Analysis, Computational Aspects of Conceptual Structures, and Formal Semantics, with some papers on pragmatism and human related aspects of computing. Never before was the program of ICCS formed by so heterogeneously rooted theories of knowledge representation and use. We hope that this swirl of ideas will benefit you as much as it already has benefited us while putting together this program