-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.07
0.066071495 = product of:
0.099107236 = sum of:
0.07891247 = product of:
0.2367374 = sum of:
0.2367374 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.2367374 = score(doc=562,freq=2.0), product of:
0.4212274 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.049684696 = queryNorm
0.56201804 = fieldWeight in 562, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=562)
0.33333334 = coord(1/3)
0.02019477 = product of:
0.04038954 = sum of:
0.04038954 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.04038954 = score(doc=562,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = queryNorm
0.23214069 = fieldWeight in 562, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=562)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Content
- Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.
- Date
- 8. 1.2013 10:22:32
-
Ruiz, M.E.; Srinivasan, P.: Combining machine learning and hierarchical indexing structures for text categorization (2001)
0.01
0.013270989 = product of:
0.039812967 = sum of:
0.039812967 = product of:
0.079625934 = sum of:
0.079625934 = weight(_text_:indexing in 1595) [ClassicSimilarity], result of:
0.079625934 = score(doc=1595,freq=4.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.41867304 = fieldWeight in 1595, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.0546875 = fieldNorm(doc=1595)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- This paper presents a method that exploits the hierarchical structure of an indexing vocabulary to guide the development and training of machine learning methods for automatic text categorization. We present the design of a hierarchical classifier based an the divide-and-conquer principle. The method is evaluated using backpropagation neural networks, such as the machine learning algorithm, that leam to assign MeSH categories to a subset of MEDLINE records. Comparisons with traditional Rocchio's algorithm adapted for text categorization, as well as flat neural network classifiers, are provided. The results indicate that the use of hierarchical structures improves Performance significantly.
-
Sebastiani, F.: ¬A tutorial an automated text categorisation (1999)
0.01
0.0080434345 = product of:
0.024130303 = sum of:
0.024130303 = product of:
0.048260607 = sum of:
0.048260607 = weight(_text_:indexing in 3390) [ClassicSimilarity], result of:
0.048260607 = score(doc=3390,freq=2.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.2537542 = fieldWeight in 3390, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.046875 = fieldNorm(doc=3390)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- The automated categorisation (or classification) of texts into topical categories has a long history, dating back at least to 1960. Until the late '80s, the dominant approach to the problem involved knowledge-engineering automatic categorisers, i.e. manually building a set of rules encoding expert knowledge an how to classify documents. In the '90s, with the booming production and availability of on-line documents, automated text categorisation has witnessed an increased and renewed interest. A newer paradigm based an machine learning has superseded the previous approach. Within this paradigm, a general inductive process automatically builds a classifier by "learning", from a set of previously classified documents, the characteristics of one or more categories; the advantages are a very good effectiveness, a considerable savings in terms of expert manpower, and domain independence. In this tutorial we look at the main approaches that have been taken towards automatic text categorisation within the general machine learning paradigm. Issues of document indexing, classifier construction, and classifier evaluation, will be touched upon.
