首页 | 官方网站   微博 | 高级检索  
     

基于自适应混沌粒子群的Web搜索结果聚类研究
引用本文:童亚拉.基于自适应混沌粒子群的Web搜索结果聚类研究[J].微电子学与计算机,2010,27(1).
作者姓名:童亚拉
作者单位:湖北工业大学,理学院,湖北,武汉,430068
基金项目:国家自然科学基金,湖北工业大学博士科研启动基金 
摘    要:提出了基于自适应混沌粒子群的Web搜索结果模糊C-均值算法,用粒子群算法代替模糊C-均值算法梯度下降的迭代过程,同时引入自适应的平衡搜索策略加快算法收敛和提高去噪能力,在增强局部搜索能力的同时引导粒子群跳出局部极值点.这样不仅在一定程度上解决了网页文档不确定性的问题,而且获得快速、稳定的聚类效果.

关 键 词:Web搜索结果聚类  混沌粒子群  模糊C-均值算法  自适应策略

Research of Web Search Results Clustering Based on Adaptive Chaos Particle Swarm Optimization
TONG Ya-la.Research of Web Search Results Clustering Based on Adaptive Chaos Particle Swarm Optimization[J].Microelectronics & Computer,2010,27(1).
Authors:TONG Ya-la
Abstract:A fuzzy C-means clustering algorithm based on adaptive chaotic particle swarm optimization (ACPSO) is pro-posed in the thesis. On one hand, interactive procedure based on FCM is replaced by that of PSO; on the other hand, a balanced adaptive search strategy is embedded so as to accelerate algorithm convergence, improve the capacity of de- nois-ing, enforce local search ability, and escape from local optimization. It will not only solve indeterminacy of Web document in parts, but also obtain stable clustering results quickly.
Keywords:web search results clustering  chaotic PSO  fuzzy C-means algorithm  adaptive strategy
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号