针对关系型网络的社区发现问题,考虑节点间相互作用的强弱程度和信息渗流机理,创新性地提出了一种基于边权重和连通分支(Edge Weight and Connected Component,EWCC)的社区发现算法。为了验证算法的有效性,首先,构建了5种具有相互作用...针对关系型网络的社区发现问题,考虑节点间相互作用的强弱程度和信息渗流机理,创新性地提出了一种基于边权重和连通分支(Edge Weight and Connected Component,EWCC)的社区发现算法。为了验证算法的有效性,首先,构建了5种具有相互作用的双层网络模型,通过分析层间节点作用的强弱程度对网络拓扑结构的影响,确定了5种双层网络模型下生成的30个数据集;其次,选用真实数据集分别与GN算法和KL算法在模块度、算法复杂度和社区划分数目评价准则上进行了对比,实验结果表明EWCC算法的准确性较高;然后,结合数值仿真得出,随着层间作用关系减弱,模块度值和社区数目成反比,并且当双层网络层间节点关系较弱时,社区划分效果较好;最后,作为算法的应用,利用实证数据构建了“用户-APP”的双层网络并进行了社区划分。展开更多
Most existing network representation learning algorithms focus on network structures for learning.However,network structure is only one kind of view and feature for various networks,and it cannot fully reflect all cha...Most existing network representation learning algorithms focus on network structures for learning.However,network structure is only one kind of view and feature for various networks,and it cannot fully reflect all characteristics of networks.In fact,network vertices usually contain rich text information,which can be well utilized to learn text-enhanced network representations.Meanwhile,Matrix-Forest Index(MFI)has shown its high effectiveness and stability in link prediction tasks compared with other algorithms of link prediction.Both MFI and Inductive Matrix Completion(IMC)are not well applied with algorithmic frameworks of typical representation learning methods.Therefore,we proposed a novel semi-supervised algorithm,tri-party deep network representation learning using inductive matrix completion(TDNR).Based on inductive matrix completion algorithm,TDNR incorporates text features,the link certainty degrees of existing edges and the future link probabilities of non-existing edges into network representations.The experimental results demonstrated that TFNR outperforms other baselines on three real-world datasets.The visualizations of TDNR show that proposed algorithm is more discriminative than other unsupervised approaches.展开更多
文摘针对关系型网络的社区发现问题,考虑节点间相互作用的强弱程度和信息渗流机理,创新性地提出了一种基于边权重和连通分支(Edge Weight and Connected Component,EWCC)的社区发现算法。为了验证算法的有效性,首先,构建了5种具有相互作用的双层网络模型,通过分析层间节点作用的强弱程度对网络拓扑结构的影响,确定了5种双层网络模型下生成的30个数据集;其次,选用真实数据集分别与GN算法和KL算法在模块度、算法复杂度和社区划分数目评价准则上进行了对比,实验结果表明EWCC算法的准确性较高;然后,结合数值仿真得出,随着层间作用关系减弱,模块度值和社区数目成反比,并且当双层网络层间节点关系较弱时,社区划分效果较好;最后,作为算法的应用,利用实证数据构建了“用户-APP”的双层网络并进行了社区划分。
基金Projects(11661069,61763041) supported by the National Natural Science Foundation of ChinaProject(IRT_15R40) supported by Changjiang Scholars and Innovative Research Team in University,ChinaProject(2017TS045) supported by the Fundamental Research Funds for the Central Universities,China
文摘Most existing network representation learning algorithms focus on network structures for learning.However,network structure is only one kind of view and feature for various networks,and it cannot fully reflect all characteristics of networks.In fact,network vertices usually contain rich text information,which can be well utilized to learn text-enhanced network representations.Meanwhile,Matrix-Forest Index(MFI)has shown its high effectiveness and stability in link prediction tasks compared with other algorithms of link prediction.Both MFI and Inductive Matrix Completion(IMC)are not well applied with algorithmic frameworks of typical representation learning methods.Therefore,we proposed a novel semi-supervised algorithm,tri-party deep network representation learning using inductive matrix completion(TDNR).Based on inductive matrix completion algorithm,TDNR incorporates text features,the link certainty degrees of existing edges and the future link probabilities of non-existing edges into network representations.The experimental results demonstrated that TFNR outperforms other baselines on three real-world datasets.The visualizations of TDNR show that proposed algorithm is more discriminative than other unsupervised approaches.
