Search (18 results, page 1 of 1)

  • × year_i:[2000 TO 2010}
  • × theme_ss:"Formale Begriffsanalyse"
  1. Priss, U.: Faceted information representation (2000) 0.02 
    0.021060942 = product of:
  0.03159141 = sum of:
    0.0073234225 = weight(_text_:in in 5095) [ClassicSimilarity], result of:
      0.0073234225 = score(doc=5095,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.10520181 = fieldWeight in 5095, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5095)
    0.02426799 = product of:
      0.04853598 = sum of:
        0.04853598 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.04853598 = score(doc=5095,freq=2.0), product of:
            0.17921144 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051176514 = 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.6666667 = coord(2/3)
    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
  2. Burmeister, P.; Holzer, R.: On the treatment of incomplete knowledge in formal concept analysis (2000) 0.01 
    0.0059182197 = product of:
  0.017754659 = sum of:
    0.017754659 = weight(_text_:in in 5085) [ClassicSimilarity], result of:
      0.017754659 = score(doc=5085,freq=16.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.25504774 = fieldWeight in 5085, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=5085)
  0.33333334 = coord(1/3)
    Abstract
    Some possible treatments of incomplete knowledge in conceptual data representation, data analysis and knowledge acquisition are presented. In particular, some ways of conceptual scalings as well as the role of the three-valued KLEENE-logic are briefly investigated. This logic is also one background in attribute exploration, a conceptual tool for knowledge acquisition. For this method a strategy is given to obtain as much of (attribute) implicational knowledge about a given "universe" as possible; and we show how to represent incomplete knowledge in order to be able to pin down the questions still to be answered in order to obtain complete knowledge in this situation
    Series
    Lecture notes in computer science; vol.1867: Lecture notes on artificial intelligence
  3. Priss, U.: Formal concept analysis in information science (2006) 0.01 
    0.0055797505 = product of:
  0.016739251 = sum of:
    0.016739251 = weight(_text_:in in 4305) [ClassicSimilarity], result of:
      0.016739251 = score(doc=4305,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.24046129 = fieldWeight in 4305, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.125 = fieldNorm(doc=4305)
  0.33333334 = coord(1/3)
  4. Hereth, J.; Stumme, G.; Wille, R.; Wille, U.: Conceptual knowledge discovery and data analysis (2000) 0.01 
    0.0052310163 = product of:
  0.015693048 = sum of:
    0.015693048 = weight(_text_:in in 5083) [ClassicSimilarity], result of:
      0.015693048 = score(doc=5083,freq=18.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.22543246 = fieldWeight in 5083, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5083)
  0.33333334 = coord(1/3)
    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
    Series
    Lecture notes in computer science; vol.1867: Lecture notes on artificial intelligence
  5. Lengnink, K.: Ähnlichkeit als Distanz in Begriffsverbänden (2000) 0.00 
    0.0048822816 = product of:
  0.014646845 = sum of:
    0.014646845 = weight(_text_:in in 4033) [ClassicSimilarity], result of:
      0.014646845 = score(doc=4033,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.21040362 = fieldWeight in 4033, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.109375 = fieldNorm(doc=4033)
  0.33333334 = coord(1/3)
  6. Prediger, S.: Terminologische Merkmalslogik in der Formalen Begriffsanalyse (2000) 0.00 
    0.0048822816 = product of:
  0.014646845 = sum of:
    0.014646845 = weight(_text_:in in 4197) [ClassicSimilarity], result of:
      0.014646845 = score(doc=4197,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.21040362 = fieldWeight in 4197, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.109375 = fieldNorm(doc=4197)
  0.33333334 = coord(1/3)
  7. Priss, U.: Comparing classification systems using facets (2000) 0.00 
    0.0048322063 = product of:
  0.014496619 = sum of:
    0.014496619 = weight(_text_:in in 6485) [ClassicSimilarity], result of:
      0.014496619 = score(doc=6485,freq=6.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.2082456 = fieldWeight in 6485, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=6485)
  0.33333334 = coord(1/3)
    Abstract
    This paper describes a qualitative methodology for comparing and analyzing classification schemes. Theoretical facets are modeled as concept lattices in the sense of formal concept analysis and are used as 'ground' on which the underlying conceptual facets of a classification scheme are visually represented as 'figures'.
    Series
    Advances in knowledge organization; vol.7
    Source
    Dynamism and stability in knowledge organization: Proceedings of the 6th International ISKO-Conference, 10-13 July 2000, Toronto, Canada. Ed.: C. Beghtol et al
  8. Ganter, B.: Computing with conceptual structures (2000) 0.00 
    0.004678764 = product of:
  0.014036291 = sum of:
    0.014036291 = weight(_text_:in in 5088) [ClassicSimilarity], result of:
      0.014036291 = score(doc=5088,freq=10.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.20163295 = fieldWeight in 5088, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=5088)
  0.33333334 = coord(1/3)
    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
    Series
    Lecture notes in computer science; vol.1867: Lecture notes on artificial intelligence
  9. Begriffliche Wissensverarbeitung : Methoden und Anwendungen. Mit Beiträgen zahlreicher Fachwissenschaftler (2000) 0.00 
    0.0046133236 = product of:
  0.01383997 = sum of:
    0.01383997 = weight(_text_:in in 4193) [ClassicSimilarity], result of:
      0.01383997 = score(doc=4193,freq=14.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.19881277 = fieldWeight in 4193, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4193)
  0.33333334 = coord(1/3)
    Abstract
    Dieses Buch stellt Methoden der Begrifflichen Wissensverarbeitung vor und präsentiert Anwendungen aus unterschiedlichen Praxisfeldern. Im Methodenteil wird in moderne Techniken der Begrifflichen Datenanalyse und Wissensverarbeitung eingeführt. Der zweite Teil richtet sich verstärkt an potentielle Anwender. An ausgewählten Anwendungen wird die Vorgehensweise bei der Datenanalyse und dem Information Retrieval mit den Methoden der Begrifflichen Wissensverarbeitung vorgestellt und ihr Potential aufgezeigt
    Content
    Enthält die Beiträge: GANTER, B.: Begriffe und Implikationen; BURMEISTER, P.: ConImp: Ein Programm zur Fromalen Begriffsanalyse; Lengnink, K.: Ähnlichkeit als Distanz in Begriffsverbänden; POLLANDT, S.: Datenanalyse mit Fuzzy-Begriffen; PREDIGER, S.: Terminologische Merkmalslogik in der Formalen Begriffsanalyse; WILLE, R. u. M. ZICKWOLFF: Grundlagen einer Triadischen Begriffsanalyse; LINDIG, C. u. G. SNELTING: Formale Begriffsanalyse im Software Engineering; STRACK, H. u. M. SKORSKY: Zugriffskontrolle bei Programmsystemen und im Datenschutz mittels Formaler Begriffsanalyse; ANDELFINGER, U.: Inhaltliche Erschließung des Bereichs 'Sozialorientierte Gestaltung von Informationstechnik': Ein begriffsanalytischer Ansatz; GÖDERT, W.: Wissensdarstellung in Informationssystemen, Fragetypen und Anforderungen an Retrievalkomponenten; ROCK, T. u. R. WILLE: Ein TOSCANA-Erkundungssystem zur Literatursuche; ESCHENFELDER, D. u.a.: Ein Erkundungssystem zum Baurecht: Methoden der Entwicklung eines TOSCANA-Systems; GROßKOPF, A. u. G. HARRAS: Begriffliche Erkundung semantischer Strukturen von Sprechaktverben; ZELGER, J.: Grundwerte, Ziele und Maßnahmen in einem regionalen Krankenhaus: Eine Anwendung des Verfahrens GABEK; KOHLER-KOCH, B. u. F. VOGT: Normen- und regelgeleitete internationale Kooperationen: Formale Begriffsanalyse in der Politikwissenschaft; HENNING, H.J. u. W. KEMMNITZ: Entwicklung eines kontextuellen Methodenkonzeptes mit Hilfer der Formalen Begriffsanalyse an Beispielen zum Risikoverständnis; BARTEL, H.-G.: Über Möglichkeiten der Formalen Begriffsanalyse in der Mathematischen Archäochemie
  10. Wille, R.: Begriffliche Wissensverarbeitung in der Wirtschaft (2002) 0.00 
    0.0042281803 = product of:
  0.012684541 = sum of:
    0.012684541 = weight(_text_:in in 547) [ClassicSimilarity], result of:
      0.012684541 = score(doc=547,freq=6.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.1822149 = fieldWeight in 547, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=547)
  0.33333334 = coord(1/3)
    Abstract
    Begriffliche Wissensverarbeitung ist einem pragmatischen Wissensverständnis verpflichtet, nach dem menschliches Wissen in einem offenen Prozess menschlichen Denkens, Argumentierens und Kommunizierens entsteht und weiterlebt. Sie gründet sich auf eine mathematische Begriffstheorie, die auf das wechselseitige Zusammenwirken von Formalem und Inhaltlichem ausgerichtet ist. Wie diese theoretische Konzeption in der wirtschaftlichen Praxis zur Wirkung kommt wird erläutert anhand der Kernprozesse des organisationalen Wissensmanagements, d.h. nach G. Probst et al. anhand von Wissensidentifikation, Wissenserwerb, Wissensentwicklung, Wissens(ver)teilung, Wissensnutzung und Wissensbewahrung; jeweils an einem Beispiel wird der Einsatz spezifischer Methoden der Begrifflichen Wissensverarbeitung demonstriert. Abschließend wird auf den prozesshaften Wirkungszusammenhang von Wissenszielen und Wissensbewertungen mit den Kernprozessen aus Sicht der Begrifflichen Wissensverarbeitung eingegangen.
  11. Kohler-Koch, B.; Vogt, F.: Normen- und regelgeleitete internationale Kooperationen : Formale Begriffsanalyse in der Politikwissenschaft (2000) 0.00 
    0.0041848132 = product of:
  0.012554439 = sum of:
    0.012554439 = weight(_text_:in in 4206) [ClassicSimilarity], result of:
      0.012554439 = score(doc=4206,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.18034597 = fieldWeight in 4206, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.09375 = fieldNorm(doc=4206)
  0.33333334 = coord(1/3)
  12. Bartel, H.-G.: Über Möglichkeiten der Formalen Begriffsanalyse in der Mathematischen Archäochemie (2000) 0.00 
    0.0041848132 = product of:
  0.012554439 = sum of:
    0.012554439 = weight(_text_:in in 4208) [ClassicSimilarity], result of:
      0.012554439 = score(doc=4208,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.18034597 = fieldWeight in 4208, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.09375 = fieldNorm(doc=4208)
  0.33333334 = coord(1/3)
  13. Eklund, P.; Groh, B.; Stumme, G.; Wille, R.: ¬A conceptual-logic extension of TOSCANA (2000) 0.00 
    0.0036241547 = product of:
  0.010872464 = sum of:
    0.010872464 = weight(_text_:in in 5082) [ClassicSimilarity], result of:
      0.010872464 = score(doc=5082,freq=6.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.1561842 = fieldWeight in 5082, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=5082)
  0.33333334 = coord(1/3)
    Abstract
    The aim of this paper is to indicate how TOSCANA may be extended to allow graphical representations not only of concept lattices but also of concept graphs in the sense of Contextual Logic. The contextual- logic extension of TOSCANA requires the logical scaling of conceptual and relational scales for which we propose the Peircean Algebraic Logic as reconstructed by R. W. Burch. As graphical representations we recommend, besides labelled line diagrams of concept lattices and Sowa's diagrams of conceptual graphs, particular information maps for utilizing background knowledge as much as possible. Our considerations are illustrated by a small information system about the domestic flights in Austria
    Series
    Lecture notes in computer science; vol.1867: Lecture notes on artificial intelligence
  14. Eklund. P.W.: Logic-based networks : concept graphs and conceptual structures (2000) 0.00 
    0.0036241547 = product of:
  0.010872464 = sum of:
    0.010872464 = weight(_text_:in in 5084) [ClassicSimilarity], result of:
      0.010872464 = score(doc=5084,freq=6.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.1561842 = fieldWeight in 5084, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=5084)
  0.33333334 = coord(1/3)
    Abstract
    Logic-based networks are semantic networks that support reasoning capabilities. In this paper, knowledge processing within logicbased networks is viewed as three stages. The first stage involves the formation of concepts and relations: the basic primitives with which we wish to formulate knowledge. The second stage involves the formation of wellformed formulas that express knowledge about the primitive concepts and relations once isolated. The final stage involves efficiently processing the wffs to the desired end. Our research involves each of these steps as they relate to Sowa's conceptual structures and Wille's concept lattices. Formal Concept Analysis gives us a capability to perform concept formation via symbolic machine learning. Concept(ual) Graphs provide a means to describe relational properties between primitive concept and relation types. Finally, techniques from other areas of computer science are required to compute logic-based networks efficiently. This paper illustrates the three stages of knowledge processing in practical terms using examples from our research
    Series
    Lecture notes in computer science; vol.1867: Lecture notes on artificial intelligence
  15. Priss, U.: Lattice-based information retrieval (2000) 0.00 
    0.003452295 = product of:
  0.010356884 = sum of:
    0.010356884 = weight(_text_:in in 6055) [ClassicSimilarity], result of:
      0.010356884 = score(doc=6055,freq=4.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.14877784 = fieldWeight in 6055, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6055)
  0.33333334 = coord(1/3)
    Abstract
    A lattice-based model for information retrieval was suggested in the 1960's but has been seen as a theoretical possibility hard to practically apply ever since. This paper attempts to revive the lattice model and demonstrate its applicability in an information retrieval system, FalR, that incorporates a graphical representation of a faceted thesaurus. It shows how Boolean queries can be lattice-theoretically related to the concepts of the thesaurus and visualized within the thesaurus display. An advantage of FaIR is that it allows for a high level of transparency of the system, which can be controlled by the user
  16. Conceptual structures : logical, linguistic, and computational issues. 8th International Conference on Conceptual Structures, ICCS 2000, Darmstadt, Germany, August 14-18, 2000 (2000) 0.00 
    0.0033083854 = product of:
  0.009925156 = sum of:
    0.009925156 = weight(_text_:in in 691) [ClassicSimilarity], result of:
      0.009925156 = score(doc=691,freq=20.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.14257601 = fieldWeight in 691, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0234375 = fieldNorm(doc=691)
  0.33333334 = coord(1/3)
    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
    Content
    Concepts and Language: The Role of Conceptual Structure in Human Evolution (Keith Devlin) - Concepts in Linguistics - Concepts in Natural Language (Gisela Harras) - Patterns, Schemata, and Types: Author Support through Formalized Experience (Felix H. Gatzemeier) - Conventions and Notations for Knowledge Representation and Retrieval (Philippe Martin) - Conceptual Ontology: Ontology, Metadata, and Semiotics (John F. Sowa) - Pragmatically Yours (Mary Keeler) - Conceptual Modeling for Distributed Ontology Environments (Deborah L. McGuinness) - Discovery of Class Relations in Exception Structured Knowledge Bases (Hendra Suryanto, Paul Compton) - Conceptual Graphs: Perspectives: CGs Applications: Where Are We 7 Years after the First ICCS ? (Michel Chein, David Genest) - The Engineering of a CC-Based System: Fundamental Issues (Guy W. Mineau) - Conceptual Graphs, Metamodeling, and Notation of Concepts (Olivier Gerbé, Guy W. Mineau, Rudolf K. Keller) - Knowledge Representation and Reasonings: Based on Graph Homomorphism (Marie-Laure Mugnier) - User Modeling Using Conceptual Graphs for Intelligent Agents (James F. Baldwin, Trevor P. Martin, Aimilia Tzanavari) - Towards a Unified Querying System of Both Structured and Semi-structured Imprecise Data Using Fuzzy View (Patrice Buche, Ollivier Haemmerlé) - Formal Semantics of Conceptual Structures: The Extensional Semantics of the Conceptual Graph Formalism (Guy W. Mineau) - Semantics of Attribute Relations in Conceptual Graphs (Pavel Kocura) - Nested Concept Graphs and Triadic Power Context Families (Susanne Prediger) - Negations in Simple Concept Graphs (Frithjof Dau) - Extending the CG Model by Simulations (Jean-François Baget) - Contextual Logic and Formal Concept Analysis: Building and Structuring Description Logic Knowledge Bases: Using Least Common Subsumers and Concept Analysis (Franz Baader, Ralf Molitor) - On the Contextual Logic of Ordinal Data (Silke Pollandt, Rudolf Wille) - Boolean Concept Logic (Rudolf Wille) - Lattices of Triadic Concept Graphs (Bernd Groh, Rudolf Wille) - Formalizing Hypotheses with Concepts (Bernhard Ganter, Sergei 0. Kuznetsov) - Generalized Formal Concept Analysis (Laurent Chaudron, Nicolas Maille) - A Logical Generalization of Formal Concept Analysis (Sébastien Ferré, Olivier Ridoux) - On the Treatment of Incomplete Knowledge in Formal Concept Analysis (Peter Burmeister, Richard Holzer) - Conceptual Structures in Practice: Logic-Based Networks: Concept Graphs and Conceptual Structures (Peter W. Eklund) - Conceptual Knowledge Discovery and Data Analysis (Joachim Hereth, Gerd Stumme, Rudolf Wille, Uta Wille) - CEM - A Conceptual Email Manager (Richard Cole, Gerd Stumme) - A Contextual-Logic Extension of TOSCANA (Peter Eklund, Bernd Groh, Gerd Stumme, Rudolf Wille) - A Conceptual Graph Model for W3C Resource Description Framework (Olivier Corby, Rose Dieng, Cédric Hébert) - Computational Aspects of Conceptual Structures: Computing with Conceptual Structures (Bernhard Ganter) - Symmetry and the Computation of Conceptual Structures (Robert Levinson) An Introduction to SNePS 3 (Stuart C. Shapiro) - Composition Norm Dynamics Calculation with Conceptual Graphs (Aldo de Moor) - From PROLOG++ to PROLOG+CG: A CG Object-Oriented Logic Programming Language (Adil Kabbaj, Martin Janta-Polczynski) - A Cost-Bounded Algorithm to Control Events Generalization (Gaël de Chalendar, Brigitte Grau, Olivier Ferret)
    Series
    Lecture notes in computer science; vol.1867: Lecture notes on artificial intelligence
  17. Working with conceptual structures : contributions to ICCS 2000. 8th International Conference on Conceptual Structures: Logical, Linguistic, and Computational Issues. Darmstadt, August 14-18, 2000 (2000) 0.00 
    0.0032293263 = product of:
  0.009687979 = sum of:
    0.009687979 = weight(_text_:in in 5089) [ClassicSimilarity], result of:
      0.009687979 = score(doc=5089,freq=14.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.13916893 = fieldWeight in 5089, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02734375 = fieldNorm(doc=5089)
  0.33333334 = coord(1/3)
    Abstract
    The 8th International Conference on Conceptual Structures - Logical, Linguistic, and Computational Issues (ICCS 2000) brings together a wide range of researchers and practitioners working with conceptual structures. During the last few years, the ICCS conference series has considerably widened its scope on different kinds of conceptual structures, stimulating research across domain boundaries. We hope that this stimulation is further enhanced by ICCS 2000 joining the long tradition of conferences in Darmstadt with extensive, lively discussions. This volume consists of contributions presented at ICCS 2000, complementing the volume "Conceptual Structures: Logical, Linguistic, and Computational Issues" (B. Ganter, G.W. Mineau (Eds.), LNAI 1867, Springer, Berlin-Heidelberg 2000). It contains submissions reviewed by the program committee, and position papers. We wish to express our appreciation to all the authors of submitted papers, to the general chair, the program chair, the editorial board, the program committee, and to the additional reviewers for making ICCS 2000 a valuable contribution in the knowledge processing research field. Special thanks go to the local organizers for making the conference an enjoyable and inspiring event. We are grateful to Darmstadt University of Technology, the Ernst Schröder Center for Conceptual Knowledge Processing, the Center for Interdisciplinary Studies in Technology, the Deutsche Forschungsgemeinschaft, Land Hessen, and NaviCon GmbH for their generous support
    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)
  18. Carpineto, C.; Romano, G.: Order-theoretical ranking (2000) 0.00 
    0.0030201292 = product of:
  0.0090603875 = sum of:
    0.0090603875 = weight(_text_:in in 4766) [ClassicSimilarity], result of:
      0.0090603875 = score(doc=4766,freq=6.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.1301535 = fieldWeight in 4766, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4766)
  0.33333334 = coord(1/3)
    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

Authors

Languages

  • e 12
  • d 6

Types

Themes