Search (2 results, page 1 of 1)

  • × author_ss:"Soergel, D."
  1. Komlodi, A.; Soergel, D.; Marchionini, G.: Search histories for user support in user interfaces (2006) 0.06
    0.06177877 = product of:
      0.12355754 = sum of:
        0.067414425 = weight(_text_:storage in 5298) [ClassicSimilarity], result of:
          0.067414425 = score(doc=5298,freq=2.0), product of:
            0.1866346 = queryWeight, product of:
              5.4488444 = idf(docFreq=516, maxDocs=44218)
              0.034252144 = queryNorm
            0.36121076 = fieldWeight in 5298, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4488444 = idf(docFreq=516, maxDocs=44218)
              0.046875 = fieldNorm(doc=5298)
        0.020776404 = weight(_text_:retrieval in 5298) [ClassicSimilarity], result of:
          0.020776404 = score(doc=5298,freq=2.0), product of:
            0.10360982 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.034252144 = queryNorm
            0.20052543 = fieldWeight in 5298, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=5298)
        0.021444622 = weight(_text_:systems in 5298) [ClassicSimilarity], result of:
          0.021444622 = score(doc=5298,freq=2.0), product of:
            0.10526281 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.034252144 = queryNorm
            0.2037246 = fieldWeight in 5298, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.046875 = fieldNorm(doc=5298)
        0.013922078 = product of:
          0.027844155 = sum of:
            0.027844155 = weight(_text_:22 in 5298) [ClassicSimilarity], result of:
              0.027844155 = score(doc=5298,freq=2.0), product of:
                0.119945176 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.034252144 = queryNorm
                0.23214069 = fieldWeight in 5298, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.046875 = fieldNorm(doc=5298)
          0.5 = coord(1/2)
      0.5 = coord(4/8)
    
    Abstract
    The authors describe user interface tools based on search histories to support legal information seekers. The design of the tools was informed by the results of a user study (Komlodi, 2002a) that examined the use of human memory, external memory aids, and search histories in legal information seeking and derived interface design recommendations for information storage and retrieval systems. The data collected were analyzed to identify potential task areas where search histories can support information seeking and use. The results show that many information-seeking tasks can take advantage of automatically and manually recorded history information. These findings encouraged the design of user interface tools building on search history information: direct search history displays, history-enabled scratchpad facilities, and organized results collection tools.
    Date
    22. 7.2006 18:04:19
  2. Soergel, D.: Mathematical analysis of documentation systems : an attempt to a theory of classification and search request formulation (1967) 0.04
    0.040753707 = product of:
      0.10867655 = sum of:
        0.05617869 = weight(_text_:storage in 5449) [ClassicSimilarity], result of:
          0.05617869 = score(doc=5449,freq=2.0), product of:
            0.1866346 = queryWeight, product of:
              5.4488444 = idf(docFreq=516, maxDocs=44218)
              0.034252144 = queryNorm
            0.30100897 = fieldWeight in 5449, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4488444 = idf(docFreq=516, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5449)
        0.03462734 = weight(_text_:retrieval in 5449) [ClassicSimilarity], result of:
          0.03462734 = score(doc=5449,freq=8.0), product of:
            0.10360982 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.034252144 = queryNorm
            0.33420905 = fieldWeight in 5449, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5449)
        0.01787052 = weight(_text_:systems in 5449) [ClassicSimilarity], result of:
          0.01787052 = score(doc=5449,freq=2.0), product of:
            0.10526281 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.034252144 = queryNorm
            0.1697705 = fieldWeight in 5449, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5449)
      0.375 = coord(3/8)
    
    Abstract
    As an attempt to make a general structural theory of information retrieval, a documentation system (DS) is defined as a formal system consisting of (a) a set o of objects (documents); (b) a set A++ of elementary attributes (key-words), from which further attributes may be constructed: A++ generates A; (c) a set of axioms of the form X++(x)=m (m¯M, M a set of constant connecting attributes with objects: from the axioms further theorems (=true statements) may be constructed. By use of the theorems, different mappings O -> P(o) (P(o) set of all subsets of o) (search question -> set of documents retrieved) are defined. The type of a DS depends on two basic decisions: (1) choice of the rules for the construction of attributes and theorems, e.g., logical product in coordinate indexing; links. (2) choice of M; M may consist of the two constants 'applicable' and 'not applicable', or some positive integers, ...; Further practical decisions: A++ hierarchical or not; kind of mapping; introduction of roles (=further attributes). The most simple case - ordinary two-valued Coordinate Indexing - is discusssed in detail; o is a free distributive (but not Boolean) lattice, the homographic image a ring of subsets of o; instead of negation which is not useful, a useful retrieval operation 'praeternagation' is introduced. Furthermore these are discussed: a generalized definition of superimposed coding, some functions for the distance of objects or attributes; optimization and automatic derivation of classifications. The model takes into account term-term relations and document-document relations. It may serve as a structural framework in terms of which the functional problems of retrieval theory may be expressed more clearly
    Source
    Information storage and retrieval. 3(1967), S.129-173