Skip to main content
Top

2013 | OriginalPaper | Chapter

Influence Diffusion, Community Detection, and Link Prediction in Social Network Analysis

Authors : Lidan Fan, Weili Wu, Zaixin Lu, Wen Xu, Ding-Zhu Du

Published in: Dynamics of Information Systems: Algorithmic Approaches

Publisher: Springer New York

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

search-config
loading …

Abstract

Social networks have received extensive attention among researchers across a wide range of disciplines such as computer science, physics, and sociology. This paper mainly overviews a variety of approaches for three problems in real-world life scenarios. The first problem is about influence diffusion, in which influence represents news, ideas, information, and so forth; the second one concerns with partitioning social networks into communities efficiently; and the third one is to predict the hidden or possible new links between individuals in the future based on the existing or observed information.

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 G. Agarwal and D. Kempe: Modularity-maximizing graph communities via mathematical programming. European Physical Journal B, 66:409–418, 2008.MathSciNetMATHCrossRef G. Agarwal and D. Kempe: Modularity-maximizing graph communities via mathematical programming. European Physical Journal B, 66:409–418, 2008.MathSciNetMATHCrossRef
2.
go back to reference Y. Ahn, J. Bagrow and S. Lehmann: Link communities reveal multiscale complexity in networks. Nature, 466:761–764, 2010.CrossRef Y. Ahn, J. Bagrow and S. Lehmann: Link communities reveal multiscale complexity in networks. Nature, 466:761–764, 2010.CrossRef
3.
go back to reference L. Backstrom and J. Leskovec: Supervised random walks: predicting and recommending links in social networks. In WSDM ’11, 2011. L. Backstrom and J. Leskovec: Supervised random walks: predicting and recommending links in social networks. In WSDM ’11, 2011.
4.
go back to reference S. Bharathi, D. Kempe and M. Salek: Competitive influence maximization in social networks. In WINE, pp. 306–311, 2007. S. Bharathi, D. Kempe and M. Salek: Competitive influence maximization in social networks. In WINE, pp. 306–311, 2007.
5.
go back to reference A. Borodin, Y. Filmus and J. Oren: Threshold models for competitive influence in social networks. In WINE, pp. 539–550, 2010. A. Borodin, Y. Filmus and J. Oren: Threshold models for competitive influence in social networks. In WINE, pp. 539–550, 2010.
6.
go back to reference U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Transactions on Knowledge and Data Engineering, 20(2):172188, 2008. U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Transactions on Knowledge and Data Engineering, 20(2):172188, 2008.
7.
go back to reference C. Budak, D. Agrawal and A. E. Abbadi: Limiting the spread of misinformation in social networks. In WWW, pp. 665–674, 2011. C. Budak, D. Agrawal and A. E. Abbadi: Limiting the spread of misinformation in social networks. In WWW, pp. 665–674, 2011.
8.
go back to reference T. Carnes, C. Nagarajan, S. M. Wild and A. van Zuylen: Maximizing influence in a competitive social network: a followers perspective. In ICEC, pp. 351–360, 2007. T. Carnes, C. Nagarajan, S. M. Wild and A. van Zuylen: Maximizing influence in a competitive social network: a followers perspective. In ICEC, pp. 351–360, 2007.
9.
go back to reference D. Chakrabarti, R. Kumar and A. Tomkins: Evolutionary clustering. In Proc. In KDD, pp. 554–560, 2006. D. Chakrabarti, R. Kumar and A. Tomkins: Evolutionary clustering. In Proc. In KDD, pp. 554–560, 2006.
10.
go back to reference W. Chen, Y. Wang, and S. Yang: Efficient Influence Maximization in Social Networks. the 2009 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 199–208, 2009. W. Chen, Y. Wang, and S. Yang: Efficient Influence Maximization in Social Networks. the 2009 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 199–208, 2009.
11.
go back to reference W. Chen, C. Wang and Y. Wang: Scalable Influence Maximization for Prevalent Viral Marketing in Large-scale Social Networks. the 2010 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1029–1038, 2010. W. Chen, C. Wang and Y. Wang: Scalable Influence Maximization for Prevalent Viral Marketing in Large-scale Social Networks. the 2010 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1029–1038, 2010.
12.
go back to reference W. Chen, Y. Yuan and L. Zhang: Scalable Influence Maximization in Social Networks under the Linear Threshold Model. the 2010 International Conference on Data Mining, pp. 88–97, 2010. W. Chen, Y. Yuan and L. Zhang: Scalable Influence Maximization in Social Networks under the Linear Threshold Model. the 2010 International Conference on Data Mining, pp. 88–97, 2010.
13.
go back to reference W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu, D. Rincn, X. Sun, Y. Wang, W. Wei and Y. Yuan: Influence maximization in social networks when negative opinions may emerge and propagate. In SDM, pp. 379–390, 2011. W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu, D. Rincn, X. Sun, Y. Wang, W. Wei and Y. Yuan: Influence maximization in social networks when negative opinions may emerge and propagate. In SDM, pp. 379–390, 2011.
14.
go back to reference A. Clauset, M. E. J. Newman and C. Moore: Finding community structure in very large networks, Phys. Rev. E 70, 066111, 2004.CrossRef A. Clauset, M. E. J. Newman and C. Moore: Finding community structure in very large networks, Phys. Rev. E 70, 066111, 2004.CrossRef
15.
go back to reference A. Clauset, C. Moore and M. E. J. Newman: Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191):98-101, 2008.CrossRef A. Clauset, C. Moore and M. E. J. Newman: Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191):98-101, 2008.CrossRef
16.
go back to reference P. M. Comar, P.N. Tan and A. K. Jain: LinkBoost: A novel cost-sensitive boosting framework for community-level network link prediction. In ICDM, pages 131–140, 2011. P. M. Comar, P.N. Tan and A. K. Jain: LinkBoost: A novel cost-sensitive boosting framework for community-level network link prediction. In ICDM, pages 131–140, 2011.
17.
go back to reference L. Danon, A. Díaz-Guilera and A. Arenas: Effect of size heterogeneity on community identification in complex networks. J. Stat. Mech. P11010, 2006. L. Danon, A. Díaz-Guilera and A. Arenas: Effect of size heterogeneity on community identification in complex networks. J. Stat. Mech. P11010, 2006.
18.
go back to reference P. Domingos and M. Richardson: Mining the network value of customers. In KDD, pp. 57–66, 2001. P. Domingos and M. Richardson: Mining the network value of customers. In KDD, pp. 57–66, 2001.
19.
go back to reference H. Du, M. W. Feldman, S. Li and X. Jin: An algorithm for detecting community structure of social networks based on prior knowledge and modularity. Complexity 12(3), pp. 53–60, 2007.MathSciNetCrossRef H. Du, M. W. Feldman, S. Li and X. Jin: An algorithm for detecting community structure of social networks based on prior knowledge and modularity. Complexity 12(3), pp. 53–60, 2007.MathSciNetCrossRef
20.
go back to reference F. Folino and C. Pizzuti: A multi-objective and evolutionary clustering method for dynamic networks. In Proc. Int. Conf. Advances in Social Networks Analysis and Mining, pp. 256–263, August 2010. F. Folino and C. Pizzuti: A multi-objective and evolutionary clustering method for dynamic networks. In Proc. Int. Conf. Advances in Social Networks Analysis and Mining, pp. 256–263, August 2010.
21.
go back to reference S. Fortunato: Community detection in graphs. Physics Reports, 486(3–5), 2010. S. Fortunato: Community detection in graphs. Physics Reports, 486(3–5), 2010.
22.
go back to reference S. Fortunato and M. Barthelemy: Resolution limit in community detection. Proceedings of The National Academy of Sciences, 104(1):36–41, 2007.CrossRef S. Fortunato and M. Barthelemy: Resolution limit in community detection. Proceedings of The National Academy of Sciences, 104(1):36–41, 2007.CrossRef
23.
go back to reference L. Getoor and C. P. Diehl: Link mining: a survey. SIGKDD Explor. Newsl., 7(2):3–12, 2005.CrossRef L. Getoor and C. P. Diehl: Link mining: a survey. SIGKDD Explor. Newsl., 7(2):3–12, 2005.CrossRef
24.
go back to reference M. Girvan and M. E. J. Newman: Community structure in social and biological networks, PNAS, vol.99, no. 12, pp. 7821–7826, 2002.MathSciNetCrossRef M. Girvan and M. E. J. Newman: Community structure in social and biological networks, PNAS, vol.99, no. 12, pp. 7821–7826, 2002.MathSciNetCrossRef
25.
go back to reference J. Goldenberg, B. Libai and E. Muller: Using Complex Systems Analysis to Advance Marketing Theory Development. Academy of Marketing Science Review, 2001. J. Goldenberg, B. Libai and E. Muller: Using Complex Systems Analysis to Advance Marketing Theory Development. Academy of Marketing Science Review, 2001.
26.
go back to reference J. Goldenberg, B. Libai and E. Muller: Talk of the Network: A Complex Systems Look at the Underlying Process of Wordof- Mouth. Marketing Letters, 12(3): pp. 211–223, 2001.CrossRef J. Goldenberg, B. Libai and E. Muller: Talk of the Network: A Complex Systems Look at the Underlying Process of Wordof- Mouth. Marketing Letters, 12(3): pp. 211–223, 2001.CrossRef
27.
go back to reference M. G. Gong, L. J. Zhang and J. J. Ma, et al.: Community detection in dynamic social networks based on multiobjective immune algorithm, Journal of Computer Science and Technology 27, pp. 455–467, 2012.MathSciNetCrossRef M. G. Gong, L. J. Zhang and J. J. Ma, et al.: Community detection in dynamic social networks based on multiobjective immune algorithm, Journal of Computer Science and Technology 27, pp. 455–467, 2012.MathSciNetCrossRef
28.
go back to reference B. H. Good, Y. A. de Montjoye and A. Clauset: The performance of modularity maximization in practical contexts. Physical Review E, 81:046106, 2010.MathSciNetCrossRef B. H. Good, Y. A. de Montjoye and A. Clauset: The performance of modularity maximization in practical contexts. Physical Review E, 81:046106, 2010.MathSciNetCrossRef
29.
go back to reference A. Goyal, W. Lu, and L. V. S. Lakshmanan: CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks. the 2011 International World Wide Web Conference, pp. 47–48, 2011. A. Goyal, W. Lu, and L. V. S. Lakshmanan: CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks. the 2011 International World Wide Web Conference, pp. 47–48, 2011.
30.
go back to reference A. Goyal, W. Lu and L. V. S. Lakshmanan: SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. the 2011 IEEE International Conference on Data Mining, pp. 211–220, 2011. A. Goyal, W. Lu and L. V. S. Lakshmanan: SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. the 2011 IEEE International Conference on Data Mining, pp. 211–220, 2011.
31.
go back to reference M. Granovetter: Threshold Models of Collective Behavior. American Journal of Sociology, 83(6): pp. 1420–1443, 1978.CrossRef M. Granovetter: Threshold Models of Collective Behavior. American Journal of Sociology, 83(6): pp. 1420–1443, 1978.CrossRef
32.
go back to reference D. Greene, D. Doyle and P. Cunningham: Tracking the evolution of communities in dynamic social networks. In ASONAM, pp. 176–183, 2010. D. Greene, D. Doyle and P. Cunningham: Tracking the evolution of communities in dynamic social networks. In ASONAM, pp. 176–183, 2010.
33.
go back to reference R. V. Guha, R. Kumar, P. Raghavan and A. Tomkins: Propagation of trust and distrust. In Proc. 13th WWW, 2004. R. V. Guha, R. Kumar, P. Raghavan and A. Tomkins: Propagation of trust and distrust. In Proc. 13th WWW, 2004.
34.
go back to reference R. Guimerà and L. N. Amaral: Functional cartography of complex metabolic networks. Nature, 433(7028):895–900, 2005.CrossRef R. Guimerà and L. N. Amaral: Functional cartography of complex metabolic networks. Nature, 433(7028):895–900, 2005.CrossRef
35.
go back to reference R. Guimerà, M. SALES-PARDO and L. A. N. AND AMARAL: Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E 70 art. no. 025101, 2004. R. Guimerà, M. SALES-PARDO and L. A. N. AND AMARAL: Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E 70 art. no. 025101, 2004.
36.
go back to reference M. A. Hasan, V. Chaoji, S. Salem and M. Zaki: Link prediction using supervised learning. In Proc. of SDM 06 workshop on Link Analysis, Counterterrorism and Security, 2006. M. A. Hasan, V. Chaoji, S. Salem and M. Zaki: Link prediction using supervised learning. In Proc. of SDM 06 workshop on Link Analysis, Counterterrorism and Security, 2006.
37.
go back to reference X. He, G. Song, W. Chen and Q. Jiang: Influence blocking maximization in social networks under the competitive linear threshold model. SDM to appear, 2012. X. He, G. Song, W. Chen and Q. Jiang: Influence blocking maximization in social networks under the competitive linear threshold model. SDM to appear, 2012.
38.
go back to reference Z. Huang and D. K. J. Lin: The time-series link prediction problem with applications in communication surveillance. INFORMS J. on Computing, 21:286-303, April 2009.CrossRef Z. Huang and D. K. J. Lin: The time-series link prediction problem with applications in communication surveillance. INFORMS J. on Computing, 21:286-303, April 2009.CrossRef
39.
go back to reference Q. Jiang, G. Song, G. Cong, Y. Wang, W. Si and K. Xie: Simulated Annealing Based in Influence Maximization in Social Networks. the 2011 AAAI Conference on Artificial Intelligence, 2011. Q. Jiang, G. Song, G. Cong, Y. Wang, W. Si and K. Xie: Simulated Annealing Based in Influence Maximization in Social Networks. the 2011 AAAI Conference on Artificial Intelligence, 2011.
40.
go back to reference D. Kempe, J. Kleinberg and É. Tardos: Maximizing The Spread of Influence Through a Social Network. the 2003 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 137–146, 2003. D. Kempe, J. Kleinberg and É. Tardos: Maximizing The Spread of Influence Through a Social Network. the 2003 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 137–146, 2003.
41.
go back to reference D. Kempe, J. M. Kleinberg and É. Tardos: Influential nodes in a diffusion model for social networks. In ICALP, pp. 1127–1138, 2005. D. Kempe, J. M. Kleinberg and É. Tardos: Influential nodes in a diffusion model for social networks. In ICALP, pp. 1127–1138, 2005.
42.
go back to reference K. Kim, R. McKay and B. R. Moon: Multi-objective evolutionary algorithms for dynamic social network clustering. In Proc. the 12th Conf. Genetic and Evolutionary Computation, pp. 1179–1186, July 2010. K. Kim, R. McKay and B. R. Moon: Multi-objective evolutionary algorithms for dynamic social network clustering. In Proc. the 12th Conf. Genetic and Evolutionary Computation, pp. 1179–1186, July 2010.
43.
go back to reference M. Kimura, K. Saito and R. Nakano: Extracting Influential Nodes for Information Diffusion on Social Network. the 2007 AAAI Conference on Artificial Intelligence, pp. 1371–1376, 2007. M. Kimura, K. Saito and R. Nakano: Extracting Influential Nodes for Information Diffusion on Social Network. the 2007 AAAI Conference on Artificial Intelligence, pp. 1371–1376, 2007.
44.
go back to reference M. Kimura, k. Saito and H. Motoda: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 2008. M. Kimura, k. Saito and H. Motoda: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 2008.
45.
go back to reference J. Kostka, Y. A. Oswald and R. Wattenhofer: Word of mouth: Rumor dissemination in social networks. In SIROCCO, pp. 185–196, 2008. J. Kostka, Y. A. Oswald and R. Wattenhofer: Word of mouth: Rumor dissemination in social networks. In SIROCCO, pp. 185–196, 2008.
46.
go back to reference J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van- Briesen and N. S. Glance: Cost-Effective Outbreak Detection in Networks. the 2007 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 420–429, 2007. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van- Briesen and N. S. Glance: Cost-Effective Outbreak Detection in Networks. the 2007 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 420–429, 2007.
47.
go back to reference J. Leskovec, D. Huttenlocher and J. Kleinberg: Predicting Positive and Negative Links in Online Social Networks, In Proceedings of WWW’2010, ACM Press, New York, 2010. J. Leskovec, D. Huttenlocher and J. Kleinberg: Predicting Positive and Negative Links in Online Social Networks, In Proceedings of WWW’2010, ACM Press, New York, 2010.
48.
go back to reference Y. R. Lin, Y. Chi, S. H. Zhu, H. Sundaram and B. L. Tseng: Facetnet: A framework for analyzing communities and their evolutions in dynamic networks. In Proc. the 17th Int. Conf. World Wide Web, pp. 685–694, April 2008. Y. R. Lin, Y. Chi, S. H. Zhu, H. Sundaram and B. L. Tseng: Facetnet: A framework for analyzing communities and their evolutions in dynamic networks. In Proc. the 17th Int. Conf. World Wide Web, pp. 685–694, April 2008.
49.
go back to reference J. O’Madadhain, J. Hutchins and P. Smyth: Prediction and ranking algorithms for event-based network data. ACM SIGKDD Exploration Newsletter, 7(2):23-30, 2005.CrossRef J. O’Madadhain, J. Hutchins and P. Smyth: Prediction and ranking algorithms for event-based network data. ACM SIGKDD Exploration Newsletter, 7(2):23-30, 2005.CrossRef
50.
go back to reference R. Narayanam and Y. Narahari: A Shapley Value Based Approach to Discover Influenctial Nodes in Social Networks. IEEE Transactions on Automation Science and Engineering, 8(1): pp. 130–147, 2011.CrossRef R. Narayanam and Y. Narahari: A Shapley Value Based Approach to Discover Influenctial Nodes in Social Networks. IEEE Transactions on Automation Science and Engineering, 8(1): pp. 130–147, 2011.CrossRef
51.
go back to reference M. E. J. Newman: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004).CrossRef M. E. J. Newman: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004).CrossRef
52.
go back to reference M. E. Newman and M. Girvan: Finding and evaluating community structure in networks, Phys. Rev. E 69 (2), 026113, 2004. M. E. Newman and M. Girvan: Finding and evaluating community structure in networks, Phys. Rev. E 69 (2), 026113, 2004.
53.
go back to reference N. P. Nguyen, T. N. Dinh, Y. Xuan and M. T. Thai: Adaptive algorithms for detecting community structure in dynamic social networks. INFOCOM, 2011. N. P. Nguyen, T. N. Dinh, Y. Xuan and M. T. Thai: Adaptive algorithms for detecting community structure in dynamic social networks. INFOCOM, 2011.
54.
go back to reference N. P. Nguyen, T. N. Dinh, S. Tokala and M. T. Thai: Overlapping communities in dynamic networks: Their detection and mobile applications. MOBICOM, 2011. N. P. Nguyen, T. N. Dinh, S. Tokala and M. T. Thai: Overlapping communities in dynamic networks: Their detection and mobile applications. MOBICOM, 2011.
55.
go back to reference N. P. Nguyen, G. Yan, M. T. Thai and S. Eidenbenz: Containment of Misinformation Spread in Online Social Networks. WebSci, 2012. N. P. Nguyen, G. Yan, M. T. Thai and S. Eidenbenz: Containment of Misinformation Spread in Online Social Networks. WebSci, 2012.
56.
go back to reference D. Liben-Nowell and J. M. Kleinberg: The link prediction problem for social networks. In CIKM, pp. 556–559, 2003. D. Liben-Nowell and J. M. Kleinberg: The link prediction problem for social networks. In CIKM, pp. 556–559, 2003.
57.
go back to reference D. Liben-Nowell and J. M. Kleinberg: The link-prediction problem for social networks. JASIST, 58(7), pp. 1019–1031, 2007.CrossRef D. Liben-Nowell and J. M. Kleinberg: The link-prediction problem for social networks. JASIST, 58(7), pp. 1019–1031, 2007.CrossRef
58.
go back to reference L. Lü and T. Zhou: Link prediction in complex networks: A survey. Physica A, 390:1150–1170, 2011.CrossRef L. Lü and T. Zhou: Link prediction in complex networks: A survey. Physica A, 390:1150–1170, 2011.CrossRef
59.
go back to reference G. Palla, A. L. Barabasi and T. Vicsek: Quantifying social group evolution. Nature, 446(7136): 664–667, 2007.CrossRef G. Palla, A. L. Barabasi and T. Vicsek: Quantifying social group evolution. Nature, 446(7136): 664–667, 2007.CrossRef
60.
go back to reference A. Potgieter, K. A. April, R. J. E. Cooke and I. O. Osunmakinde: Temporality in link prediction: Understanding social complexity, 2007. A. Potgieter, K. A. April, R. J. E. Cooke and I. O. Osunmakinde: Temporality in link prediction: Understanding social complexity, 2007.
61.
go back to reference M. Richardson and P. Domingos: Mining knowledge-sharing sites for viral marketing. In KDD, pp. 61–70, 2002. M. Richardson and P. Domingos: Mining knowledge-sharing sites for viral marketing. In KDD, pp. 61–70, 2002.
62.
go back to reference M. Rosvall and C. T. Bergstrom: Mapping change in large networks. PLoS ONE, 5, e8694, 2010.CrossRef M. Rosvall and C. T. Bergstrom: Mapping change in large networks. PLoS ONE, 5, e8694, 2010.CrossRef
63.
go back to reference M. Sales Pardo, R. Guimer, A. Moreirà and L. Amaral: Extracting the hierarchical organization of complex systems. Proceedings of the National Academy of Sciences, 104(39):15224–15229, 2007.CrossRef M. Sales Pardo, R. Guimer, A. Moreirà and L. Amaral: Extracting the hierarchical organization of complex systems. Proceedings of the National Academy of Sciences, 104(39):15224–15229, 2007.CrossRef
64.
go back to reference T. Schelling: Micromotives and Macrobehavior. Norton, 1978. T. Schelling: Micromotives and Macrobehavior. Norton, 1978.
65.
go back to reference J. Shi and J. Malik: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8): pp. 888–905, 2000.CrossRef J. Shi and J. Malik: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8): pp. 888–905, 2000.CrossRef
66.
go back to reference M. Shiga, I. Takigawa and H. Mamitsuka: A spectral clustering approach to optimally combining numerical vectors with a modular network. In KDD, pp. 647–656, 2007. M. Shiga, I. Takigawa and H. Mamitsuka: A spectral clustering approach to optimally combining numerical vectors with a modular network. In KDD, pp. 647–656, 2007.
67.
go back to reference P. R. D. S. Soares and R. B. C. Prudêncio: Time Series Based Link Prediction. Neural Networks (IJCNN), The 2012 International Joint Conference on 10–15 June 2012. P. R. D. S. Soares and R. B. C. Prudêncio: Time Series Based Link Prediction. Neural Networks (IJCNN), The 2012 International Joint Conference on 10–15 June 2012.
68.
go back to reference C. Tantipathananandh, T. Berger-Wolf and D. Kempe: A framework for community identification in dynamic social networks. In Proc. 13th ACM SIGKDD International conference on Knowledge Discovery and Data mining, pp. 717–726, ACM, 2007. C. Tantipathananandh, T. Berger-Wolf and D. Kempe: A framework for community identification in dynamic social networks. In Proc. 13th ACM SIGKDD International conference on Knowledge Discovery and Data mining, pp. 717–726, ACM, 2007.
69.
go back to reference B. Taskar, M.F. Wong, P. Abbeel and D. Koller: Link prediction in relational data. In Neural Information Processing Systems, volume 15, 2003. B. Taskar, M.F. Wong, P. Abbeel and D. Koller: Link prediction in relational data. In Neural Information Processing Systems, volume 15, 2003.
70.
go back to reference M. Thai and P. M. Pardalos: Handbook of Optimization in Complex Networks. Communication and Social Networks. Springer. Series: Springer Optimization and Its Applications, 2012. Vol. 58. ISBN 978-1-4614-0856-7. M. Thai and P. M. Pardalos: Handbook of Optimization in Complex Networks. Communication and Social Networks. Springer. Series: Springer Optimization and Its Applications, 2012. Vol. 58. ISBN 978-1-4614-0856-7.
71.
go back to reference M. Thai and P. M. Pardalos: Handbook of Optimization in Complex Networks. Theory and Applications. Springer. Series: Springer Optimization and Its Applications, 2012. Vol. 57. ISBN 978-1-4614-0753-9. M. Thai and P. M. Pardalos: Handbook of Optimization in Complex Networks. Theory and Applications. Springer. Series: Springer Optimization and Its Applications, 2012. Vol. 57. ISBN 978-1-4614-0753-9.
72.
go back to reference D. Trpevski, W. K. S. Tang and L. Kocarev: Model for rumor spreading over networks. Physics Review E, 2010. D. Trpevski, W. K. S. Tang and L. Kocarev: Model for rumor spreading over networks. Physics Review E, 2010.
73.
go back to reference K. Wakita and T. Tsurumi: Finding community structure in mega-scale social networks. In WWW, pp. 1275–1276, 2007. K. Wakita and T. Tsurumi: Finding community structure in mega-scale social networks. In WWW, pp. 1275–1276, 2007.
74.
go back to reference Y. Wang, G. Cong, G. Song and K. Xie: Community-Based Greedy Algorithm for Mining Top-k Influential Nodes in Mobile Social Networks. the 2010 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1039–1048, 2010. Y. Wang, G. Cong, G. Song and K. Xie: Community-Based Greedy Algorithm for Mining Top-k Influential Nodes in Mobile Social Networks. the 2010 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1039–1048, 2010.
75.
go back to reference E. W. Xiang: A survey on link prediction models for social network data. Science And Technology, 2008. E. W. Xiang: A survey on link prediction models for social network data. Science And Technology, 2008.
76.
go back to reference B. Xiang, E. H. Chen and T. Zhou: Finding community structure based on subgraph similarity. Complex Networks, vol.207, pp. 73–81, 2009.CrossRef B. Xiang, E. H. Chen and T. Zhou: Finding community structure based on subgraph similarity. Complex Networks, vol.207, pp. 73–81, 2009.CrossRef
77.
go back to reference X. Xu, N. Yuruk, Z. Feng and T. A. J. Schweiger: Scan: A structural clustering algorithm for networks. In KDD, pp. 824–833, 2007. X. Xu, N. Yuruk, Z. Feng and T. A. J. Schweiger: Scan: A structural clustering algorithm for networks. In KDD, pp. 824–833, 2007.
78.
go back to reference Z. Ye, S. Hu and J. Yu: Adaptive clustering algorithm for community detection in complex networks. Physical Review E, 78:046115, 2008.MathSciNetCrossRef Z. Ye, S. Hu and J. Yu: Adaptive clustering algorithm for community detection in complex networks. Physical Review E, 78:046115, 2008.MathSciNetCrossRef
Metadata
Title
Influence Diffusion, Community Detection, and Link Prediction in Social Network Analysis
Authors
Lidan Fan
Weili Wu
Zaixin Lu
Wen Xu
Ding-Zhu Du
Copyright Year
2013
Publisher
Springer New York
DOI
https://doi.org/10.1007/978-1-4614-7582-8_11