Skip to main content

Clustering of Links and Clustering of Nodes: Fusion of Knowledge in Social Networks

  • Chapter
  • First Online:

Part of the book series: Studies in Computational Intelligence ((SCI,volume 665))

Abstract

The extraction of knowledge from social networks is an area that has experienced significant growth in recent years. Indeed, thanks to the improvement of storage and calculation capacities, and the heterogeneity of data that can currently be extracted, much effort has been made to go beyond traditional knowledge, by proposing new kinds of patterns that take into account the context. However, while many works were interested in designing new patterns of knowledge or in optimizing existing approaches, few studies have been focused in merging patterns and on the useful knowledge emerging from such fusions. In this work, we focus on two network clustering approaches, able to extract two distinct kinds of patterns, and we seek to understand both the intersections that can exist between them and the knowledge that emerges from their fusion. The first is the classical nodes clustering approach that consists in searching for communities into a network. The second is the search for frequent conceptual links, a new link clustering approach that aims identifying frequent links between groups of nodes sharing common attributes. We propose a set of original measures that aim to evaluate the amount of shared information between these patterns when they are extracted from a same network. These measures are applied to three datasets and demonstrate the interest in simultaneously considering several sources of knowledge.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.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

Learn about institutional subscriptions

References

  • Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases (pp. 487–499).

    Google Scholar 

  • Barrett, C. L., Bisset, K. R., Eubank, S. G., Feng, X., & Marathe, M. V. (2008). Episimdemics: An efficient algorithm for simulating the spread of infectious disease over large realistic social networks. In Proceedings of the 2008 ACM/IEEE Conference on Supercomputing.

    Google Scholar 

  • Blondel, V., Guillaume, J. L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008, P10008.

    Article  Google Scholar 

  • Croft, D. P., James, R., & Krause, J. (2008). Exploring animals social networks. Princeton: Princeton University Press.

    Google Scholar 

  • El Gamal, A. & Kim, Y.-H. (2011). Network information theory. Cambridge: Cambridge University Press.

    Google Scholar 

  • Fortunato, S. (2009). Community detection in graphs. Physics Reports, 486, 75–174.

    Article  MathSciNet  Google Scholar 

  • Ganter, B., Stumme, G., & Wille, R. (2005). Formal concept analysis, foundations and applications. Lecture Notes in computer science (Vol. 3626).

    Google Scholar 

  • Getoor, L., & Diehl, C. P. (2005). Link mining: A survey. Physics Reports, 7, 3–12.

    Google Scholar 

  • Kumpula, J. M., Saramäki, J., Kaski, K., & Kertész, J. (2007). Limited resolution in complex network community detection with potts model approach. Physics Reports, 56(1), 41–45.

    Google Scholar 

  • Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008). Benchmark graphs for testing community detection algorithms. Physical Review E, 78, 046110.

    Article  Google Scholar 

  • Lehmann, S., & Hansen, L. K. (2007). Deterministic modularity optimization. Physical Review E, 60(1), 83–88.

    MathSciNet  Google Scholar 

  • Leskovec, J., Adamic, L. A., & Huberman, B. A. (2007). The dynamics of viral marketing. ACM Transactions on the Web, 1.

    Google Scholar 

  • Mangiameli, P., Chen, S. K., & West, D. (1996). A comparison of som neural network and hierarchical clustering methods. European Journal of Operational Research, 93(2), 402–417.

    Article  MATH  Google Scholar 

  • Manyika, J., et al. (2011). Big data: The next frontier for innovation, competition, and productivity.

    Google Scholar 

  • Newman, M. E. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23), 8577–8582.

    Article  Google Scholar 

  • Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004). Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America, 101(9), 2658–2663.

    Article  Google Scholar 

  • Riadh, T., Le Grand, B., Aufaure, M., & Soto, M. (2009). Conceptual and statistical footprints for social networks’ characterization. In Proceedings of the 3rd Workshop on Social Network Mining and Analysis (p. 8). ACM.

    Google Scholar 

  • Scott, J. (2011). Social network analysis: Developments, advances, and prospects. Proceedings of the National Academy of Sciences of the United States of America, 1(1), 21–26.

    Google Scholar 

  • Stattner, E. (2014). Link formation in a telecommunication network. In 2014 IEEE Eighth International Conference on Research Challenges in Information Science (RCIS) (pp. 1–9). IEEE.

    Google Scholar 

  • Stattner, E. & Collard, M. (2012a). Frequent links: An approach that combines attributes and structure for extracting frequent patterns in social networks. In 16th East-European Conference on Advances in Databases and Information Systems.

    Google Scholar 

  • Stattner, E. and Collard, M. (2012b). Social-based conceptual links: Conceptual analysis applied to social networks. In International Conference on Advances in Social Networks Analysis and Mining.

    Google Scholar 

  • Stattner, E. and Collard, M. (2013). Towards a hybrid algorithm for extracting maximal frequent conceptual links in social networks. In IEEE International Conference on Research Challenges in Information Science (pp. 1–8).

    Google Scholar 

  • Steinhaeuser, K., & Chawla, N. V. (2010). Identifying and evaluating community structure in complex networks. Pattern Recognition Letters, 31, 413–421.

    Article  Google Scholar 

  • Yang, J., McAuley, J., & Leskovec, J. (2013). Community detection in networks with node attributes. In 2013 IEEE 13th International Conference on Data Mining (ICDM) (pp. 1151–1156). IEEE.

    Google Scholar 

  • Yoon, S.-H., Song, S.-S., and Kim, S.-W. (2011). Efficient link-based clustering in a large scaled blog network. In Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011 (pp. 71:1–71:5). New York: ACM.

    Google Scholar 

  • Zhou, Y., Cheng, H., & Yu, J. (2009). Graph clustering based on structural/attribute similarities. Pattern Recognition Letters, 2(1), 718–729.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Erick Stattner .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Stattner, E., Collard, M. (2017). Clustering of Links and Clustering of Nodes: Fusion of Knowledge in Social Networks. In: Guillet, F., Pinaud, B., Venturini, G. (eds) Advances in Knowledge Discovery and Management. Studies in Computational Intelligence, vol 665. Springer, Cham. https://doi.org/10.1007/978-3-319-45763-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45763-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45762-8

  • Online ISBN: 978-3-319-45763-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics