TITLE

Network-based stochastic competitive learning approach to disambiguation in collaborative networks

AUTHOR(S)
Christiano Silva, Thiago; Raphael Amancio, Diego
PUB. DATE
March 2013
SOURCE
Chaos;Mar2013, Vol. 23 Issue 1, p013139
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
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.
ACCESSION #
86446961

 

Related Articles

  • Finding overlapping communities based on Markov chain and link clustering. Deng, Xiaoheng; Li, Genghao; Dong, Mianxiong; Ota, Kaoru // Peer-to-Peer Networking & Applications;Mar2017, Vol. 10 Issue 2, p411 

    Since community structure is an important feature of complex network, the study of community detection has attracted more and more attention in recent years. Despite most researchers focus on identifying disjoint communities, communities in many real networks often overlap. In this paper, we...

  • Three Authors Reply. El-Sayed, Abdulrahman M.; Scarborough, Peter; Galea, Sandro // American Journal of Epidemiology;Sep2013, Vol. 178 Issue 5, p838 

    A response from the authors of the article "Are Network-Based Interventions a Useful Antiobesity Strategy? An Application of Simulation Models for Causal Inference in Epidemiology" which appeared in a 2013 issue is presented.

  • Computer simulation of long polymers adsorbed on a surface. I. Corrections to scaling in an ideal chain. Livne, Shelly; Meirovitch, Hagai // Journal of Chemical Physics;4/1/1988, Vol. 88 Issue 7, p4498 

    This paper is the first in a series of papers in which polymer adsorption on a surface is studied by computer simulation using the ‘‘scanning method.’’ This method is especially efficient to handle chain systems with finite interactions and geometrical constraints. Here...

  • Application of social network analysis in research of intergovernmental organizations. LIU Jian-sheng; FENG Xiao-sheng; HE Wan-hui; LI Li-bo // Application Research of Computers / Jisuanji Yingyong Yanjiu;Jan2014, Vol. 31 Issue 1, p28 

    This paper analyzed and reviewed application of social network analysis in the research of intergovernmental organizations. By an example network, the paper mainly focused on the method of constructing intergovernmental organizations network, centrality analysis method, cluster analysis method...

  • Re: “Are Network-Based Interventions a Useful Antiobesity Strategy?”. de la Haye, Kayla // American Journal of Epidemiology;Sep2013, Vol. 178 Issue 5, p837 

    A letter to the editor is presented in response to the article "Are Network-Based Interventions a Useful Antiobesity Strategy? An Application of Simulation Models for Causal Inference in Epidemiology" by A. M. El-Sayed, L. Seeman and P. Scarborough et al which appeared in a 2013 issue.

  • Node Survival in Networks under Correlated Attacks. Hao, Yan; Armbruster, Dieter; Hütt, Marc-Thorsten // PLoS ONE;May2015, Vol. 10 Issue 5, p1 

    We study the interplay between correlations, dynamics, and networks for repeated attacks on a socio-economic network. As a model system we consider an insurance scheme against disasters that randomly hit nodes, where a node in need receives support from its network neighbors. The model is...

  • A hybrid classical-quantum clustering algorithm based on quantum walks. Li, Qiang; He, Yan; Jiang, Jing-ping // Quantum Information Processing;Feb2011, Vol. 10 Issue 1, p13 

    The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum walk (QW) with the problem of data clustering, and develop two clustering algorithms based on the one-dimensional discrete-time QW. Then, the position probability...

  • Simple random walk on long range percolation clusters I: heat kernel bounds. Crawford, Nicholas; Sly, Allan // Probability Theory & Related Fields;Dec2012, Vol. 154 Issue 3/4, p753 

    In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any d ≥ 1 and for any exponent $${s \in (d, (d+2) \wedge 2d)}$$ giving the rate of decay of the percolation process, we show...

  • Random Walk on the High-Dimensional IIC. Heydenreich, Markus; Hofstad, Remco; Hulshof, Tim // Communications in Mathematical Physics;Jul2014, Vol. 329 Issue 1, p57 

    We study the asymptotic behavior of the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by Kumagai and Misumi (J Theor Probab 21:910-935, ). We do this by getting bounds on the effective resistance between the origin and the...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics