A Hierarchical Monothetic Document Clustering Algorithm for 一個分層單文檔聚類算法

1、a hierarchical monothetic document clustering algorithm for summarization and browsing search resultskummamuru et al.presented by bei yusept. 22nd, 2004roadmapnproperties of topic hierarchynautomatic taxonomy generation (atg)nmonothetic atgndiscover algorithmncaard algorithmndsp algorithmnresult com

2、parisonnquestionsgenerating topic hierarchy (taxonomy)ndesirable properties of topic hierarchyndocument coveragencompactness (breadth/depth, node number)nsibling node distinctivenessnnode label predictivenessngeneral to specificnreach timemonothetic atg nautomatic taxonomy generation (atg)nmonotheti

3、c vs. polytheticnmonothetic: single-feature based cluster assignmentnpolythetic: multiple-features based assignment nkeywords vs. documents vs. both clusteringntop-down vs. bottom-upnmonothetic atgnsubsumption algorithm (sanderson and croft, 1999)ndsp (lawrie et al., 2001)ncaard (kummamuru and krish

4、napuram, 2001)ndiscover (this paper)discovernprogressively grow the hierarchyncoverage and compactness tradeoffngenerate an optimal permuted sequence of the concepts under a node.nevery document represented as a set of concepts;n“concepts under the node” means all the the other concepts in the docum

5、ents covered by the node.nselect an optimal subset from the concepts with maximal coverage and distinctivenessnquestion: preset the child node number?discover| )()(|),(| )()(|),(),(2),(1),(),()(1,1,1,1,1,1,1,1,1,maxargkjjkdkjjkcjkdjkcjkjjkjstctcsgsdcdcsgcsgwcsgwcsguccsgkkcoveragedistinctivenesscaard

6、 (kummamuru and krishnapuram, 2001)corpusconceptsinclusion degree:| / |iijijwwwidtop-level min_subsetrest subsetijidrecursivedsp (lawrie et al., 2001)corpustopic termstop-level topic termsvocabulary termsmaximal predictive power and vocabulary coveragelanguage modela: topic term; b: vocabularya=brec

7、ursiona - subtopic term around topicb=a?)|(prbaxevaluationnin generalnprecisionnf-measurenuser studynsummary evaluation (emim cmp. tf*idf)nreachabilitynreach timenthis paper comparesncomputation complexityncoverage and compactnessnreach timenuser studyresultsresultsresultsquestionsnthe performance as the n