Co-Clustering Bipartite with Pattern Preservation for Topic Extraction
نویسندگان
چکیده
Tianming Hu1, Chew Lim Tan2, Yong Tang3, Sam Yuan Sung4, Hui Xiong5, Chao Qu1 1Department of Computer Science, DongGuan University of Technology [email protected], [email protected] 2Department of Computer Science, National University of Singapore [email protected] 3Department of Computer Science, Sun Yat-Sen University [email protected] 4Department of Computer Science, South Texas College [email protected] 5Management Science and Information Systems Department, Rutgers University
منابع مشابه
Bipartite Graph for Topic Extraction
This article presents a bipartite graph propagation method to be applied to different tasks in the machine learning unsupervised domain, such as topic extraction and clustering. We introduce the objectives and hypothesis that motivate the use of graph based method, and we give the intuition of the proposed Bipartite Graph Propagation Algorithm. The contribution of this study is the development ...
متن کاملImproving semantic topic clustering for search queries with word co-occurrence and bigraph co-clustering
Uncovering common themes from a large number of unorganized search queries is a primary step to mine insights about aggregated user interests. Common topic modeling techniques for document modeling often face sparsity problems with search query data as these are much shorter than documents. We present two novel techniques that can discover semantically meaningful topics in search queries: i) wo...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملDetecting Sub-Topic Correspondence through Bipartite Term Clustering
This paper addresses a novel task of detecting sub-topic correspondence in a pair of text fragments, enhancing common notions of text similarity. This task is addressed by coupling corresponding term subsets through bipartite clustering. The paper presents a cost-based clustering scheme and compares it with a bipartite version of the single-link method, providing illustrating results.
متن کاملA Bipartite Graph Co-Clustering Approach to Ontology Mapping
The necessity of mapping concepts of one ontology to concepts in a second ontology is an important research topic due to the requirements brought by the Semantic Web. Most ontology mapping techniques available today do not allow the existence of many-to-many correspondences among concepts. To overcome this problem we propose to model two ontologies as a weighted bipartite graph. We assign weigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal on Artificial Intelligence Tools
دوره 17 شماره
صفحات -
تاریخ انتشار 2008