简介:Inthispaper,weinvestigatetheproblemofasize-constrainedk-coregroupquery(SCCGQ)insocialnetworks,takingbothuserclosenessandnetworktopologyintoconsideration.Morespecifically,SCCGQintendstofindagroupofhusersthathasthehighestsocialclosenesswhilebeingak-core.SCCGQcanbewidelyappliedtoeventplanning,taskassignment,socialanalysis,andmanyotherfields.Incontrasttoexistingworkonthek-coredetectionproblem,whichaimstofindak-coreinasocialnetwork,SCCGQnotonlyfocusesonk-coredetectionbutalsotakessizeconstraintsintoconsideration.Althoughtheconventionalk-coredetectionproblemcanbesolvedinlineartime,SCCGQhasahighercomplexity.TosolvetheproblemofSCCGQ,weproposeaBlastScatter(BS)algorithm,whichappointsthequerynodeasthecentertobeginoutwardexpansionsviabreadthsearch.Ineachoutwardexpansion,BSfindsanewcenterthroughagreedystrategyandthenselectsmultipleneighborsofthecenter.TospeeduptheBSalgorithm,weproposeanadvancedsearchalgorithm,calledBoundedExtension(BE).Specifically,BEcombinesaneffectivesocialdistancepruningstrategyandatightupperboundofsocialclosenesstoprunethesearchspaceconsiderably.Inaddition,weproposeanoffiinesocial-awareindextoacceleratethequeryprocessing.Finally,ourexperimentalresultsdemonstratetheefficiencyandeffectivenessofourproposedalgorithmsonlargereal-worldsocialnetworks.