Search (14 results, page 1 of 1)

0.06537996 = product of:
  0.13075992 = sum of:
    0.09702934 = weight(_text_:26 in 3142) [ClassicSimilarity], result of:
      0.09702934 = score(doc=3142,freq=4.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.5518006 = fieldWeight in 3142, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.078125 = fieldNorm(doc=3142)
    0.03373058 = product of:
      0.06746116 = sum of:
        0.06746116 = weight(_text_:22 in 3142) [ClassicSimilarity], result of:
          0.06746116 = score(doc=3142,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = 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.5 = coord(2/4)

Date

26. 2.2008 15:58:22

Footnote

Rez. in: KO 26(1999) no.3, S.175-176 (R. Wille)

0.02744404 = product of:
  0.10977616 = sum of:
    0.10977616 = weight(_text_:26 in 4570) [ClassicSimilarity], result of:
      0.10977616 = score(doc=4570,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.62429106 = fieldWeight in 4570, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.125 = fieldNorm(doc=4570)
  0.25 = coord(1/4)

Date

9.12.1995 17:26:17

0.023783846 = product of:
  0.09513538 = sum of:
    0.09513538 = weight(_text_:description in 618) [ClassicSimilarity], result of:
      0.09513538 = score(doc=618,freq=2.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.41095015 = fieldWeight in 618, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.0625 = fieldNorm(doc=618)
  0.25 = coord(1/4)

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.02058303 = product of:
  0.08233212 = sum of:
    0.08233212 = weight(_text_:26 in 4206) [ClassicSimilarity], result of:
      0.08233212 = score(doc=4206,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.4682183 = fieldWeight in 4206, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.09375 = fieldNorm(doc=4206)
  0.25 = coord(1/4)

Date

29.11.1999 16:26:02

0.015448062 = product of:
  0.061792247 = sum of:
    0.061792247 = weight(_text_:description in 691) [ClassicSimilarity], result of:
      0.061792247 = score(doc=691,freq=6.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.26691997 = fieldWeight in 691, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.0234375 = fieldNorm(doc=691)
  0.25 = coord(1/4)

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)

0.01372202 = product of:
  0.05488808 = sum of:
    0.05488808 = weight(_text_:26 in 3527) [ClassicSimilarity], result of:
      0.05488808 = score(doc=3527,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.31214553 = fieldWeight in 3527, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.0625 = fieldNorm(doc=3527)
  0.25 = coord(1/4)

Source

Paradigms and conceptual systems in knowledge organization: Proceedings of the Eleventh International ISKO Conference, 23-26 February 2010 Rome, Italy. Edited by Claudio Gnoli and Fulvio Mazzocchi

0.012006768 = product of:
  0.048027072 = sum of:
    0.048027072 = weight(_text_:26 in 5230) [ClassicSimilarity], result of:
      0.048027072 = score(doc=5230,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.27312735 = fieldWeight in 5230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5230)
  0.25 = coord(1/4)

Source

International classification. 18(1991) no.1, S.26-34

0.010291515 = product of:
  0.04116606 = sum of:
    0.04116606 = weight(_text_:26 in 5061) [ClassicSimilarity], result of:
      0.04116606 = score(doc=5061,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.23410915 = fieldWeight in 5061, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.046875 = fieldNorm(doc=5061)
  0.25 = coord(1/4)

Footnote

Rez. in: KO 26(1999) no.3, S.172-173 (U. Priss)

0.006746116 = product of:
  0.026984464 = sum of:
    0.026984464 = product of:
      0.05396893 = sum of:
        0.05396893 = weight(_text_:22 in 1901) [ClassicSimilarity], result of:
          0.05396893 = score(doc=1901,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = 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.25 = coord(1/4)

Source

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

0.0059028515 = product of:
  0.023611406 = sum of:
    0.023611406 = product of:
      0.04722281 = sum of:
        0.04722281 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.04722281 = score(doc=5095,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = 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.25 = coord(1/4)

Date

22. 1.2016 17:47:06

0.0059028515 = product of:
  0.023611406 = sum of:
    0.023611406 = product of:
      0.04722281 = sum of:
        0.04722281 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.04722281 = score(doc=2654,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = queryNorm
            0.2708308 = fieldWeight in 2654, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2654)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

22. 1.2016 17:30:31

0.0047399946 = product of:
  0.018959979 = sum of:
    0.018959979 = product of:
      0.037919957 = sum of:
        0.037919957 = weight(_text_:access in 2737) [ClassicSimilarity], result of:
          0.037919957 = score(doc=2737,freq=2.0), product of:
            0.16876608 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.04979191 = queryNorm
            0.22468945 = fieldWeight in 2737, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.046875 = fieldNorm(doc=2737)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

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.00446891 = product of:
  0.01787564 = sum of:
    0.01787564 = product of:
      0.03575128 = sum of:
        0.03575128 = weight(_text_:access in 2470) [ClassicSimilarity], result of:
          0.03575128 = score(doc=2470,freq=4.0), product of:
            0.16876608 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.04979191 = queryNorm
            0.21183924 = fieldWeight in 2470, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.03125 = fieldNorm(doc=2470)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Even for the experienced information professional, designing an efficient multi-purpose information access structure can be a very difficult task. This paper argues for the use of a faceted thesaurus as the basis for organizing a small-scale institutional website. We contend that a faceted approach to knowledge organization can make the process of organization less random and more manageable. We begin by reporting on an informal survey of three institutional websites. This study underscores the problems of organization that can impact access to information. We then formalize the terminology of faceted thesauri and demonstrate its application with several examples.

0.0031599966 = product of:
  0.012639986 = sum of:
    0.012639986 = product of:
      0.025279973 = sum of:
        0.025279973 = weight(_text_:access in 3291) [ClassicSimilarity], result of:
          0.025279973 = score(doc=3291,freq=2.0), product of:
            0.16876608 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.04979191 = queryNorm
            0.14979297 = fieldWeight in 3291, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.03125 = fieldNorm(doc=3291)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

The web is a network of linked sites whereby each site either forms a physical portal or a standalone page. In the former case, the portal presents an access point to its embedded web pages that coherently present a specific topic. In the latter case, there are millions of standalone web pages, that are scattered throughout the web, having the same topic and could be conceptually linked together to form virtual portals. Search engines have been developed to help users in reaching the adequate pages in an efficient and effective manner. All the known current search engine techniques rely on the web page as the basic atomic search unit. They ignore the conceptual links, that reveal the implicit web related meanings, among the retrieved pages. However, building a semantic model for the whole portal may contain more semantic information than a model of scattered individual pages. In addition, user queries can be poor and contain imprecise terms that do not reflect the real user intention. Consequently, retrieving the standalone individual pages that are directly related to the query may not satisfy the user's need. In this paper, we propose PREFCA, a Portal Retrieval Engine based on Formal Concept Analysis that relies on the portal as the main search unit. PREFCA consists of three phases: First, the information extraction phase that is concerned with extracting portal's semantic data. Second, the formal concept analysis phase that utilizes formal concept analysis to discover the conceptual links among portal and attributes. Finally, the information retrieval phase where we propose a portal ranking method to retrieve ranked pairs of portals and embedded pages. Additionally, we apply the network analysis rules to output some portal characteristics. We evaluated PREFCA using two data sets, namely the Forum for Information Retrieval Evaluation 2010 and ClueWeb09 (category B) test data, for physical and virtual portals respectively. PREFCA proves higher F-measure accuracy, better Mean Average Precision ranking and comparable network analysis and efficiency results than other search engine approaches, namely Term Frequency Inverse Document Frequency (TF-IDF), Latent Semantic Analysis (LSA), and BM25 techniques. As well, it gains high Mean Average Precision in comparison with learning to rank techniques. Moreover, PREFCA also gains better reach time than Carrot as a well-known topic-based search engine.