Search (4 results, page 1 of 1)

  • × author_ss:"Frants, V.I."
  • × year_i:[1990 TO 2000}
  1. Frants, V.I.; Shapiro, J.; Voiskunskii, V.G.: Optimal search available to an individual user (1996) 0.06
    0.060176264 = product of:
      0.090264395 = sum of:
        0.0664249 = weight(_text_:search in 7703) [ClassicSimilarity], result of:
          0.0664249 = score(doc=7703,freq=4.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.38015217 = fieldWeight in 7703, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7703)
        0.0238395 = product of:
          0.047679 = sum of:
            0.047679 = weight(_text_:22 in 7703) [ClassicSimilarity], result of:
              0.047679 = score(doc=7703,freq=2.0), product of:
                0.17604718 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.05027291 = queryNorm
                0.2708308 = fieldWeight in 7703, 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=7703)
          0.5 = coord(1/2)
      0.6666667 = coord(2/3)
    
    Abstract
    Describes an approach to the design and implementation of an information retrieval system capable of providing an optimal search for each individual user. On the basis of the properties of information need, analyzes the pecularities of optimal searching in documentary information retrieval systems. Considers the problems arising from implementing optimal searching and proposes concrete solutions to some of these problems. Describes a simple and convenient methods of selecting the 'best result' and proposes an algorithm for organizing optimal searching for selective dissemination of information (SDI). This algorithm can be used, without substantial modification, in many systems capable of using different searching methods
    Source
    Journal of information science. 22(1996) no.3, S.181-191
  2. Frants, V.I.; Shapiro, J.; Taksa, I.; Voiskunskii, V.G.: Boolean search : current state and perspectives (1999) 0.02
    0.022141634 = product of:
      0.0664249 = sum of:
        0.0664249 = weight(_text_:search in 2954) [ClassicSimilarity], result of:
          0.0664249 = score(doc=2954,freq=4.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.38015217 = fieldWeight in 2954, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2954)
      0.33333334 = coord(1/3)
    
    Abstract
    Most of the operational information retrieval (IR) systems in existence today use Boolean logic during search. Such systems are usually called Boolean IR systems. These systems, as any other IR systems, are not perfect and the problem of their development (and hence providing better quality service for real users) is one of the most important problems in information science. From this viewpoint, the article analyzes existing criticisms of operational systems and points out some of their positive features. At the same time, certain negative effects which hinder the development of existing systems are considered. Finally, the article provides several conclusions about using Boolean logic in developing multiversion IR systems
  3. Frants, V.I.; Voiskunskii, V.G.; Shapiro, J.: Automated information retrieval : theory and methods (1997) 0.02
    0.018978544 = product of:
      0.056935627 = sum of:
        0.056935627 = weight(_text_:search in 1790) [ClassicSimilarity], result of:
          0.056935627 = score(doc=1790,freq=4.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.3258447 = fieldWeight in 1790, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=1790)
      0.33333334 = coord(1/3)
    
    Content
    The system and the systems approach - Vital activities and needs - Information crisis - Concept on an information retrieval system - Information retrieval language - Automatic indexing of documents - Automatic indexing of search requests - Storage and access to information - Control and feedback in IR systems - Evaluation of search results - Evaluation of macroevaluated objects - Some directions in the development of IR systems
  4. Frants, V.I.; Kamenoff, N.I.; Shapiro, J.: ¬One approach to classification of users and automatic clustering of documents (1993) 0.02
    0.017893143 = product of:
      0.053679425 = sum of:
        0.053679425 = weight(_text_:search in 4569) [ClassicSimilarity], result of:
          0.053679425 = score(doc=4569,freq=2.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.30720934 = fieldWeight in 4569, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0625 = fieldNorm(doc=4569)
      0.33333334 = coord(1/3)
    
    Abstract
    Shows how to automatically construct a classification of users and a clustering of documents on the basis of users' information needs by creating clusters of documents and cross-references among clusters using users' search requests. Examines feedback in the construction of this classification and clustering so that the classification can be changed over time to reflect the changing needs of the users