-
Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006)
0.11
0.10669494 = product of:
0.21338987 = sum of:
0.21338987 = sum of:
0.16601379 = weight(_text_:tree in 5273) [ClassicSimilarity], result of:
0.16601379 = score(doc=5273,freq=2.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.5069797 = fieldWeight in 5273, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.0546875 = fieldNorm(doc=5273)
0.047376085 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.047376085 = score(doc=5273,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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)
- Abstract
- In text categorization tasks, classification on some class hierarchies has better results than in cases without the hierarchy. Currently, because a large number of documents are divided into several subgroups in a hierarchy, we can appropriately use a hierarchical classification method. However, we have no systematic method to build a hierarchical classification system that performs well with large collections of practical data. In this article, we introduce a new evaluation scheme for internal node classifiers, which can be used effectively to develop a hierarchical classification system. We also show that our method for constructing the hierarchical classification system is very effective, especially for the task of constructing classifiers applied to hierarchy tree with a lot of levels.
- Date
- 22. 7.2006 16:24:52
-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.10
0.09964347 = sum of:
0.07933943 = product of:
0.23801827 = sum of:
0.23801827 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.23801827 = score(doc=562,freq=2.0), product of:
0.42350647 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.049953517 = 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.020304035 = product of:
0.04060807 = sum of:
0.04060807 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.04060807 = score(doc=562,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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)
- 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
-
Egbert, J.; Biber, D.; Davies, M.: Developing a bottom-up, user-based method of web register classification (2015)
0.09
0.09145281 = product of:
0.18290561 = sum of:
0.18290561 = sum of:
0.14229754 = weight(_text_:tree in 2158) [ClassicSimilarity], result of:
0.14229754 = score(doc=2158,freq=2.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.43455404 = fieldWeight in 2158, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.046875 = fieldNorm(doc=2158)
0.04060807 = weight(_text_:22 in 2158) [ClassicSimilarity], result of:
0.04060807 = score(doc=2158,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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)
- Abstract
- This paper introduces a project to develop a reliable, cost-effective method for classifying Internet texts into register categories, and apply that approach to the analysis of a large corpus of web documents. To date, the project has proceeded in 2 key phases. First, we developed a bottom-up method for web register classification, asking end users of the web to utilize a decision-tree survey to code relevant situational characteristics of web documents, resulting in a bottom-up identification of register and subregister categories. We present details regarding the development and testing of this method through a series of 10 pilot studies. Then, in the second phase of our project we applied this procedure to a corpus of 53,000 web documents. An analysis of the results demonstrates the effectiveness of these methods for web register classification and provides a preliminary description of the types and distribution of registers on the web.
- Date
- 4. 8.2015 19:22:04
-
Frank, E.; Paynter, G.W.: Predicting Library of Congress Classifications from Library of Congress Subject Headings (2004)
0.05
0.050309774 = product of:
0.10061955 = sum of:
0.10061955 = product of:
0.2012391 = sum of:
0.2012391 = weight(_text_:tree in 2218) [ClassicSimilarity], result of:
0.2012391 = score(doc=2218,freq=4.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.6145522 = fieldWeight in 2218, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.046875 = fieldNorm(doc=2218)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This paper addresses the problem of automatically assigning a Library of Congress Classification (LCC) to a work given its set of Library of Congress Subject Headings (LCSH). LCCs are organized in a tree: The root node of this hierarchy comprises all possible topics, and leaf nodes correspond to the most specialized topic areas defined. We describe a procedure that, given a resource identified by its LCSH, automatically places that resource in the LCC hierarchy. The procedure uses machine learning techniques and training data from a large library catalog to learn a model that maps from sets of LCSH to classifications from the LCC tree. We present empirical results for our technique showing its accuracy an an independent collection of 50,000 LCSH/LCC pairs.
-
Choi, B.; Peng, X.: Dynamic and hierarchical classification of Web pages (2004)
0.05
0.050309774 = product of:
0.10061955 = sum of:
0.10061955 = product of:
0.2012391 = sum of:
0.2012391 = weight(_text_:tree in 2555) [ClassicSimilarity], result of:
0.2012391 = score(doc=2555,freq=4.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.6145522 = fieldWeight in 2555, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.046875 = fieldNorm(doc=2555)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Automatic classification of Web pages is an effective way to organise the vast amount of information and to assist in retrieving relevant information from the Internet. Although many automatic classification systems have been proposed, most of them ignore the conflict between the fixed number of categories and the growing number of Web pages being added into the systems. They also require searching through all existing categories to make any classification. This article proposes a dynamic and hierarchical classification system that is capable of adding new categories as required, organising the Web pages into a tree structure, and classifying Web pages by searching through only one path of the tree. The proposed single-path search technique reduces the search complexity from (n) to (log(n)). Test results show that the system improves the accuracy of classification by 6 percent in comparison to related systems. The dynamic-category expansion technique also achieves satisfying results for adding new categories into the system as required.
-
Sun, A.; Lim, E.-P.; Ng, W.-K.: Performance measurement framework for hierarchical text classification (2003)
0.04
0.035574384 = product of:
0.07114877 = sum of:
0.07114877 = product of:
0.14229754 = sum of:
0.14229754 = weight(_text_:tree in 1808) [ClassicSimilarity], result of:
0.14229754 = score(doc=1808,freq=2.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.43455404 = fieldWeight in 1808, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.046875 = fieldNorm(doc=1808)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Hierarchical text classification or simply hierarchical classification refers to assigning a document to one or more suitable categories from a hierarchical category space. In our literature survey, we have found that the existing hierarchical classification experiments used a variety of measures to evaluate performance. These performance measures often assume independence between categories and do not consider documents misclassified into categories that are similar or not far from the correct categories in the category tree. In this paper, we therefore propose new performance measures for hierarchicai classification. The proposed performance measures consist of category similarity measures and distance-based measures that consider the contributions of misclassified documents. Our experiments an hierarchical classification methods based an SVM classifiers and binary Naive Bayes classifiers showed that SVM classifiers perform better than Naive Bayes classifiers an Reuters-21578 collection according to the extended measures. A new classifier-centric measure called blocking measure is also defined to examine the performance of subtree classifiers in a top-down levelbased hierarchical classificatIon method.
-
Wang, J.: ¬An extensive study on automated Dewey Decimal Classification (2009)
0.03
0.029645318 = product of:
0.059290636 = sum of:
0.059290636 = product of:
0.11858127 = sum of:
0.11858127 = weight(_text_:tree in 3172) [ClassicSimilarity], result of:
0.11858127 = score(doc=3172,freq=2.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.36212835 = fieldWeight in 3172, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.0390625 = fieldNorm(doc=3172)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- In this paper, we present a theoretical analysis and extensive experiments on the automated assignment of Dewey Decimal Classification (DDC) classes to bibliographic data with a supervised machine-learning approach. Library classification systems, such as the DDC, impose great obstacles on state-of-art text categorization (TC) technologies, including deep hierarchy, data sparseness, and skewed distribution. We first analyze statistically the document and category distributions over the DDC, and discuss the obstacles imposed by bibliographic corpora and library classification schemes on TC technology. To overcome these obstacles, we propose an innovative algorithm to reshape the DDC structure into a balanced virtual tree by balancing the category distribution and flattening the hierarchy. To improve the classification effectiveness to a level acceptable to real-world applications, we propose an interactive classification model that is able to predict a class of any depth within a limited number of user interactions. The experiments are conducted on a large bibliographic collection created by the Library of Congress within the science and technology domains over 10 years. With no more than three interactions, a classification accuracy of nearly 90% is achieved, thus providing a practical solution to the automatic bibliographic classification problem.
-
Golub, K.; Lykke, M.: Automated classification of web pages in hierarchical browsing (2009)
0.03
0.029645318 = product of:
0.059290636 = sum of:
0.059290636 = product of:
0.11858127 = sum of:
0.11858127 = weight(_text_:tree in 3614) [ClassicSimilarity], result of:
0.11858127 = score(doc=3614,freq=2.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.36212835 = fieldWeight in 3614, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.0390625 = fieldNorm(doc=3614)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Purpose - The purpose of this study is twofold: to investigate whether it is meaningful to use the Engineering Index (Ei) classification scheme for browsing, and then, if proven useful, to investigate the performance of an automated classification algorithm based on the Ei classification scheme. Design/methodology/approach - A user study was conducted in which users solved four controlled searching tasks. The users browsed the Ei classification scheme in order to examine the suitability of the classification systems for browsing. The classification algorithm was evaluated by the users who judged the correctness of the automatically assigned classes. Findings - The study showed that the Ei classification scheme is suited for browsing. Automatically assigned classes were on average partly correct, with some classes working better than others. Success of browsing showed to be correlated and dependent on classification correctness. Research limitations/implications - Further research should address problems of disparate evaluations of one and the same web page. Additional reasons behind browsing failures in the Ei classification scheme also need further investigation. Practical implications - Improvements for browsing were identified: describing class captions and/or listing their subclasses from start; allowing for searching for words from class captions with synonym search (easily provided for Ei since the classes are mapped to thesauri terms); when searching for class captions, returning the hierarchical tree expanded around the class in which caption the search term is found. The need for improvements of classification schemes was also indicated. Originality/value - A user-based evaluation of automated subject classification in the context of browsing has not been conducted before; hence the study also presents new findings concerning methodology.
-
AlQenaei, Z.M.; Monarchi, D.E.: ¬The use of learning techniques to analyze the results of a manual classification system (2016)
0.03
0.029645318 = product of:
0.059290636 = sum of:
0.059290636 = product of:
0.11858127 = sum of:
0.11858127 = weight(_text_:tree in 2836) [ClassicSimilarity], result of:
0.11858127 = score(doc=2836,freq=2.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.36212835 = fieldWeight in 2836, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.0390625 = fieldNorm(doc=2836)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Classification is the process of assigning objects to pre-defined classes based on observations or characteristics of those objects, and there are many approaches to performing this task. The overall objective of this study is to demonstrate the use of two learning techniques to analyze the results of a manual classification system. Our sample consisted of 1,026 documents, from the ACM Computing Classification System, classified by their authors as belonging to one of the groups of the classification system: "H.3 Information Storage and Retrieval." A singular value decomposition of the documents' weighted term-frequency matrix was used to represent each document in a 50-dimensional vector space. The analysis of the representation using both supervised (decision tree) and unsupervised (clustering) techniques suggests that two pairs of the ACM classes are closely related to each other in the vector space. Class 1 (Content Analysis and Indexing) is closely related to Class 3 (Information Search and Retrieval), and Class 4 (Systems and Software) is closely related to Class 5 (Online Information Services). Further analysis was performed to test the diffusion of the words in the two classes using both cosine and Euclidean distance.
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.02
0.020304035 = product of:
0.04060807 = sum of:
0.04060807 = product of:
0.08121614 = sum of:
0.08121614 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.08121614 = score(doc=1046,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Date
- 5. 5.2003 14:17:22
-
Dolin, R.; Agrawal, D.; El Abbadi, A.; Pearlman, J.: Using automated classification for summarizing and selecting heterogeneous information sources (1998)
0.02
0.017787192 = product of:
0.035574384 = sum of:
0.035574384 = product of:
0.07114877 = sum of:
0.07114877 = weight(_text_:tree in 1253) [ClassicSimilarity], result of:
0.07114877 = score(doc=1253,freq=2.0), product of:
0.32745647 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.049953517 = queryNorm
0.21727702 = fieldWeight in 1253, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.0234375 = fieldNorm(doc=1253)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- We are currently experimenting with newsgroups as collections. We have built an initial prototype which automatically classifies and summarizes newsgroups within the LCC. (The prototype can be tested below, and more details may be found at http://pharos.alexandria.ucsb.edu/). The prototype uses electronic library catalog records as a `training set' and Latent Semantic Indexing (LSI) for IR. We use the training set to build a rich set of classification terminology, and associate these terms with the relevant categories in the LCC. This association between terms and classification categories allows us to relate users' queries to nodes in the LCC so that users can select appropriate query categories. Newsgroups are similarly associated with classification categories. Pharos then matches the categories selected by users to relevant newsgroups. In principle, this approach allows users to exclude newsgroups that might have been selected based on an unintended meaning of a query term, and to include newsgroups with relevant content even though the exact query terms may not have been used. This work is extensible to other types of classification, including geographical, temporal, and image feature. Before discussing the methodology of the collection summarization and selection, we first present an online demonstration below. The demonstration is not intended to be a complete end-user interface. Rather, it is intended merely to offer a view of the process to suggest the "look and feel" of the prototype. The demo works as follows. First supply it with a few keywords of interest. The system will then use those terms to try to return to you the most relevant subject categories within the LCC. Assuming that the system recognizes any of your terms (it has over 400,000 terms indexed), it will give you a list of 15 LCC categories sorted by relevancy ranking. From there, you have two choices. The first choice, by clicking on the "News" links, is to get a list of newsgroups which the system has identified as relevant to the LCC category you select. The other choice, by clicking on the LCC ID links, is to enter the LCC hierarchy starting at the category of your choice and navigate the tree until you locate the best category for your query. From there, again, you can get a list of newsgroups by clicking on the "News" links. After having shown this demonstration to many people, we would like to suggest that you first give it easier examples before trying to break it. For example, "prostate cancer" (discussed below), "remote sensing", "investment banking", and "gershwin" all work reasonably well.
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.02
0.01692003 = product of:
0.03384006 = sum of:
0.03384006 = product of:
0.06768012 = sum of:
0.06768012 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.06768012 = score(doc=611,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- 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.02
0.01692003 = product of:
0.03384006 = sum of:
0.03384006 = product of:
0.06768012 = sum of:
0.06768012 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
0.06768012 = score(doc=2748,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Date
- 1. 2.2016 18:25:22
-
Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989)
0.01
0.011844021 = product of:
0.023688043 = sum of:
0.023688043 = product of:
0.047376085 = sum of:
0.047376085 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
0.047376085 = score(doc=141,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Pages
- S.1-22
-
Dubin, D.: Dimensions and discriminability (1998)
0.01
0.011844021 = product of:
0.023688043 = sum of:
0.023688043 = product of:
0.047376085 = sum of:
0.047376085 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
0.047376085 = score(doc=2338,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Date
- 22. 9.1997 19:16:05
-
Automatic classification research at OCLC (2002)
0.01
0.011844021 = product of:
0.023688043 = sum of:
0.023688043 = product of:
0.047376085 = sum of:
0.047376085 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
0.047376085 = score(doc=1563,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Date
- 5. 5.2003 9:22:09
-
Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998)
0.01
0.011844021 = product of:
0.023688043 = sum of:
0.023688043 = product of:
0.047376085 = sum of:
0.047376085 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
0.047376085 = score(doc=1673,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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(1/2)
- Date
- 1. 8.1996 22:08:06
-
Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007)
0.01
0.011844021 = product of:
0.023688043 = sum of:
0.023688043 = product of:
0.047376085 = sum of:
0.047376085 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
0.047376085 = score(doc=2560,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Date
- 22. 9.2008 18:31:54
-
Liu, R.-L.: Context recognition for hierarchical text classification (2009)
0.01
0.010152018 = product of:
0.020304035 = sum of:
0.020304035 = product of:
0.04060807 = sum of:
0.04060807 = weight(_text_:22 in 2760) [ClassicSimilarity], result of:
0.04060807 = score(doc=2760,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Date
- 22. 3.2009 19:11:54
-
Pfeffer, M.: Automatische Vergabe von RVK-Notationen mittels fallbasiertem Schließen (2009)
0.01
0.010152018 = product of:
0.020304035 = sum of:
0.020304035 = product of:
0.04060807 = sum of:
0.04060807 = weight(_text_:22 in 3051) [ClassicSimilarity], result of:
0.04060807 = score(doc=3051,freq=2.0), product of:
0.17492871 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049953517 = 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.5 = coord(1/2)
- Date
- 22. 8.2009 19:51:28
