%0 Journal Article
%T A Web Document Clustering Algorithm Based on Association Rule<br>基于关联规则的Web文档聚类算法
%A SONG Qin-bao
%A SHEN Jun-yi
%A <br>宋擒豹
%A 沈钧毅
%J 软件学报
%D 2002
%I 
%X By grouping similar Web documents into clusters, the search space can be reduced, the search accelerated, and its precision improved. In this paper, a new clustering algorithm is introduced. In the clustering technique, topics are represented according to VSM (vector space model), documents are represented according to topics, and the relation between documents and topics is viewed in a transactional form, each document corresponds to a transaction and each topic corresponds to an item. A frequent item sets can be found by using the association riles discovery algorithm,corresponding documents can be seen as initial clusters.These clusters are merged according to the disance between clusters,or divided aivided according to the strength of connection among documents of a cluster.By real Wed documents,experimental results show the algorithm's effectivenss and suitability for tackling the overlapping clusters inhered by documents.
%K document clustering
%K association rule
%K Web mining
%K WWW<br>文档聚类
%K 关联规则
%K Web挖掘
%K WWW
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=AC15922238B3F442&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=38B194292C032A66&sid=84A93BA251D28205&eid=F27A401E323B6FAD&journal_id=1000-9825&journal_name=软件学报&referenced_num=33&reference_num=7