Search (3 results, page 1 of 1)

  • × author_ss:"Voiskunskii, V.G."
  • × year_i:[1990 TO 2000}
  1. Frants, V.I.; Shapiro, J.; Voiskunskii, V.G.: Optimal search available to an individual user (1996) 0.02 
    0.020516803 = product of:
  0.05129201 = sum of:
    0.03399104 = product of:
      0.06798208 = sum of:
        0.06798208 = weight(_text_:problems in 7703) [ClassicSimilarity], result of:
          0.06798208 = score(doc=7703,freq=4.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.4514426 = fieldWeight in 7703, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7703)
      0.5 = coord(1/2)
    0.017300973 = product of:
      0.034601945 = sum of:
        0.034601945 = weight(_text_:22 in 7703) [ClassicSimilarity], result of:
          0.034601945 = score(doc=7703,freq=2.0), product of:
            0.12776221 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.036484417 = 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.4 = coord(2/5)
    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. Voiskunskii, V.G.: Evaluation of search results : a new approach (1997) 0.01 
    0.0067982078 = product of:
  0.03399104 = sum of:
    0.03399104 = product of:
      0.06798208 = sum of:
        0.06798208 = weight(_text_:problems in 7708) [ClassicSimilarity], result of:
          0.06798208 = score(doc=7708,freq=4.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.4514426 = fieldWeight in 7708, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7708)
      0.5 = coord(1/2)
  0.2 = coord(1/5)
    Abstract
    Considers a new approach to construction of single-valued measures for evaluation of search results. Based on the formation of certain vectors, and on the use of functions allowing the evaluation of their closeness. Constructs a single valued measure. A series of constructed measures has a property imprtant in practice, leading to the creation of a mechanism which would allow the selection of the best search method for every query. Gives a general statement of this property, called the order preservation property, and analyses all considered single-valued measures for this property. Discusses problems of the legitimacy of the use of single valued measures in various specific situations. Suggests an approach to the solution of these problems
  3. Frants, V.I.; Shapiro, J.; Taksa, I.; Voiskunskii, V.G.: Boolean search : current state and perspectives (1999) 0.00 
    0.0048070587 = product of:
  0.024035294 = sum of:
    0.024035294 = product of:
      0.048070587 = sum of:
        0.048070587 = weight(_text_:problems in 2954) [ClassicSimilarity], result of:
          0.048070587 = score(doc=2954,freq=2.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.31921813 = fieldWeight in 2954, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2954)
      0.5 = coord(1/2)
  0.2 = coord(1/5)
    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

Authors