Search (1 results, page 1 of 1)

  • × author_ss:"Srinivasan, P."
  • × theme_ss:"Retrievalalgorithmen"
  • × year_i:[1980 TO 1990}
  1. Srinivasan, P.: Intelligent information retrieval using rough set approximations (1989) 0.00
    3.987516E-4 = product of:
      0.005981274 = sum of:
        0.005981274 = product of:
          0.011962548 = sum of:
            0.011962548 = weight(_text_:information in 2526) [ClassicSimilarity], result of:
              0.011962548 = score(doc=2526,freq=6.0), product of:
                0.050870337 = queryWeight, product of:
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.028978055 = queryNorm
                0.23515764 = fieldWeight in 2526, 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=2526)
          0.5 = coord(1/2)
      0.06666667 = coord(1/15)
    
    Abstract
    The theory of rough sets was introduced in 1982. It allows the classification of objects into sets of equivalent members based on their attributes. Any combination of the same objetcts (or even their attributes) may be examined using the resultant classification. The theory has direct applications in the design and evaluation of classification schemes and the selection of discriminating attributes. Introductory papers discuss its application in the domain of medical diagnostic systems and the design of information retrieval systems accessing collections of documents. Advantages offered by the theory are: the implicit inclusion of Boolean logic; term weighting; and the ability to rank retrieved documents.
    Source
    Information processing and management. 25(1989) no.4, S.347-361