Dynamic Tabu Search for Non Stationary Social Network Identification Based on Graph Coloring
作者： Israel Rebollo Ruiz , Manuel Graña Romay
DOI: 10.1007/978-3-642-32922-7_51
关键词:
摘要: We introduce a new algorithm for the identification of Non Stationary Social Networks called Dynamic Tabu Search DTS-SN, that can analyze by mapping them into graph solving Graph Coloring Problem (GCP). To map Network an unweighted undirected graph, to identify users Networks, we construct using features compound with threshold indicates if pair have relationship between or not. also take account dynamic behavior non stationary Network, where relations change along time, adapting our in real time structure Network.
springer.com
sci-hub.st 参考文章(23)
Israel Rebollo Ruiz, Manuel Graña Romay, Gravitational Swarm Approach for Graph Coloring Nature Inspired Cooperative Strategies for Optimization (NICSO 2011). pp. 159- 168 ,(2011) , 10.1007/978-3-642-24094-2_11
Nature Inspired Cooperative Strategies for Optimization (NICSO 2011) Springer Publishing Company, Incorporated. ,(2011) , 10.1007/978-3-642-24094-2
Javier Sedano, Leticia Curiel, Emilio Corchado, Enrique de la Cal, José R Villar, None, A soft computing method for detecting lifetime building thermal insulation failures Computer-Aided Engineering. ,vol. 17, pp. 103- 115 ,(2010) , 10.3233/ICA-2010-0337
Ling-Yuan Hsu, Shi-Jinn Horng, Pingzhi Fan, Muhammad Khurram Khan, Yuh-Rau Wang, Ray-Shine Run, Jui-Lin Lai, Rong-Jian Chen, MTPSO algorithm for solving planar graph coloring problem Expert Systems With Applications. ,vol. 38, pp. 5525- 5531 ,(2011) , 10.1016/J.ESWA.2010.10.084
Peixin Zhao, Cun-Quan Zhang, A new clustering method and its application in social networks Pattern Recognition Letters. ,vol. 32, pp. 2109- 2118 ,(2011) , 10.1016/J.PATREC.2011.06.008
R. D. Dutton, A new graph colouring algorithm The Computer Journal. ,vol. 24, pp. 85- 86 ,(1981) , 10.1093/COMJNL/24.1.85
Shaojie Qiao, Tianrui Li, Hong Li, Jing Peng, Hongmei Chen, A new blockmodeling based hierarchical clustering algorithm for web social networks Engineering Applications of Artificial Intelligence. ,vol. 25, pp. 640- 647 ,(2012) , 10.1016/J.ENGAPPAI.2012.01.003
Kazunori Mizuno, Seiichi Nishihara, Constructive generation of very hard 3-colorability instances Discrete Applied Mathematics. ,vol. 156, pp. 218- 229 ,(2008) , 10.1016/J.DAM.2006.07.015
Aykut Firat, Sangit Chatterjee, Mustafa Yilmaz, Genetic clustering of social networks using random walks Computational Statistics & Data Analysis. ,vol. 51, pp. 6285- 6294 ,(2007) , 10.1016/J.CSDA.2007.01.010
R. Lewis, J. Thompson, C. Mumford, J. Gillard, A wide-ranging computational comparison of high-performance graph colouring algorithms Computers & Operations Research. ,vol. 39, pp. 1933- 1950 ,(2012) , 10.1016/J.COR.2011.08.010