TAILIEUCHUNG - Báo cáo khoa học: "Searching for Topics in a Large Collection of Texts"

We describe an original method that automatically finds specific topics in a large collection of texts. Each topic is first identified as a specific cluster of texts and then represented as a virtual concept, which is a weighted mixture of words. Our intention is to employ these virtual concepts in document indexing. In this paper we show some preliminary experimental results and discuss directions of future work. | Searching for Topics in a Large Collection of Texts Martin Holub Jiri Semecky Jiri Divis Center for Computational Linguistics Charles University Prague holub semecky @ Abstract We describe an original method that automatically finds specific topics in a large collection of texts. Each topic is first identified as a specific cluster of texts and then represented as a virtual concept which is a weighted mixture of words. Our intention is to employ these virtual concepts in document indexing. In this paper we show some preliminary experimental results and discuss directions of future work. 1 Introduction In the field of information retrieval for a detailed survey see . Baeza-Yates and Ribeiro-Neto 1999 document indexing and representing documents as vectors belongs among the most successful techniques. Within the framework of the well known vector model the indexed elements are usually individual words which leads to high dimensional vectors. However there are several approaches that try to reduce the high dimensionality of the vectors in order to improve the effec-tivity of retrieving. The most famous is probably the method called Latent Semantic Indexing LSI introduced by Deerwester et al. 1990 which employs a specific linear transformation of original word-based vectors using a system of latent semantic concepts . Other two approaches which inspired us namely Dhillon and Modha 2001 and Torkkola 2002 are similar to LSI but dif ferent in the way how they project the vectors of documents into a space of a lower dimension. Our idea is to establish a system of virtual concepts which are linear functions represented by vectors extracted from automatically discovered concept-formative clusters of documents. Shortly speaking concept-formative clusters are semantically coherent and specific sets of documents which represent specific topics. This idea was originally proposed by Holub 2003 who hypothesizes that concept-oriented vector .

• Báo cáo khoa học
• Searching
• Topics in a Large Collection of Texts
• Martin Holub Ji
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• The art of computer programming
• Volume 3: Sorting and searching
• Donald Ervin Knuth
• Sequential searching
• Searching by Comparison of Keys
• Binary tree searching
• Digital searching
• Electronic digital computers programming
• Computer algorithms
• Searching multimedia databases by content
• Searching multimedia databases
• Database indexing methods
• Primary key access methods
• Secondary key access methods
• Spatial access methods (SAMS)
• Indexing signals
• 1 D time sequences
• 2 D color images
• Sub pattern matching
• Mathematical toolbox
• công nghệ thông tin
• haking
• Dangerous Google
• Searching for Secrets
• information
• Computer
• Machine code
• Programming language
• Program design
• Components
• Searching Questions
• Identifying Question Topic
• Question Focus
• báo cáo ngôn ngữ
• Special issue paper PAR 3D BLAST
• Aligning protein structures
• A parallel tool for searching
• Structural classification of proteins growth by release
• Multi core 3D BLAST algorithm
• Multi node 3D BLAST algorithm
• Solving Problem by Searching
• Problem solving agents
• Problem types
• Problem formulation
• Basic search algorithms
• Uninformed search
• Object Oriented Programing
• Lecture Object Oriented Programing
• Programming languages
• Searching algorithms
• Sorting algorithms
• Linear search
• International journal of computer science & communication networks
• Improved K means algorithm for searching research papers
• Improved K means algorithm
• Enhanced K means Algorithm
• The knowledge database
• Information need
• Information need index
• Information sharing
• Information searching
• Rice farmers
• BMC Cancer
• Breast cancer
• Searching reliable
• Protein cancer biomarkers
• Breast fluid secretome
• BMC Bioinformatics
• Protein homology
• Batch searching
• Protein query sequences
• Amino acid
• Luận án Tiến sĩ
• Luận án Tiến sĩ Toán học
• Mathematical theory of tnformatics
• Searching techniques
• Entities based
• Implicit semantic relations
• Context aware query suggestions
• Information searching behaviors
• University students
• COVID 19 pandemic
• Online COVID 19 information seeking
• Information related the coronavirus
• Báo cáo chuyên đề
• Chuyên đề Công nghệ phần mềm
• Công nghệ phần mềm
• Công nghệ Pattern searching
• Tìm kiếm mẫu từ vị trí cụ thể
• Tìm kiếm mẫu từ vị trí bất kỳ
• Information and communication technology
• Heart rate reading patterns
• Moment of information overload
• Online information searching
• Humanities and social science
• The performing arts
• Supply side perspective
• Searching for the artistic benefit
• Cultural consumption
• Customer engagement
• Value co creation
• Minimum Comparison sorting
• The oscillating sort
• Internal sorting
• Optimum sorting
• External sorting
• Cấu trúc dữ liệu
• Cấu trúc dữ liệu và giải thuật
• Data structures
• Các thuật toán tìm kiếm chuỗi
• String searching algorithms
• String searching