CCDCD基于图密度的动态约束社团核心挖掘方法.pdf

ISSNl l 8 CODEN 673—94 JKYl’A8 ofFHmtiersof scienceand hnp：／，www．ceaj．o唱 JoumaI Computer Technology 1673—9418／2009／03(03)一0309—12 DOI：10．3778／j．issn．1673—9418．2009．03．009 CCDCD：基于图密度的动态约束社团核心挖掘方法 魏绪仲，唐常杰+，徐开阔，段磊，巩杰，姜页希，李太勇 四川大学计算机学院，成都610065 Basedon CCDCD Core with Constrains Graph CommunityMiningDynamic Density+ Yexi，U Lei，GONGJie，JIANG Taiyong WEI Kaikuo，DUAN Chan西ie+，XU Xuzhong，TANG 610065，China Scienceand Sch001，SichuanUniVersity，Chengdu Computer Technology +CoITespondingauthor：E—mail：tangchan百ie@cs．scu．edu．cn dynamic a1．CCDCD：CommuIli锣coremiIling稍th WEI Kaikuo，et Xuzhong，7IANGChangjie，XU ofFrontiersof Scienceand densi何J伽mal Computer co吣t咫i璐based仰graph 309—320． hot inthe6eldofdata methodsreduce acun-ent core topic mining．Existing Abstract：Communitymining(CCM)is constraintsandn．eatCCMasdense mining·Theexisting the tothe with sub—graphs communitygraphsspecific the and constmints．To e佑ciency，a in娟cienton with improVe methodsare muhi—graphdynamic complexproblem