Leveraging Probabilistic Segmentation to Document Clustering

被引:0
作者
Banerjee, Arko [1 ]
机构
[1] Coll Engn & Management, Kolaghat, India
来源
2015 EIGHTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3) | 2015年
关键词
document clustering; boundary entropy; forward-backward algorithm;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper a novel approach to document clustering has been introduced by defining a representative-based document similarity model that performs probabilistic segmentation of documents into chunks. The frequently occuring chunks that are considered as representatives of the document set, may represent phrases or stem of true words. The representative based document similarity model, containing a term-document matrix with respect to the representatives, is a compact representation of the vector space model that improves quality of document clustering over traditional methods.
引用
收藏
页码:82 / 87
页数:6
相关论文
共 20 条
[1]  
[Anonymous], 2011, INDUCTIVE DATABASES
[2]  
BELLMAN R, 1961, COMMUNICATIONS ACM, V4
[3]   Efficient phrase-based document similarity for clustering [J].
Chim, Hung ;
Deng, Xiaotie .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2008, 20 (09) :1217-1229
[4]  
Cohen P., 2006, J INTELLIGENT DATA A
[5]   Efficient phrase-based document indexing for web document clustering [J].
Hammouda, KM ;
Kamel, MS .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2004, 16 (10) :1279-1296
[6]  
Hewlett D., 2011, FULLY UNSUPERVISED W, P540
[7]  
Hewlett D, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P1071
[8]  
Lewis D.D., REUTERS 21578 TEXT C
[9]   Identifying hierarchical structure in sequences: A linear-time algorithm [J].
NevillManning, CG ;
Witten, IH .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1997, 7 :67-82
[10]  
Rabiner, 2013, 1 HAND HIDDEN MARKOV