research-article

Current and Future Challenges in Mining Large Networks: Report on the Second SDM Workshop on Mining Networks and Graphs

Authors:

Lawrence B. Holder,

Rajmonda Caceres,

David F. Gleich,

Nitesh V. Chawla,

Christine Klymko,

Tina Eliassi-Rad,

Aditya PrakashAuthors Info & Claims

ACM SIGKDD Explorations Newsletter, Volume 18, Issue 1

Pages 39 - 45

https://doi.org/10.1145/2980765.2980770

Published: 01 August 2016 Publication History

Abstract

We report on the Second Workshop on Mining Networks and Graphs held at the 2015 SIAM International Conference on Data Mining. This half-day workshop consisted of a keynote talk, four technical paper presentations, one demonstration, and a panel on future challenges in mining large networks. We summarize the main highlights of the workshop, including expanded written summaries of the future challenges provided by the panelists. The current and future challenges discussed at the workshop and elaborated here provide valuable guidance for future research in the field

References

[1]

Abdelhamid, S.H.E.M. et al. 2014. {CINET} 2.0: {A} CyberInfrastructure for Network Science. 10th {IEEE} International Conference on e-Science, eScience 2014, Sao Paulo, Brazil, October 20-24, 2014 (2014), 324--331.

Digital Library

[2]

Ahmed, R. and Karypis, G. 2015. Mining Coevolving Induced Relational Motifs in Dynamic Networks. Proceedings of the 2nd SDM Workshop on Mining Networks and Graphs: A Big Data Analytic Challenge (2015).

[3]

Ahn, K.J., Guha, S. and McGregor, A. 2012. Graph Sketches: Sparsification, Spanners, and Subgraphs. Proceedings of the 31st Symposium on Principles of Database Systems (New York, NY, USA, 2012), 5--14.

Digital Library

[4]

Bader, J.S., Chaudhuri, A., Rothberg, J.M. and Chant, J. 2004. Gaining confidence in high-throughput protein interaction networks. Nat Biotech. 22, 1 (Jan. 2004), 78--85.

[5]

Bakshy, E., Rosenn, I., Marlow, C. and Adamic, L. 2012. The Role of Social Networks in Information Diffusion. Proceedings of the 21st International Conference on World Wide Web (New York, NY, USA, 2012), 519--528.

Digital Library

[6]

Bilgic, M., Mihalkova, L. and Getoor, L. 2010. Active Learning for Networked Data. Proceedings of the 27th International Conference on Machine Learning (ICML-10) (2010).

[7]

Burkhardt, P. and Waring, C. 2013. An NSA Big Graph experiment. Report NSA-RD-2013-056002v1 (2013).

[8]

Calderoni, F. 2014. Identifying Mafia Bosses from Meeting Attendance. Networks and Network Analysis for Defence and Security. A.J. Masys, ed. Springer International Publishing. 27--48.

[9]

Chakrabarti, D., Zhan, Y. and Faloutsos, C. 2004. RMAT: A Recursive Model for Graph Mining. SIAM International Conference on Data Mining (2004).

[10]

Cheng, Y. and Wang, N. 2015. Graph clustering by recursive membership identification in neighborhood. Proceedings of the 2nd SDM Workshop on Mining Networks and Graphs: A Big Data Analytic Challenge (2015).

[11]

Choudhury, S., Holder, L.B., Chin, G., Agarwal, K. and Feo, J. 2015. A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs. Proceedings of the 18th International Conference on Extending Database Technology (EDBT) (2015), 157--168.

[12]

Dasgupta, A., Kumar, R. and Sarlos, T. 2014. On Estimating the Average Degree. Proceedings of the 23rd International Conference on World Wide Web (New York, NY, USA, 2014), 795--806.

Digital Library

[13]

Fan, W., Wang, X. and Wu, Y. 2014. Querying Big Graphs Within Bounded Resources. Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (New York, NY, USA, 2014), 301--312.

Digital Library

[14]

Goldreich, O., Goldwasser, S. and Ron, D. 1998. Property Testing and Its Connection to Learning and Approximation. J. ACM. 45, 4 (Jul. 1998), 653--750.

Digital Library

[15]

Hasan, S.M.S. et al. 2012. CINET: A Cyberinfrastructure for Network Science. Proceedings of the 2012 IEEE 8th International Conference on E-Science (e-Science) (Washington, DC, USA, 2012), 1--8.

Digital Library

