Skip to main content
Top
Published in: Cluster Computing 2/2019

27-03-2018

Identification and classification of best spreader in the domain of interest over the social networks

Authors: A. N. Arularasan, A. Suresh, Koteeswaran Seerangan

Published in: Cluster Computing | Special Issue 2/2019

Log in

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

search-config
loading …

Abstract

The emerging social networks promptly create greater opportunities for fast-developing viral marketing. The online social networks (OSNs) play an essential role in the information diffusion among the social users within the community. The social network being large-scale, it leads to the inconvenience in identifying the influential spreaders in a specific domain, as every social user receives the information from different sources through multiple connections over the network. Although, analyzing the complex social network is indispensable to determine the influence spreaders with the knowledge of understanding the dynamics of information evolution. The existing solutions of the influential measurement techniques lack in neglecting the redundant links and quantifying the temporal information among the social users while estimating the diffusion importance of a social user. Moreover, these techniques fail in analyzing the structural relationships in the domain. To overcome these obstacles, this paper presents a de-duplicated k-shell influence estimation (DKIE) model in the social network by classifying the influential spreaders based on the domain of interest using k-shell decomposition and N-gram similarity. The DKIE model incorporates two major phases such as generic influential spreader identification and domain-specific influential spreader identification. The first phase measures the diffusion importance of each active social user based on the structural relationships of the social network using k-shell decomposition method. It separates the core-like groups and true core and identifies the best spreaders regardless of the redundant links. The second phase exploits the topic of the discussion of the best spreaders and consequently, measures the topic-wise influence to categorize the domain-specific best spreaders using N-gram similarity measurement. The experimental results illustrate the effectiveness of DKIE approach.

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 "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!

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!

