期刊文献+

社团挖掘的粒计算方法研究 被引量:1

Study on community mining based on granular computing approach
下载PDF
导出
摘要 挖掘社会网络中的社团结构是当今一个非常有挑战性和发展潜力的研究领域。粒计算理论具有模拟了人类思考和解决问题方式的一种智能信息处理模型,它通过将问题进行粒化成具有不同粒度大小的粒度空间上,以简化问题的求解。借助粒计算思想,改进了对结点之间的紧密关系的度量方法。基于粗糙集模型的粒计算方法给出了覆盖粒和覆盖粒度空间等概念,提出一种基于粒计算方法的社团挖掘数据模型,得到几个相关性质,并设计相应的基于粒计算社团结构挖掘方法,即将社团挖掘问题转换成在覆盖粒度空间上的粒度转换问题。通过实例在3个标准测试数据集上测试,并对比试验结果,表明所提出的方法是有效的。 Mining the community structure of social network is a challenging research area with great de- velopment potential nowadays. Granular computing( GrC ) is an emerging computing paradigm of intelligent information processing, which simulates the ways of human thinking and solving problems. It can simplify the solution of a problem by granulating the prob|em and implementing it in a granulation space with different levels. First of all, with the idea of granular computing, the measurement of the close relationship between nodes is improved. Next,with some concepts such as coverage granules and a corresponding cov- erage granular space being defined, a data model for mining community structure based on granular com- puting approach is built and several related properties are obtained. On the basis of the coverage granular spaces ,the method for mining community structure is presented, which converts solving the problem of community mining into realizing corresponding granularity translation in different levels in the coverage granular space. Finally,a real instance is illustrated and the tests and comparisons in three real standard data sets are implemented. Experimental results show that the proposed method is feasible.
出处 《南昌工程学院学报》 CAS 2015年第4期43-51,共9页 Journal of Nanchang Institute of Technology
基金 国家自然科学基金资助项目(61070139 81460769) 江西省教育厅科技计划项目(GJJ14134 GJJ14143)
关键词 社会网络 社团挖掘 粒计算 social network community mining granular computing
  • 相关文献

参考文献18

  • 1Karrer B,Nemmm M E J. Stochastic blocels and community structure in networks[ J ]. Physical Review E,2011,83(1 ) :1 - 10.
  • 2Nadakuditi R R, Newman M E J. Graph Spectra and the Detectability of Community Structure in Networks [ J ]. Physical Review Letters,2012,108(18) :5.
  • 3Duch J ,Arenas A. Community detection in complex networks using extreme optimization[ J ]. Physical Review E ,2005,72(2) :1 -4.
  • 4王国胤,李德毅,姚一豫,等.云模型与粒计算[M].北京:科学出版社,2012.
  • 5陈艺璇.基于多目标遗传算法的复杂网络社区划分[D].兰州:兰州大学,2012.
  • 6Bastani S, Jafarabad A K, Zarandi M H F. Fuzzy Models for Link Prediction in Social Networks [ J ]. International Journal of Intel- ligent System,2013,28:768 - 786.
  • 7Clauset A,Newman M E J,Moore C. Finding community structure in very large networks[ J ]. Physical Review E,2004,70(6):1 -6.
  • 8Ball B,Karrer B,Newman M E J. Efficient and principled method for detecting communities in networks[J]. Physical Review E, 2011,84(3) :1 -3.
  • 9徐计,王国胤,于洪.基于粒计算的大数据处理[J].计算机学报,2014,37(113):1-22.
  • 10Yager R R. Granular Computing for Intelligent Social Network Modeling and Cooperative Decisions[ C]. In Prec. 4th IEEE Inter- national Conference,2008 ( 1 ) : 13 - 17.

二级参考文献26

  • 1胡健,杨炳儒.基于边聚集系数的社区结构发现算法[J].计算机应用研究,2009,26(3):858-859. 被引量:10
  • 2NEWMAN M E J, GIRVAN M. Finding and evaluating community structure in networks[ J]. Phys Rev E, 2004,69(2) :026113.
  • 3CLAUSET A,NEWMAN M E J,MOORE C. Finding community structure in very large networks [ J ]. Phys Rev E,2004,70 (6) :066111.
  • 4BEZDEK J C, BOGGAVARAPU S, HALL L O,et al. Genetic algorithm guided clustering [ C ]//Proc of the 1st Conference on Evolutionary Computation. [ S. 1. ] : IEEE Press, 1994:34-39.
  • 5NEWMAN M E J. Fast algorithm for detecting community structure in networks[J]. Phys Rev E,2004,69(6) :066133.
  • 6KERNIGHAN B W,LIN S. An efficient heuristic procedure for partitioning graphs[ J]. Bell System Technical Journal, 1970,49 ( 1 ) : 291-307.
  • 7POTHEN A, SIMON H, LIOU K P. Partitioning sparse matrices with eigenvectors of graphs [ J ]. SIAM d Matrix Anal Appl, 1990,11 (3) : 430-452.
  • 8HAN Jia-wei, KANBER M. Data mining: concepts and techniques [ M ]. San Francisco : Morgan Kaufmann Publishers,2000.
  • 9ORDONEZ C, OMIECINSKI E. Efficient disk-based K-means clustering for relational databases [ J]. IEEE Trans on Knowledge and Data Engineering,2004,16 ( 8 ) :909-921.
  • 10FORTUNATO S, LATORA V, MARCHIORI M. A method to find community structures based on information centrality [ J ]. Phys Rev E, 2004,70:056104.

共引文献34

同被引文献5

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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