Skip to main content
Top
Published in: Social Network Analysis and Mining 1/2015

01-12-2015 | Original Article

On the network you keep: analyzing persons of interest using Cliqster

Authors: Saber Shokat Fadaee, Mehrdad Farajtabar, Ravi Sundaram, Javed A. Aslam, Nikos Passas

Published in: Social Network Analysis and Mining | Issue 1/2015

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Our goal is to determine the structural differences between different categories of networks and to use these differences to predict the network category. Existing work on this topic has looked at social networks such as Facebook, Twitter, co-author networks, etc. We, instead, focus on a novel dataset that we have assembled from a variety of sources, including law enforcement agencies, financial institutions, commercial database providers and other similar organizations. The dataset comprises networks of persons of interest with each network belonging to different categories such as suspected terrorists, convicted individuals, etc. We demonstrate that such “anti-social” networks are qualitatively different from the usual social networks and that new techniques are required to identify and learn features of such networks for the purposes of prediction and classification. We propose Cliqster, a new generative Bernoulli process-based model for unweighted networks. The generating probabilities are the result of a decomposition which reflects a network’s community structure. Using a maximum likelihood solution for the network inference leads to a least squares problem. By solving this problem, we are able to present an efficient algorithm for transforming the network to a new space which is both concise and discriminative. This new space preserves the identity of the network as much as possible. Our algorithm is interpretable and intuitive. Finally, by comparing our research against the baseline method (SVD) and against a state-of-the-art Graphlet algorithm, we show the strength of our algorithm in discriminating between different categories of networks.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Airoldi EM, Blei DM, Fienberg SE, Xing EP (2008) Mixed membership stochastic blockmodels. J Mach Learn Res 9:1981–2014MATH Airoldi EM, Blei DM, Fienberg SE, Xing EP (2008) Mixed membership stochastic blockmodels. J Mach Learn Res 9:1981–2014MATH
go back to reference Airoldi EM (2006) Bayesian mixed-membership models of complex and evolving networks. Tech Rep, DTIC Document Airoldi EM (2006) Bayesian mixed-membership models of complex and evolving networks. Tech Rep, DTIC Document
go back to reference Azari Soufiani H, Airoldi EM (2012) Graphlet decomposition of a weighted network. In: Proceedings of the fifteenth international conference on artificial intelligence and statistics (AISTATS). La Palma, Canary Islands Azari Soufiani H, Airoldi EM (2012) Graphlet decomposition of a weighted network. In: Proceedings of the fifteenth international conference on artificial intelligence and statistics (AISTATS). La Palma, Canary Islands
go back to reference Barta G (2014) A link-based approach to entity resolution in social networks. CoRR, vol abs/1404.3017 Barta G (2014) A link-based approach to entity resolution in social networks. CoRR, vol abs/1404.3017
go back to reference Bhagat S, Cormode G, Muthukrishnan S (2011) Node classification in social networks. CoRR, vol abs/1101.3291 Bhagat S, Cormode G, Muthukrishnan S (2011) Node classification in social networks. CoRR, vol abs/1101.3291
go back to reference Bilgic M, Licamele L, Getoor L, Shneiderman B (2006) D-dupe: an interactive tool for entity resolution in social networks. In: Visual analytics science and technology (VAST), Baltimore Bilgic M, Licamele L, Getoor L, Shneiderman B (2006) D-dupe: an interactive tool for entity resolution in social networks. In: Visual analytics science and technology (VAST), Baltimore
go back to reference Boyd SP, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge Boyd SP, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge
go back to reference Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16(9):575–579CrossRefMATH Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16(9):575–579CrossRefMATH
go back to reference Buchanan A, Walteros J, Butenko S, Pardalos P (2014) Solving maximum clique in sparse graphs: an \(O(nm + n2^{d/4})\) algorithm for d-degenerate graphs. Optim Lett 8:1611–1617MathSciNetCrossRefMATH Buchanan A, Walteros J, Butenko S, Pardalos P (2014) Solving maximum clique in sparse graphs: an \(O(nm + n2^{d/4})\) algorithm for d-degenerate graphs. Optim Lett 8:1611–1617MathSciNetCrossRefMATH
go back to reference Chung FRK (1997) Spectral graph theory. American Mathematical Society, ProvidenceMATH Chung FRK (1997) Spectral graph theory. American Mathematical Society, ProvidenceMATH
go back to reference David E, Jon K (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, New York David E, Jon K (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, New York
go back to reference Eppstein D, Strash D (2011) Listing all maximal cliques in large sparse real-world graphs. In: Experimental algorithms. Springer, Berlin, pp 364–375 Eppstein D, Strash D (2011) Listing all maximal cliques in large sparse real-world graphs. In: Experimental algorithms. Springer, Berlin, pp 364–375
go back to reference Erdős P, Rényi A (1959) On random graphs. Publ Math Debr 6:290–297 Erdős P, Rényi A (1959) On random graphs. Publ Math Debr 6:290–297
go back to reference Gillespie CS (2015) Fitting heavy tailed distributions: the poweRlaw package. J Stat Softw 64(2):1–16CrossRef Gillespie CS (2015) Fitting heavy tailed distributions: the poweRlaw package. J Stat Softw 64(2):1–16CrossRef
go back to reference Glaeser EL, Sacerdote B, Scheinkman JA (1996) Crime and social interactions. Q J Econ 111(2):507–548 Glaeser EL, Sacerdote B, Scheinkman JA (1996) Crime and social interactions. Q J Econ 111(2):507–548
go back to reference Goldenberg A, Zheng AX, Fienberg SE, Airoldi EM (2009) A survey of statistical network models (arXiv e-prints) Goldenberg A, Zheng AX, Fienberg SE, Airoldi EM (2009) A survey of statistical network models (arXiv e-prints)
go back to reference Henderson K, Gallagher B, Eliassi-Rad T, Tong H, Basu S, Akoglu L, Koutra D, Faloutsos C, Li L (2012) Rolx: structural role extraction and mining in large graphs. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, ser. KDD ’12. ACM, New York, pp 1231–1239 Henderson K, Gallagher B, Eliassi-Rad T, Tong H, Basu S, Akoglu L, Koutra D, Faloutsos C, Li L (2012) Rolx: structural role extraction and mining in large graphs. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, ser. KDD ’12. ACM, New York, pp 1231–1239
go back to reference Hoff P (2009) Multiplicative latent factor models for description and prediction of social networks. Comput Math Organ Theory 15(4):261–272CrossRef Hoff P (2009) Multiplicative latent factor models for description and prediction of social networks. Comput Math Organ Theory 15(4):261–272CrossRef
go back to reference Lawson CL, Hanson RJ (1995) Solving least squares problems. Society for Industrial and Applied Mathematics (SIAM), PhiladelphiaCrossRefMATH Lawson CL, Hanson RJ (1995) Solving least squares problems. Society for Industrial and Applied Mathematics (SIAM), PhiladelphiaCrossRefMATH
go back to reference Li K, Guo S, Du N, Gao J, Zhang A (2013) Learning, analyzing and predicting object roles on dynamic networks. In: 2013 IEEE 13th international conference on data mining (ICDM), pp 428–437 Li K, Guo S, Du N, Gao J, Zhang A (2013) Learning, analyzing and predicting object roles on dynamic networks. In: 2013 IEEE 13th international conference on data mining (ICDM), pp 428–437
go back to reference Lo Y-C, Li J-Y, Yeh M-Y, Lin S-D, Pei J (2013) What distinguish one from its peers in social networks? Data Min Knowl Discov 27(3):396–420MathSciNetCrossRefMATH Lo Y-C, Li J-Y, Yeh M-Y, Lin S-D, Pei J (2013) What distinguish one from its peers in social networks? Data Min Knowl Discov 27(3):396–420MathSciNetCrossRefMATH
go back to reference Moustafa WE, Kimmig A, Deshpande A, Getoor L (2013) Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. CoRR, vol abs/1305.7006 Moustafa WE, Kimmig A, Deshpande A, Getoor L (2013) Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. CoRR, vol abs/1305.7006
go back to reference Patacchini E, Zenou Y (2008) The strength of weak ties in crime. Eur Econ Rev 52(2):209–236CrossRef Patacchini E, Zenou Y (2008) The strength of weak ties in crime. Eur Econ Rev 52(2):209–236CrossRef
go back to reference Reiss A (1980) Understanding changes in crime rates. In: Crime and justice: a review of research, vol 10 Reiss A (1980) Understanding changes in crime rates. In: Crime and justice: a review of research, vol 10
go back to reference Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p*) models for social networks, Social Networks, vol 29, no 2, pp 173–191 (special section: Advances in exponential random graph (p*) models) Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p*) models for social networks, Social Networks, vol 29, no 2, pp 173–191 (special section: Advances in exponential random graph (p*) models)
go back to reference Rossi RA, Ahmed NK (2014) Role discovery in networks. IEEE Trans Knowl Data Eng 99:1 Rossi RA, Ahmed NK (2014) Role discovery in networks. IEEE Trans Knowl Data Eng 99:1
go back to reference Shokat Fadaee S, Farajtabar M, Sundaram R, Aslam J, Passas N (2014) The network you keep: analyzing persons of interest using cliqster. In: 2014 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 122–129 Shokat Fadaee S, Farajtabar M, Sundaram R, Aslam J, Passas N (2014) The network you keep: analyzing persons of interest using cliqster. In: 2014 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 122–129
go back to reference Xu H, Yang Y, Wang L, Liu W (2013) Node classification in social network via a factor graph model. In: Pei J, Tseng V, Cao L, Motoda H, Xu G (eds) Advances in knowledge discovery and data mining, ser. Lecture Notes in Computer Science, vol 7818. Springer, Berlin, pp 213–224 Xu H, Yang Y, Wang L, Liu W (2013) Node classification in social network via a factor graph model. In: Pei J, Tseng V, Cao L, Motoda H, Xu G (eds) Advances in knowledge discovery and data mining, ser. Lecture Notes in Computer Science, vol 7818. Springer, Berlin, pp 213–224
go back to reference Yang Y, Tang J, Leung CW-K, Sun Y, Chen Q, Li J, Yang Q (2014) Rain: social role-aware information diffusion. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence. AAAI Publications, Austin Yang Y, Tang J, Leung CW-K, Sun Y, Chen Q, Li J, Yang Q (2014) Rain: social role-aware information diffusion. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence. AAAI Publications, Austin
go back to reference Zhao Y, Wang G, Yu PS, Liu S, Zhang S (2013) Inferring social roles and statuses in social networks. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, ser. KDD ’13. ACM, New York, pp 695–703 Zhao Y, Wang G, Yu PS, Liu S, Zhang S (2013) Inferring social roles and statuses in social networks. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, ser. KDD ’13. ACM, New York, pp 695–703
Metadata
Title
On the network you keep: analyzing persons of interest using Cliqster
Authors
Saber Shokat Fadaee
Mehrdad Farajtabar
Ravi Sundaram
Javed A. Aslam
Nikos Passas
Publication date
01-12-2015
Publisher
Springer Vienna
Published in
Social Network Analysis and Mining / Issue 1/2015
Print ISSN: 1869-5450
Electronic ISSN: 1869-5469
DOI
https://doi.org/10.1007/s13278-015-0302-0

Other articles of this Issue 1/2015

Social Network Analysis and Mining 1/2015 Go to the issue

Premium Partner