Hillman, D.J.: Mathematical classification techniques for nonstatic document collections, with particular reference to the problem of relevance (1965)
0.00
0.001674345 = product of:
0.00334869 = sum of:
0.00334869 = product of:
0.00669738 = sum of:
0.00669738 = weight(_text_:a in 5516) [ClassicSimilarity], result of:
0.00669738 = score(doc=5516,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.12611452 = fieldWeight in 5516, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=5516)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- It is first argued that classification schemes have an essentially hypothetical nature, whose adoption is not anything which can be true or false. Such schemes are therefore corrigible and susceptible of modification as fresh data accrue. These schemes are tools for the logical analysis of the structure of recorded knowledge. Their use amount to the adoption of a hypothesis. ... It is therefore imperative that classification schemes be devised which do allow us to deal with sets of documents that change with time. The formal bases of two such schemes are next described. They are known, respectively, as implicative lattices and subtractive lattices ...
- Type
- a