[16]

Herrera-Semenets, V., Acosta-Mendoze, M. and Gago- Alonso, A. 2015. A Framework for Intrusion Detection based on Frequent Subgraph Mining. Proceedings of the 2nd SDM Workshop on Mining Networks and Graphs: A Big Data Analytic Challenge (2015).

[17]

Holstein, D., Goltsev, A. V and Mendes, J.F.F. 2013. Impact of noise and damage on collective dynamics of scale-free neuronal networks. Phys. Rev. E. 87, 3 (Mar. 2013), 32717.

[18]

Huffaker, B., Fomenkov, M. and Claffy, K. 2012. Internet Topology Data Comparison. CAIDA Technical Report (2012).

[19]

Kashtan, N., Itzkovitz, S., Milo, R. and Alon, U. 2004. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics. 20, 11 (2004), 1746--1758.

Digital Library

[20]

Kempe, D., Kleinberg, J. and Tardos, É. 2003. Maximizing the Spread of Influence Through a Social Network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (New York, NY, USA, 2003), 137--146.

Digital Library

[21]

Khan, M., Klymko, C. and Holder, L.B. eds. 2015. Proceedings of the Second Workshop on Mining Networks and Graphs. SIAM International Conference on Data Mining (2015).

[22]

Kim, M. and Leskovec, J. 2012. Multiplicative Attribute Graph Model of Real-World Networks. Internet Math. 8, 1-2 (2012), 113--160.

[23]

Koff, R.S. 1992. Infectious diseases of humans: Dynamics and control. By R.M. Anderson and R.M. May, 757 pp. Oxford: Oxford University Press, 1991. 95.00. Hepatology. 15, 1 (1992), 169.

[24]

Leskovec, J., Kleinberg, J. and Faloutsos, C. 2007. Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data. 1, 1 (Mar. 2007), 1--41.

Digital Library

[25]

Li, X., Wu, M., Kwoh, C.-K. and Ng, S.-K. 2010. Computational approaches for detecting protein complexes from protein interaction networks: a survey. BMC Genomics. 11, Suppl 1 (2010).

[26]

McSherry, F., Isard, M. and Murray, D.G. 2015. Scalability! But at what cost? 15th Workshop on Hot Topics in Operating Systems (HotOS XV) (Kartause Ittingen, Switzerland, May 2015).

Digital Library

[27]

Moreno, S., Kirshner, S., Neville, J. and Vishwanathan, S. 2010. Tied kronecker product graph models to capture variance in network populations. Allerton'10 (2010), 17--61.

[28]

Moreno, S. and Neville, J. 2013. Network Hypothesis Testing Using Mixed Kronecker Product Graph Models. IEEE 13th International Conference on Data Mining (ICDM) (Dec. 2013), 1163--1168.

[29]

Murphy, R.C., Wheeler, K.B., Barrett, B.W. and Ang, J.A. 2010. Introducing the Graph 500. Cray User's Group (May 2010).

[30]

Pfeiffer III, J.J., Neville, J. and Bennett, P.N. 2014. Active Exploration in Networks: Using Probabilistic Relationships for Learning and Inference. Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (New York, NY, USA, 2014), 639--648.

Digital Library

[31]

Prakash, B.A., Chakrabarti, D., Faloutsos, M., Valler, N. and Faloutsos, C. 2011. Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks. Proceedings of the 2011 IEEE 11th International Conference on Data Mining (Washington, DC, USA, 2011), 537--546.

Digital Library

[32]

Ron, D. 2010. Algorithmic and Analysis Techniques in Property Testing. Now Publishers Inc.

Digital Library

[33]

Rubinfield, R. 2006. Sublinear Time Algorithms. Proceedings of the International Conference of Mathematicians (2006).

[34]

Scaling Apache Giraph to a Trillion Edges: 2013. https://www.facebook.com/notes/facebookengineering/scaling-apache-giraph-to-a-trillionedges/10151617006153920.

[35]

Seshadhri, C., Kolda, T.G. and Pinar, A. 2012. Community structure and scale-free collections of Erd?s- Rényi graphs. Phys. Rev. E. 85, 5 (May 2012).

[36]

Seshadhri, C., Pinar, A. and Kolda, T. 2011. An In-Depth Study of Stochastic Kronecker Graphs. Proceedings of IEEE International Conference on Data Mining (2011).

Digital Library

[37]

