Paper Info
Title
Dynamic Tabu Search for Non Stationary Social Network Identification Based on Graph Coloring.
Abstract
We introduce a new algorithm for the identification of Non Stationary Social Networks called Dynamic Tabu Search for Social Networks DTS-SN, that can analyze Social Networks by mapping them into a graph solving a Graph Coloring Problem (GCP). To map the Social Network into an unweighted undirected graph, to identify the users of the Social Networks, we construct a graph using the features that compound the Social Networks with a threshold that indicates if a pair of users have a relationship between them or not. We also take into account the dynamic behavior of the non stationary Social Network, where the relations between users change along time, adapting our algorithm in real time to the new structure of the Social Network.
Year
DOI
Venue
2012
10.1007/978-3-642-32922-7_51
SOFT COMPUTING MODELS IN INDUSTRIAL AND ENVIRONMENTAL APPLICATIONS
Keywords
Field
DocType
non stationary Social Networks,Dynamic Tabu Search,Graph Coloring
Network science,Social network,Computer science,Theoretical computer science,Artificial intelligence,Connectivity,Clustering coefficient,Random geometric graph,Graph (abstract data type),Machine learning,Voltage graph,Graph coloring
Conference
Volume
ISSN
Citations 
188
2194-5357
0
PageRank 
References 
Authors
0.34
17
2
Name
Order
Citations
PageRank
Israel Rebollo Ruiz1184.33
Manuel Graña Romay2411157.98