Real-Time Multi-Criteria Social Graph Partitioning

作者: Nikos Armenatzoglou , Huy Pham , Vasilis Ntranos , Dimitris Papadias , Cyrus Shahabi

DOI: 10.1145/2723372.2749450

关键词: Class (computer programming)Computer scienceMachine learningSocial graphSimilarity (psychology)GraphTheoretical computer scienceTask (project management)Artificial intelligenceSet (abstract data type)Graph partitionSocial networkGame theory

摘要: Graph partitioning has attracted considerable attention due to its high practicality for real-world applications. It is particularly relevant social networks because it enables the grouping of users into communities market analysis and advertising purposes. In this paper, we introduce RMGP, a type real-time multi-criteria graph that groups based on their connectivity similarity set input classes. We consider RMGP as an on-line task, which may be frequently performed different query parameters (e.g., classes). order overcome serious performance issues associated with large graphs found in practice, develop solutions game theoretic framework. Specifically, each user player, whose goal find class optimizes his objective function. propose algorithms best-response dynamics, analyze properties, show efficiency effectiveness real datasets under centralized decentralized scenarios.

参考文章(27)
Peter Rousseeuw, L Kaufman, Clustering by means of medoids Proc. Statistical Data Analysis Based on the L1 Norm Conference, Neuchatel, 1987. pp. 405- 416 ,(1987)
Lovro Puzar, Prasad Chakka, Nathan Bronson, Mark Marchukov, Zach Amsden, Anthony Giardullo, George Cabrera, Jack Ferris, Yee Jiun Song, Peter Dimov, Sachin Kulkarni, Hui Ding, Dmitri Petrov, Harry Li, Venkat Venkataramani, TAO: Facebook's distributed data store for the social graph usenix annual technical conference. pp. 49- 60 ,(2013)
Ramasuri Narayanam, Y. Narahari, A game theory inspired, decentralized, local information based algorithm for community detection in social graphs international conference on pattern recognition. pp. 1072- 1075 ,(2012)
Chandra Chekuri, Joseph (Seffi) Naor, Sanjeev Khanna, Leonid Zosin, Approximation algorithms for the metric labeling problem via a new linear programming formulation symposium on discrete algorithms. pp. 109- 118 ,(2001) , 10.5555/365411.365426
Daniel Granot, Gur Huberman, Minimum cost spanning tree games Mathematical Programming. ,vol. 21, pp. 1- 18 ,(1981) , 10.1007/BF01584227
Justin J. Levandoski, Mohamed Sarwat, Ahmed Eldawy, Mohamed F. Mokbel, LARS: A Location-Aware Recommender System 2012 IEEE 28th International Conference on Data Engineering. pp. 450- 461 ,(2012) , 10.1109/ICDE.2012.54
Jon Kleinberg, Éva Tardos, Approximation algorithms for classification problems with pairwise relationships Journal of the ACM. ,vol. 49, pp. 616- 639 ,(2002) , 10.1145/585265.585268
J. F. Nash, Equilibrium points in n-person games Proceedings of the National Academy of Sciences. ,vol. 36, pp. 48- 49 ,(1950) , 10.1073/PNAS.36.1.48
M. E. J. Newman, M. Girvan, Finding and evaluating community structure in networks. Physical Review E. ,vol. 69, pp. 026113- 026113 ,(2004) , 10.1103/PHYSREVE.69.026113
Yucheng Low, Danny Bickson, Joseph Gonzalez, Carlos Guestrin, Aapo Kyrola, Joseph M. Hellerstein, Distributed GraphLab Proceedings of the VLDB Endowment. ,vol. 5, pp. 716- 727 ,(2012) , 10.14778/2212351.2212354