Golub, K.: Automated subject classification of textual documents in the context of Web-based hierarchical browsing (2011)
0.00
0.0028568096 = product of:
0.028568096 = sum of:
0.028568096 = weight(_text_:web in 4558) [ClassicSimilarity], result of:
0.028568096 = score(doc=4558,freq=4.0), product of:
0.0933738 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.028611459 = queryNorm
0.3059541 = fieldWeight in 4558, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=4558)
0.1 = coord(1/10)
- Abstract
- While automated methods for information organization have been around for several decades now, exponential growth of the World Wide Web has put them into the forefront of research in different communities, within which several approaches can be identified: 1) machine learning (algorithms that allow computers to improve their performance based on learning from pre-existing data); 2) document clustering (algorithms for unsupervised document organization and automated topic extraction); and 3) string matching (algorithms that match given strings within larger text). Here the aim was to automatically organize textual documents into hierarchical structures for subject browsing. The string-matching approach was tested using a controlled vocabulary (containing pre-selected and pre-defined authorized terms, each corresponding to only one concept). The results imply that an appropriate controlled vocabulary, with a sufficient number of entry terms designating classes, could in itself be a solution for automated classification. Then, if the same controlled vocabulary had an appropriat hierarchical structure, it would at the same time provide a good browsing structure for the collection of automatically classified documents.
