-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.41
0.4050102 = product of:
0.5670143 = sum of:
0.034518216 = product of:
0.17259108 = sum of:
0.17259108 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.17259108 = score(doc=562,freq=2.0), product of:
0.3070917 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03622214 = 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.2 = coord(1/5)
0.17259108 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
0.17259108 = score(doc=562,freq=2.0), product of:
0.3070917 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03622214 = 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.17259108 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
0.17259108 = score(doc=562,freq=2.0), product of:
0.3070917 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03622214 = 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.17259108 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
0.17259108 = score(doc=562,freq=2.0), product of:
0.3070917 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03622214 = 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.0147228 = product of:
0.0294456 = sum of:
0.0294456 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.0294456 = score(doc=562,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.71428573 = coord(5/7)
- 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
-
Oberhauser, O.: Automatisches Klassifizieren und Bibliothekskataloge (2005)
0.06
0.058995128 = product of:
0.20648293 = sum of:
0.0051266486 = product of:
0.025633242 = sum of:
0.025633242 = weight(_text_:retrieval in 4099) [ClassicSimilarity], result of:
0.025633242 = score(doc=4099,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.23394634 = fieldWeight in 4099, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0546875 = fieldNorm(doc=4099)
0.2 = coord(1/5)
0.20135628 = weight(_text_:mehrsprachigkeit in 4099) [ClassicSimilarity], result of:
0.20135628 = score(doc=4099,freq=2.0), product of:
0.3070917 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03622214 = queryNorm
0.65568775 = fieldWeight in 4099, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0546875 = fieldNorm(doc=4099)
0.2857143 = coord(2/7)
- Abstract
- In der bibliothekarischen Welt sind die Vorzüge einer klassifikatorischen Inhaltserschließung seit jeher wohlbekannt. Auch im Zeitalter der Online-Kataloge gibt es dafür keinen wirklichen Ersatz, da - kurz formuliert - ein stichwortbasiertes Retrieval alleine mit Problemen wie Ambiguität und Mehrsprachigkeit nicht fertig zu werden vermag. Zahlreiche Online-Kataloge weisen daher Notationen verschiedener Klassifikationssysteme auf; allerdings sind die darauf basierenden Abfragemöglichkeiten meist noch arg unterentwickelt. Viele Datensätze in OPACs sind aber überhaupt nicht sachlich erschlossen, sei es, dass sie aus retrospektiv konvertierten Nominalkatalogen stammen, sei es, dass ein Mangel an personellen Ressourcen ihre inhaltliche Erschließung verhindert hat. Angesichts großer Mengen solcher Datensätze liegt ein Interesse an automatischen Verfahren zur Sacherschließung durchaus nahe.
-
Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006)
0.01
0.008083502 = product of:
0.028292254 = sum of:
0.011115653 = product of:
0.055578265 = sum of:
0.055578265 = weight(_text_:system in 5273) [ClassicSimilarity], result of:
0.055578265 = score(doc=5273,freq=8.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.4871716 = fieldWeight in 5273, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=5273)
0.2 = coord(1/5)
0.0171766 = product of:
0.0343532 = sum of:
0.0343532 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.0343532 = score(doc=5273,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.2857143 = coord(2/7)
- 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
-
Mengle, S.; Goharian, N.: Passage detection using text classification (2009)
0.01
0.005844926 = product of:
0.02045724 = sum of:
0.008188239 = product of:
0.040941194 = sum of:
0.040941194 = weight(_text_:retrieval in 2765) [ClassicSimilarity], result of:
0.040941194 = score(doc=2765,freq=10.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.37365708 = fieldWeight in 2765, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.2 = coord(1/5)
0.0122690005 = product of:
0.024538001 = sum of:
0.024538001 = weight(_text_:22 in 2765) [ClassicSimilarity], result of:
0.024538001 = score(doc=2765,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.2857143 = coord(2/7)
- 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
-
Liu, R.-L.: Context recognition for hierarchical text classification (2009)
0.01
0.005567615 = product of:
0.01948665 = sum of:
0.0047638514 = product of:
0.023819257 = sum of:
0.023819257 = weight(_text_:system in 2760) [ClassicSimilarity], result of:
0.023819257 = score(doc=2760,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.20878783 = fieldWeight in 2760, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=2760)
0.2 = coord(1/5)
0.0147228 = product of:
0.0294456 = sum of:
0.0294456 = weight(_text_:22 in 2760) [ClassicSimilarity], result of:
0.0294456 = score(doc=2760,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.2857143 = coord(2/7)
- 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
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.00
0.0042065145 = product of:
0.0294456 = sum of:
0.0294456 = product of:
0.0588912 = sum of:
0.0588912 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.0588912 = score(doc=1046,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.14285715 = coord(1/7)
- Date
- 5. 5.2003 14:17:22
-
Yao, H.; Etzkorn, L.H.; Virani, S.: Automated classification and retrieval of reusable software components (2008)
0.00
0.003696582 = product of:
0.025876073 = sum of:
0.025876073 = product of:
0.06469018 = sum of:
0.03661892 = weight(_text_:retrieval in 1382) [ClassicSimilarity], result of:
0.03661892 = score(doc=1382,freq=8.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.33420905 = fieldWeight in 1382, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=1382)
0.028071264 = weight(_text_:system in 1382) [ClassicSimilarity], result of:
0.028071264 = score(doc=1382,freq=4.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.24605882 = fieldWeight in 1382, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=1382)
0.4 = coord(2/5)
0.14285715 = coord(1/7)
- Abstract
- The authors describe their research which improves software reuse by using an automated approach to semantically search for and retrieve reusable software components in large software component repositories and on the World Wide Web (WWW). Using automation and smart (semantic) techniques, their approach speeds up the search and retrieval of reusable software components, while retaining good accuracy, and therefore improves the affordability of software reuse. A program understanding of software components and natural language understanding of user queries was employed. Then the software component descriptions were compared by matching the resulting semantic representations of the user queries to the semantic representations of the software components to search for software components that best match the user queries. A proof of concept system was developed to test the authors' approach. The results of this proof of concept system were compared to human experts, and statistical analysis was performed on the collected experimental data. The results from these experiments demonstrate that this automated semantic-based approach for software reusable component classification and retrieval is successful when compared to the labor-intensive results from the experts, thus showing that this approach can significantly benefit software reuse classification and retrieval.
-
Reiner, U.: Automatische DDC-Klassifizierung bibliografischer Titeldatensätze der Deutschen Nationalbibliografie (2009)
0.00
0.003641347 = product of:
0.012744714 = sum of:
0.0029295133 = product of:
0.014647567 = sum of:
0.014647567 = weight(_text_:retrieval in 3284) [ClassicSimilarity], result of:
0.014647567 = score(doc=3284,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.13368362 = fieldWeight in 3284, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03125 = fieldNorm(doc=3284)
0.2 = coord(1/5)
0.0098152 = product of:
0.0196304 = sum of:
0.0196304 = weight(_text_:22 in 3284) [ClassicSimilarity], result of:
0.0196304 = score(doc=3284,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.2857143 = coord(2/7)
- 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
-
Sebastiani, F.: Classification of text, automatic (2006)
0.00
0.0030527073 = product of:
0.02136895 = sum of:
0.02136895 = product of:
0.053422377 = sum of:
0.025633242 = weight(_text_:retrieval in 5003) [ClassicSimilarity], result of:
0.025633242 = score(doc=5003,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.23394634 = fieldWeight in 5003, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0546875 = fieldNorm(doc=5003)
0.027789133 = weight(_text_:system in 5003) [ClassicSimilarity], result of:
0.027789133 = score(doc=5003,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.2435858 = fieldWeight in 5003, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=5003)
0.4 = coord(2/5)
0.14285715 = coord(1/7)
- Abstract
- Automatic text classification (ATC) is a discipline at the crossroads of information retrieval (IR), machine learning (ML), and computational linguistics (CL), and consists in the realization of text classifiers, i.e. software systems capable of assigning texts to one or more categories, or classes, from a predefined set. Applications range from the automated indexing of scientific articles, to e-mail routing, spam filtering, authorship attribution, and automated survey coding. This article will focus on the ML approach to ATC, whereby a software system (called the learner) automatically builds a classifier for the categories of interest by generalizing from a "training" set of pre-classified texts.
-
Hagedorn, K.; Chapman, S.; Newman, D.: Enhancing search and browse using automated clustering of subject metadata (2007)
0.00
0.0026166062 = product of:
0.018316243 = sum of:
0.018316243 = product of:
0.045790605 = sum of:
0.02197135 = weight(_text_:retrieval in 1168) [ClassicSimilarity], result of:
0.02197135 = score(doc=1168,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.20052543 = fieldWeight in 1168, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.046875 = fieldNorm(doc=1168)
0.023819257 = weight(_text_:system in 1168) [ClassicSimilarity], result of:
0.023819257 = score(doc=1168,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.20878783 = fieldWeight in 1168, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=1168)
0.4 = coord(2/5)
0.14285715 = coord(1/7)
- Abstract
- The Web puzzle of online information resources often hinders end-users from effective and efficient access to these resources. Clustering resources into appropriate subject-based groupings may help alleviate these difficulties, but will it work with heterogeneous material? The University of Michigan and the University of California Irvine joined forces to test automatically enhancing metadata records using the Topic Modeling algorithm on the varied OAIster corpus. We created labels for the resulting clusters of metadata records, matched the clusters to an in-house classification system, and developed a prototype that would showcase methods for search and retrieval using the enhanced records. Results indicated that while the algorithm was somewhat time-intensive to run and using a local classification scheme had its drawbacks, precise clustering of records was achieved and the prototype interface proved that faceted classification could be powerful in helping end-users find resources.
-
Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007)
0.00
0.0024538 = product of:
0.0171766 = sum of:
0.0171766 = product of:
0.0343532 = sum of:
0.0343532 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
0.0343532 = score(doc=2560,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.14285715 = coord(1/7)
- Date
- 22. 9.2008 18:31:54
-
Humphrey, S.M.; Névéol, A.; Browne, A.; Gobeil, J.; Ruch, P.; Darmoni, S.J.: Comparing a rule-based versus statistical system for automatic categorization of MEDLINE documents according to biomedical specialty (2009)
0.00
0.0021805053 = product of:
0.015263537 = sum of:
0.015263537 = product of:
0.03815884 = sum of:
0.01830946 = weight(_text_:retrieval in 3300) [ClassicSimilarity], result of:
0.01830946 = score(doc=3300,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.16710453 = fieldWeight in 3300, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=3300)
0.01984938 = weight(_text_:system in 3300) [ClassicSimilarity], result of:
0.01984938 = score(doc=3300,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.17398985 = fieldWeight in 3300, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=3300)
0.4 = coord(2/5)
0.14285715 = coord(1/7)
- Abstract
- Automatic document categorization is an important research problem in Information Science and Natural Language Processing. Many applications, including, Word Sense Disambiguation and Information Retrieval in large collections, can benefit from such categorization. This paper focuses on automatic categorization of documents from the biomedical literature into broad discipline-based categories. Two different systems are described and contrasted: CISMeF, which uses rules based on human indexing of the documents by the Medical Subject Headings (MeSH) controlled vocabulary in order to assign metaterms (MTs), and Journal Descriptor Indexing (JDI), based on human categorization of about 4,000 journals and statistical associations between journal descriptors (JDs) and textwords in the documents. We evaluate and compare the performance of these systems against a gold standard of humanly assigned categories for 100 MEDLINE documents, using six measures selected from trec_eval. The results show that for five of the measures performance is comparable, and for one measure JDI is superior. We conclude that these results favor JDI, given the significantly greater intellectual overhead involved in human indexing and maintaining a rule base for mapping MeSH terms to MTs. We also note a JDI method that associates JDs with MeSH indexing rather than textwords, and it may be worthwhile to investigate whether this JDI method (statistical) and CISMeF (rule-based) might be combined and then evaluated showing they are complementary to one another.
-
Pfeffer, M.: Automatische Vergabe von RVK-Notationen mittels fallbasiertem Schließen (2009)
0.00
0.0021032572 = product of:
0.0147228 = sum of:
0.0147228 = product of:
0.0294456 = sum of:
0.0294456 = weight(_text_:22 in 3051) [ClassicSimilarity], result of:
0.0294456 = score(doc=3051,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.14285715 = coord(1/7)
- Date
- 22. 8.2009 19:51:28
-
Wu, M.; Fuller, M.; Wilkinson, R.: Using clustering and classification approaches in interactive retrieval (2001)
0.00
0.0014647568 = product of:
0.010253297 = sum of:
0.010253297 = product of:
0.051266484 = sum of:
0.051266484 = weight(_text_:retrieval in 2666) [ClassicSimilarity], result of:
0.051266484 = score(doc=2666,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.46789268 = fieldWeight in 2666, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.109375 = fieldNorm(doc=2666)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
-
Khoo, C.S.G.; Ng, K.; Ou, S.: ¬An exploratory study of human clustering of Web pages (2003)
0.00
0.0014021716 = product of:
0.0098152 = sum of:
0.0098152 = product of:
0.0196304 = sum of:
0.0196304 = weight(_text_:22 in 2741) [ClassicSimilarity], result of:
0.0196304 = score(doc=2741,freq=2.0), product of:
0.12684377 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03622214 = 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.14285715 = coord(1/7)
- Date
- 12. 9.2004 9:56:22
-
Shafer, K.E.: Automatic Subject Assignment via the Scorpion System (2001)
0.00
0.0013611005 = product of:
0.009527703 = sum of:
0.009527703 = product of:
0.047638513 = sum of:
0.047638513 = weight(_text_:system in 1043) [ClassicSimilarity], result of:
0.047638513 = score(doc=1043,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.41757566 = fieldWeight in 1043, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.09375 = fieldNorm(doc=1043)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
-
Yu, W.; Gong, Y.: Document clustering by concept factorization (2004)
0.00
0.0012555057 = product of:
0.00878854 = sum of:
0.00878854 = product of:
0.0439427 = sum of:
0.0439427 = weight(_text_:retrieval in 4084) [ClassicSimilarity], result of:
0.0439427 = score(doc=4084,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.40105087 = fieldWeight in 4084, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.09375 = fieldNorm(doc=4084)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
- Source
- SIGIR'04: Proceedings of the 27th Annual International ACM-SIGIR Conference an Research and Development in Information Retrieval. Ed.: K. Järvelin, u.a
-
Guerrero-Bote, V.P.; Moya Anegón, F. de; Herrero Solana, V.: Document organization using Kohonen's algorithm (2002)
0.00
0.0011837021 = product of:
0.008285915 = sum of:
0.008285915 = product of:
0.04142957 = sum of:
0.04142957 = weight(_text_:retrieval in 2564) [ClassicSimilarity], result of:
0.04142957 = score(doc=2564,freq=4.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.37811437 = fieldWeight in 2564, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=2564)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
- Abstract
- The classification of documents from a bibliographic database is a task that is linked to processes of information retrieval based on partial matching. A method is described of vectorizing reference documents from LISA which permits their topological organization using Kohonen's algorithm. As an example a map is generated of 202 documents from LISA, and an analysis is made of the possibilities of this type of neural network with respect to the development of information retrieval systems based on graphical browsing.
-
Choi, B.; Peng, X.: Dynamic and hierarchical classification of Web pages (2004)
0.00
0.0011787476 = product of:
0.008251233 = sum of:
0.008251233 = product of:
0.041256163 = sum of:
0.041256163 = weight(_text_:system in 2555) [ClassicSimilarity], result of:
0.041256163 = score(doc=2555,freq=6.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.36163113 = fieldWeight in 2555, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=2555)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
- 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.
-
Shen, D.; Chen, Z.; Yang, Q.; Zeng, H.J.; Zhang, B.; Lu, Y.; Ma, W.Y.: Web page classification through summarization (2004)
0.00
0.0010462549 = product of:
0.007323784 = sum of:
0.007323784 = product of:
0.03661892 = sum of:
0.03661892 = weight(_text_:retrieval in 4132) [ClassicSimilarity], result of:
0.03661892 = score(doc=4132,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.33420905 = fieldWeight in 4132, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.078125 = fieldNorm(doc=4132)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
- Source
- SIGIR'04: Proceedings of the 27th Annual International ACM-SIGIR Conference an Research and Development in Information Retrieval. Ed.: K. Järvelin, u.a
