Skip to main content
SpringerLink
Log in

Link-Based Network Mining

  • Chapter
  • First Online:
Structural Analysis of Complex Networks

Abstract

Network mining is a growing area of research within the data mining community that uses metrics and algorithms from graph theory. In this chapter we present an overview of the different techniques in network mining and suggest future research possibilities in the direction of graph theory.

MSC2000: Primary 91D30; Secondary 94C15

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamic L, Adar E (2003) Friends and neighbors on the web. Soc Networks 25:211–230

    Article  Google Scholar 

  2. Airoldi EM, Carley KM (2005) Sampling algorithms for pure network topologies. SIGKDD Explorations 7:13–22

    Article  Google Scholar 

  3. Backstrom L, Dwork C, Kleinberg J (2007) Wherefore art thou r3579x? Anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th international World Wide Web conference

    Google Scholar 

  4. Backstrom L, Huttenlocher D, Kleinberg J, Lan X (2006) Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining

    Google Scholar 

  5. Banerjee A, Krumpelman C, Ghosh J, Basu S, Mooney R (2005) Model based overlapping clustering. In: Proceedings of the 11th ACM SIGKDD international conference on knowledge discovery and data mining

    Google Scholar 

  6. Barabási A-L, Bonabeau E (2003) Scale-free networks. Sci Am 288:50–59

    Article  Google Scholar 

  7. Basu S, Bilenko M, Mooney R (2004) A probabilistic framework for semi-supervised clustering. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, Seattle, WA

    Google Scholar 

  8. Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Deng X, Graham FC (eds) Proceedings of WINE 2007. Springer, Heidelberg

    Google Scholar 

  9. Borgatti SP, Everett MG (1999) Models of core/periphery structures. Soc Networks 21: 375–395

    Article  Google Scholar 

  10. Brandes U, Erlebach T (2005) Network analysis. Lecture Notes in Computer Science. Springer, Berlin

    Book  MATH  Google Scholar 

  11. Burk W, Steglich CEG, Snijders TAB (2007) Beyond dyadic interdependence: actor-oriented models for co-evolving social networks and individual behaviors. Int J Behav Dev 31:397

    Article  Google Scholar 

  12. Chakrabarti S, Dom B, Indyk P (1998) Enhanced hypertext categorization using hyperlinks. In: Proceedings of the SIGMOD international conference on management of data. ACM, New York, pp 307–318

    Google Scholar 

  13. Chang H, Yeung D-Y (2008) Robust path-based spectral clustering. Pattern Recogn 41: 191–203

    Article  MATH  Google Scholar 

  14. Chartrand G, Oellermann O (1992) Applied and algorithmic graph theory. McGraw-Hill, New York

    Google Scholar 

  15. Clauset A, Moore C, Newman MEJ (2006) Structural inference of hierarchies in networks. In: Statistical network analysis: models, issues, and new directions, vol 4503, pp 1–13

    Article  Google Scholar 

  16. Dehmer M, Emmert-Streib F (2008) Structural information content of networks: graph entropy based on local vertex functionals. Comput Biol Chem 32:131–138

    Article  MATH  MathSciNet  Google Scholar 

  17. Desikan P, Pathak N, Srivastava J, Kumar V (2005) Incremental page rank computation on evolving graphs. In: Proceedings of the 14th international World Wide Web conference (Special interest tracks and posters)

    Google Scholar 

  18. Dhillon IS, Guan Y, Kulis B (2004) Kernel k-means: spectral clustering and normalized cuts. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining

    Google Scholar 

  19. Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, pp 57–66

    Google Scholar 

  20. Doreian P, Batagelj V, Ferligoj A (2005) Positional analysis of sociometric data. In: Carrington P, Scott J, Wasserman S (eds) Models and methods in social network analysis, Cambridge, New York

    Google Scholar 

  21. Erd\ddot{o}s P, R\acute{e}nyi A (1960) On the evolution of random graphs, vol 5. Publications of the institute of Mathematics, Hungarian Academy of Science, pp 17–61

    Google Scholar 

  22. Fienberg S (2006) Panel discussion from statistical network analysis: models, issues, and new directions. In: Proceedings of the ICML 2006 workshop on statistical network analysis, Pittsburgh, PA, USA

    Google Scholar 

  23. Flake G, Tsioutsiouliklis K, Tarjan R (2002) Graph clustering techniques based on minimum cut trees. Technical Report, NEC, Princeton, NJ

    Google Scholar 

  24. Frantz T, Carley KM (2005) A formal characterization of cellular networks. Technical Report CMU-ISRI-05-109, School of Computer Science, Carnegie Mellon University

    Google Scholar 

  25. Gao J, Tan PN, Cheng H (2006) Semi-supervised clustering with partial background information. In: Proceedings of SDM’06: SIAM international conference on data mining

    Google Scholar 

  26. Getoor L, Diehl CP (2005) Link mining: a survey. SIGKDD Explorations 7:3–12

    Article  Google Scholar 

  27. Gibson D, Kleinberg J, Raghavan P (1998) Inferring web communities from link topology. In: Proceedings of the 9th ACM conference on hypertext and hypermedia

    Google Scholar 

  28. Girvan M, Newman M (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99:7821–7826

    Article  MATH  MathSciNet  Google Scholar 

  29. Goldenberg J, Libai B, Muller E (2001) Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Academy of Marketing Science Review

    Google Scholar 

  30. Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83:1420–1443

    Article  Google Scholar 

  31. Guimer\grave{a} R, Sales-Pardo M, Amaral L (2007) Classes of complex networks defined by role-to-role connectivity profiles. Nat Phys 3:63–69

    Google Scholar 

  32. Hanneke S, Xing E (2006) Discrete temporal models of social networks. In: Proceedings of the 23rd international conference on machine learning workshop on statistical network analysis

    Google Scholar 

  33. Al Hasan M, Chaoji V, Salem S, Zaki M (2006) Link prediction using supervised learning. In: Proceedings of SDM’06: SIAM data mining conference workshop on link analysis, counter-terrorism and Security

    Google Scholar 

  34. Heer J, Boyd D (2005) Vizster: visualizing online social networks. In: Proceedings of IEEE symposium on information visualization. IEEE Press, Minneapolis, MN

    Google Scholar 

  35. Jackson M (2008) Social networks in economics. In: Benhabib J, Bisin A, Jackson MO (eds) Handbook of social economics. Elsevier, Amsterdam

    Google Scholar 

  36. Kandel D (1978) Homophily, selection, and socialization in adolescent friendships. Am J Sociol 84:427–436

    Article  Google Scholar 

  37. Karypis G, Kumar V (1995) Analysis of multilevel graph partitioning. Supercomputing

    Google Scholar 

  38. Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20:359–392

    Article  MATH  MathSciNet  Google Scholar 

  39. Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18: 39–43

    Article  MATH  Google Scholar 

  40. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 137–146

    Google Scholar 

  41. Kleinberg J (1999) Sources in a hyperlinked environment. J ACM 46:604–632

    Article  MATH  MathSciNet  Google Scholar 

  42. Krackhardt D, Hanson JR (1993) Informal networks: the company behind the chart. Harvard Bus Rev 71:104–111

    Google Scholar 

  43. Lempel R, Moran S (2001) Salsa: the stochastic approach for link-structure analysis. ACM Trans Inf Syst 19:131–160

    Article  Google Scholar 

  44. Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: SIGKDD

    Google Scholar 

  45. Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the 11th ACM SIGKDD international conference on knowledge discovery in data mining

    Google Scholar 

  46. Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: Proceedings of the 12th international conference on information and knowledge management, New Orleans, LA

    Google Scholar 

  47. Lu Q, Getoor L (2003) Link-based classification. In: Proceedings of the 20th international conference on machine learning, ICML

    Google Scholar 

  48. Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions. Math Program 14:265–294

    Article  MATH  MathSciNet  Google Scholar 

  49. Neville J, Jensen D (2005) Leveraging relational autocorrelation with latent group models. In: Proceedings of the 5th IEEE international conference on data mining

    Google Scholar 

  50. Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113

    Article  Google Scholar 

  51. Newman MEJ (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64:025102

    Article  Google Scholar 

  52. O’Madadhain J, Hutchins J, Smyth P (2005) Prediction and ranking algorithms for event-based network data. SIGKDD Explorations 7:23–30

    Article  Google Scholar 

  53. Page L, Brin S, Motwani R, Winograd T (1998) Pagerank citation ranking: bringing order to the web. Technical report, Stanford University

    Google Scholar 

  54. Potgieter A, April K, Cooke R, Osunmakinde IO (2006) Temporality in link prediction: understanding social complexity. J Trans Eng Manag

    Google Scholar 

  55. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101:2658–2663

    Article  Google Scholar 

  56. Rattigan M, Jensen D (2005) The case for anomalous link discovery. SIGKDD Explorations 7:41–47

    Article  Google Scholar 

  57. Scripps J, Tan PN (2006) Clustering in the presence of bridge-nodes. In: Proceedings of SDM’06: SIAM international conference on data mining, Bethesda, MD

    Google Scholar 

  58. Scripps J, Tan PN, Esfahanian A-H (2007) Exploration of link structure and community-based node roles in network. Technical report, Michigan State University

    Google Scholar 

  59. Scripps J, Tan PN, Esfahanian A-H (2007) Exploration of link structure and community-based node roles in network analysis. In: Proceedings of the 7th IEEE international conference on data mining

    Google Scholar 

  60. Senator T (2002) Darpa: evidence extraction and link discovery program. DARPATech

    Google Scholar 

  61. Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal 22(8):888–905

    Article  Google Scholar 

  62. Skorobogatov VA, Dobrynin AA (1988) Metrical analysis of graphs. MATCH 23:105–155

    MATH  MathSciNet  Google Scholar 

  63. Solé RV, Valverde S (2004) Information theory of complex networks: on evolution and architectural constraints. In: Lecture notes in physics, vol 650, pp 189–207

    Google Scholar 

  64. Tan P, Steinbach M, Kumar V (2005) Introduction to data mining. Addison Wesley, Boston, MA

    Google Scholar 

  65. Tantipathananandh C, Berger-Wolf TY, Kempe D (2007) A framework for community identification in dynamic social networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 717–726

    Google Scholar 

  66. Taskar B, Abbeel P, Koller D (2002) Discriminative probabilistic models for relational data. In: Proceedings of the 18th conference on uncertainty in artificial intelligence (UAI02)

    Google Scholar 

  67. Taskar B, Wong MF, Abbeel P, Koller D (2003) Link prediction in relational data. In: Neural information processing systems conference (NIPS03)

    Google Scholar 

  68. Tyler JR, Wilkinson DM, Huberman BA (2003) Email as spectroscopy: automated discovery of community structure within organizations. In: Proceedings of the 5th international conference on communities and technologies

    Google Scholar 

  69. Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge

    Google Scholar 

  70. Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440–442

    Article  Google Scholar 

  71. Yang Y, Slattery S, Ghani R (2002) A study of approaches to hypertext categorization. J Intell Inf Syst 18:219–241

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Information Systems, Grand Valley State University, 1 Campus Drive, Allendale, MI, 49401, USA

    Jerry Scripps

Authors
  1. Jerry Scripps
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ronald Nussbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pang-Ning Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdol-Hossein Esfahanian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jerry Scripps .

Editor information

Editors and Affiliations

  1. Medizinische Informatik und Technik, Institute for Bioinformatics and Transla, UMIT-Private Universität für Gesundheits, Eduard Wallnöfer-Zentrum 1, Hall in Tirol, A-6060, Austria

    Matthias Dehmer

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Scripps, J., Nussbaum, R., Tan, PN., Esfahanian, AH. (2011). Link-Based Network Mining. In: Dehmer, M. (eds) Structural Analysis of Complex Networks. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4789-6_16

Download citation

Publish with us

Policies and ethics

Search

Navigation