Subramaniyam, N.P. and Hyttinen, J. 2014. Characterization of dynamical systems under noise using recurrence networks: Application to simulated and {EEG} data. Physics Letters A. 378, 46 (2014), 3464--3474.

[38]

Wang, H., Zheng, D., Burns, R. and Priebe, C. 2015. Active Community Detection in Massive Graphs. Proceedings of the 2nd SDM Workshop on Mining Networks and Graphs: A Big Data Analytic Challenge (2015).

[39]

Web Data Commons - Hyperlink Graphs: http://webdatacommons.org/hyperlinkgraph/.

[40]

Zakrzewska, A. and Bader, D.A. 2013. Measuring the Sensitivity of Graph Metrics to Missing Data. PPAM Workshop on Power and Energy Aspects of Computation (Sep. 2013).

Cited By

Miasnikof PShestopaloff ABonner ALawryshyn YPardalos P(2020)A density-based statistical analysis of graph clustering algorithm performanceJournal of Complex Networks10.1093/comnet/cnaa0128:3Online publication date: 3-Aug-2020
https://doi.org/10.1093/comnet/cnaa012
Morik K(2019)A Note on Artificial Intelligence and StatisticsApplications in Statistical Computing10.1007/978-3-030-25147-5_8(127-138)Online publication date: 12-Oct-2019
https://doi.org/10.1007/978-3-030-25147-5_8
Miasnikof PShestopaloff ABonner ALawryshyn Y(2018)A Statistical Performance Analysis of Graph Clustering AlgorithmsAlgorithms and Models for the Web Graph10.1007/978-3-319-92871-5_11(170-184)Online publication date: 30-May-2018
https://doi.org/10.1007/978-3-319-92871-5_11
Show More Cited By

Recommendations

HeteroNAM: International Workshop on Heterogeneous Networks Analysis and Mining
WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining

The first International Workshop on Heterogeneous Networks Analysis and Mining is held in Los Angeles, California, USA on February 9th, 2018 and is co-located with the 11th ACM International Conference on Web Search and Data Mining. The goal of this ...
Research challenges in future networks: a report from US-Japan workshop on future networks

A US-Japan Workshop on Future Networks was held in Palo Alto, CA on October 31 - November 1, 2008. This workshop brought together leading US and Japanese network researchers and network research infrastructure developers who are interested in future ...
Eighth workshop on mining and learning with graphs

The Eighth Workshop on Mining and Learning with Graphs (MLG)1was held at KDD 2010 in Washington DC. It brought together a variete of researchers interested in analyzing data that is best represented as a graph. Examples include the WWW, social networks, ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGKDD Explorations Newsletter

ACM SIGKDD Explorations Newsletter Volume 18, Issue 1

June 2016

45 pages

ISSN:1931-0145

EISSN:1931-0153

DOI:10.1145/2980765

Editors:
Charu Aggarwal
IBM T.J. Watson
,
Haixun Wang
Google
,
Ankur M. Teredesai
University of Washington Tacoma
,
Hanghang Tong
Arizona State University

Issue’s Table of Contents

Copyright © 2016 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 2016

Published in SIGKDD Volume 18, Issue 1

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Miasnikof PShestopaloff ABonner ALawryshyn YPardalos P(2020)A density-based statistical analysis of graph clustering algorithm performanceJournal of Complex Networks10.1093/comnet/cnaa0128:3Online publication date: 3-Aug-2020
https://doi.org/10.1093/comnet/cnaa012
Morik K(2019)A Note on Artificial Intelligence and StatisticsApplications in Statistical Computing10.1007/978-3-030-25147-5_8(127-138)Online publication date: 12-Oct-2019
https://doi.org/10.1007/978-3-030-25147-5_8
Miasnikof PShestopaloff ABonner ALawryshyn Y(2018)A Statistical Performance Analysis of Graph Clustering AlgorithmsAlgorithms and Models for the Web Graph10.1007/978-3-319-92871-5_11(170-184)Online publication date: 30-May-2018
https://doi.org/10.1007/978-3-319-92871-5_11
Zand MTrayhan MFarooq SFucile CGhoshal GWhite RQuill CRosenberg ABarbosa HBush KChafi HBoudreau T(2017)Properties of healthcare teaming networks as a function of network construction algorithmsPLOS ONE10.1371/journal.pone.017587612:4(e0175876)Online publication date: 20-Apr-2017
https://doi.org/10.1371/journal.pone.0175876

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents