-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.05
0.04621624 = product of:
0.09243248 = sum of:
0.06933434 = product of:
0.20800301 = sum of:
0.20800301 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.20800301 = score(doc=562,freq=2.0), product of:
0.37010026 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.043654136 = 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.005354538 = weight(_text_:in in 562) [ClassicSimilarity], result of:
0.005354538 = score(doc=562,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.09017298 = fieldWeight in 562, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=562)
0.017743597 = product of:
0.035487194 = sum of:
0.035487194 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.035487194 = score(doc=562,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.23214069 = fieldWeight in 562, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=562)
0.5 = coord(1/2)
0.5 = coord(3/6)
- Abstract
- Document representations for text classification are typically based on the classical Bag-Of-Words paradigm. This approach comes with deficiencies that motivate the integration of features on a higher semantic level than single words. In this paper we propose an enhancement of the classical document representation through concepts extracted from background knowledge. Boosting is used for actual classification. Experimental evaluations on two well known text corpora support our approach through consistent improvement of the results.
- 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
-
HaCohen-Kerner, Y. et al.: Classification using various machine learning methods and combinations of key-phrases and visual features (2016)
0.01
0.012832299 = product of:
0.038496897 = sum of:
0.008924231 = weight(_text_:in in 2748) [ClassicSimilarity], result of:
0.008924231 = score(doc=2748,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.15028831 = fieldWeight in 2748, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.078125 = fieldNorm(doc=2748)
0.029572664 = product of:
0.059145328 = sum of:
0.059145328 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
0.059145328 = score(doc=2748,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = 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.33333334 = coord(2/6)
- Date
- 1. 2.2016 18:25:22
- Series
- Lecture notes in computer science ; 9398
-
Lindholm, J.; Schönthal, T.; Jansson , K.: Experiences of harvesting Web resources in engineering using automatic classification (2003)
0.01
0.011077631 = product of:
0.033232894 = sum of:
0.014278769 = weight(_text_:in in 4088) [ClassicSimilarity], result of:
0.014278769 = score(doc=4088,freq=8.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.24046129 = fieldWeight in 4088, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=4088)
0.018954126 = weight(_text_:und in 4088) [ClassicSimilarity], result of:
0.018954126 = score(doc=4088,freq=2.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.19590102 = fieldWeight in 4088, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=4088)
0.33333334 = coord(2/6)
- Abstract
- Authors describe the background and the work involved in setting up Engine-e, a Web index that uses automatic classification as a mean for the selection of resources in Engineering. Considerations in offering a robot-generated Web index as a successor to a manually indexed quality-controlled subject gateway are also discussed
- Footnote
- Auch unter: http://www.ariadne.ac.uk/issue37/lindholm/ und http://engine-e.lub.lu.se/
-
Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006)
0.01
0.01106493 = product of:
0.033194788 = sum of:
0.012493922 = weight(_text_:in in 5273) [ClassicSimilarity], result of:
0.012493922 = score(doc=5273,freq=8.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.21040362 = fieldWeight in 5273, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=5273)
0.020700864 = product of:
0.04140173 = sum of:
0.04140173 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.04140173 = score(doc=5273,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.2708308 = fieldWeight in 5273, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=5273)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- 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
-
Dubin, D.: Dimensions and discriminability (1998)
0.01
0.009845134 = product of:
0.029535402 = sum of:
0.008834538 = weight(_text_:in in 2338) [ClassicSimilarity], result of:
0.008834538 = score(doc=2338,freq=4.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.14877784 = fieldWeight in 2338, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=2338)
0.020700864 = product of:
0.04140173 = sum of:
0.04140173 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
0.04140173 = score(doc=2338,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.2708308 = fieldWeight in 2338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=2338)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Visualization interfaces can improve subject access by highlighting the inclusion of document representation components in similarity and discrimination relationships. Within a set of retrieved documents, what kinds of groupings can index terms and subject headings make explicit? The role of controlled vocabulary in classifying search output is examined
- Date
- 22. 9.1997 19:16:05
-
Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998)
0.01
0.009845134 = product of:
0.029535402 = sum of:
0.008834538 = weight(_text_:in in 1673) [ClassicSimilarity], result of:
0.008834538 = score(doc=1673,freq=4.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.14877784 = fieldWeight in 1673, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.020700864 = product of:
0.04140173 = sum of:
0.04140173 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
0.04140173 = score(doc=1673,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = 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.33333334 = coord(2/6)
- Abstract
- The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib
- Date
- 1. 8.1996 22:08:06
-
Egbert, J.; Biber, D.; Davies, M.: Developing a bottom-up, user-based method of web register classification (2015)
0.01
0.009005977 = product of:
0.027017929 = sum of:
0.009274333 = weight(_text_:in in 2158) [ClassicSimilarity], result of:
0.009274333 = score(doc=2158,freq=6.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.1561842 = fieldWeight in 2158, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=2158)
0.017743597 = product of:
0.035487194 = sum of:
0.035487194 = weight(_text_:22 in 2158) [ClassicSimilarity], result of:
0.035487194 = score(doc=2158,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.23214069 = fieldWeight in 2158, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2158)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- 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
-
Mengle, S.; Goharian, N.: Passage detection using text classification (2009)
0.01
0.008572079 = product of:
0.025716238 = sum of:
0.010929906 = weight(_text_:in in 2765) [ClassicSimilarity], result of:
0.010929906 = score(doc=2765,freq=12.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.18406484 = fieldWeight in 2765, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.014786332 = product of:
0.029572664 = sum of:
0.029572664 = weight(_text_:22 in 2765) [ClassicSimilarity], result of:
0.029572664 = score(doc=2765,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.19345059 = fieldWeight in 2765, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Passages can be hidden within a text to circumvent their disallowed transfer. Such release of compartmentalized information is of concern to all corporate and governmental organizations. Passage retrieval is well studied; we posit, however, that passage detection is not. Passage retrieval is the determination of the degree of relevance of blocks of text, namely passages, comprising a document. Rather than determining the relevance of a document in its entirety, passage retrieval determines the relevance of the individual passages. As such, modified traditional information-retrieval techniques compare terms found in user queries with the individual passages to determine a similarity score for passages of interest. In passage detection, passages are classified into predetermined categories. More often than not, passage detection techniques are deployed to detect hidden paragraphs in documents. That is, to hide information, documents are injected with hidden text into passages. Rather than matching query terms against passages to determine their relevance, using text-mining techniques, the passages are classified. Those documents with hidden passages are defined as infected. Thus, simply stated, passage retrieval is the search for passages relevant to a user query, while passage detection is the classification of passages. That is, in passage detection, passages are labeled with one or more categories from a set of predetermined categories. We present a keyword-based dynamic passage approach (KDP) and demonstrate that KDP outperforms statistically significantly (99% confidence) the other document-splitting approaches by 12% to 18% in the passage detection and passage category-prediction tasks. Furthermore, we evaluate the effects of the feature selection, passage length, ambiguous passages, and finally training-data category distribution on passage-detection accuracy.
- Date
- 22. 3.2009 19:14:43
-
Liu, R.-L.: Context recognition for hierarchical text classification (2009)
0.01
0.008438686 = product of:
0.025316058 = sum of:
0.0075724614 = weight(_text_:in in 2760) [ClassicSimilarity], result of:
0.0075724614 = score(doc=2760,freq=4.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.12752387 = fieldWeight in 2760, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=2760)
0.017743597 = product of:
0.035487194 = sum of:
0.035487194 = weight(_text_:22 in 2760) [ClassicSimilarity], result of:
0.035487194 = score(doc=2760,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.23214069 = fieldWeight in 2760, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2760)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Information is often organized as a text hierarchy. A hierarchical text-classification system is thus essential for the management, sharing, and dissemination of information. It aims to automatically classify each incoming document into zero, one, or several categories in the text hierarchy. In this paper, we present a technique called CRHTC (context recognition for hierarchical text classification) that performs hierarchical text classification by recognizing the context of discussion (COD) of each category. A category's COD is governed by its ancestor categories, whose contents indicate contextual backgrounds of the category. A document may be classified into a category only if its content matches the category's COD. CRHTC does not require any trials to manually set parameters, and hence is more portable and easier to implement than other methods. It is empirically evaluated under various conditions. The results show that CRHTC achieves both better and more stable performance than several hierarchical and nonhierarchical text-classification methodologies.
- Date
- 22. 3.2009 19:11:54
-
Liu, R.-L.: ¬A passage extractor for classification of disease aspect information (2013)
0.01
0.008254642 = product of:
0.024763925 = sum of:
0.009977593 = weight(_text_:in in 1107) [ClassicSimilarity], result of:
0.009977593 = score(doc=1107,freq=10.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.16802745 = fieldWeight in 1107, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=1107)
0.014786332 = product of:
0.029572664 = sum of:
0.029572664 = weight(_text_:22 in 1107) [ClassicSimilarity], result of:
0.029572664 = score(doc=1107,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.19345059 = fieldWeight in 1107, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=1107)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Retrieval of disease information is often based on several key aspects such as etiology, diagnosis, treatment, prevention, and symptoms of diseases. Automatic identification of disease aspect information is thus essential. In this article, I model the aspect identification problem as a text classification (TC) problem in which a disease aspect corresponds to a category. The disease aspect classification problem poses two challenges to classifiers: (a) a medical text often contains information about multiple aspects of a disease and hence produces noise for the classifiers and (b) text classifiers often cannot extract the textual parts (i.e., passages) about the categories of interest. I thus develop a technique, PETC (Passage Extractor for Text Classification), that extracts passages (from medical texts) for the underlying text classifiers to classify. Case studies on thousands of Chinese and English medical texts show that PETC enhances a support vector machine (SVM) classifier in classifying disease aspect information. PETC also performs better than three state-of-the-art classifier enhancement techniques, including two passage extraction techniques for text classifiers and a technique that employs term proximity information to enhance text classifiers. The contribution is of significance to evidence-based medicine, health education, and healthcare decision support. PETC can be used in those application domains in which a text to be classified may have several parts about different categories.
- Date
- 28.10.2013 19:22:57
-
Zhu, W.Z.; Allen, R.B.: Document clustering using the LSI subspace signature model (2013)
0.01
0.0076993788 = product of:
0.023098135 = sum of:
0.005354538 = weight(_text_:in in 690) [ClassicSimilarity], result of:
0.005354538 = score(doc=690,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.09017298 = fieldWeight in 690, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=690)
0.017743597 = product of:
0.035487194 = sum of:
0.035487194 = weight(_text_:22 in 690) [ClassicSimilarity], result of:
0.035487194 = score(doc=690,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.23214069 = fieldWeight in 690, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=690)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- We describe the latent semantic indexing subspace signature model (LSISSM) for semantic content representation of unstructured text. Grounded on singular value decomposition, the model represents terms and documents by the distribution signatures of their statistical contribution across the top-ranking latent concept dimensions. LSISSM matches term signatures with document signatures according to their mapping coherence between latent semantic indexing (LSI) term subspace and LSI document subspace. LSISSM does feature reduction and finds a low-rank approximation of scalable and sparse term-document matrices. Experiments demonstrate that this approach significantly improves the performance of major clustering algorithms such as standard K-means and self-organizing maps compared with the vector space model and the traditional LSI model. The unique contribution ranking mechanism in LSISSM also improves the initialization of standard K-means compared with random seeding procedure, which sometimes causes low efficiency and effectiveness of clustering. A two-stage initialization strategy based on LSISSM significantly reduces the running time of standard K-means procedures.
- Date
- 23. 3.2013 13:22:36
-
Khoo, C.S.G.; Ng, K.; Ou, S.: ¬An exploratory study of human clustering of Web pages (2003)
0.01
0.0068576634 = product of:
0.02057299 = sum of:
0.008743925 = weight(_text_:in in 2741) [ClassicSimilarity], result of:
0.008743925 = score(doc=2741,freq=12.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.14725187 = fieldWeight in 2741, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.03125 = fieldNorm(doc=2741)
0.011829065 = product of:
0.02365813 = sum of:
0.02365813 = weight(_text_:22 in 2741) [ClassicSimilarity], result of:
0.02365813 = score(doc=2741,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.15476047 = fieldWeight in 2741, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=2741)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- This study seeks to find out how human beings cluster Web pages naturally. Twenty Web pages retrieved by the Northem Light search engine for each of 10 queries were sorted by 3 subjects into categories that were natural or meaningful to them. lt was found that different subjects clustered the same set of Web pages quite differently and created different categories. The average inter-subject similarity of the clusters created was a low 0.27. Subjects created an average of 5.4 clusters for each sorting. The categories constructed can be divided into 10 types. About 1/3 of the categories created were topical. Another 20% of the categories relate to the degree of relevance or usefulness. The rest of the categories were subject-independent categories such as format, purpose, authoritativeness and direction to other sources. The authors plan to develop automatic methods for categorizing Web pages using the common categories created by the subjects. lt is hoped that the techniques developed can be used by Web search engines to automatically organize Web pages retrieved into categories that are natural to users. 1. Introduction The World Wide Web is an increasingly important source of information for people globally because of its ease of access, the ease of publishing, its ability to transcend geographic and national boundaries, its flexibility and heterogeneity and its dynamic nature. However, Web users also find it increasingly difficult to locate relevant and useful information in this vast information storehouse. Web search engines, despite their scope and power, appear to be quite ineffective. They retrieve too many pages, and though they attempt to rank retrieved pages in order of probable relevance, often the relevant documents do not appear in the top-ranked 10 or 20 documents displayed. Several studies have found that users do not know how to use the advanced features of Web search engines, and do not know how to formulate and re-formulate queries. Users also typically exert minimal effort in performing, evaluating and refining their searches, and are unwilling to scan more than 10 or 20 items retrieved (Jansen, Spink, Bateman & Saracevic, 1998). This suggests that the conventional ranked-list display of search results does not satisfy user requirements, and that better ways of presenting and summarizing search results have to be developed. One promising approach is to group retrieved pages into clusters or categories to allow users to navigate immediately to the "promising" clusters where the most useful Web pages are likely to be located. This approach has been adopted by a number of search engines (notably Northem Light) and search agents.
- Date
- 12. 9.2004 9:56:22
- 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
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.01
0.0059145326 = product of:
0.035487194 = sum of:
0.035487194 = product of:
0.07097439 = sum of:
0.07097439 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.07097439 = score(doc=1046,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = queryNorm
0.46428138 = fieldWeight in 1046, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=1046)
0.5 = coord(1/2)
0.16666667 = coord(1/6)
- Date
- 5. 5.2003 14:17:22
-
Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007)
0.00
0.003450144 = product of:
0.020700864 = sum of:
0.020700864 = product of:
0.04140173 = sum of:
0.04140173 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
0.04140173 = score(doc=2560,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = 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.16666667 = coord(1/6)
- Date
- 22. 9.2008 18:31:54
-
Barbu, E.: What kind of knowledge is in Wikipedia? : unsupervised extraction of properties for similar concepts (2014)
0.00
0.0026772693 = product of:
0.016063616 = sum of:
0.016063616 = weight(_text_:in in 1547) [ClassicSimilarity], result of:
0.016063616 = score(doc=1547,freq=18.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.27051896 = fieldWeight in 1547, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=1547)
0.16666667 = coord(1/6)
- Abstract
- This article presents a novel method for extracting knowledge from Wikipedia and a classification schema for annotating the extracted knowledge. Unlike the majority of approaches in the literature, we use the raw Wikipedia text for knowledge acquisition. The main assumption made is that the concepts classified under the same node in a taxonomy are described in a comparable way in Wikipedia. The annotation of the extracted knowledge is done at two levels: ontological and logical. The extracted properties are evaluated in the traditional way, that is, by computing the precision of the extraction procedure and in a clustering task. The second method of evaluation is seldom used in the natural language processing community, but it is regularly employed in cognitive psychology.
-
Ingwersen, P.; Wormell, I.: Ranganathan in the perspective of advanced information retrieval (1992)
0.00
0.0026606917 = product of:
0.01596415 = sum of:
0.01596415 = weight(_text_:in in 7695) [ClassicSimilarity], result of:
0.01596415 = score(doc=7695,freq=10.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.26884392 = fieldWeight in 7695, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=7695)
0.16666667 = coord(1/6)
- Abstract
- Examnines Ranganathan's approach to knowledge organisation and its relevance to intellectual accessibility in libraries. Discusses the current and future developments of his methodology and theories in knowledge-based systems. Topics covered include: semi-automatic classification and structure of thesauri; user-intermediary interactions in information retrieval (IR); semantic value-theory and uncertainty principles in IR; and case grammar
-
Fang, H.: Classifying research articles in multidisciplinary sciences journals into subject categories (2015)
0.00
0.0024665273 = product of:
0.014799163 = sum of:
0.014799163 = weight(_text_:in in 2194) [ClassicSimilarity], result of:
0.014799163 = score(doc=2194,freq=22.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.24922498 = fieldWeight in 2194, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=2194)
0.16666667 = coord(1/6)
- Abstract
- In the Thomson Reuters Web of Science database, the subject categories of a journal are applied to all articles in the journal. However, many articles in multidisciplinary Sciences journals may only be represented by a small number of subject categories. To provide more accurate information on the research areas of articles in such journals, we can classify articles in these journals into subject categories as defined by Web of Science based on their references. For an article in a multidisciplinary sciences journal, the method counts the subject categories in all of the article's references indexed by Web of Science, and uses the most numerous subject categories of the references to determine the most appropriate classification of the article. We used articles in an issue of Proceedings of the National Academy of Sciences (PNAS) to validate the correctness of the method by comparing the obtained results with the categories of the articles as defined by PNAS and their content. This study shows that the method provides more precise search results for the subject category of interest in bibliometric investigations through recognition of articles in multidisciplinary sciences journals whose work relates to a particular subject category.
-
Ru, C.; Tang, J.; Li, S.; Xie, S.; Wang, T.: Using semantic similarity to reduce wrong labels in distant supervision for relation extraction (2018)
0.00
0.0024665273 = product of:
0.014799163 = sum of:
0.014799163 = weight(_text_:in in 5055) [ClassicSimilarity], result of:
0.014799163 = score(doc=5055,freq=22.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.24922498 = fieldWeight in 5055, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=5055)
0.16666667 = coord(1/6)
- Abstract
- Distant supervision (DS) has the advantage of automatically generating large amounts of labelled training data and has been widely used for relation extraction. However, there are usually many wrong labels in the automatically labelled data in distant supervision (Riedel, Yao, & McCallum, 2010). This paper presents a novel method to reduce the wrong labels. The proposed method uses the semantic Jaccard with word embedding to measure the semantic similarity between the relation phrase in the knowledge base and the dependency phrases between two entities in a sentence to filter the wrong labels. In the process of reducing wrong labels, the semantic Jaccard algorithm selects a core dependency phrase to represent the candidate relation in a sentence, which can capture features for relation classification and avoid the negative impact from irrelevant term sequences that previous neural network models of relation extraction often suffer. In the process of relation classification, the core dependency phrases are also used as the input of a convolutional neural network (CNN) for relation classification. The experimental results show that compared with the methods using original DS data, the methods using filtered DS data performed much better in relation extraction. It indicates that the semantic similarity based method is effective in reducing wrong labels. The relation extraction performance of the CNN model using the core dependency phrases as input is the best of all, which indicates that using the core dependency phrases as input of CNN is enough to capture the features for relation classification and could avoid negative impact from irrelevant terms.
- Theme
- Semantisches Umfeld in Indexierung u. Retrieval
-
Rijsbergen, C.J. van: Automatic classification in information retrieval (1978)
0.00
0.0023797948 = product of:
0.014278769 = sum of:
0.014278769 = weight(_text_:in in 2412) [ClassicSimilarity], result of:
0.014278769 = score(doc=2412,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.24046129 = fieldWeight in 2412, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.125 = fieldNorm(doc=2412)
0.16666667 = coord(1/6)
-
Sparck Jones, K.: Automatic classification (1976)
0.00
0.0023797948 = product of:
0.014278769 = sum of:
0.014278769 = weight(_text_:in in 2908) [ClassicSimilarity], result of:
0.014278769 = score(doc=2908,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.24046129 = fieldWeight in 2908, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.125 = fieldNorm(doc=2908)
0.16666667 = coord(1/6)
- Source
- Classification in the 1970s: a second look. Rev. ed. Ed.: A. Maltby
