-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.15
0.14865604 = product of:
0.29731208 = sum of:
0.06985858 = product of:
0.20957573 = sum of:
0.20957573 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.20957573 = score(doc=562,freq=2.0), product of:
0.37289858 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.043984205 = 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.20957573 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
0.20957573 = score(doc=562,freq=2.0), product of:
0.37289858 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.043984205 = 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.017877758 = product of:
0.035755515 = sum of:
0.035755515 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.035755515 = score(doc=562,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = 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.5 = coord(3/6)
- 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
-
Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998)
0.06
0.05589337 = product of:
0.11178674 = sum of:
0.014825371 = weight(_text_:information in 1673) [ClassicSimilarity], result of:
0.014825371 = score(doc=1673,freq=4.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.1920054 = fieldWeight in 1673, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.07610398 = weight(_text_:networks in 1673) [ClassicSimilarity], result of:
0.07610398 = score(doc=1673,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.36581108 = fieldWeight in 1673, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.020857384 = product of:
0.04171477 = sum of:
0.04171477 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
0.04171477 = score(doc=1673,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.2708308 = fieldWeight in 1673, 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=1673)
0.5 = coord(1/2)
0.5 = coord(3/6)
- Abstract
- The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib
- Date
- 1. 8.1996 22:08:06
- Source
- Computer networks and ISDN systems. 30(1998) nos.1/7, S.646-648
-
Borko, H.: Research in computer based classification systems (1985)
0.04
0.042280298 = product of:
0.084560595 = sum of:
0.0052415603 = weight(_text_:information in 3647) [ClassicSimilarity], result of:
0.0052415603 = score(doc=3647,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.06788416 = fieldWeight in 3647, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.02734375 = fieldNorm(doc=3647)
0.05353194 = weight(_text_:united in 3647) [ClassicSimilarity], result of:
0.05353194 = score(doc=3647,freq=2.0), product of:
0.24675635 = queryWeight, product of:
5.6101127 = idf(docFreq=439, maxDocs=44218)
0.043984205 = queryNorm
0.2169425 = fieldWeight in 3647, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.6101127 = idf(docFreq=439, maxDocs=44218)
0.02734375 = fieldNorm(doc=3647)
0.025787095 = product of:
0.05157419 = sum of:
0.05157419 = weight(_text_:states in 3647) [ClassicSimilarity], result of:
0.05157419 = score(doc=3647,freq=2.0), product of:
0.24220218 = queryWeight, product of:
5.506572 = idf(docFreq=487, maxDocs=44218)
0.043984205 = queryNorm
0.21293859 = fieldWeight in 3647, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.506572 = idf(docFreq=487, maxDocs=44218)
0.02734375 = fieldNorm(doc=3647)
0.5 = coord(1/2)
0.5 = coord(3/6)
- Abstract
- The selection in this reader by R. M. Needham and K. Sparck Jones reports an early approach to automatic classification that was taken in England. The following selection reviews various approaches that were being pursued in the United States at about the same time. It then discusses a particular approach initiated in the early 1960s by Harold Borko, at that time Head of the Language Processing and Retrieval Research Staff at the System Development Corporation, Santa Monica, California and, since 1966, a member of the faculty at the Graduate School of Library and Information Science, University of California, Los Angeles. As was described earlier, there are two steps in automatic classification, the first being to identify pairs of terms that are similar by virtue of co-occurring as index terms in the same documents, and the second being to form equivalence classes of intersubstitutable terms. To compute similarities, Borko and his associates used a standard correlation formula; to derive classification categories, where Needham and Sparck Jones used clumping, the Borko team used the statistical technique of factor analysis. The fact that documents can be classified automatically, and in any number of ways, is worthy of passing notice. Worthy of serious attention would be a demonstra tion that a computer-based classification system was effective in the organization and retrieval of documents. One reason for the inclusion of the following selection in the reader is that it addresses the question of evaluation. To evaluate the effectiveness of their automatically derived classification, Borko and his team asked three questions. The first was Is the classification reliable? in other words, could the categories derived from one sample of texts be used to classify other texts? Reliability was assessed by a case-study comparison of the classes derived from three different samples of abstracts. The notso-surprising conclusion reached was that automatically derived classes were reliable only to the extent that the sample from which they were derived was representative of the total document collection. The second evaluation question asked whether the classification was reasonable, in the sense of adequately describing the content of the document collection. The answer was sought by comparing the automatically derived categories with categories in a related classification system that was manually constructed. Here the conclusion was that the automatic method yielded categories that fairly accurately reflected the major area of interest in the sample collection of texts; however, since there were only eleven such categories and they were quite broad, they could not be regarded as suitable for use in a university or any large general library. The third evaluation question asked whether automatic classification was accurate, in the sense of producing results similar to those obtainabie by human cIassifiers. When using human classification as a criterion, automatic classification was found to be 50 percent accurate.
-
Ruiz, M.E.; Srinivasan, P.: Combining machine learning and hierarchical indexing structures for text categorization (2001)
0.03
0.028862368 = product of:
0.0865871 = sum of:
0.010483121 = weight(_text_:information in 1595) [ClassicSimilarity], result of:
0.010483121 = score(doc=1595,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.13576832 = fieldWeight in 1595, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=1595)
0.07610398 = weight(_text_:networks in 1595) [ClassicSimilarity], result of:
0.07610398 = score(doc=1595,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.36581108 = fieldWeight in 1595, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0546875 = fieldNorm(doc=1595)
0.33333334 = coord(2/6)
- 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.
- Imprint
- Medford, NJ : Information Today
-
Denoyer, L.; Gallinari, P.: Bayesian network model for semi-structured document classification (2004)
0.03
0.028441414 = product of:
0.08532424 = sum of:
0.02009226 = weight(_text_:information in 995) [ClassicSimilarity], result of:
0.02009226 = score(doc=995,freq=10.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.2602176 = fieldWeight in 995, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=995)
0.06523198 = weight(_text_:networks in 995) [ClassicSimilarity], result of:
0.06523198 = score(doc=995,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.31355235 = fieldWeight in 995, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046875 = fieldNorm(doc=995)
0.33333334 = coord(2/6)
- Abstract
- Recently, a new community has started to emerge around the development of new information research methods for searching and analyzing semi-structured and XML like documents. The goal is to handle both content and structural information, and to deal with different types of information content (text, image, etc.). We consider here the task of structured document classification. We propose a generative model able to handle both structure and content which is based on Bayesian networks. We then show how to transform this generative model into a discriminant classifier using the method of Fisher kernel. The model is then extended for dealing with different types of content information (here text and images). The model was tested on three databases: the classical webKB corpus composed of HTML pages, the new INEX corpus which has become a reference in the field of ad-hoc retrieval for XML documents, and a multimedia corpus of Web pages.
- Source
- Information processing and management. 40(2004) no.5, S.807-827
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.01
0.014924051 = product of:
0.04477215 = sum of:
0.014975886 = weight(_text_:information in 611) [ClassicSimilarity], result of:
0.014975886 = score(doc=611,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.19395474 = fieldWeight in 611, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.078125 = fieldNorm(doc=611)
0.029796265 = product of:
0.05959253 = sum of:
0.05959253 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.05959253 = score(doc=611,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.38690117 = fieldWeight in 611, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=611)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Content
- Präsentation zum Vortrag anlässlich des 98. Deutscher Bibliothekartag in Erfurt: Ein neuer Blick auf Bibliotheken; TK10: Information erschließen und recherchieren Inhalte erschließen - mit neuen Tools
- Date
- 22. 8.2009 12:54:24
-
Dubin, D.: Dimensions and discriminability (1998)
0.01
0.013004894 = product of:
0.039014682 = sum of:
0.018157298 = weight(_text_:information in 2338) [ClassicSimilarity], result of:
0.018157298 = score(doc=2338,freq=6.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.23515764 = fieldWeight in 2338, 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=2338)
0.020857384 = product of:
0.04171477 = sum of:
0.04171477 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
0.04171477 = score(doc=2338,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.2708308 = fieldWeight in 2338, 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=2338)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Date
- 22. 9.1997 19:16:05
- Imprint
- Urbana-Champaign, IL : Illinois University at Urbana-Champaign, Graduate School of Library and Information Science
- Source
- Visualizing subject access for 21st century information resources: Papers presented at the 1997 Clinic on Library Applications of Data Processing, 2-4 Mar 1997, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign. Ed.: P.A. Cochrane et al
-
Liu, R.-L.: ¬A passage extractor for classification of disease aspect information (2013)
0.01
0.01156979 = product of:
0.034709368 = sum of:
0.019811235 = weight(_text_:information in 1107) [ClassicSimilarity], result of:
0.019811235 = score(doc=1107,freq=14.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.256578 = fieldWeight in 1107, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=1107)
0.0148981325 = product of:
0.029796265 = sum of:
0.029796265 = weight(_text_:22 in 1107) [ClassicSimilarity], result of:
0.029796265 = score(doc=1107,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.19345059 = fieldWeight in 1107, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=1107)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Retrieval of disease information is often based on several key aspects such as etiology, diagnosis, treatment, prevention, and symptoms of diseases. Automatic identification of disease aspect information is thus essential. In this article, I model the aspect identification problem as a text classification (TC) problem in which a disease aspect corresponds to a category. The disease aspect classification problem poses two challenges to classifiers: (a) a medical text often contains information about multiple aspects of a disease and hence produces noise for the classifiers and (b) text classifiers often cannot extract the textual parts (i.e., passages) about the categories of interest. I thus develop a technique, PETC (Passage Extractor for Text Classification), that extracts passages (from medical texts) for the underlying text classifiers to classify. Case studies on thousands of Chinese and English medical texts show that PETC enhances a support vector machine (SVM) classifier in classifying disease aspect information. PETC also performs better than three state-of-the-art classifier enhancement techniques, including two passage extraction techniques for text classifiers and a technique that employs term proximity information to enhance text classifiers. The contribution is of significance to evidence-based medicine, health education, and healthcare decision support. PETC can be used in those application domains in which a text to be classified may have several parts about different categories.
- Date
- 28.10.2013 19:22:57
- Source
- Journal of the American Society for Information Science and Technology. 64(2013) no.11, S.2265-2277
-
Liu, R.-L.: Context recognition for hierarchical text classification (2009)
0.01
0.011147052 = product of:
0.033441156 = sum of:
0.015563398 = weight(_text_:information in 2760) [ClassicSimilarity], result of:
0.015563398 = score(doc=2760,freq=6.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.20156369 = fieldWeight in 2760, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2760)
0.017877758 = product of:
0.035755515 = sum of:
0.035755515 = weight(_text_:22 in 2760) [ClassicSimilarity], result of:
0.035755515 = score(doc=2760,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.23214069 = fieldWeight in 2760, 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=2760)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Information is often organized as a text hierarchy. A hierarchical text-classification system is thus essential for the management, sharing, and dissemination of information. It aims to automatically classify each incoming document into zero, one, or several categories in the text hierarchy. In this paper, we present a technique called CRHTC (context recognition for hierarchical text classification) that performs hierarchical text classification by recognizing the context of discussion (COD) of each category. A category's COD is governed by its ancestor categories, whose contents indicate contextual backgrounds of the category. A document may be classified into a category only if its content matches the category's COD. CRHTC does not require any trials to manually set parameters, and hence is more portable and easier to implement than other methods. It is empirically evaluated under various conditions. The results show that CRHTC achieves both better and more stable performance than several hierarchical and nonhierarchical text-classification methodologies.
- Date
- 22. 3.2009 19:11:54
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.4, S.803-813
-
Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989)
0.01
0.010446835 = product of:
0.031340506 = sum of:
0.010483121 = weight(_text_:information in 141) [ClassicSimilarity], result of:
0.010483121 = score(doc=141,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.13576832 = fieldWeight in 141, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=141)
0.020857384 = product of:
0.04171477 = sum of:
0.04171477 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
0.04171477 = score(doc=141,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.2708308 = fieldWeight in 141, 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=141)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Pages
- S.1-22
-
Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006)
0.01
0.010446835 = product of:
0.031340506 = sum of:
0.010483121 = weight(_text_:information in 5273) [ClassicSimilarity], result of:
0.010483121 = score(doc=5273,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.13576832 = fieldWeight in 5273, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=5273)
0.020857384 = product of:
0.04171477 = sum of:
0.04171477 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.04171477 = score(doc=5273,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.2708308 = fieldWeight in 5273, 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=5273)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Date
- 22. 7.2006 16:24:52
- Source
- Journal of the American Society for Information Science and Technology. 57(2006) no.3, S.431-442
-
Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007)
0.01
0.010446835 = product of:
0.031340506 = sum of:
0.010483121 = weight(_text_:information in 2560) [ClassicSimilarity], result of:
0.010483121 = score(doc=2560,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.13576832 = fieldWeight in 2560, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=2560)
0.020857384 = product of:
0.04171477 = sum of:
0.04171477 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
0.04171477 = score(doc=2560,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.2708308 = fieldWeight in 2560, 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=2560)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- The proliferation of digital resources and their integration into a traditional library setting has created a pressing need for an automated tool that organizes textual information based on library classification schemes. Automated text classification is a research field of developing tools, methods, and models to automate text classification. This article describes the current popular approach for text classification and major text classification projects and applications that are based on library classification schemes. Related issues and challenges are discussed, and a number of considerations for the challenges are examined.
- Date
- 22. 9.2008 18:31:54
-
Billal, B.; Fonseca, A.; Sadat, F.; Lounis, H.: Semi-supervised learning and social media text analysis towards multi-labeling categorization (2017)
0.01
0.010250217 = product of:
0.0615013 = sum of:
0.0615013 = weight(_text_:networks in 4095) [ClassicSimilarity], result of:
0.0615013 = score(doc=4095,freq=4.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.29562 = fieldWeight in 4095, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.03125 = fieldNorm(doc=4095)
0.16666667 = coord(1/6)
- Abstract
- In traditional text classification, classes are mutually exclusive, i.e. it is not possible to have one text or text fragment classified into more than one class. On the other hand, in multi-label classification an individual text may belong to several classes simultaneously. This type of classification is required by a large number of current applications such as big data classification, images and video annotation. Supervised learning is the most used type of machine learning in the classification task. It requires large quantities of labeled data and the intervention of a human tagger in the creation of the training sets. When the data sets become very large or heavily noisy, this operation can be tedious, prone to error and time consuming. In this case, semi-supervised learning, which requires only few labels, is a better choice. In this paper, we study and evaluate several methods to address the problem of multi-label classification using semi-supervised learning and data from social networks. First, we propose a linguistic pre-processing involving tokeni-sation, recognition of named entities and hashtag segmentation in order to decrease the noise in this type of massive and unstructured real data and then we perform a word sense disambiguation using WordNet. Second, several experiments related to multi-label classification and semi-supervised learning are carried out on these data sets and compared to each other. These evaluations compare the results of the approaches considered. This paper proposes a method for combining semi-supervised methods with a graph method for the extraction of subjects in social networks using a multi-label classification approach. Experiments show that the performance of the proposed model increases in 4 p.p. the precision of the classification when compared to a baseline.
-
Mengle, S.; Goharian, N.: Passage detection using text classification (2009)
0.01
0.009958006 = product of:
0.02987402 = sum of:
0.014975886 = weight(_text_:information in 2765) [ClassicSimilarity], result of:
0.014975886 = score(doc=2765,freq=8.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.19395474 = fieldWeight in 2765, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.0148981325 = product of:
0.029796265 = sum of:
0.029796265 = weight(_text_:22 in 2765) [ClassicSimilarity], result of:
0.029796265 = score(doc=2765,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.19345059 = fieldWeight in 2765, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Passages can be hidden within a text to circumvent their disallowed transfer. Such release of compartmentalized information is of concern to all corporate and governmental organizations. Passage retrieval is well studied; we posit, however, that passage detection is not. Passage retrieval is the determination of the degree of relevance of blocks of text, namely passages, comprising a document. Rather than determining the relevance of a document in its entirety, passage retrieval determines the relevance of the individual passages. As such, modified traditional information-retrieval techniques compare terms found in user queries with the individual passages to determine a similarity score for passages of interest. In passage detection, passages are classified into predetermined categories. More often than not, passage detection techniques are deployed to detect hidden paragraphs in documents. That is, to hide information, documents are injected with hidden text into passages. Rather than matching query terms against passages to determine their relevance, using text-mining techniques, the passages are classified. Those documents with hidden passages are defined as infected. Thus, simply stated, passage retrieval is the search for passages relevant to a user query, while passage detection is the classification of passages. That is, in passage detection, passages are labeled with one or more categories from a set of predetermined categories. We present a keyword-based dynamic passage approach (KDP) and demonstrate that KDP outperforms statistically significantly (99% confidence) the other document-splitting approaches by 12% to 18% in the passage detection and passage category-prediction tasks. Furthermore, we evaluate the effects of the feature selection, passage length, ambiguous passages, and finally training-data category distribution on passage-detection accuracy.
- Date
- 22. 3.2009 19:14:43
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.4, S.814-825
-
Zhu, W.Z.; Allen, R.B.: Document clustering using the LSI subspace signature model (2013)
0.01
0.00895443 = product of:
0.026863288 = sum of:
0.0089855315 = weight(_text_:information in 690) [ClassicSimilarity], result of:
0.0089855315 = score(doc=690,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.116372846 = fieldWeight in 690, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=690)
0.017877758 = product of:
0.035755515 = sum of:
0.035755515 = weight(_text_:22 in 690) [ClassicSimilarity], result of:
0.035755515 = score(doc=690,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.23214069 = fieldWeight in 690, 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=690)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Date
- 23. 3.2013 13:22:36
- Source
- Journal of the American Society for Information Science and Technology. 64(2013) no.4, S.844-860
-
Egbert, J.; Biber, D.; Davies, M.: Developing a bottom-up, user-based method of web register classification (2015)
0.01
0.00895443 = product of:
0.026863288 = sum of:
0.0089855315 = weight(_text_:information in 2158) [ClassicSimilarity], result of:
0.0089855315 = score(doc=2158,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.116372846 = fieldWeight in 2158, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2158)
0.017877758 = product of:
0.035755515 = sum of:
0.035755515 = weight(_text_:22 in 2158) [ClassicSimilarity], result of:
0.035755515 = score(doc=2158,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.23214069 = fieldWeight in 2158, 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=2158)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Date
- 4. 8.2015 19:22:04
- Source
- Journal of the Association for Information Science and Technology. 66(2015) no.9, S.1817-1831
-
Khoo, C.S.G.; Ng, K.; Ou, S.: ¬An exploratory study of human clustering of Web pages (2003)
0.01
0.0074313683 = product of:
0.022294104 = sum of:
0.010375599 = weight(_text_:information in 2741) [ClassicSimilarity], result of:
0.010375599 = score(doc=2741,freq=6.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.1343758 = fieldWeight in 2741, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03125 = fieldNorm(doc=2741)
0.011918506 = product of:
0.023837011 = sum of:
0.023837011 = weight(_text_:22 in 2741) [ClassicSimilarity], result of:
0.023837011 = score(doc=2741,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.15476047 = fieldWeight in 2741, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=2741)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- This study seeks to find out how human beings cluster Web pages naturally. Twenty Web pages retrieved by the Northem Light search engine for each of 10 queries were sorted by 3 subjects into categories that were natural or meaningful to them. lt was found that different subjects clustered the same set of Web pages quite differently and created different categories. The average inter-subject similarity of the clusters created was a low 0.27. Subjects created an average of 5.4 clusters for each sorting. The categories constructed can be divided into 10 types. About 1/3 of the categories created were topical. Another 20% of the categories relate to the degree of relevance or usefulness. The rest of the categories were subject-independent categories such as format, purpose, authoritativeness and direction to other sources. The authors plan to develop automatic methods for categorizing Web pages using the common categories created by the subjects. lt is hoped that the techniques developed can be used by Web search engines to automatically organize Web pages retrieved into categories that are natural to users. 1. Introduction The World Wide Web is an increasingly important source of information for people globally because of its ease of access, the ease of publishing, its ability to transcend geographic and national boundaries, its flexibility and heterogeneity and its dynamic nature. However, Web users also find it increasingly difficult to locate relevant and useful information in this vast information storehouse. Web search engines, despite their scope and power, appear to be quite ineffective. They retrieve too many pages, and though they attempt to rank retrieved pages in order of probable relevance, often the relevant documents do not appear in the top-ranked 10 or 20 documents displayed. Several studies have found that users do not know how to use the advanced features of Web search engines, and do not know how to formulate and re-formulate queries. Users also typically exert minimal effort in performing, evaluating and refining their searches, and are unwilling to scan more than 10 or 20 items retrieved (Jansen, Spink, Bateman & Saracevic, 1998). This suggests that the conventional ranked-list display of search results does not satisfy user requirements, and that better ways of presenting and summarizing search results have to be developed. One promising approach is to group retrieved pages into clusters or categories to allow users to navigate immediately to the "promising" clusters where the most useful Web pages are likely to be located. This approach has been adopted by a number of search engines (notably Northem Light) and search agents.
- Date
- 12. 9.2004 9:56:22
-
Reiner, U.: Automatische DDC-Klassifizierung bibliografischer Titeldatensätze der Deutschen Nationalbibliografie (2009)
0.01
0.0059696203 = product of:
0.01790886 = sum of:
0.0059903543 = weight(_text_:information in 3284) [ClassicSimilarity], result of:
0.0059903543 = score(doc=3284,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.0775819 = fieldWeight in 3284, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03125 = fieldNorm(doc=3284)
0.011918506 = product of:
0.023837011 = sum of:
0.023837011 = weight(_text_:22 in 3284) [ClassicSimilarity], result of:
0.023837011 = score(doc=3284,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.15476047 = fieldWeight in 3284, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=3284)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Die Menge der zu klassifizierenden Veröffentlichungen steigt spätestens seit der Existenz des World Wide Web schneller an, als sie intellektuell sachlich erschlossen werden kann. Daher werden Verfahren gesucht, um die Klassifizierung von Textobjekten zu automatisieren oder die intellektuelle Klassifizierung zumindest zu unterstützen. Seit 1968 gibt es Verfahren zur automatischen Dokumentenklassifizierung (Information Retrieval, kurz: IR) und seit 1992 zur automatischen Textklassifizierung (ATC: Automated Text Categorization). Seit immer mehr digitale Objekte im World Wide Web zur Verfügung stehen, haben Arbeiten zur automatischen Textklassifizierung seit ca. 1998 verstärkt zugenommen. Dazu gehören seit 1996 auch Arbeiten zur automatischen DDC-Klassifizierung bzw. RVK-Klassifizierung von bibliografischen Titeldatensätzen und Volltextdokumenten. Bei den Entwicklungen handelt es sich unseres Wissens bislang um experimentelle und keine im ständigen Betrieb befindlichen Systeme. Auch das VZG-Projekt Colibri/DDC ist seit 2006 u. a. mit der automatischen DDC-Klassifizierung befasst. Die diesbezüglichen Untersuchungen und Entwicklungen dienen zur Beantwortung der Forschungsfrage: "Ist es möglich, eine inhaltlich stimmige DDC-Titelklassifikation aller GVK-PLUS-Titeldatensätze automatisch zu erzielen?"
- Date
- 22. 1.2010 14:41:24
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.01
0.005959253 = product of:
0.035755515 = sum of:
0.035755515 = product of:
0.07151103 = sum of:
0.07151103 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.07151103 = score(doc=1046,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.46428138 = fieldWeight in 1046, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=1046)
0.5 = coord(1/2)
0.16666667 = coord(1/6)
- Date
- 5. 5.2003 14:17:22
-
Panyr, J.: Automatische Klassifikation und Information Retrieval : Anwendung und Entwicklung komplexer Verfahren in Information-Retrieval-Systemen und ihre Evaluierung (1986)
0.01
0.005187799 = product of:
0.031126795 = sum of:
0.031126795 = weight(_text_:information in 32) [ClassicSimilarity], result of:
0.031126795 = score(doc=32,freq=6.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.40312737 = fieldWeight in 32, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.09375 = fieldNorm(doc=32)
0.16666667 = coord(1/6)
- Series
- Sprache und Information; Bd.12
