-
Automatic classification research at OCLC (2002)
0.09
0.087416716 = product of:
0.17483343 = sum of:
0.077454165 = weight(_text_:standards in 1563) [ClassicSimilarity], result of:
0.077454165 = score(doc=1563,freq=2.0), product of:
0.22470023 = queryWeight, product of:
4.4569545 = idf(docFreq=1393, maxDocs=44218)
0.050415643 = queryNorm
0.34469998 = fieldWeight in 1563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4569545 = idf(docFreq=1393, maxDocs=44218)
0.0546875 = fieldNorm(doc=1563)
0.09737927 = sum of:
0.049564905 = weight(_text_:organization in 1563) [ClassicSimilarity], result of:
0.049564905 = score(doc=1563,freq=2.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.27574396 = fieldWeight in 1563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.0546875 = fieldNorm(doc=1563)
0.047814365 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
0.047814365 = score(doc=1563,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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(2/4)
- Abstract
- OCLC enlists the cooperation of the world's libraries to make the written record of humankind's cultural heritage more accessible through electronic media. Part of this goal can be accomplished through the application of the principles of knowledge organization. We believe that cultural artifacts are effectively lost unless they are indexed, cataloged and classified. Accordingly, OCLC has developed products, sponsored research projects, and encouraged the participation in international standards communities whose outcome has been improved library classification schemes, cataloging productivity tools, and new proposals for the creation and maintenance of metadata. Though cataloging and classification requires expert intellectual effort, we recognize that at least some of the work must be automated if we hope to keep pace with cultural change
- Date
- 5. 5.2003 9:22:09
-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.05
0.050282635 = product of:
0.10056527 = sum of:
0.0800734 = product of:
0.2402202 = sum of:
0.2402202 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.2402202 = score(doc=562,freq=2.0), product of:
0.42742437 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.050415643 = 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.02049187 = product of:
0.04098374 = sum of:
0.04098374 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.04098374 = score(doc=562,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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(2/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
-
Khoo, C.S.G.; Ng, K.; Ou, S.: ¬An exploratory study of human clustering of Web pages (2003)
0.04
0.03963486 = product of:
0.07926972 = sum of:
0.011892734 = weight(_text_:information in 2741) [ClassicSimilarity], result of:
0.011892734 = score(doc=2741,freq=6.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.067376986 = sum of:
0.040054493 = weight(_text_:organization in 2741) [ClassicSimilarity], result of:
0.040054493 = score(doc=2741,freq=4.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.22283478 = fieldWeight in 2741, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.03125 = fieldNorm(doc=2741)
0.027322493 = weight(_text_:22 in 2741) [ClassicSimilarity], result of:
0.027322493 = score(doc=2741,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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(2/4)
- 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
- Series
- Advances in knowledge organization; vol.8
- Source
- Challenges in knowledge representation and organization for the 21st century: Integration of knowledge across boundaries. Proceedings of the 7th ISKO International Conference Granada, Spain, July 10-13, 2002. Ed.: M. López-Huertas
-
Guerrero-Bote, V.P.; Moya Anegón, F. de; Herrero Solana, V.: Document organization using Kohonen's algorithm (2002)
0.03
0.03191998 = product of:
0.06383996 = sum of:
0.023785468 = weight(_text_:information in 2564) [ClassicSimilarity], result of:
0.023785468 = score(doc=2564,freq=6.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.2687516 = fieldWeight in 2564, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=2564)
0.040054493 = product of:
0.080108985 = sum of:
0.080108985 = weight(_text_:organization in 2564) [ClassicSimilarity], result of:
0.080108985 = score(doc=2564,freq=4.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.44566956 = fieldWeight in 2564, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.0625 = fieldNorm(doc=2564)
0.5 = coord(1/2)
0.5 = coord(2/4)
- 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.
- Source
- Information processing and management. 38(2002) no.1, S.79-89
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.03
0.025659401 = product of:
0.051318802 = sum of:
0.017165681 = weight(_text_:information in 611) [ClassicSimilarity], result of:
0.017165681 = score(doc=611,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.03415312 = product of:
0.06830624 = sum of:
0.06830624 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.06830624 = score(doc=611,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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(2/4)
- 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
-
Liu, R.-L.: Context recognition for hierarchical text classification (2009)
0.02
0.019165486 = product of:
0.038330972 = sum of:
0.017839102 = weight(_text_:information in 2760) [ClassicSimilarity], result of:
0.017839102 = score(doc=2760,freq=6.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.02049187 = product of:
0.04098374 = sum of:
0.04098374 = weight(_text_:22 in 2760) [ClassicSimilarity], result of:
0.04098374 = score(doc=2760,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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(2/4)
- 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
-
Hu, G.; Zhou, S.; Guan, J.; Hu, X.: Towards effective document clustering : a constrained K-means based approach (2008)
0.02
0.018399216 = product of:
0.036798432 = sum of:
0.012015978 = weight(_text_:information in 2113) [ClassicSimilarity], result of:
0.012015978 = score(doc=2113,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.13576832 = fieldWeight in 2113, 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=2113)
0.024782453 = product of:
0.049564905 = sum of:
0.049564905 = weight(_text_:organization in 2113) [ClassicSimilarity], result of:
0.049564905 = score(doc=2113,freq=2.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.27574396 = fieldWeight in 2113, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.0546875 = fieldNorm(doc=2113)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Document clustering is an important tool for document collection organization and browsing. In real applications, some limited knowledge about cluster membership of a small number of documents is often available, such as some pairs of documents belonging to the same cluster. This kind of prior knowledge can be served as constraints for the clustering process. We integrate the constraints into the trace formulation of the sum of square Euclidean distance function of K-means. Then, the combined criterion function is transformed into trace maximization, which is further optimized by eigen-decomposition. Our experimental evaluation shows that the proposed semi-supervised clustering method can achieve better performance, compared to three existing methods.
- Source
- Information processing and management. 44(2008) no.4, S.1397-1409
-
Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006)
0.02
0.01796158 = product of:
0.03592316 = sum of:
0.012015978 = weight(_text_:information in 5273) [ClassicSimilarity], result of:
0.012015978 = score(doc=5273,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.023907183 = product of:
0.047814365 = sum of:
0.047814365 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.047814365 = score(doc=5273,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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.5 = coord(2/4)
- 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.02
0.01796158 = product of:
0.03592316 = sum of:
0.012015978 = weight(_text_:information in 2560) [ClassicSimilarity], result of:
0.012015978 = score(doc=2560,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.023907183 = product of:
0.047814365 = sum of:
0.047814365 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
0.047814365 = score(doc=2560,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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(2/4)
- 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
-
Golub, K.: Automated subject classification of textual Web pages, based on a controlled vocabulary : challenges and recommendations (2006)
0.02
0.017903835 = product of:
0.03580767 = sum of:
0.014565565 = weight(_text_:information in 5897) [ClassicSimilarity], result of:
0.014565565 = score(doc=5897,freq=4.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.16457605 = fieldWeight in 5897, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=5897)
0.021242103 = product of:
0.042484205 = sum of:
0.042484205 = weight(_text_:organization in 5897) [ClassicSimilarity], result of:
0.042484205 = score(doc=5897,freq=2.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.23635197 = fieldWeight in 5897, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.046875 = fieldNorm(doc=5897)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The primary objective of this study was to identify and address problems of applying a controlled vocabulary in automated subject classification of textual Web pages, in the area of engineering. Web pages have special characteristics such as structural information, but are at the same time rather heterogeneous. The classification approach used comprises string-to-string matching between words in a term list extracted from the Ei (Engineering Information) thesaurus and classification scheme, and words in the text to be classified. Based on a sample of 70 Web pages, a number of problems with the term list are identified. Reasons for those problems are discussed and improvements proposed. Methods for implementing the improvements are also specified, suggesting further research.
- Content
- Beitrag eines Themenheftes "Knowledge organization systems and services"
-
Mengle, S.; Goharian, N.: Passage detection using text classification (2009)
0.02
0.017121121 = product of:
0.034242243 = sum of:
0.017165681 = weight(_text_:information in 2765) [ClassicSimilarity], result of:
0.017165681 = score(doc=2765,freq=8.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.01707656 = product of:
0.03415312 = sum of:
0.03415312 = weight(_text_:22 in 2765) [ClassicSimilarity], result of:
0.03415312 = score(doc=2765,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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.5 = coord(2/4)
- 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
-
Na, J.-C.; Sui, H.; Khoo, C.; Chan, S.; Zhou, Y.: Effectiveness of simple linguistic processing in automatic sentiment classification of product reviews (2004)
0.02
0.01680845 = product of:
0.0336169 = sum of:
0.008582841 = weight(_text_:information in 2624) [ClassicSimilarity], result of:
0.008582841 = score(doc=2624,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.09697737 = fieldWeight in 2624, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=2624)
0.025034059 = product of:
0.050068118 = sum of:
0.050068118 = weight(_text_:organization in 2624) [ClassicSimilarity], result of:
0.050068118 = score(doc=2624,freq=4.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.27854347 = fieldWeight in 2624, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.0390625 = fieldNorm(doc=2624)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Series
- Advances in knowledge organization; vol.9
- Source
- Knowledge organization and the global information society: Proceedings of the 8th International ISKO Conference 13-16 July 2004, London, UK. Ed.: I.C. McIlwaine
-
Golub, K.; Hamon, T.; Ardö, A.: Automated classification of textual documents based on a controlled vocabulary in engineering (2007)
0.02
0.015770756 = product of:
0.03154151 = sum of:
0.01029941 = weight(_text_:information in 1461) [ClassicSimilarity], result of:
0.01029941 = score(doc=1461,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.116372846 = fieldWeight in 1461, 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=1461)
0.021242103 = product of:
0.042484205 = sum of:
0.042484205 = weight(_text_:organization in 1461) [ClassicSimilarity], result of:
0.042484205 = score(doc=1461,freq=2.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.23635197 = fieldWeight in 1461, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.046875 = fieldNorm(doc=1461)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Automated subject classification has been a challenging research issue for many years now, receiving particular attention in the past decade due to rapid increase of digital documents. The most frequent approach to automated classification is machine learning. It, however, requires training documents and performs well on new documents only if these are similar enough to the former. We explore a string-matching algorithm based on a controlled vocabulary, which does not require training documents - instead it reuses the intellectual work put into creating the controlled vocabulary. Terms from the Engineering Information thesaurus and classification scheme were matched against title and abstract of engineering papers from the Compendex database. Simple string-matching was enhanced by several methods such as term weighting schemes and cut-offs, exclusion of certain terms, and en- richment of the controlled vocabulary with automatically extracted terms. The best results are 76% recall when the controlled vocabulary is enriched with new terms, and 79% precision when certain terms are excluded. Precision of individual classes is up to 98%. These results are comparable to state-of-the-art machine-learning algorithms.
- Source
- Knowledge organization. 34(2007) no.4, S.247-263
-
Classification, automation, and new media : Proceedings of the 24th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Passau, March 15 - 17, 2000 (2002)
0.01
0.014919861 = product of:
0.029839722 = sum of:
0.01213797 = weight(_text_:information in 5997) [ClassicSimilarity], result of:
0.01213797 = score(doc=5997,freq=4.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.13714671 = fieldWeight in 5997, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=5997)
0.017701752 = product of:
0.035403505 = sum of:
0.035403505 = weight(_text_:organization in 5997) [ClassicSimilarity], result of:
0.035403505 = score(doc=5997,freq=2.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.19695997 = fieldWeight in 5997, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.0390625 = fieldNorm(doc=5997)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Given the huge amount of information in the internet and in practically every domain of knowledge that we are facing today, knowledge discovery calls for automation. The book deals with methods from classification and data analysis that respond effectively to this rapidly growing challenge. The interested reader will find new methodological insights as well as applications in economics, management science, finance, and marketing, and in pattern recognition, biology, health, and archaeology.
- Content
- Data Analysis, Statistics, and Classification.- Pattern Recognition and Automation.- Data Mining, Information Processing, and Automation.- New Media, Web Mining, and Automation.- Applications in Management Science, Finance, and Marketing.- Applications in Medicine, Biology, Archaeology, and Others.- Author Index.- Subject Index.
- Series
- Proceedings of the ... annual conference of the Gesellschaft für Klassifikation e.V. ; 24)(Studies in classification, data analysis, and knowledge organization
-
Xu, Y.; Bernard, A.: Knowledge organization through statistical computation : a new approach (2009)
0.01
0.010621051 = product of:
0.042484205 = sum of:
0.042484205 = product of:
0.08496841 = sum of:
0.08496841 = weight(_text_:organization in 3252) [ClassicSimilarity], result of:
0.08496841 = score(doc=3252,freq=8.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.47270393 = fieldWeight in 3252, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.046875 = fieldNorm(doc=3252)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Knowledge organization (KO) is an interdisciplinary issue which includes some problems in knowledge classification such as how to classify newly emerged knowledge. With the great complexity and ambiguity of knowledge, it is becoming sometimes inefficient to classify knowledge by logical reasoning. This paper attempts to propose a statistical approach to knowledge organization in order to resolve the problems in classifying complex and mass knowledge. By integrating the classification process into a mathematical model, a knowledge classifier, based on the maximum entropy theory, is constructed and the experimental results show that the classification results acquired from the classifier are reliable. The approach proposed in this paper is quite formal and is not dependent on specific contexts, so it could easily be adapted to the use of knowledge classification in other domains within KO.
- Source
- Knowledge organization. 36(2009) no.4, S.227-239
-
Reiner, U.: Automatische DDC-Klassifizierung bibliografischer Titeldatensätze der Deutschen Nationalbibliografie (2009)
0.01
0.01026376 = product of:
0.02052752 = sum of:
0.006866273 = weight(_text_:information in 3284) [ClassicSimilarity], result of:
0.006866273 = score(doc=3284,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.013661247 = product of:
0.027322493 = sum of:
0.027322493 = weight(_text_:22 in 3284) [ClassicSimilarity], result of:
0.027322493 = score(doc=3284,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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.5 = coord(2/4)
- 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.010245935 = product of:
0.04098374 = sum of:
0.04098374 = product of:
0.08196748 = sum of:
0.08196748 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.08196748 = score(doc=1046,freq=2.0), product of:
0.17654699 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050415643 = 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
-
Miyamoto, S.: Information clustering based an fuzzy multisets (2003)
0.01
0.0073582535 = product of:
0.029433014 = sum of:
0.029433014 = weight(_text_:information in 1071) [ClassicSimilarity], result of:
0.029433014 = score(doc=1071,freq=12.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.3325631 = fieldWeight in 1071, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=1071)
0.25 = coord(1/4)
- Abstract
- A fuzzy multiset model for information clustering is proposed with application to information retrieval on the World Wide Web. Noting that a search engine retrieves multiple occurrences of the same subjects with possibly different degrees of relevance, we observe that fuzzy multisets provide an appropriate model of information retrieval on the WWW. Information clustering which means both term clustering and document clustering is considered. Three methods of the hard c-means, fuzzy c-means, and an agglomerative method using cluster centers are proposed. Two distances between fuzzy multisets and algorithms for calculating cluster centers are defined. Theoretical properties concerning the clustering algorithms are studied. Illustrative examples are given to show how the algorithms work.
- Source
- Information processing and management. 39(2003) no.2, S.195-213
-
Khoo, C.S.G.; Ou, S.: Machine versus human clustering of concepts across documents (2008)
0.01
0.0062585147 = product of:
0.025034059 = sum of:
0.025034059 = product of:
0.050068118 = sum of:
0.050068118 = weight(_text_:organization in 2286) [ClassicSimilarity], result of:
0.050068118 = score(doc=2286,freq=4.0), product of:
0.17974974 = queryWeight, product of:
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.050415643 = queryNorm
0.27854347 = fieldWeight in 2286, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5653565 = idf(docFreq=3399, maxDocs=44218)
0.0390625 = fieldNorm(doc=2286)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Series
- Advances in knowledge organization; vol.11
- Source
- Culture and identity in knowledge organization: Proceedings of the Tenth International ISKO Conference 5-8 August 2008, Montreal, Canada. Ed. by Clément Arsenault and Joseph T. Tennis
-
Wu, M.; Fuller, M.; Wilkinson, R.: Using clustering and classification approaches in interactive retrieval (2001)
0.01
0.006007989 = product of:
0.024031956 = sum of:
0.024031956 = weight(_text_:information in 2666) [ClassicSimilarity], result of:
0.024031956 = score(doc=2666,freq=2.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.27153665 = fieldWeight in 2666, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.109375 = fieldNorm(doc=2666)
0.25 = coord(1/4)
- Source
- Information processing and management. 37(2001) no.3, S.459-484
