Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Big Data Storage and Data Models Read chapter Read first chapter

2017 | OriginalPaper | Chapter

Link and Graph Mining in the Big Data Era

Authors : Ana Paula Appel, Luis G. Moyano

Published in: Handbook of Big Data Technologies

Publisher: Springer International Publishing

Log in

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

search-config
loading …

Abstract

Graphs are a convenient representation for large sets of data, being complex networks, social networks, publication networks, and so on. The growing volume of data modeled as complex networks, e.g. the World Wide Web, and social networks like Twitter, Facebook, has raised a new area of research focused in complex networks mining. In this new multidisciplinary area, it is possible to highlight some important tasks: extraction of statistical properties, community detection, link prediction, among several others. This new approach has been driven largely by the growing availability of computers and communication networks, which allow us to gather and analyze data on a scale far larger than previously possible. In this chapter we will give an overview of several graph mining approach to mine and handle large complex networks.

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!

inform now

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!

inform now

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!

inform now
previous chapter Big-Graphs: Querying, Mining, and Beyond
next chapter Granular Social Network: Model and Applications
Footnotes
Literature
1.
L.A. Adamic, E. Adar, Friends and neighbors on the web. Soc. Network. 25(3), 211–230 (2003)CrossRef
2.
L.A. Adamic, B.A. Huberman A. Barabási, R. Albert, H. Jeong, G. Bianconi, Power-law distribution of the world wide web. Science 287(5461):2115a+ (2000)
3.
C. Aggarwal, K. Subbian, Evolutionary network analysis: a survey. ACM Comput. Surv. 47(1), 10:1–10:36 (2014)CrossRefMATH
4.
C. Aggarwal, Y. Xie, P.S. Yu, On Dynamic Link Inference in Heterogeneous Networks, chap. 35, pp. 415–426
5.
N. Ahmed, J. Neville, R.R. Kompella, Network sampling via edge-based node selection with graph induction (2011)
6.
L. Akoglu, M. McGlohon, C. Faloutsos, Oddball: spotting anomalies in weighted graphs, in Advances in Knowledge Discovery and Data Mining, ed. by M.J. Zaki, J.X. Yu, B. Ravindran, V. Pudi (Springer, Heidelberg, 2010), pp. 410–421CrossRef
7.
L. Akoglu, H. Tong, D. Koutra, Graph based anomaly detection and description: a survey. Data Min. Knowl. Discov. 29(3), 626–688 (2015). MayMathSciNetCrossRef
8.
L. Akoglu, P.O.S. Vaz de Melo, C. Faloutsos, Quantifying reciprocity in large weighted communication networks, in Proceedings of the 16th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining - Volume Part II, PAKDD’12 (Springer, Heidelberg, 2012), pp. 85–96
9.
M. Al Hasan, M.J. Zaki, Output space sampling for graph patterns. Proc. VLDB Endow. 2(1), 730–741 (2009)CrossRef
10.
U. Alon, Network motifs: theory and experimental approaches. Nat. Rev. Genet. 8(6), 450–461 (2007)CrossRef
11.
D. Andersen, H. Balakrishnan, F. Kaashoek, R. Morris, Resilient overlay networks (ACM, 2001)
12.
13.
A.P. Appel, E.R.H. Junior, Prophet – a link-predictor to learn new rules on nell, in 2011 IEEE 11th International Conference on Data Mining Workshops (ICDMW), Dec 2011, pp. 917–924
14.
15.
S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak, Z. Ives, DBpedia: a nucleus for a web of open data, in The Semantic Web: 6th International Semantic Web Conference, 2nd Asian Semantic Web Conference, ISWC 2007 + ASWC 2007, Busan, Korea, 11–15 November 2007. Proceedings (Springer, Heidelberg, 2007), pp. 722–735
16.
T. Aynaud, V.D. Blondel, J.-L. Guillaume, R.Lambiotte, Multilevel local optimization of modularity, in Graph Partitioning (2013), pp. 315–345
17.
L. Backstrom, J. Leskovec, Supervised random walks: predicting and recommending links in social networks, in Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, WSDM’11 (ACM, New York, 2011), pp. 635–644
18.
A. Barrat, M. Barthélemy, R. Pastor-Satorras, A. Vespignani, The architecture of complex weighted networks. Proc. National Acad. Sci. 101, 3747–3752 (2004)CrossRef
19.
M. Barthélemy, A. Barrat, R. Pastor-Satorras, A. Vespignani, Characterization and modeling of weighted networks. Physica A 346, 34–43 (2005)CrossRef
20.
D.S. Bassett, M.A. Porter, N.F. Wymbs, S.T. Grafton, J.M. Carlson, P.J. Mucha, Robust detection of dynamic community structure in networks. J. Nonlinear Sci. 23(1), 013142 (2013)MathSciNet
21.
M. Bastian, S. Heymann, M. Jacomy et al., Gephi: an open source software for exploring and manipulating networks. ICWSM 8, 361–362 (2009)
22.
M. Belkin, P. Niyogi, Laplacian eigenmaps and spectral techniques for embedding and clustering. NIPS 14, 585–591 (2001)
23.
Y. Bengio, A. Courville, P. Vincent, Representation learning: a review and new perspectives. IEEE Trans. Pattern Anal. Mach. Intell. 35(8), 1798–1828 (2013)CrossRef
24.
M. Berlingerio, M. Coscia, F. Giannotti, A. Monreale, D. Pedreschi, Multidimensional networks: foundations of structural analysis. World Wide Web 16(5), 567–593 (2012)
25.
G. Bianconi, Statistical mechanics of multiplex networks: entropy and overlap. Phys. Rev. E 87(6), 062806 (2013)CrossRef
26.
V.D. Blondel, J.-L. Guillaume, R. Lambiotte, E. Lefebvre, Fast unfolding of communities in large networks. J. Stat. Mech. Theory Experiment 2008(10), P10008 (2008)CrossRef
27.
S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, D.-U. Hwang, Complex networks: structure and dynamics. Phys. Rep. 424(4), 175–308 (2006)MathSciNetCrossRef
28.
K. Bollacker, C. Evans, P. Paritosh, T. Sturge, J. Taylor, Freebase: a collaboratively created graph database for structuring human knowledge, in Proceedings of SIGMOD (2008)
29.
D. Braha, Y. Bar-Yam, Time-dependent complex networks: dynamic centrality, dynamic motifs, and cycles of social interactions, in Adaptive Networks: Theory, Models and Applications (Springer, Heidelberg, 2009), pp. 39–50
30.
P. Bródka, K. Musial, P. Kazienko, A method for group extraction in complex social networks, in Knowledge Management, Information Systems, E-Learning, and Sustainability Research, ed. by M.D. Lytras, P. Ordonez De Pablos, A. Ziderman, A. Roulstone, H. Maurer, J.B. Imber (Springer, Heidelberg, 2010), pp. 238–247CrossRef
31.
P. Bródka, K. Skibicki, P. Kazienko, K. Musiał, A degree centrality in multi-layered social network, in 2011 International Conference on Computational Aspects of Social Networks (CASoN) (IEEE, 2011), pp. 237–242
32.
P. Bródka, P. Kazienko, K. Musiał, K. Skibicki, Analysis of neighbourhoods in multi-layered dynamic social networks. Int. J. Comput. Intell. Syst. 5(3), 582–596 (2012)CrossRef
33.
A. Cardillo, J.Gómez-Gardeñes, M. Zanin, M. Romance, D. Papo, F. del Pozo, S. Boccaletti, Emergence of network features from multiplexity. Sci. Rep. 3 (2013)
34.
A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E.R. Hruschka Jr., T.M. Mitchell, Toward an architecture for never-ending language learning, in Proceedings of AAAI (2010)
35.
36.
D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, C. Faloutsos, Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur. 10(4), 1–26 (2008)CrossRef
37.
A. Ching, S. Edunov, M. Kabiljo, D. Logothetis, S. Muthukrishnan, One trillion edges: graph processing at facebook-scale. Proc. VLDB Endow. 8(12), 1804–1815 (2015)CrossRef
38.
N.M.K. Chowdhury, R. Boutaba, A survey of network virtualization. Comput. Network. 54(5), 862–876 (2010)CrossRefMATH
39.
A. Clauset, M.E. Newman, C. Moore, Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)CrossRef
40.
G. D’Agostino, A. Scala, Networks of Networks: The Last Frontier of Complexity, vol. 340 (Springer, Heidelberg, 2014)CrossRef
41.
M. De Domenico, A. Solé-Ribalta, E. Cozzo, M. Kivelä, Y. Moreno, M.A. Porter, S. Gómez, A. Arenas, Mathematical formulation of multilayer networks. Phys. Rev. X 3(4), 041022 (2013)
42.
R.A. de Paula, A.P. Appel, C.S. Pinhanez, V.F. Cavalcante, C.S. Andrade, Using social analytics for studying work-networks: a novel, initial approach, in 2012 Brazilian Symposium on Collaborative Systems (SBSC), Oct 2012, pp. 146–153
43.
O. Deshpande, D.S. Lamba, M. Tourn, S. Das, S. Subramaniam, A. Rajaraman, V. Harinarayan, A. Doan, Building, maintaining, and using knowledge bases: a report from the trenches, in Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD’13 (ACM, New York, 2013), pp. 1209–1220
44.
X. Dong, E. Gabrilovich, G. Heitz, W. Horn, N. Lao, K. Murphy, T. Strohmann, S. Sun, W. Zhang, Knowledge vault: a web-scale approach to probabilistic knowledge fusion, in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’14 (ACM, New York, 2014), pp. 601–610
45.
Y. Dong, J. Tang, S. Wu, J. Tian, N.V. Chawla, J. Rao, H. Cao, Link prediction and recommendation across heterogeneous social networks, in Proceedings of the 2012 IEEE 12th International Conference on Data Mining, ICDM’12 (IEEE Computer Society, Washington, DC, 2012), pp. 181–190
46.
D.M. Dunlavy, T.G. Kolda, E. Acar, Temporal link prediction using matrix and tensor factorizations. ACM Trans. Knowl. Discov. Data 5(2), 10:1–10:27 (2011)CrossRef
47.
M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, in ACM SIGCOMM Computer Communication Review, vol. 29 (ACM, 1999), pp. 251–262
48.
49.
50.
S. Fortunato, C. Castellano, Community structure in graphs, in Computational Complexity, ed. by R.A. Meyers (Springer, Heidelberg, 2012), pp. 490–512CrossRef
51.
52.
J. Gao, S.V. Buldyrev, S. Havlin, H.E. Stanley, Robustness of a network of networks. Phys. Rev. Lett. 107(19), 195701 (2011)CrossRef
53.
54.
M. Girvan, M.E. Newman, Community structure in social and biological networks. Proc. National Acad. Sci. 99(12), 7821–7826 (2002)MathSciNetCrossRefMATH
55.
D.F. Gleich, M.W. Mahoney, Mining large graphs, in Handbook of Big Data (2016), p. 191
56.
S. Gomez, A. Diaz-Guilera, J. Gomez-Gardeñes, C.J. Perez-Vicente, Y. Moreno, A. Arenas, Diffusion dynamics on multiplex networks. Phys. Rev. Lett. 110(2), 028701 (2013)CrossRef
57.
J. Gómez-Gardeñes, I. Reinares, A. Arenas, L.M. Floría, Evolution of cooperation in multiplex networks. Sci. Rep. 2 (2012)
58.
J.E. Gonzalez, Y. Low, H. Gu, D. Bickson, C. Guestrin, Powergraph: distributed graph-parallel computation on natural graphs, in Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12) (2012), pp. 17–30
59.
60.
M. Granovetter, The strength of weak ties. Am. J. Sociol. 78(6), 1360–1380 (1973)CrossRef
61.
62.
63.
64.
65.
66.
P. Gupta, A. Goel, J. Lin, A. Sharma, D. Wang, R. Zadeh, Wtf: the who to follow service at twitter, in Proceedings of the 22nd International Conference on World Wide Web Conferences Steering Committee (2013), pp. 505–514
67.
I. Guy, S. Ur, I. Ronen, A. Perer, M. Jacovi, Do you want to know?: recommending strangers in the enterprise, in Proceedings of the ACM 2011 Conference on Computer Supported Cooperative Work, CSCW’11 (ACM, New York, 2011), pp. 285–294
68.
A. Halu, R.J. Mondragón, P. Panzarasa, G. Bianconi, Multiplex pagerank. PloS One 8(10), e78293 (2013)CrossRef
69.
M.A. Hasan, M.J. Zaki, A survey of link prediction in social networks, in Social Network Data Analytics, ed. by C.C. Aggarwal (Springer, Boston, 2011), pp. 243–275CrossRef
70.
71.
P. Holme, C. Edling, F. Liljeros, Structure and time-evolution of an internet dating community. Soc. NetworK. 26, 155 (2004)CrossRef
72.
P. Holme, J. Saramäki, Temporal networks. Phys. Rep. 519(3), 97–125 (2012)CrossRef
73.
74.
75.
76.
77.
M. Jha, C. Seshadhri, A. Pinar, A space efficient streaming algorithm for triangle counting using the birthday paradox, in Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2013), pp. 589–597
78.
U. Kang, C. Faloutsos, Big graph mining: algorithms and discoveries. ACM SIGKDD Explor. Newslett. 14(2), 29–36 (2013)CrossRef
79.
U. Kang, C.E. Tsourakakis, A.P. Appel, C. Faloutsos, J. Leskovec, Hadi: mining radii of large graphs. ACM Trans. Knowl. Discov. Data (TKDD) 5(2), 8 (2011)
80.
81.
D. Kempe, J. Kleinberg, A. Kumar, Connectivity and inference problems for temporal networks, in Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, STOC’00 (ACM, New York, 2000), pp. 504–513
82.
M. Kivelä, A. Arenas, M. Barthelemy, J.P. Gleeson, Y. Moreno, M.A. Porter, Multilayer networks. J. Complex Network. 2(3), 203–271 (2014)CrossRef
83.
X. Kong, J. Zhang, P.S. Yu, Inferring anchor links across multiple heterogeneous social networks, in Proceedings of the 22Nd ACM International Conference on Information & Knowledge Management, CIKM’13 (ACM, New York, 2013), pp. 179–188
84.
J. Kunegis, A. Lommatzsch, C. Bauckhage, The slashdot zoo: mining a social network with negative edges, in Proceedings of the 18th International Conference on World Wide Web, WWW’09 (ACM, New York, 2009, pp. 741–750
85.
M. Kurant, M. Gjoka, C.T. Butts, A. Markopoulou, Walking on a graph with a magnifying glass: stratified sampling via weighted random walks, in Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems (ACM, 2011), pp. 281–292
86.
N. Lao, T. Mitchell, W.W. Cohen, Random walk inference and learning in a large scale knowledge base, in Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing (Association for Computational Linguistics, Edinburgh, 2011), pp. 529–539
87.
C.-H. Lee, X. Xu, D.Y. Eun, Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling, in ACM SIGMETRICS Performance Evaluation Review, vol. 40 (ACM, 2012), pp. 319–330
88.
J. Leskovec, C. Faloutsos, Sampling from large graphs, in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data mining (ACM, 2006), pp. 631–636
89.
J. Leskovec, D. Huttenlocher, J. Kleinberg, Predicting positive and negative links in online social networks, in Proceedings of the 19th International Conference on World Wide Web, WWW’10 (ACM, New York, 2010), pp. 641–650
90.
J. Leskovec, J. Kleinberg, C. Faloutsos, Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1) (2007)
91.
J. Leskovec, L. Backstrom, R. Kumar, A. Tomkins, Microscopic evolution of social networks, in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’08 (ACM, New York, 2008), pp. 462–470
92.
J. Leskovec, K.J. Lang, A. Dasgupta, M.W. Mahoney, Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29–123 (2009)MathSciNetCrossRefMATH
93.
D. Liben-Nowell, J. Kleinberg, The link prediction problem for social networks, in Proceedings of the Twelfth International Conference on Information and Knowledge Management, CIKM’03 (ACM, New York, 2003), pp. 556–559
94.
W. Liu, L. Lü, Link prediction based on local random walk. EPL (Europhysics Letters) 89(5), 58007 (2010)CrossRef
95.
L. Lü, T. Zhou, Role of weak ties in link prediction of complex networks, in Proceedings of the 1st ACM International Workshop on Complex Networks Meet Information & Knowledge Management, CNIKM’09 (ACM, New York, 2009), pp. 55–58
96.
L. Lü, T. Zhou, Link prediction in weighted networks: the role of weak ties. EPL (Europhysics Letters) 89(1), 18001 (2010)CrossRef
97.
L. Lü, T. Zhou, Link prediction in complex networks: a survey. Physica A 390(6), 1150–1170 (2011)CrossRef
98.
G. Malewicz, M.H. Austern, A.J. Bik, J.C. Dehnert, I. Horn, N. Leiser, G. Czajkowski, Pregel: a system for large-scale graph processing, in Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data (ACM, 2010), pp. 135–146
99.
P. Massa, P. Avesani, Controversial users demand local trust metrics: an experimental study on epinions.com community, in Proceedings of the 20th National Conference on Artificial Intelligence - Volume 1, AAAI’05 (AAAI Press, 2005), pp. 121–126
100.
M. McGlohon, L. Akoglu, C. Faloutsos, Weighted graphs and disconnected components: patterns and a generator, in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’08 (ACM, New York, 2008), pp. 524–532
101.
A. McGregor, Graph stream algorithms: a survey. ACM SIGMOD Rec. 43(1), 9–20 (2014)CrossRef
102.
G. Menichetti, D. Remondini, P. Panzarasa, R.J. Mondragón, G. Bianconi, Weighted multiplex networks. CoRR, abs/1312.6720 (2013)
103.
T. Mikolov, I. Sutskever, K. Chen, G.S. Corrado, J. Dean, Distributed representations of words and phrases and their compositionality, in Advances in Neural Information Processing Systems (2013), pp. 3111–3119
104.
S. Milgram, The small world problem. Psychol. Today 2(1), 60–67 (1967)
105.
R.G. Morris, M. Barthelemy, Transport on coupled spatial networks. Phys. Rev. Lett. 109(12), 128703 (2012)CrossRef
106.
P.J. Mucha, M.A. Porter, Communities in multislice voting networks. Chaos 20(4), 041108 (2010)CrossRef
107.
P.J. Mucha, T. Richardson, K. Macon, M.A. Porter, J.-P. Onnela, Community structure in time-dependent, multiscale, and multiplex networks. Science 328(5980), 876–878 (2010)MathSciNetCrossRefMATH
108.
109.
110.
M.E. Newman, Modularity and community structure in networks. Proc. National Acad. Sci. 103(23), 8577–8582 (2006)CrossRef
111.
112.
M.E. Newman, M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)CrossRef
113.
M.K.-P. Ng, X. Li, Y. Ye, Multirank: co-ranking for objects and relations in multi-relational data, in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2011), pp. 1217–1225
114.
F. Niu, C. Zhang, C. Ré, J. Shavlik, Elementary: large-scale knowledge-base construction via machine learning and statistical inference. Int. J. Semant. Web Inf. Syst. 8(3), 42–73 (2012). JulyCrossRef
115.
116.
L. Page, S. Brin, R. Motwani, T. Winograd, The pagerank citation ranking: bringing order to the web (1999)
117.
C.R. Palmer, P.B. Gibbons, C. Faloutsos, Anf: a fast and scalable tool for data mining in massive graphs, in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2002), pp. 81–90
118.
Y. Park, M. Shankar, B.-H. Park, J. Ghosh, Graph databases for large-scale healthcare systems: a framework for efficient data management and data services, in 2014 IEEE 30th International Conference on Data Engineering Workshops (ICDEW) (IEEE, 2014), pp. 12–19
119.
A. Pavan, K. Tangwongsan, S. Tirthapura, K.-L. Wu, Counting and sampling triangles from a graph stream. Proc. VLDB Endow. 6(14), 1870–1881 (2013)CrossRef
120.
121.
B. Perozzi, R. Al-Rfou, S. Skiena, Deepwalk: online learning of social representations, in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2014), pp. 701–710
122.
M.A. Rodriguez, The gremlin graph traversal machine and language (invited talk), in Proceedings of the 15th Symposium on Database Programming Languages (ACM, 2015), pp. 1–10
123.
B. Shao, H. Wang, Y. Li, The trinity graph engine. Microsoft Res., 54 (2012)
124.
B. Shao, H. Wang, Y. Li, Trinity: a distributed graph engine on a memory cloud, in Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data (ACM, 2013), pp. 505–516
125.
126.
D. Song, D.A. Meyer, D. Tao, Efficient latent link recommendation in signed networks, in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’15 (ACM, New York, 2015), pp. 1105–1114
127.
S. Soundarajan, J. Hopcroft, Using community information to improve the precision of link prediction methods, in Proceedings of the 21st International Conference on World Wide Web, WWW’12 Companion (ACM, New York, 2012), pp. 607–608
128.
129.
M. Spiliopoulou, Evolution in social networks: a survey, in Social Network Data Analytics, ed. by C.C. Aggarwal (Springer, Heidelberg, 2011), pp. 149–175CrossRef
130.
N.V. Spirin, J. He, M. Develin, K.G. Karahalios, M. Boucher, People search within an online social network: large scale analysis of facebook graph search query logs, in Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (ACM, 2014), pp. 1009–1018
131.
F.M. Suchanek, G. Kasneci, G. Weikum, Yago: a core of semantic knowledge, in Proceedings of WWW (2007)
132.
X. Sui, T.-H. Lee, J.J. Whang, B. Savas, S. Jain, K. Pingali, I. Dhillon, Parallel clustered low-rank approximation of graphs and its application to link prediction, in Languages and Compilers for Parallel Computing (Springer, 2012), pp. 76–95
133.
Y. Sun, R. Barber, M. Gupta, C.C. Aggarwal, J. Han, Co-author relationship prediction in heterogeneous bibliographic networks, in Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM’11 (IEEE Computer Society, Washington, DC, 2011), pp. 121–128
134.
Y. Sun, J. Han, C.C. Aggarwal, N.V. Chawla, When will it happen?: relationship prediction in heterogeneous information networks, in Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, WSDM’12 (ACM, New York, 2012), pp. 663–672
135.
J. Sun, C.K. Reddy, Big data analytics for healthcare, in Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2013), pp. 1525–1525
136.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, Q. Mei, Line: large-scale information network embedding, in Proceedings of the 24th International Conference on World Wide Web Conferences Steering Committee (2015), pp. 1067–1077
137.
S. Tasci, M. Demirbas, Giraphx: parallel yet serializable large-scale graph processing, in Euro-Par 2013 Parallel Processing, ed. by F. Wolf, B. Mohr, D. an Mey (Springer, Heidelberg, 2013), pp. 458–469CrossRef
138.
T.T. Tchrakian, B. Basu, M. O’Mahony, Real-time traffic flow forecasting using spectral analysis. IEEE Trans. Intell. Transp. Syst. 13(2), 519–526 (2012)CrossRef
139.
Y. Tian, A. Balmin, S.A. Corsten, S. Tatikonda, J. McPherson, From think like a vertex to think like a graph. Proc. VLDB Endow. 7(3), 193–204 (2013)CrossRef
140.
141.
142.
C.E. Tsourakakis, Fast counting of triangles in large real networks without counting: algorithms and laws, in ICDM’08 (IEEE Computer Society, Washington, DC, 2008), pp. 608–617
143.
T. Wang, Y. Chen, Z. Zhang, T. Xu, L. Jin, P. Hui, B. Deng, X. Li, Understanding graph sampling algorithms for social network analysis, in Proceedings of the 2011 31st International Conference on Distributed Computing Systems Workshops, ICDCSW’11) (IEEE Computer Society, Washington, DC, 2011), pp. 123–128
144.
W.Y. Wang, K. Mazaitis, W.W. Cohen, Programming with personalized pagerank: a locally groundable first-order probabilistic logic, in Proceedings of the 22nd ACM International Conference on Information and Knowledge Management (CIKM 2013) (2013, to appear)
145.
D. Wang, D. Pedreschi, C. Song, F. Giannotti, A.-L. Barabasi, Human mobility, social ties, and link prediction, in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’11 (ACM, New York 2011), pp. 1100–1108
146.
D.J. Watts, S.H. Strogatz, Collective dynamics of’small-world’networks. Nature 393(6684), 409–10 (1998)CrossRef
147.
K. Wehmuth, A. Ziviani, E. Fleury, A unifying model for representing time-varying graphs. In 2015 IEEE International Conference on Data Science and Advanced Analytics, DSAA 2015, Campus des Cordeliers, Paris, France, 19–21 October 2015 (2015), pp. 1–10, 2015
148.
P.C. Wong, C. Chen, C. Gorg, B. Shneiderman, J. Stasko, J. Thomas, Graph analyticslessons learned and challenges ahead. IEEE Comput. Graph. Appl. 5, 18–29 (2011)CrossRef
149.
S.H. Yook, H. Jeong, A.L. Barabasi, Weighted evolving networks. Phys. Rev. Lett. 86(25), 5835–5838 (2001)CrossRef
150.
J. Zhang, X. Kong, P.S. Yu, Transferring heterogeneous links across location-based social networks, in Proceedings of the 7th ACM International Conference on Web Search and Data Mining, WSDM’14 (ACM, New York, 2014), pp. 303–312
151.
Y. Zhao, Mining Large Graphs. Ph.D. thesis, University of Illinois at Chicago (2013)
152.
D. Zhou, S.A. Orshanskiy, H. Zha, C.L. Giles, Co-ranking authors and documents in a heterogeneous network, in Seventh IEEE International Conference on Data Mining, 2007. ICDM 2007 (IEEE, 2007), pp. 739–744
153.
R. Zou, L.B. Holder, Frequent subgraph mining on a single large graph using sampling techniques, in Proceedings of the Eighth Workshop on Mining and Learning with Graphs (ACM, 2010), pp. 171–178
Metadata
Title
Link and Graph Mining in the Big Data Era
Authors
Ana Paula Appel
Luis G. Moyano
Copyright Year
2017
Book
Handbook of Big Data Technologies

Print ISBN: 978-3-319-49339-8

Electronic ISBN: 978-3-319-49340-4

Copyright Year: 2017

DOI
https://doi.org/10.1007/978-3-319-49340-4_17

Premium Partner

    Image Credits