Search (6 results, page 1 of 1)

  • × theme_ss:"Formale Begriffsanalyse"
  • × type_ss:"a"
  • × year_i:[2000 TO 2010}
  1. Priss, U.: Faceted information representation (2000) 0.01 
    0.009460352 = product of:
  0.06622247 = sum of:
    0.058266878 = weight(_text_:representation in 5095) [ClassicSimilarity], result of:
      0.058266878 = score(doc=5095,freq=4.0), product of:
        0.11578492 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.025165197 = queryNorm
        0.50323373 = fieldWeight in 5095, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5095)
    0.007955586 = product of:
      0.023866756 = sum of:
        0.023866756 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.023866756 = score(doc=5095,freq=2.0), product of:
            0.08812423 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.025165197 = 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.14285715 = coord(2/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
  2. Priss, U.: Lattice-based information retrieval (2000) 0.00 
    0.0029429218 = product of:
  0.041200902 = sum of:
    0.041200902 = weight(_text_:representation in 6055) [ClassicSimilarity], result of:
      0.041200902 = score(doc=6055,freq=2.0), product of:
        0.11578492 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.025165197 = queryNorm
        0.35583997 = fieldWeight in 6055, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6055)
  0.071428575 = coord(1/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
  3. Burmeister, P.; Holzer, R.: On the treatment of incomplete knowledge in formal concept analysis (2000) 0.00 
    0.0025225044 = product of:
  0.03531506 = sum of:
    0.03531506 = weight(_text_:representation in 5085) [ClassicSimilarity], result of:
      0.03531506 = score(doc=5085,freq=2.0), product of:
        0.11578492 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.025165197 = queryNorm
        0.3050057 = fieldWeight in 5085, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.046875 = fieldNorm(doc=5085)
  0.071428575 = coord(1/14)
    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
  4. Carpineto, C.; Romano, G.: Order-theoretical ranking (2000) 0.00 
    0.0021020873 = product of:
  0.02942922 = sum of:
    0.02942922 = weight(_text_:representation in 4766) [ClassicSimilarity], result of:
      0.02942922 = score(doc=4766,freq=2.0), product of:
        0.11578492 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.025165197 = queryNorm
        0.25417143 = fieldWeight in 4766, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4766)
  0.071428575 = coord(1/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
  5. Hereth, J.; Stumme, G.; Wille, R.; Wille, U.: Conceptual knowledge discovery and data analysis (2000) 0.00 
    0.0021020873 = product of:
  0.02942922 = sum of:
    0.02942922 = weight(_text_:representation in 5083) [ClassicSimilarity], result of:
      0.02942922 = score(doc=5083,freq=2.0), product of:
        0.11578492 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.025165197 = queryNorm
        0.25417143 = fieldWeight in 5083, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5083)
  0.071428575 = coord(1/14)
    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
  6. Priss, U.: Formal concept analysis in information science (2006) 0.00 
    0.0013106616 = product of:
  0.01834926 = sum of:
    0.01834926 = product of:
      0.055047777 = sum of:
        0.055047777 = weight(_text_:29 in 4305) [ClassicSimilarity], result of:
          0.055047777 = score(doc=4305,freq=2.0), product of:
            0.08852329 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.025165197 = queryNorm
            0.6218451 = fieldWeight in 4305, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.125 = fieldNorm(doc=4305)
      0.33333334 = coord(1/3)
  0.071428575 = coord(1/14)
    Date
    13. 7.2008 19:29:59

Authors

Themes