Different aspects of social networks have increasingly been under investigation from last decade. The social network studies range in various viewpoints from the structural and node measures to the information diffusion processes. Key node identification has been one of the limelight topics of social network analysis (SNA) specifically in a discipline like politics, criminology, marketing etc. This research uses multiple networks constructed from the different social site and real-life relationships to cover the multi-dimensional aspects of human relations. In the multi-relationship system, the different dimensions may differ in terms of relevance and weight. One of the most intriguing aspects of key node identification in the multi-dimensional system can be the consideration of dimension relevance. This research covers the methodology to optimize the weights of dimensions using a number of centrality measures from each network layer covering multiple different objectives of interest. The study formulates the novel weighted feature set pertaining to layer relevance calculated based on layers relative importance through particle swarm optimization technique. The framework applies ensemble-based approach on the weighted feature set along with node characteristics to predict key nodes in a network. The results are validated against ground truth data and accuracy achieved is promising.
MagnaniM. and Rossi.L. The ML-model for multi-layer social networks. In Proc. 2011 ASONAM Int’l Conf. on Advances in Social Networks Analysis and Mining, pages 5–12, Kaohsiung City, Taiwan, July 2011.
3.
BródkaP., KazienkoP., MusiałK. and SkibickiK., Analysis of neighborhoods in multi-layered dynamic social networks, Int J Comp Intel Sys5(3) (2012), 582–596.
4.
KiveläM., et al., Multilayer networks, J Comp Netw2 (2014), 203–271.
5.
BorgattiS., The key player problem, presented in the proceedings of the National Academy of Sciences Workshop on Terrorism. National Academy of Sciences, Washington DC (2002).
6.
LinShou-de, Hans, Chalupsky, Discovering and explaining abnormal nodes in semantic graphs, IEEE Transactions on Knowledge and Data Engineering20(8) (2008), 1039–1052.
7.
MemonN., HarkiolakisN., DavidL., Hicks, Detecting High-Value Individuals in Covert Networks, 7/7 London Bombing Case Study, in the proceedings of the IEEE/ACS International Conference on Computer Systems and Applications (2008), pp. 206–215.
8.
MemonN., Rasool QureshiA., Kock WiilU. and DavidL., Hicks, Novel algorithms for subgroup detection in terrorist networks, presented in the International Conference on Availability, Reliability and Security, Fukuoka Institute of Technology, Fukuoka, Japan (2009).
9.
BorgattiS.P., Identifying sets of key players in a network. Computational, Mathematical and Organizational Theory12(1) (2006), 21–34.
10.
Ortiz-ArroyoD., Discovering Sets of Key Players in Social Networks. In AbrahamA., HassanienA-E., & SnáselV. (Eds.), Computational Social Networks Analysis, Trends, Tools and Research Advances (Chapter 2), pp. 27–47. (2010), Springer. doi: 10.1007/978-1-84882-229-0
11.
FriedlD.-M.B. and HeidemannJ., A critical review of centrality measures in social networks, Bus Inf Syst Eng2(6) (2010), 371–385.
12.
ImanM., MehrdadA.M., RobertH. and AlirezaA., Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools, Mathematical Technology of Networks, Springer Proceedings in Mathematics & Statistics (2015), 128. doi: 10.1007/978-3-319-16619-3_10
13.
FreundY. and SchapireR.E., A decision-theoretic generalization of on-line learning and an application to boosting, J Comput Syst Sci55 (1995), 119–139. doi: 10.1007/3-540-59119-2_166
14.
De DomenicoM., et al., Mathematical formulation of multilayer networks Phys. Rev. (2013), X3041022.
15.
BoserB.E., et al., A Training Algorithm for Optimal Margin lassifiers, Proceedings of the Fifth Annual Workshop on Computational Learning Theory5 (1992), 144–152. Pittsburgh.
QuinlanJ.R., Induction of Decision Trees, Mach Learn1(1) (1986), 81–106.
18.
BerlingerioM., CosciaM., GiannottiF., MonrealeA. and PedreschiD., The pursuit of hubbiness: Analysis of hubs in large multidimensional networks, J Comp Sci2 (2011), 223–237.
19.
BerlingerioM., CosciaM., GiannottiF., MonrealeA. and PedreschiD., Multidimensional networks: Foundations of structural analysis, WWW: Internet and Web Info Systems16 (2013), 567–593.
20.
CosciaM., RossettiG., PennacchioliD., CeccarelliD. and GiannottiF., You know because i know: A multidimensional network approach to human resources problem. In Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (2013), pp. 434–441. ACM.
21.
WangP., RobinsG., PattisonP. and Lazega.E., Exponential random graph models for multilevel networks, Social Networks35 (2013), 96–115.
22.
StanleyW. and KatherineF., Social Network Analysis: Methods and Applications, Structural Analysis in the Social Sciences81994. Cambridge University Press.
23.
BorgattiStephen P., Mehra, Ajay, Brass, DanielJ. and GiuseppeL., Network analysis in the social sciences, Science323(5916) (2009), 892–895.
24.
DomenicoDe, Manlio, Porter, MasonA., and ArenasA., MuxViz: A tool for multilayer analysis and visualization of networks, Journal of Complex Networks3(2) (2014), 159–176.
25.
BattistonF., NicosiaV. and LatoraV., Structural measures for multiplex networks Phys. Rev. 2014, E 89032804.
26.
BallesterC. and ZenouY., Key Player Policies When Contextual Effects Matter, Social Science Research Network, Rochester, NY, SSRN Scholarly Paper ID 2013797, Jan 2012.
27.
HristovaD., MusolesiM. and MascoloC., Keep your friends close and your Facebook friends closer: A multiplex network approach to the analysis of offline and online social ties. Article in International Conference on Weblogs and Social Media (ICWSM)2014. AAAI.
28.
WestlakeB.G., BouchardM. and FrankR., Finding the key players in online child exploitation networks, Policy & Internet3(2) (2011), 1–32. doi: 10.2202/1944-2866.1126
29.
NewmanM.E.J., A measure of betweenness centrality based on random walks, Social Networks27(1) (2005), 39–54.
30.
BonacichP. and LloydP., Eigenvector-like measures of centrality for asymmetric relations, Social Networks23(3) (2001), 191–201.
31.
FreemanL.C., Centrality in social networks conceptual clarification, Social Networks1(3) (1979–1979), pp. 215–239.
32.
EverettM.G. and BorgattiS.P., Extending centralities, Models and methods in social network analysis, pp. 57–76, Cambridge University Press.
33.
YangJ., Generalized key player problem, Journal Computational & Mathematical Organization Theory archive21 (2015), 24–47.
34.
WeihuaA. and Yu-HsinL., key player: An R Package for Locating Key Players in Social Networks, (2016), pp. 257–268, R JOURNAL.
35.
GunasekaraR.C., MehrotraK. and MohanC.K., Soc. Netw., Anal. Min.., Multi-objective optimization to identify key players in large social networks, Social Network Analysis & Minining, (2015), pp. 5–21.
36.
XiujuF., et al., Key node selection for containing infectious disease spread using particle swarm optimization, 2009 IEEE Swarm Intelligence Symposium, Nashville, TN, 2009, pp. 109–113.
37.
BonacichP. and LloydP., Eigenvector-like measures of centrality for asymmetric relations, Social Networks23(3) (2001), pp. 191–201.
38.
BonacichP., Power and centrality: A family of measures, Am J Sociol (1987), 1170–1182.
39.
IlyasM.U. and RadhaH.Identifying influential nodes in online social networks using principal component centrality”, In: Proceedings of communications (ICC), IEEE international conference, IEEE, (2011), pp. 1–5.
40.
PoriaPirozmand, GuoweiWu, JiankangRen and XinjiaoL., An Exploration on Social Attributes of Key Players in Dynamic Social Networks, IJCSE4(4) (2015), 102–112.
41.
HaluA., MondragónR.J., PanzarasaP. and BianconiG., Multiplex PageRank, Physics and Society, PLoS ONE8(10) (2013), e78293. doi: 10.1371/journal.pone.0078293
42.
De DomenicoM., Sol_e-RibaltaA., OmodeiE., G_omezS. and ArenasA., Centrality in interconnected multilayer networks’, CoRR abs/1311.2906 (2013).
43.
ProbstF., GrosswieleD.K.L. and PflegerD.K.R., Who will lead and who will follow: Identifying influential users in online social networks, Bus Inf Syst Eng5(3) (2013), 179–193.
44.
CataneseS., MeoP.D., FerraraE., FiumaraG. and ProvettiA., Crawling facebook for social network analysis purposes, in WIMS, (2011), pp. 52.
45.
GjokaM., KurantM., ButtsC.T. and MarkopoulouA., Walking in facebook: A case study of unbiased sampling of osns,” in Proceedings of the 29th conference on Information communications, INFOCOM’10, (2010), pp. 2498–2506, IEEE Press.
46.
KrackhardtD., Cognitive social structures, Social Networks9 (1987), 104–134.
47.
MuthusamyH., PolatK. and YaacobS., Particle Swarm Optimization Based Feature Enhancement and Feature Selection for Improved Emotion Recognition in Speech and Glottal Signals, PLoS ONE10(3) (2015), e0120344. doi: 10.1371/journal.pone.0120344
48.
XiujuFu, et al., Key node selection for containing infectious disease spread using particle swarm optimization, 2009 IEEE Swarm Intelligence Symposium, Nashville, TN, 2009, pp. 109–113. doi: 10.1109/SIS.2009.4937852
49.
MichalskiR., KazienkoP., and DawidKról, ”Predicting Social Network Measures Using Machine Learning Approach”, Advances in Social Networks Analysis and Mining (ASONAM), 2012 IEEE/ACM International Conference on, 26-29 Aug, 2012.
50.
MelvilleP., SindhwaniV., LawrenceR. and MeliksetianE., et al., Machine Learning for Social Media Analytics. In Machine Learning Symposium, New York Academy of Sciences, November, 2009. [Accessed from http://www.prem-melville.com/on 03/01/2017].
51.
CieslakD.A., ChawlaN.W. and StriegelA., Combating imbalance in network intrusion datasets. Proc IEEE Int Conf Granular Comput. 2006, Atlanta, Georgia, USA, 732–737.
52.
LiuY., ChawlaN.V., HarperM.P., ShribergE. and StolckeA., A study in machine learning from imbalanced data for sentence boundary detection in speech, Comput Speech Lang20(4) (2006), 468–494. doi: 10.1016/j.csl.2005.06.002
53.
SolaL., RomanceM., CriadoR., FloresJ., GarciaD.A.A. and BoccalettiS., Eigenvector centrality of nodes in multiplex networks, Chaos23 (2013), 033131.
54.
BoccalettiS., BianconiG., CriadoR., del GenioC.I., Gómez-GardeñesJ., RomanceM., Sendiña-NadalI., WangZ. and ZaninM., The structure and dynamics of multilayer networks, Phys Reps544(1) (2014), 1–122.
55.
GranovetterM., The strength of weak ties, American Journal of Sociology78(6) (1973), 1360–1380.
56.
WenC., TanB.C.Y. and ChangK.T.-T., Advertising Effectiveness on Social Network Sites: An Investigation of Tie Strength, Endorser Expertise, Product Type on Consumer Purchase Intention, Thirtieth International Conference on Information Systems, Phoenix, AZ, December, 2009.
57.
HusslageB., BormP., BurgT., Hamers.H. and LindelaufR., Ranking terrorists in networks: A sensitivity analysis of Al Qaeda’s 9/11 attack, CentER Discussion, 2014.
58.
GilbertE. and KarahaliosK., Predicting tie strength with social media. In Proc. of the 27th CHI, (2009), 211–220.
59.
XiangR., NevilleJ. and RogatiM., Modeling relationship strength in online social networks, In: Proceedings of the 19th International Conference on World Wide Web, pp. 981–990. ACM (2010).
60.
KahandaI. and NevilleJ., Using Transactional Information to Predict Link Strength in Online Social Networks. Proceedings of the 3rd International Conference on Weblogs and Social Media (ICWSM), West Lafayette, June (2009), 74–81.
61.
WieseJ., MinJ.-K., HongJ.I. and ZimmermanJ.: You never call, you never write: Call, and SMS logs do not always indicate tie strength, In: Proceedings of the 18th ACM Conference on Computer Supported Cooperative Work & Social Computing, pp. 765–774. ACM, 2015.
62.
BonacichP., HoldrenA.C. and JohnstonM., Hyper-edges and multidimensional centrality, Social Networks26 (2004), 189–203.
63.
ClarkC.R., Modeling, and Analysis of Clandestine Networks. Master’s thesis, AFIT (2005).
64.
HamillJ.T., Air Force Institute of Technology, Analysis of Layered Social Networks. Ph. D. thesis, 2006.
65.
BerlingerioM., CosciaM., GiannottiF., MonrealeA. and PedreschiD., Foundations of multidimensional network analysis. Pages 485–489 of International Conference on Social Network Analysis and Mining (ASONAM). IEEE, 2011.
66.
MagnaniM., MonrealeA., RossettiG. and GiannottiF., On multidimensional network measures, 21st Italian Symposium on Advanced Database Systems (SEBD), Italy2013.
67.
PappalardoL., RossettiG. and PedreschiD., Measuring tie strength in multidimensional networks, 21st Italian Symposium on Advanced Database Systems, SEBD22 (2013), 3–230.
68.
ZhongL., GaoC., ZhangZ., ShiN. and HuangJ., Identifying Influential Nodes in Complex Networks: A Multiple Attributes Fusion Method, Active Media Technology AMT Lecture Notes in Computer Science, Springer2014 (8610).
69.
DuY., GaoC., HuY., MahadevanS. and DengY., A new method of identifying influential nodes in complex networks based on Topsis, Physica A399 (2014), 57–69.
70.
GongN.Z., XuW., HuangL., MittalP., StefanovE., SekarV. and SongD., Evolution of social attribute networks: Measurements, modeling, and implications using google+. In Proceedings of the Internet Measurement Conference (IMC), 2012.
71.
GongN.Z., TalwalkarA., MackeyL., HuangL., ShinE.C.R., StefanovE., ShiE. and SongD., Joint link prediction and attribute inference using a social attribute network, ACM Trans Intell Syst Technol5(2), 2014.
72.
ReissA.J., Why Are Communities Important to Understanding Crime?ReissA.J. and TonryM.. (eds), Crime and Justice, University of Chicago Press, 1986.
73.
McGuireR.M., The weighted key player problem for social network analysis. Dissertation, Air Force Institute of Technology, 2011.
74.
ZhangY., WangZ. and XiaC., Identifying key users for targeted marketing by mining online social network, In: Proc 24th international conference on advanced information networking and applications, Perth (2010), 644–649.
75.
ZhangY., ZhouJ. and ChengJ., Preference-Based Top-K Influential Nodes Mining in Social Networks (2011). 2011IEEE 10th International Conference on Trust Security and Privacy in Computing and Communications, Changsha, China, 2011, pp. 1512–1518.
