| 以图频繁集为基础的核心节点发现 |
| |
| 引用本文： | 宋文军,刘红星,王崇骏,谢俊元. 以图频繁集为基础的核心节点发现[J]. 计算机科学与探索, 2010, 4(1): 82-88. DOI: 10.3778/j.issn.1673-9418.2010.01.009 |
| |
| 作者姓名： | 宋文军 刘红星 王崇骏 谢俊元 |
| |
| 作者单位： | 南京大学计算机软件新技术国家重点实验室,南京210093;南京大学计算机科学与技术系,南京210093 |
| |
| 基金项目： | 国家自然科学基金No.60721002,60875038,60503021;;国家教育部重点项目No.108151;;江苏省高新技术计划No.BG2007038~~ |
| |
| 摘 要： | 结合基于图的关联规则挖掘和双向搜索的策略,产生最大频繁项集,从而提出基于图的最大频繁项集(graph based maximum frequen tset,GBMFS)生成算法。运用此算法,结合社会网络的动态特征,发现社会网络中所存在的团伙的核心成员。最后,在实际系统中对相关的算法进行了验证。
|
| 关 键 词： | 最大频繁项集 图 核心节点 |
| 修稿时间： | |
Core Nodes Detection Based on Frequent Itemsets of Graph |
| |
| SONG Wenjun,LIU Hongxing,WANG Chongjun,XIE Junyuan. Core Nodes Detection Based on Frequent Itemsets of Graph[J]. Journal of Frontier of Computer Science and Technology, 2010, 4(1): 82-88. DOI: 10.3778/j.issn.1673-9418.2010.01.009 |
| |
| Authors: | SONG Wenjun LIU Hongxing WANG Chongjun XIE Junyuan |
| |
| Affiliation: | 1. National Key Laboratory for Novel Software Technology， Nanjing University， Nanjing 210093， China 2. Department of Computer Science and Technology， Nanjing University， Nanjing 210093， China |
| |
| Abstract: | This paper concentrates on the detection of core nodes in the crime network,but as a basis,it models the network as a graph and presents the algorithm of GBMFS(graph based maximum frequent set),which combines the mining of association rules with bidirectional search strategy and can be used to discover the most frequent itemsets in a graph.After getting several snaps of social network in different time and integrating the discovery of quasi-clique with GBMFS,the algorithm of discovering core nodes in these ... |
| |
| Keywords: | maximum frequent itemsets graph core node |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学与探索》浏览原始摘要信息 |
|
点击此处可从《计算机科学与探索》下载免费的PDF全文 |
