Publication: Using the ACO algorithm for path searches in social networks
Loading...
Identifiers
Publication date
2012-06
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Impact
Export
Abstract
One of the most important types of applications currently being used to share knowledge across the Internet are social networks. In addition to their use in social, professional and organizational spheres, social networks are also frequently utilized by researchers in the social sciences, particularly in anthropology and social psychology. In order to obtain information related to a particular social network, analytical techniques are employed to represent the network as a graph, where each node is a distinct member of the network and each edge is a particular type of relationship between members including, for example, kinship or friendship. This article presents a proposal for the efficien solution to one of the most frequently requested services on social networks; namely, taking different types of relationships into account in order to locate a particular member of the network. The solution is based on a biologically-inspired modificatio of the ant colony optimization algorithm.
Description
The original publication is available at www.springerlink.com
Keywords
Large graphs, Social networks, ACO, Dijkstra, Path search
Bibliographic citation
Applied Intelligence, June 2012, volume 36, number 4, pp. 899-917