The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Improvement of clustering algorithm in chinese web retrieval
Author(s): 
Pages: 2685-2687
Year: Issue:  10
Journal: COMPUTER ENGINEERING AND DESIGN

Keyword:  文本聚类算法信息检索Web挖掘;
Abstract: 对基于混合相似度的HTFC算法进行改进,要做的预处理是:建立向量空间模型,计算文档和链接的混合相似度.算法过程是:首先随机选取√kn个文档进行层次聚类,直到剩k个聚簇为止;对这k个聚簇不断迭代直到集合元素不再变化为止;然后表示出每类;最后通过用户对结果的反馈使得新生成的簇继续迭代,最终满足用户需求.算法第1步采用的是改进的k-means算法,可提高运行效率.反馈机制对原有模型进一步修正,从而提高精度.
Related Articles
loading...