期刊文献+

一种求解聚类问题的分布估计算法 被引量:3

Estimation of Distribution Algorithm for Solving Clustering Problem
下载PDF
导出
摘要 提出一种求解聚类问题的分布估计算法。基于PBIL算法定义聚类矩阵,建立对应的概率矩阵模型,引入遗传算法的基因变异算子,设计适用于分布估计算法的变异操作,改进概率模型的更新方式。实验结果表明,与Kmeans、Kmedioid、Clarans和遗传算法相比,该算法的聚类质量较好。 Based on PBIL algorithm,clustering matrix and clustering probability matrix model are designed.After leading in arithmetic operators of gene mutation in genetic algorithm,mutation which adapts to Estimation of Distribution Algorithms(EDA) is designed.After improving update mode of probabilistic model,a new estimation of distribution algorithms which can be applied to solving clustering problems is originated.By comparing new algorithms with Kmeans,Kmedioid,Clarans algorithm and Genetic Algorithm(GA),better clustering quality and general performance of new algorithms are confirmed by experimental results.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第22期191-192,195,共3页 Computer Engineering
基金 国家"973"计划基金资助项目(2009CB326203) 国家自然科学基金资助项目(61070131) 安徽高校省级自然科学重点研究基金资助项目(KJ2010B270) 安徽高校优秀青年人才基金资助项目(2009SQRZ188)
关键词 聚类 分布估计算法 概率模型 遗传算法 变异 clustering Estimation of Distribution Algorithm(EDA) probabilistic model Genetic Algorithm(GA) mutation
  • 相关文献

参考文献6

二级参考文献134

  • 1周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 2李士勇,杨丹.基于改进蚁群算法的巡航导弹航迹规划[J].宇航学报,2007,28(4):903-907. 被引量:22
  • 3[1]Fasulo, D. An analysis of recent work on clustering algorithms. Technical Report, Department of Computer Science and Engineering, University of Washington, 1999. http://www.cs.washington.edu.
  • 4[2]Baraldi, A., Blonda, P. A survey of fuzzy clustering algorithms for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999,29:786~801.
  • 5[3]Keim, D.A., Hinneburg, A. Clustering techniques for large data sets - from the past to the future. Tutorial Notes for ACM SIGKDD 1999 International Conference on Knowledge Discovery and Data Mining. San Diego, CA, ACM, 1999. 141~181.
  • 6[4]McQueen, J. Some methods for classification and Analysis of Multivariate Observations. In: LeCam, L., Neyman, J., eds. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. 1967. 281~297.
  • 7[5]Zhang, T., Ramakrishnan, R., Livny, M. BIRCH: an efficient data clustering method for very large databases. In: Jagadish, H.V., Mumick, I.S., eds. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. Quebec: ACM Press, 1996. 103~114.
  • 8[6]Guha, S., Rastogi, R., Shim, K. CURE: an efficient clustering algorithm for large databases. In: Haas, L.M., Tiwary, A., eds. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 73~84.
  • 9[7]Beyer, K.S., Goldstein, J., Ramakrishnan, R., et al. When is 'nearest neighbor' meaningful? In: Beeri, C., Buneman, P., eds. Proceedings of the 7th International Conference on Data Theory, ICDT'99. LNCS1540, Jerusalem, Israel: Springer, 1999. 217~235.
  • 10[8]Ester, M., Kriegel, H.-P., Sander, J., et al. A density-based algorithm for discovering clusters in large spatial databases with noises. In: Simoudis, E., Han, J., Fayyad, U.M., eds. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96). AAAI Press, 1996. 226~231.

共引文献293

同被引文献34

  • 1吕纯濂,陈舜华,杨勇杰.线性模型中变量和变换的同时选择[J].数值计算与计算机应用,2005,26(1):26-35. 被引量:4
  • 2周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 3Watts D J, Strogatz S H. Collective Dynamics of Small-world Networks[J]. Nature, 1998, 393(6684): 440-442.
  • 4Adamic L A, Huberman B A, Barabasi A L, et al. Power-law Distribution of the World Wide Web[J]. Science, 2000, 287(5461).
  • 5Girvan M, Newman M E J. Community Structure in Social and Biological Networks[J]. Proceedings of National Academy of Sciences, 2002, 99(12): 7821-7826.
  • 6Yan G, Chen G, Lv J, et al. Synchronization Performance of Complex Oscillator Networks[J]. Physical Review E, 2009, 80(5).
  • 7Fortunato S. Community Detection in Graphs[J]. Physics Reports, 2010, 486(3-5): 75-174.
  • 8Newman M E J, Girvan M. Finding and Evaluating Com- munity Structure in Networks[J]. Physical Review E, 2004, 69(2).
  • 9Brandes U, Delling D, Gaertler M, et al. Maximizing Modu- larity is Hard[EB/OL]. (2010-11-21). http://www.researchgate. net/publication/2176834_Maximizing_Modularity_is_hard.
  • 10Tasgin M, Herdagdelen A, Bingol H. Community Detection in Complex Networks Using Genetic Algorithms[EB/OL]. (2010-01-21). http://arxiv.org/abs/cond-mat/0604419.

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部