协作网络中基于网络的随机竞争学习消歧方法
Network-based stochastic competitive learning approach to disambiguation in collaborative networks
摘要:
复杂网络的概念和方法的应用揭示了复杂系统中的许多模式。不幸的是,揭示的模式的有效性和准确性在很大程度上取决于数据中不可避免的噪音的数量,例如社交网络中存在的同性恋个体。在本文中,我们研究了协作网络中的名称消歧问题,这是一项在无数科学背景下发挥重要作用的任务。特别地,我们使用一种无监督的技术,它依赖于网络环境中的粒子竞争机制来检测集群。研究表明,在这种环境下,由于数据的网络表示可以捕获输入数据集的拓扑特征,因此可以改善学习过程。具体来说,在所提出的消歧模型中,一组粒子被随机地产生到构成网络的节点中。随着时间的推移,粒子采用随机和优先行走策略的概率凸混合组成的运动策略。在前者中,行走规则完全依赖于网络的拓扑结构,并负责粒子的探索行为。在后者中,行走规则取决于拓扑结构和粒子对相邻节点施加的支配水平。这种行为迫使粒子执行防御策略,因为这将迫使它们重新访问已经被它们控制的节点,而不是探索竞争对手的领土。对从arXiv预印本论文库和其他数据库中提取的网络进行的计算机模拟显示了该模型的有效性,结果表明该模型比传统的聚类方法更准确。
英文摘要:
Many patterns have been uncovered in complex systems through the application of concepts and methodologies of complex networks. Unfortunately, the validity and accuracy of the unveiled patterns are strongly dependent on the amount of unavoidable noise pervading the data, such as the presence of homonymous individuals in social networks. In the current paper, we investigate the problem of name disambiguation in collaborative networks, a task that plays a fundamental role on a myriad of scientific contexts. In special, we use an unsupervised technique which relies on a particle competition mechanism in a networked environment to detect the clusters. It has been shown that, in this kind of environment, the learning process can be improved because the network representation of data can capture topological features of the input data set. Specifically, in the proposed disambiguating model, a set of particles is randomly spawned into the nodes constituting the network. As time progresses, the particles employ a movement strategy composed of a probabilistic convex mixture of random and preferential walking policies. In the former, the walking rule exclusively depends on the topology of the network and is responsible for the exploratory behavior of the particles. In the latter, the walking rule depends both on the topology and the domination levels that the particles impose on the neighboring nodes. This type of behavior compels the particles to perform a defensive strategy, because it will force them to revisit nodes that are already dominated by them, rather than exploring rival territories. Computer simulations conducted on the networks extracted from the arXiv repository of preprint papers and also from other databases reveal the effectiveness of the model, which turned out to be more accurate than traditional clustering methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。