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.
Keywords
MSC2000: Primary 91D30; Secondary 94C15
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adamic L, Adar E (2003) Friends and neighbors on the web. Soc Networks 25:211–230
Airoldi EM, Carley KM (2005) Sampling algorithms for pure network topologies. SIGKDD Explorations 7:13–22
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
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
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
Barabási A-L, Bonabeau E (2003) Scale-free networks. Sci Am 288:50–59
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
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
Borgatti SP, Everett MG (1999) Models of core/periphery structures. Soc Networks 21: 375–395
Brandes U, Erlebach T (2005) Network analysis. Lecture Notes in Computer Science. Springer, Berlin
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
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
Chang H, Yeung D-Y (2008) Robust path-based spectral clustering. Pattern Recogn 41: 191–203
Chartrand G, Oellermann O (1992) Applied and algorithmic graph theory. McGraw-Hill, New York
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
Dehmer M, Emmert-Streib F (2008) Structural information content of networks: graph entropy based on local vertex functionals. Comput Biol Chem 32:131–138
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)
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
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
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
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
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
Flake G, Tsioutsiouliklis K, Tarjan R (2002) Graph clustering techniques based on minimum cut trees. Technical Report, NEC, Princeton, NJ
Frantz T, Carley KM (2005) A formal characterization of cellular networks. Technical Report CMU-ISRI-05-109, School of Computer Science, Carnegie Mellon University
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
Getoor L, Diehl CP (2005) Link mining: a survey. SIGKDD Explorations 7:3–12
Gibson D, Kleinberg J, Raghavan P (1998) Inferring web communities from link topology. In: Proceedings of the 9th ACM conference on hypertext and hypermedia
Girvan M, Newman M (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99:7821–7826
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
Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83:1420–1443
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
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
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
Heer J, Boyd D (2005) Vizster: visualizing online social networks. In: Proceedings of IEEE symposium on information visualization. IEEE Press, Minneapolis, MN
Jackson M (2008) Social networks in economics. In: Benhabib J, Bisin A, Jackson MO (eds) Handbook of social economics. Elsevier, Amsterdam
Kandel D (1978) Homophily, selection, and socialization in adolescent friendships. Am J Sociol 84:427–436
Karypis G, Kumar V (1995) Analysis of multilevel graph partitioning. Supercomputing
Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20:359–392
Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18: 39–43
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
Kleinberg J (1999) Sources in a hyperlinked environment. J ACM 46:604–632
Krackhardt D, Hanson JR (1993) Informal networks: the company behind the chart. Harvard Bus Rev 71:104–111
Lempel R, Moran S (2001) Salsa: the stochastic approach for link-structure analysis. ACM Trans Inf Syst 19:131–160
Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: SIGKDD
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
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
Lu Q, Getoor L (2003) Link-based classification. In: Proceedings of the 20th international conference on machine learning, ICML
Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions. Math Program 14:265–294
Neville J, Jensen D (2005) Leveraging relational autocorrelation with latent group models. In: Proceedings of the 5th IEEE international conference on data mining
Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113
Newman MEJ (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64:025102
O’Madadhain J, Hutchins J, Smyth P (2005) Prediction and ranking algorithms for event-based network data. SIGKDD Explorations 7:23–30
Page L, Brin S, Motwani R, Winograd T (1998) Pagerank citation ranking: bringing order to the web. Technical report, Stanford University
Potgieter A, April K, Cooke R, Osunmakinde IO (2006) Temporality in link prediction: understanding social complexity. J Trans Eng Manag
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
Rattigan M, Jensen D (2005) The case for anomalous link discovery. SIGKDD Explorations 7:41–47
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
Scripps J, Tan PN, Esfahanian A-H (2007) Exploration of link structure and community-based node roles in network. Technical report, Michigan State University
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
Senator T (2002) Darpa: evidence extraction and link discovery program. DARPATech
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal 22(8):888–905
Skorobogatov VA, Dobrynin AA (1988) Metrical analysis of graphs. MATCH 23:105–155
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
Tan P, Steinbach M, Kumar V (2005) Introduction to data mining. Addison Wesley, Boston, MA
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
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)
Taskar B, Wong MF, Abbeel P, Koller D (2003) Link prediction in relational data. In: Neural information processing systems conference (NIPS03)
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
Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge
Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440–442
Yang Y, Slattery S, Ghani R (2002) A study of approaches to hypertext categorization. J Intell Inf Syst 18:219–241
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-0-8176-4789-6_16
Published:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4788-9
Online ISBN: 978-0-8176-4789-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)