894 resultados para Query expansion, Text mining, Information retrieval, Chinese IR
Resumo:
Includes bibliographical references.
Resumo:
Bibliography: p. 95.
Resumo:
"Written as supplementary material for a course in data structures given by the Dept. of Computer Science of the University of Illinois at Urbana-Champaign, during the second semester of the 1970-71 academic year"--Leaf 1.
Resumo:
For 1915-1916, Sumner Smith continued the reporting of mining information in two monographs entitled: The mining industry in the Territory of Alaska during the calendar year 1915[-1916], issued as Bureau of Mines bulletins 142 and 153. At the same time, a Territorial Mine Inspector had also been appointed in 1915, and reports from this office were issued from 1915-1925/26 as: Report of the Territorial Mine Inspector to the Goveror of Alaska, etc.
Resumo:
"June 30, 1987."
Resumo:
"Reprinted from the American Journal of Mathematics, vol. XLIV, no. 1, January, 1922."
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
"Made up of resumés and indexes of documents [of educational significance] ... numbered sequentially with ED prefixes and current Office of Education research projects [with EP prefixes]".
Resumo:
Mode of access: Internet.
Resumo:
In this paper we explore the use of text-mining methods for the identification of the author of a text. We apply the support vector machine (SVM) to this problem, as it is able to cope with half a million of inputs it requires no feature selection and can process the frequency vector of all words of a text. We performed a number of experiments with texts from a German newspaper. With nearly perfect reliability the SVM was able to reject other authors and detected the target author in 60–80% of the cases. In a second experiment, we ignored nouns, verbs and adjectives and replaced them by grammatical tags and bigrams. This resulted in slightly reduced performance. Author detection with SVMs on full word forms was remarkably robust even if the author wrote about different topics.
Resumo:
Spatial data mining recently emerges from a number of real applications, such as real-estate marketing, urban planning, weather forecasting, medical image analysis, road traffic accident analysis, etc. It demands for efficient solutions for many new, expensive, and complicated problems. In this paper, we investigate the problem of evaluating the top k distinguished “features” for a “cluster” based on weighted proximity relationships between the cluster and features. We measure proximity in an average fashion to address possible nonuniform data distribution in a cluster. Combining a standard multi-step paradigm with new lower and upper proximity bounds, we presented an efficient algorithm to solve the problem. The algorithm is implemented in several different modes. Our experiment results not only give a comparison among them but also illustrate the efficiency of the algorithm.
Resumo:
The main aim of the proposed approach presented in this paper is to improve Web information retrieval effectiveness by overcoming the problems associated with a typical keyword matching retrieval system, through the use of concepts and an intelligent fusion of confidence values. By exploiting the conceptual hierarchy of the WordNet (G. Miller, 1995) knowledge base, we show how to effectively encode the conceptual information in a document using the semantic information implied by the words that appear within it. Rather than treating a word as a string made up of a sequence of characters, we consider a word to represent a concept.