检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李青青 马慧芳 李举 李志欣[3] LI Qing-qing;MA Hui-fang;LI Ju;LI Zhi-xin(College of Computer Science and Engineering,Northwest Normal University,Lanzhou,Gansu 730070,China;Guangxi Key Laboratory of Trusted Software,Guilin University of Electronic Science and Technology,Guilin,Guangxi 541004,China;College of Computer Science and Information Engineering,Guangxi Normal University,Guilin,Guangxi 541004,China)
机构地区:[1]西北师范大学计算机科学与工程学院,甘肃兰州730070 [2]桂林电子科技大学广西可信软件重点实验室,广西桂林541004 [3]广西师范大学计算机科学与信息工程学院,广西桂林541004
出 处:《电子学报》2021年第11期2096-2100,共5页Acta Electronica Sinica
基 金:国家自然科学基金(No.61762078,No.61363058,No.6196604);广西多源信息挖掘与安全重点实验室开放基金(No.MIMS18-08);西北师范大学2019年度青年教师科研能力提升计划重大项目(No.NWNU-LKQN2019-2);甘肃省自然科学基金(No.21JR7RA114);甘肃省教育厅优秀研究生“创新之星”项目(No.2021CX2X-270)。
摘 要:社区搜索旨在寻找与给定查询节点高度相关的个性化社区.现有社区搜索方法多面向简单网络且处理单个查询节点或假定多个查询节点来自同一社区,这种严格的假设使得算法灵活性受限.据此,提出一种在属性网络中利用查询节点随机游走路径的相似性增强的多社区搜索方法,可以有效地定位查询节点所属的多个局部目标社区.具体地,有效融合网络中高阶结构与属性信息,利用重启随机游走计算各查询节点的重要性分数向量;计算查询节点随机游走路径的相似性并设计一种相似性增强策略,使得在无监督学习中相似路径游走者彼此增强关联从而定位不同查询节点所属的多个社区结构;基于结合结构和属性的并行电导值精准查询社区.真实数据集和人工数据集的实验验证了本文方法的有效性和效率.Community search aims to find personalized communities highly related to the given query nodes.Existing community search methods are applicable to simple networks,and always assume either a single query node is given or multiple query nodes are from the same community,which limits the flexibility of the algorithm.An attributed network oriented multicommunity search method,which is designed via random walk path similarity enhancement of query nodes,is proposed to effec⁃tively locate multiple local communities that query node belongs.Attribute and high-order structure information in the network are effectively fused,and the importance score vector of each query node is calculated based on random walk with restart.The similarity between random walk paths of query nodes is calculated and the similarity enhancement strategy is designed to en⁃hance the association of similar path walkers so as to locate multiple community structures of different query nodes.Based on the combination of structure and attribute,the parallel conductance is used to accurately find the community.The experiments on both real-world datasets and synthetic datasets verify the effectiveness and efficiency of the proposed method.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43