Literature
1.
go back to reference Bonchi, F., Castillo, C., Gionis, A., Jaimes, A.: Social network analysis and mining for business applications. ACM Trans. Intell. Syst. Technol. 2(3), 22 (2011) Bonchi, F., Castillo, C., Gionis, A., Jaimes, A.: Social network analysis and mining for business applications. ACM Trans. Intell. Syst. Technol. 2(3), 22 (2011)
2.
go back to reference Bakshy, E., Rosenn, I., Marlow, C., Adamic, L.: The role of social networks in information diffusion. In: ACM Proceedings of the 21st International Conference on World Wide Web, pp. 519–528 (2012) Bakshy, E., Rosenn, I., Marlow, C., Adamic, L.: The role of social networks in information diffusion. In: ACM Proceedings of the 21st International Conference on World Wide Web, pp. 519–528 (2012)
3.
go back to reference Chen, D., Lü, L., Shang, M.S., Zhang, Y., Zhou, T.: Identifying influential nodes in complex networks. Physica A 391(4), 1777–1787 (2012) Chen, D., Lü, L., Shang, M.S., Zhang, Y., Zhou, T.: Identifying influential nodes in complex networks. Physica A 391(4), 1777–1787 (2012)
4.
go back to reference Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. Knowl. Inf. Syst. 37(3), 555–584 (2013) Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. Knowl. Inf. Syst. 37(3), 555–584 (2013)
5.
go back to reference Rabade, R., Mishra, N., Sharma, S.: Survey of influential user identification techniques in online social networks. In: Recent Advances in Intelligent Informatics, pp. 359–370. Springer, New York (2014) Rabade, R., Mishra, N., Sharma, S.: Survey of influential user identification techniques in online social networks. In: Recent Advances in Intelligent Informatics, pp. 359–370. Springer, New York (2014)
6.
go back to reference Hou, B., Yao, Y., Liao, D.: Identifying all-around nodes for spreading dynamics in complex networks. Physica A 391(15), 4012–4017 (2012) Hou, B., Yao, Y., Liao, D.: Identifying all-around nodes for spreading dynamics in complex networks. Physica A 391(15), 4012–4017 (2012)
7.
go back to reference Mangal, N., Niyogi, R., Milani, A.: Analysis of users’ interest based on tweets. In: 16th International Conference on Computational Science and Its Applications, pp. 12–23. Springer, New York (2016) Mangal, N., Niyogi, R., Milani, A.: Analysis of users’ interest based on tweets. In: 16th International Conference on Computational Science and Its Applications, pp. 12–23. Springer, New York (2016)
8.
go back to reference Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888–893 (2010) Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888–893 (2010)
9.
go back to reference Zeng, A., Zhang, C.J.: Ranking spreaders by decomposing complex networks. Phys. Lett. A 377(14), 1031–1035 (2013) Zeng, A., Zhang, C.J.: Ranking spreaders by decomposing complex networks. Phys. Lett. A 377(14), 1031–1035 (2013)
10.
go back to reference Liu, Y., Tang, M., Zhou, T., Do, Y.: Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition. Sci. Rep. 5, 9602 (2015) Liu, Y., Tang, M., Zhou, T., Do, Y.: Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition. Sci. Rep. 5, 9602 (2015)
11.
go back to reference Liu, Y., Tang, M., Zhou, T., Do, Y.: Improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics. Sci. Rep. 5, 13172 (2015) Liu, Y., Tang, M., Zhou, T., Do, Y.: Improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics. Sci. Rep. 5, 13172 (2015)
12.
go back to reference Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: ACM Proceedings of the SIGMOD International Conference on Management of Data, pp. 1311–1322 (2014) Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: ACM Proceedings of the SIGMOD International Conference on Management of Data, pp. 1311–1322 (2014)
13.
go back to reference Kim, H., Yoneki, E.: Influential neighbours selection for information diffusion in online social networks. In: IEEE 21st International Conference on Computer Communications and Networks (ICCCN), pp. 1–7 (2012) Kim, H., Yoneki, E.: Influential neighbours selection for information diffusion in online social networks. In: IEEE 21st International Conference on Computer Communications and Networks (ICCCN), pp. 1–7 (2012)
14.
go back to reference Lin, J.H., Guo, Q., Dong, W.Z., Tang, L.Y., Liu, J.G.: Identifying the node spreading influence with largest k-core values. Phys. Lett. A 378(45), 3279–3284 (2014) Lin, J.H., Guo, Q., Dong, W.Z., Tang, L.Y., Liu, J.G.: Identifying the node spreading influence with largest k-core values. Phys. Lett. A 378(45), 3279–3284 (2014)
15.
go back to reference Akiba, T., Iwata, Y., Yoshida, Y.: Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In: ACM Proceedings of the 22nd International Conference on Information and Knowledge Management, pp. 909–918 (2013) Akiba, T., Iwata, Y., Yoshida, Y.: Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In: ACM Proceedings of the 22nd International Conference on Information and Knowledge Management, pp. 909–918 (2013)
16.
go back to reference Cheng, J., Ke, Y., Chu, S., Özsu, M.T.: Efficient core decomposition in massive networks. In: IEEE 27th International Conference on Data Engineering, pp. 51–62 (2011) Cheng, J., Ke, Y., Chu, S., Özsu, M.T.: Efficient core decomposition in massive networks. In: IEEE 27th International Conference on Data Engineering, pp. 51–62 (2011)
17.
go back to reference Michalski, R., Bródka, P., Kazienko, P., Juszczyszyn, K.; Quantifying social network dynamics. In: IEEE Fourth International Conference on Computational Aspects of Social Networks (CASoN), pp. 69–74 (2012) Michalski, R., Bródka, P., Kazienko, P., Juszczyszyn, K.; Quantifying social network dynamics. In: IEEE Fourth International Conference on Computational Aspects of Social Networks (CASoN), pp. 69–74 (2012)
18.
go back to reference Cha, M., Haddadi, H., Benevenuto, F., Gummadi, P.K.: Measuring user influence in Twitter: the million follower fallacy. In: Proceedings of the Fourth International AAAI Conference on Weblogs and Social Media, Vol. 10, No. 30, pp. 10–17 (2011) Cha, M., Haddadi, H., Benevenuto, F., Gummadi, P.K.: Measuring user influence in Twitter: the million follower fallacy. In: Proceedings of the Fourth International AAAI Conference on Weblogs and Social Media, Vol. 10, No. 30, pp. 10–17 (2011)
19.
go back to reference Sun, E., Rosenn, I., Marlow, C., Lento, T.M.: Gesundheit! modeling contagion through Facebook news feed. In: ICWSM (2009) Sun, E., Rosenn, I., Marlow, C., Lento, T.M.: Gesundheit! modeling contagion through Facebook news feed. In: ICWSM (2009)
20.
go back to reference Aral, S., Muchnik, L., Sundararajan, A.: Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks. Proc. Natl. Acad. Sci. 106(51), 21544–21549 (2009) Aral, S., Muchnik, L., Sundararajan, A.: Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks. Proc. Natl. Acad. Sci. 106(51), 21544–21549 (2009)
21.
go back to reference Di Caro, L., Cataldi, M., Schifanella, C.: The d-index: discovering dependences among scientific collaborators from their bibliographic data records. Scientometrics 93(3), 583–607 (2012) Di Caro, L., Cataldi, M., Schifanella, C.: The d-index: discovering dependences among scientific collaborators from their bibliographic data records. Scientometrics 93(3), 583–607 (2012)
22.
go back to reference Zhang, S., Jin, X., Shen, D., Cao, B., Ding, X., Zhang, X.: Short text classification by detecting information path. In: ACM Proceedings of the 22nd International Conference on Information and Knowledge Management, pp. 727–732 (2013) Zhang, S., Jin, X., Shen, D., Cao, B., Ding, X., Zhang, X.: Short text classification by detecting information path. In: ACM Proceedings of the 22nd International Conference on Information and Knowledge Management, pp. 727–732 (2013)
23.
go back to reference Cataldi, M., Mittal, N., Aufaure, M.A.: Estimating domain-based user influence in social networks. In: ACM Proceedings of the 28th Annual Symposium on Applied Computing, pp. 1957–1962 (2013) Cataldi, M., Mittal, N., Aufaure, M.A.: Estimating domain-based user influence in social networks. In: ACM Proceedings of the 28th Annual Symposium on Applied Computing, pp. 1957–1962 (2013)
24.
go back to reference Cataldi, M., Aufaure, M.A.: The 10 million follower fallacy: audience size does not prove domain-influence on Twitter. Knowl. Inf. Syst. 44(3), 559–580 (2015) Cataldi, M., Aufaure, M.A.: The 10 million follower fallacy: audience size does not prove domain-influence on Twitter. Knowl. Inf. Syst. 44(3), 559–580 (2015)
25.
go back to reference Zhou, D., Han, W., Wang, Y.: Identifying topic-sensitive influential spreaders in social networks. Int. J. Hybrid Inf. Technol. 8(2), 409–422 (2015) Zhou, D., Han, W., Wang, Y.: Identifying topic-sensitive influential spreaders in social networks. Int. J. Hybrid Inf. Technol. 8(2), 409–422 (2015)
32.
go back to reference Gao, S., Ma, J., Chen, Z., Wang, G., Xing, C.: Ranking the spreading ability of nodes in complex networks based on local structure. Physica A 403, 130–147 (2014) Gao, S., Ma, J., Chen, Z., Wang, G., Xing, C.: Ranking the spreading ability of nodes in complex networks based on local structure. Physica A 403, 130–147 (2014)
33.
go back to reference Kondrak, G.: N-gram similarity and distance. In: Springer Proceedings of International Symposium on String Processing and Information Retrieval, pp. 115–126 (2005) Kondrak, G.: N-gram similarity and distance. In: Springer Proceedings of International Symposium on String Processing and Information Retrieval, pp. 115–126 (2005)
Metadata
Title
Identification and classification of best spreader in the domain of interest over the social networks
Authors
A. N. Arularasan
A. Suresh
Koteeswaran Seerangan
Publication date
27-03-2018
Publisher
Springer US
Published in
Cluster Computing / Issue Special Issue 2/2019
Print ISSN: 1386-7857
Electronic ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-2616-y

Other articles of this Special Issue 2/2019

Cluster Computing 2/2019 Go to the issue

Premium Partner