Search (36 results, page 1 of 2)

  • × theme_ss:"Formale Begriffsanalyse"
  1. Negm, E.; AbdelRahman, S.; Bahgat, R.: PREFCA: a portal retrieval engine based on formal concept analysis (2017) 0.02 
    0.01827754 = product of:
  0.06397139 = sum of:
    0.028331855 = weight(_text_:web in 3291) [ClassicSimilarity], result of:
      0.028331855 = score(doc=3291,freq=12.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.35328537 = fieldWeight in 3291, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=3291)
    0.007483506 = weight(_text_:information in 3291) [ClassicSimilarity], result of:
      0.007483506 = score(doc=3291,freq=10.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.1734784 = fieldWeight in 3291, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=3291)
    0.01987402 = weight(_text_:retrieval in 3291) [ClassicSimilarity], result of:
      0.01987402 = score(doc=3291,freq=8.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.26736724 = fieldWeight in 3291, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03125 = fieldNorm(doc=3291)
    0.008282016 = product of:
      0.024846047 = sum of:
        0.024846047 = weight(_text_:2010 in 3291) [ClassicSimilarity], result of:
          0.024846047 = score(doc=3291,freq=2.0), product of:
            0.117538005 = queryWeight, product of:
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.024573348 = queryNorm
            0.21138735 = fieldWeight in 3291, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.03125 = fieldNorm(doc=3291)
      0.33333334 = coord(1/3)
  0.2857143 = coord(4/14)
    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.
    Source
    Information processing and management. 53(2017) no.1, S.203-222
  2. De Maio, C.; Fenza, G.; Loia, V.; Senatore, S.: Hierarchical web resources retrieval by exploiting Fuzzy Formal Concept Analysis (2012) 0.01 
    0.013492942 = product of:
  0.06296706 = sum of:
    0.030050473 = weight(_text_:web in 2737) [ClassicSimilarity], result of:
      0.030050473 = score(doc=2737,freq=6.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.37471575 = fieldWeight in 2737, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2737)
    0.007099477 = weight(_text_:information in 2737) [ClassicSimilarity], result of:
      0.007099477 = score(doc=2737,freq=4.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.16457605 = fieldWeight in 2737, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2737)
    0.02581711 = weight(_text_:retrieval in 2737) [ClassicSimilarity], result of:
      0.02581711 = score(doc=2737,freq=6.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.34732026 = fieldWeight in 2737, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=2737)
  0.21428572 = coord(3/14)
    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.
    Content
    Beitrag in einem Themenheft "Soft Approaches to IA on the Web". Vgl.: doi:10.1016/j.ipm.2011.04.003.
    Source
    Information processing and management. 48(2012) no.3, S.399-418
  3. Wille, R.; Wachter, C.: Begriffsanalyse von Dokumenten (1992) 0.01 
    0.009474369 = product of:
  0.066320576 = sum of:
    0.010040177 = weight(_text_:information in 341) [ClassicSimilarity], result of:
      0.010040177 = score(doc=341,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.23274569 = fieldWeight in 341, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=341)
    0.0562804 = weight(_text_:frankfurt in 341) [ClassicSimilarity], result of:
      0.0562804 = score(doc=341,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.55104816 = fieldWeight in 341, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.09375 = fieldNorm(doc=341)
  0.14285715 = coord(2/14)
    Imprint
    Frankfurt am Main : DGD
    Source
    Information und Dokumentation in den 90er Jahren: neue Herausforderung, neue Technologien. Deutscher Dokumentartag 1991, Universität Ulm, 30.9.-2.10.1991. Hrsg.: W. Neubauer u. K.-H. Meier
  4. Skorsky, M.: Graphische Darstellung eines Thesaurus (1997) 0.01 
    0.009474369 = product of:
  0.066320576 = sum of:
    0.010040177 = weight(_text_:information in 1051) [ClassicSimilarity], result of:
      0.010040177 = score(doc=1051,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.23274569 = fieldWeight in 1051, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=1051)
    0.0562804 = weight(_text_:frankfurt in 1051) [ClassicSimilarity], result of:
      0.0562804 = score(doc=1051,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.55104816 = fieldWeight in 1051, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.09375 = fieldNorm(doc=1051)
  0.14285715 = coord(2/14)
    Imprint
    Frankfurt : DGD
    Source
    Information und Dokumentation: Qualität und Qualifikation. Deutscher Dokumentartag 1997, Universität Regensburg, 24.-26.9.1997. Hrsg.: M. Ockenfeld u. G.J. Mantwill
  5. Conceptual structures : logical, linguistic, and computational issues. 8th International Conference on Conceptual Structures, ICCS 2000, Darmstadt, Germany, August 14-18, 2000 (2000) 0.01 
    0.008148367 = product of:
  0.057038564 = sum of:
    0.007452757 = weight(_text_:retrieval in 691) [ClassicSimilarity], result of:
      0.007452757 = score(doc=691,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.10026272 = fieldWeight in 691, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0234375 = fieldNorm(doc=691)
    0.049585808 = weight(_text_:kongress in 691) [ClassicSimilarity], result of:
      0.049585808 = score(doc=691,freq=4.0), product of:
        0.16122791 = queryWeight, product of:
          6.5610886 = idf(docFreq=169, maxDocs=44218)
          0.024573348 = queryNorm
        0.30755103 = fieldWeight in 691, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          6.5610886 = idf(docFreq=169, maxDocs=44218)
          0.0234375 = fieldNorm(doc=691)
  0.14285715 = coord(2/14)
    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)
    RSWK
    Begriffsgraph / Kongress / Darmstadt <2000>
    Subject
    Begriffsgraph / Kongress / Darmstadt <2000>
  6. Priss, U.: Faceted information representation (2000) 0.01 
    0.0071659223 = product of:
  0.03344097 = sum of:
    0.008282723 = weight(_text_:information in 5095) [ClassicSimilarity], result of:
      0.008282723 = score(doc=5095,freq=4.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.1920054 = fieldWeight in 5095, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5095)
    0.017389767 = weight(_text_:retrieval in 5095) [ClassicSimilarity], result of:
      0.017389767 = score(doc=5095,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.23394634 = fieldWeight in 5095, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5095)
    0.007768482 = product of:
      0.023305446 = sum of:
        0.023305446 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.023305446 = score(doc=5095,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = 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.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    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
  7. Priss, U.: Faceted knowledge representation (1999) 0.01 
    0.0066460758 = product of:
  0.03101502 = sum of:
    0.00585677 = weight(_text_:information in 2654) [ClassicSimilarity], result of:
      0.00585677 = score(doc=2654,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.13576832 = fieldWeight in 2654, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2654)
    0.017389767 = weight(_text_:retrieval in 2654) [ClassicSimilarity], result of:
      0.017389767 = score(doc=2654,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.23394634 = fieldWeight in 2654, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2654)
    0.007768482 = product of:
      0.023305446 = sum of:
        0.023305446 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.023305446 = score(doc=2654,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = 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.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    Abstract
    Faceted Knowledge Representation provides a formalism for implementing knowledge systems. The basic notions of faceted knowledge representation are "unit", "relation", "facet" and "interpretation". Units are atomic elements and can be abstract elements or refer to external objects in an application. Relations are sequences or matrices of 0 and 1's (binary matrices). Facets are relational structures that combine units and relations. Each facet represents an aspect or viewpoint of a knowledge system. Interpretations are mappings that can be used to translate between different representations. This paper introduces the basic notions of faceted knowledge representation. The formalism is applied here to an abstract modeling of a faceted thesaurus as used in information retrieval.
    Date
    22. 1.2016 17:30:31
  8. Priss, U.; Jacob, E.: Utilizing faceted structures for information systems design (1999) 0.01 
    0.0058060116 = product of:
  0.04064208 = sum of:
    0.030601902 = weight(_text_:web in 2470) [ClassicSimilarity], result of:
      0.030601902 = score(doc=2470,freq=14.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.38159183 = fieldWeight in 2470, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=2470)
    0.010040176 = weight(_text_:information in 2470) [ClassicSimilarity], result of:
      0.010040176 = score(doc=2470,freq=18.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.23274568 = fieldWeight in 2470, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=2470)
  0.14285715 = coord(2/14)
    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.
    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.
    Imprint
    Medford, NJ : Information Today
    Series
    Proceedings of the American Society for Information Science; vol.36
    Source
    Knowledge: creation, organization and use. Proceedings of the 62nd Annual Meeting of the American Society for Information Science, 31.10.-4.11.1999. Ed.: L. Woods
  9. Priss, U.: Lattice-based information retrieval (2000) 0.01 
    0.005752026 = product of:
  0.04026418 = sum of:
    0.010144223 = weight(_text_:information in 6055) [ClassicSimilarity], result of:
      0.010144223 = score(doc=6055,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.23515764 = fieldWeight in 6055, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6055)
    0.03011996 = weight(_text_:retrieval in 6055) [ClassicSimilarity], result of:
      0.03011996 = score(doc=6055,freq=6.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.40520695 = fieldWeight in 6055, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6055)
  0.14285715 = coord(2/14)
    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
  10. Kumar, C.A.; Radvansky, M.; Annapurna, J.: Analysis of Vector Space Model, Latent Semantic Indexing and Formal Concept Analysis for information retrieval (2012) 0.01 
    0.005186626 = product of:
  0.03630638 = sum of:
    0.01171354 = weight(_text_:information in 2710) [ClassicSimilarity], result of:
      0.01171354 = score(doc=2710,freq=8.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.27153665 = fieldWeight in 2710, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2710)
    0.024592843 = weight(_text_:retrieval in 2710) [ClassicSimilarity], result of:
      0.024592843 = score(doc=2710,freq=4.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.33085006 = fieldWeight in 2710, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2710)
  0.14285715 = coord(2/14)
    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.
    Source
    Cybernetics and information technologies. 12(2012) no.1, S.34-48
  11. Neuss, C.; Kent, R.E.: Conceptual analysis of resource meta-information (1995) 0.01 
    0.005181366 = product of:
  0.03626956 = sum of:
    0.01639554 = weight(_text_:information in 2204) [ClassicSimilarity], result of:
      0.01639554 = score(doc=2204,freq=12.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.38007212 = fieldWeight in 2204, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=2204)
    0.01987402 = weight(_text_:retrieval in 2204) [ClassicSimilarity], result of:
      0.01987402 = score(doc=2204,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.26736724 = fieldWeight in 2204, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=2204)
  0.14285715 = coord(2/14)
    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
  12. Ganter, B.; Wille, R.: Implikationen und Abhängigkeiten zwischen Merkmalen (1986) 0.00 
    0.0040200287 = product of:
  0.0562804 = sum of:
    0.0562804 = weight(_text_:frankfurt in 5448) [ClassicSimilarity], result of:
      0.0562804 = score(doc=5448,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.55104816 = fieldWeight in 5448, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.09375 = fieldNorm(doc=5448)
  0.071428575 = coord(1/14)
    Imprint
    Frankfurt : Indeks
  13. Skorsky, M.: How to draw a concept lattice with parallelograms (1989) 0.00 
    0.0040200287 = product of:
  0.0562804 = sum of:
    0.0562804 = weight(_text_:frankfurt in 592) [ClassicSimilarity], result of:
      0.0562804 = score(doc=592,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.55104816 = fieldWeight in 592, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.09375 = fieldNorm(doc=592)
  0.071428575 = coord(1/14)
    Imprint
    Frankfurt : Indeks
  14. Wille, R.: Liniendiagramme hierarchischer Begriffssysteme (1984) 0.00 
    0.0040200287 = product of:
  0.0562804 = sum of:
    0.0562804 = weight(_text_:frankfurt in 593) [ClassicSimilarity], result of:
      0.0562804 = score(doc=593,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.55104816 = fieldWeight in 593, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.09375 = fieldNorm(doc=593)
  0.071428575 = coord(1/14)
    Imprint
    Frankfurt : Indeks
  15. Skorsky, M.: Dokumentensammlungen : Strukturiert und recherchiert mit TOSKANA (1996) 0.00 
    0.0040200287 = product of:
  0.0562804 = sum of:
    0.0562804 = weight(_text_:frankfurt in 5261) [ClassicSimilarity], result of:
      0.0562804 = score(doc=5261,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.55104816 = fieldWeight in 5261, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.09375 = fieldNorm(doc=5261)
  0.071428575 = coord(1/14)
    Imprint
    Frankfurt a.M. : DGD
  16. Kaytoue, M.; Kuznetsov, S.O.; Assaghir, Z.; Napoli, A.: Embedding tolerance relations in concept lattices : an application in information fusion (2010) 0.00 
    0.0028464387 = product of:
  0.019925069 = sum of:
    0.007245874 = weight(_text_:information in 4843) [ClassicSimilarity], result of:
      0.007245874 = score(doc=4843,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.16796975 = fieldWeight in 4843, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4843)
    0.012679196 = product of:
      0.038037587 = sum of:
        0.038037587 = weight(_text_:2010 in 4843) [ClassicSimilarity], result of:
          0.038037587 = score(doc=4843,freq=3.0), product of:
            0.117538005 = queryWeight, product of:
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.024573348 = queryNorm
            0.32361948 = fieldWeight in 4843, product of:
              1.7320508 = tf(freq=3.0), with freq of:
                3.0 = termFreq=3.0
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4843)
      0.33333334 = coord(1/3)
  0.14285715 = coord(2/14)
    Abstract
    Formal Concept Analysis (FCA) is a well founded mathematical framework used for conceptual classication and knowledge management. Given a binary table describing a relation between objects and attributes, FCA consists in building a set of concepts organized by a subsumption relation within a concept lattice. Accordingly, FCA requires to transform complex data, e.g. numbers, intervals, graphs, into binary data leading to loss of information and poor interpretability of object classes. In this paper, we propose a pre-processing method producing binary data from complex data taking advantage of similarity between objects. As a result, the concept lattice is composed of classes being maximal sets of pairwise similar objects. This method is based on FCA and on a formalization of similarity as a tolerance relation (reexive and symmetric). It applies to complex object descriptions and especially here to interval data. Moreover, it can be applied to any kind of structured data for which a similarity can be dened (sequences, graphs, etc.). Finally, an application highlights that the resulting concept lattice plays an important role in information fusion problem, as illustrated with a real-world example in agronomy.
    Year
    2010
  17. Carpineto, C.; Romano, G.: Order-theoretical ranking (2000) 0.00 
    0.0028095911 = product of:
  0.019667137 = sum of:
    0.007245874 = weight(_text_:information in 4766) [ClassicSimilarity], result of:
      0.007245874 = score(doc=4766,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.16796975 = fieldWeight in 4766, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4766)
    0.012421262 = weight(_text_:retrieval in 4766) [ClassicSimilarity], result of:
      0.012421262 = score(doc=4766,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.16710453 = fieldWeight in 4766, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4766)
  0.14285715 = coord(2/14)
    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
    Source
    Journal of the American Society for Information Science. 51(2000) no.7, S.587-601
  18. Kipke, U.; Wille, R.: Begriffsverbände als Ablaufschemata zur Gegenstandsbestimmung (1986) 0.00 
    0.0026800195 = product of:
  0.03752027 = sum of:
    0.03752027 = weight(_text_:frankfurt in 3039) [ClassicSimilarity], result of:
      0.03752027 = score(doc=3039,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.36736545 = fieldWeight in 3039, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.0625 = fieldNorm(doc=3039)
  0.071428575 = coord(1/14)
    Imprint
    Frankfurt : Indeks
  19. Sedelow, S.Y.; Sedelow, W.A.: Thesauri and concept-lattice semantic nets (1994) 0.00 
    0.0026800195 = product of:
  0.03752027 = sum of:
    0.03752027 = weight(_text_:frankfurt in 7733) [ClassicSimilarity], result of:
      0.03752027 = score(doc=7733,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.36736545 = fieldWeight in 7733, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.0625 = fieldNorm(doc=7733)
  0.071428575 = coord(1/14)
    Imprint
    Frankfurt : INDEKS
  20. Kent, R.E.: Implications and rules in thesauri (1994) 0.00 
    0.0026800195 = product of:
  0.03752027 = sum of:
    0.03752027 = weight(_text_:frankfurt in 3457) [ClassicSimilarity], result of:
      0.03752027 = score(doc=3457,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.36736545 = fieldWeight in 3457, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.0625 = fieldNorm(doc=3457)
  0.071428575 = coord(1/14)
    Imprint
    Frankfurt : INDEKS

Authors

Years

Languages

  • e 25
  • d 10

Types

  • a 29
  • m 5
  • s 3
  • el 1
  • r 1
  • More… Less…

Themes

Subjects

Classifications