Search (52 results, page 3 of 3)

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

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

0.0034873444 = product of:
  0.010462033 = sum of:
    0.010462033 = weight(_text_:in in 5908) [ClassicSimilarity], result of:
      0.010462033 = score(doc=5908,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.15028831 = fieldWeight in 5908, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.078125 = fieldNorm(doc=5908)
  0.33333334 = coord(1/3)

0.0034873444 = product of:
  0.010462033 = sum of:
    0.010462033 = weight(_text_:in in 3084) [ClassicSimilarity], result of:
      0.010462033 = score(doc=3084,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.15028831 = fieldWeight in 3084, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.078125 = fieldNorm(doc=3084)
  0.33333334 = coord(1/3)

Series

Lecture notes in artificial intelligence; vol.1453

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

0.003452295 = product of:
  0.010356884 = sum of:
    0.010356884 = weight(_text_:in in 2710) [ClassicSimilarity], result of:
      0.010356884 = score(doc=2710,freq=4.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.14877784 = fieldWeight in 2710, 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=2710)
  0.33333334 = coord(1/3)

Abstract

Latent Semantic Indexing (LSI), a variant of classical Vector Space Model (VSM), is an Information Retrieval (IR) model that attempts to capture the latent semantic relationship between the data items. Mathematical lattices, under the framework of Formal Concept Analysis (FCA), represent conceptual hierarchies in data and retrieve the information. However both LSI and FCA uses the data represented in form of matrices. The objective of this paper is to systematically analyze VSM, LSI and FCA for the task of IR using the standard and real life datasets.

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

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)

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

0.0027898753 = product of:
  0.008369626 = sum of:
    0.008369626 = weight(_text_:in in 618) [ClassicSimilarity], result of:
      0.008369626 = score(doc=618,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.120230645 = fieldWeight in 618, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=618)
  0.33333334 = coord(1/3)

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.0027898753 = product of:
  0.008369626 = sum of:
    0.008369626 = weight(_text_:in in 4376) [ClassicSimilarity], result of:
      0.008369626 = score(doc=4376,freq=2.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.120230645 = fieldWeight in 4376, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=4376)
  0.33333334 = coord(1/3)

Abstract

Ein grundsätzliches Problem der Literaturverwaltung besteht darin, daß viele Nutzer der Retrievalsysteme gar nicht genau sagen können, was sie suchen. Erst im Prozeß des erkundenden Suchens lernen sie genauer zu präzisieren, was sie finden wollen. Dieser Lernprozeß wird durch einzelne Suchwörter (Suchwortketten) nur unzureichend unterstützt, weshalb der benutzer häufig unzufrieden mit dem Ergebnis eines solchen Suchprozesses ist. Notwendig sind reichhaltigere Begriffsnetze, die thematisch geordnete Zusammenhänge darstellen und sich flexibel verfeinern, vergröbern oder verändern lassen, um in geeignetem Umfang die wünschenswerte Orientierung liefern zu können. Das Computerprogramm TOSCANA könnte hier weiterhelfen

0.0027898753 = product of:
  0.008369626 = sum of:
    0.008369626 = weight(_text_:in in 2470) [ClassicSimilarity], result of:
      0.008369626 = score(doc=2470,freq=8.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.120230645 = fieldWeight in 2470, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.03125 = fieldNorm(doc=2470)
  0.33333334 = coord(1/3)

Abstract

The writers show that a faceted navigation structure makes web sites easier to use. They begin by analyzing the web sites of three library and information science faculties, and seeing if the sites easily provide the answers to five specific questions, e.g., how the school ranks in national evaluations. (It is worth noting that the web site of the Faculty of Information Studies and the University of Toronto, where this bibliography is being written, would fail on four of the five questions.) Using examples from LIS web site content, they show how facets can be related and constructed, and use concept diagrams for illustration. They briefly discuss constraints necessary when joining facets: for example, enrolled students can be full- or part-time, but prospective and alumni students cannot. It should not be possible to construct terms such as "part-time alumni" (see Yannis Tzitzikas et al, below in Background). They conclude that a faceted approach is best for web site navigation, because it can clearly show where the user is in the site, what the related pages are, and how to get to them. There is a short discussion of user interfaces, and the diagrams in the paper will be of interest to anyone making a facet-based web site. This paper is clearly written, informative, and thought-provoking. Uta Priss's web site lists her other publications, many of which are related and some of which are online: http://www.upriss.org.uk/top/research.html.