-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.23
0.23367935 = product of:
0.31157246 = sum of:
0.0732093 = product of:
0.21962789 = sum of:
0.21962789 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.21962789 = score(doc=562,freq=2.0), product of:
0.3907844 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046093877 = 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.21962789 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
0.21962789 = score(doc=562,freq=2.0), product of:
0.3907844 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046093877 = 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.018735252 = product of:
0.037470505 = sum of:
0.037470505 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.037470505 = score(doc=562,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.75 = coord(3/4)
- 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.03
0.030867463 = product of:
0.12346985 = sum of:
0.12346985 = sum of:
0.07975426 = weight(_text_:networks in 1673) [ClassicSimilarity], result of:
0.07975426 = score(doc=1673,freq=2.0), product of:
0.21802035 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046093877 = 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.04371559 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
0.04371559 = score(doc=1673,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 1. 8.1996 22:08:06
- Source
- Computer networks and ISDN systems. 30(1998) nos.1/7, S.646-648
-
Mukhopadhyay, S.; Peng, S.; Raje, R.; Palakal, M.; Mostafa, J.: Multi-agent information classification using dynamic acquaintance lists (2003)
0.02
0.020141672 = product of:
0.08056669 = sum of:
0.08056669 = weight(_text_:communication in 1755) [ClassicSimilarity], result of:
0.08056669 = score(doc=1755,freq=4.0), product of:
0.19902779 = queryWeight, product of:
4.317879 = idf(docFreq=1601, maxDocs=44218)
0.046093877 = queryNorm
0.4048012 = fieldWeight in 1755, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.317879 = idf(docFreq=1601, maxDocs=44218)
0.046875 = fieldNorm(doc=1755)
0.25 = coord(1/4)
- Abstract
- There has been considerable interest in recent years in providing automated information services, such as information classification, by means of a society of collaborative agents. These agents augment each other's knowledge structures (e.g., the vocabularies) and assist each other in providing efficient information services to a human user. However, when the number of agents present in the society increases, exhaustive communication and collaboration among agents result in a [arge communication overhead and increased delays in response time. This paper introduces a method to achieve selective interaction with a relatively small number of potentially useful agents, based an simple agent modeling and acquaintance lists. The key idea presented here is that the acquaintance list of an agent, representing a small number of other agents to be collaborated with, is dynamically adjusted. The best acquaintances are automatically discovered using a learning algorithm, based an the past history of collaboration. Experimental results are presented to demonstrate that such dynamically learned acquaintance lists can lead to high quality of classification, while significantly reducing the delay in response time.
-
Cathey, R.J.; Jensen, E.C.; Beitzel, S.M.; Frieder, O.; Grossman, D.: Exploiting parallelism to support scalable hierarchical clustering (2007)
0.01
0.011868593 = product of:
0.047474373 = sum of:
0.047474373 = weight(_text_:communication in 448) [ClassicSimilarity], result of:
0.047474373 = score(doc=448,freq=2.0), product of:
0.19902779 = queryWeight, product of:
4.317879 = idf(docFreq=1601, maxDocs=44218)
0.046093877 = queryNorm
0.23853138 = fieldWeight in 448, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.317879 = idf(docFreq=1601, maxDocs=44218)
0.0390625 = fieldNorm(doc=448)
0.25 = coord(1/4)
- Abstract
- A distributed memory parallel version of the group average hierarchical agglomerative clustering algorithm is proposed to enable scaling the document clustering problem to large collections. Using standard message passing operations reduces interprocess communication while maintaining efficient load balancing. In a series of experiments using a subset of a standard Text REtrieval Conference (TREC) test collection, our parallel hierarchical clustering algorithm is shown to be scalable in terms of processors efficiently used and the collection size. Results show that our algorithm performs close to the expected O(n**2/p) time on p processors rather than the worst-case O(n**3/p) time. Furthermore, the O(n**2/p) memory complexity per node allows larger collections to be clustered as the number of nodes increases. While partitioning algorithms such as k-means are trivially parallelizable, our results confirm those of other studies which showed that hierarchical algorithms produce significantly tighter clusters in the document clustering task. Finally, we show how our parallel hierarchical agglomerative clustering algorithm can be used as the clustering subroutine for a parallel version of the buckshot algorithm to cluster the complete TREC collection at near theoretical runtime expectations.
-
Ruiz, M.E.; Srinivasan, P.: Combining machine learning and hierarchical indexing structures for text categorization (2001)
0.01
0.009969283 = product of:
0.03987713 = sum of:
0.03987713 = product of:
0.07975426 = sum of:
0.07975426 = weight(_text_:networks in 1595) [ClassicSimilarity], result of:
0.07975426 = score(doc=1595,freq=2.0), product of:
0.21802035 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046093877 = 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.5 = coord(1/2)
0.25 = coord(1/4)
- 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.
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.01
0.009367626 = product of:
0.037470505 = sum of:
0.037470505 = product of:
0.07494101 = sum of:
0.07494101 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.07494101 = score(doc=1046,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 5. 5.2003 14:17:22
-
Denoyer, L.; Gallinari, P.: Bayesian network model for semi-structured document classification (2004)
0.01
0.008545099 = product of:
0.034180395 = sum of:
0.034180395 = product of:
0.06836079 = sum of:
0.06836079 = weight(_text_:networks in 995) [ClassicSimilarity], result of:
0.06836079 = score(doc=995,freq=2.0), product of:
0.21802035 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046093877 = 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.5 = coord(1/2)
0.25 = coord(1/4)
- 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.
-
Billal, B.; Fonseca, A.; Sadat, F.; Lounis, H.: Semi-supervised learning and social media text analysis towards multi-labeling categorization (2017)
0.01
0.008056397 = product of:
0.032225586 = sum of:
0.032225586 = product of:
0.06445117 = sum of:
0.06445117 = weight(_text_:networks in 4095) [ClassicSimilarity], result of:
0.06445117 = score(doc=4095,freq=4.0), product of:
0.21802035 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046093877 = 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.5 = coord(1/2)
0.25 = coord(1/4)
- 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.
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.01
0.0078063556 = product of:
0.031225422 = sum of:
0.031225422 = product of:
0.062450845 = sum of:
0.062450845 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.062450845 = score(doc=611,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 22. 8.2009 12:54:24
-
HaCohen-Kerner, Y. et al.: Classification using various machine learning methods and combinations of key-phrases and visual features (2016)
0.01
0.0078063556 = product of:
0.031225422 = sum of:
0.031225422 = product of:
0.062450845 = sum of:
0.062450845 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
0.062450845 = score(doc=2748,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = queryNorm
0.38690117 = fieldWeight in 2748, 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=2748)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 1. 2.2016 18:25:22
-
Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989)
0.01
0.0054644486 = product of:
0.021857794 = sum of:
0.021857794 = product of:
0.04371559 = sum of:
0.04371559 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
0.04371559 = score(doc=141,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Pages
- S.1-22
-
Dubin, D.: Dimensions and discriminability (1998)
0.01
0.0054644486 = product of:
0.021857794 = sum of:
0.021857794 = product of:
0.04371559 = sum of:
0.04371559 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
0.04371559 = score(doc=2338,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 22. 9.1997 19:16:05
-
Automatic classification research at OCLC (2002)
0.01
0.0054644486 = product of:
0.021857794 = sum of:
0.021857794 = product of:
0.04371559 = sum of:
0.04371559 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
0.04371559 = score(doc=1563,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = queryNorm
0.2708308 = fieldWeight in 1563, 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=1563)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 5. 5.2003 9:22:09
-
Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006)
0.01
0.0054644486 = product of:
0.021857794 = sum of:
0.021857794 = product of:
0.04371559 = sum of:
0.04371559 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.04371559 = score(doc=5273,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 22. 7.2006 16:24:52
-
Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007)
0.01
0.0054644486 = product of:
0.021857794 = sum of:
0.021857794 = product of:
0.04371559 = sum of:
0.04371559 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
0.04371559 = score(doc=2560,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 22. 9.2008 18:31:54
-
Liu, R.-L.: Context recognition for hierarchical text classification (2009)
0.00
0.004683813 = product of:
0.018735252 = sum of:
0.018735252 = product of:
0.037470505 = sum of:
0.037470505 = weight(_text_:22 in 2760) [ClassicSimilarity], result of:
0.037470505 = score(doc=2760,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 22. 3.2009 19:11:54
-
Pfeffer, M.: Automatische Vergabe von RVK-Notationen mittels fallbasiertem Schließen (2009)
0.00
0.004683813 = product of:
0.018735252 = sum of:
0.018735252 = product of:
0.037470505 = sum of:
0.037470505 = weight(_text_:22 in 3051) [ClassicSimilarity], result of:
0.037470505 = score(doc=3051,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = queryNorm
0.23214069 = fieldWeight in 3051, 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=3051)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 22. 8.2009 19:51:28
-
Zhu, W.Z.; Allen, R.B.: Document clustering using the LSI subspace signature model (2013)
0.00
0.004683813 = product of:
0.018735252 = sum of:
0.018735252 = product of:
0.037470505 = sum of:
0.037470505 = weight(_text_:22 in 690) [ClassicSimilarity], result of:
0.037470505 = score(doc=690,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 23. 3.2013 13:22:36
-
Egbert, J.; Biber, D.; Davies, M.: Developing a bottom-up, user-based method of web register classification (2015)
0.00
0.004683813 = product of:
0.018735252 = sum of:
0.018735252 = product of:
0.037470505 = sum of:
0.037470505 = weight(_text_:22 in 2158) [ClassicSimilarity], result of:
0.037470505 = score(doc=2158,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 4. 8.2015 19:22:04
-
Mengle, S.; Goharian, N.: Passage detection using text classification (2009)
0.00
0.0039031778 = product of:
0.015612711 = sum of:
0.015612711 = product of:
0.031225422 = sum of:
0.031225422 = weight(_text_:22 in 2765) [ClassicSimilarity], result of:
0.031225422 = score(doc=2765,freq=2.0), product of:
0.16141291 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046093877 = 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.25 = coord(1/4)
- Date
- 22. 3.2009 19:14:43
