Skip to main content
SpringerLink
Log in
Book cover

International Conference on Complex Networks and Their Applications

COMPLEX NETWORKS 2019: Complex Networks and Their Applications VIII pp 228–241Cite as

Attributed Graph Pattern Set Selection Under a Distance Constraint

  • Conference paper
  • First Online:

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

Abstract

Pattern mining exhaustively enumerates patterns that occur in some structured dataset and each satisfy some constraints. To avoid redundancy and reduce the set of patterns resulting from the enumeration, it is necessary to go beyond the individual selection of patterns and select a pattern subset which, as a whole, contains relevant and non redundant information. This is particularly useful when enumerating bi-patterns, which represent pairs of attribute patterns describing for instance subnetworks in two-mode attributed networks. We present and experiment a general greedy algorithm performing pattern set selection on attributed graphs.

This is a preview of subscription content, 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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.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

Notes

  1. 1.

    Interior operators p are monotonic, idempotent and such that for any X, \(p(X) \le X\).

  2. 2.

    https://www.stats.ox.ac.uk/~snijders/siena/Lazega_lawyers_data.htm.

  3. 3.

    https://lipn.univ-paris13.fr/MinerLC/.

References

  1. Atzmueller, M., Doerfel, S., Mitzlaff, F.: Description-oriented community detection using exhaustive subgroup discovery. Inf. Sci. 329, 965–984 (2016)

    Article  Google Scholar 

  2. Atzmueller, M., Soldano, H., Santini, G., Bouthinon, D.: MinerLSD: efficient local pattern mining on attributed graphs. In: Proceedings of the 2018 IEEE International Conference on Data Mining Workshops (ICDMW). IEEE Press (2018)

    Google Scholar 

  3. Baroni, A., Conte, A., Patrignani, M., Ruggieri, S.: Efficiently clustering very large attributed graphs. In: Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pp. 369–376. ASONAM 2017. ACM, New York (2017)

    Google Scholar 

  4. Batagelj, V., Zaversnik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 5(2), 129–145 (2011)

    Article  MathSciNet  Google Scholar 

  5. Brandstädt, A.: On robust algorithms for the maximum weight stable set problem. In: Freivalds, R. (ed.) Fundamentals of Computation Theory, pp. 445–458. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Galbrun, E., Gionis, A., Tatti, N.: Overlapping community detection in labeled graphs. Data Min. Knowl. Discov. 28(5–6), 1586–1610 (2014)

    Article  MathSciNet  Google Scholar 

  7. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604–632 (1999)

    Article  MathSciNet  Google Scholar 

  8. Lazega, E.: The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership. Oxford University Press, Oxford (2001)

    Book  Google Scholar 

  9. McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415–444 (2001)

    Article  Google Scholar 

  10. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)

    Article  Google Scholar 

  11. Seidman, S.B.: Network structure and minimum degree. Soc. Networks 5, 269–287 (1983)

    Article  MathSciNet  Google Scholar 

  12. Silva, A., Meira Jr., W., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. Proc. VLDB Endow. 5(5), 466–477 (2012)

    Article  Google Scholar 

  13. Soldano, H., Santini, G.: Graph abstraction for closed pattern mining in attributed networks. In: Schaub, T., Friedrich, G., O’Sullivan, B. (eds.) European Conference in Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 849–854. IOS Press (2014)

    Google Scholar 

  14. Soldano, H., Santini, G., Bouthinon, D., Bary, S., Lazega, E.: Bi-pattern mining of attributed networks. Appl. Network Sci. 4(1), 37 (2019)

    Article  Google Scholar 

  15. Soldano, H., Santini, G., Bouthinon, D., Lazega, E.: Hub-authority cores and attributed directed network mining. In: International Conference on Tools with Artificial Intelligence (ICTAI), pp. 1120–1127. IEEE Computer Society, Boston, 7-9 November 2017

    Google Scholar 

  16. Spyropoulou, E., Bie, T.D., Boley, M.: Interesting pattern mining in multi-relational data. Data Min. Knowl. Discov. 28(3), 808–849 (2014)

    Article  MathSciNet  Google Scholar 

  17. Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: mining itemsets that compress. Data Min. Knowl. Disc. 23(1), 169–214 (2011)

    Article  MathSciNet  Google Scholar 

  18. Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: 2013 IEEE 13th International Conference on Data Mining, pp. 1151–1156, December 2013

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nukkai Lab, Paris, France

    Henry Soldano

  2. LIPN, Université Paris-Nord UMR-CNRS, 7030, Paris, France

    Henry Soldano, Guillaume Santini & Dominique Bouthinon

Authors
  1. Henry Soldano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guillaume Santini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dominique Bouthinon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Henry Soldano .

Editor information

Editors and Affiliations

  1. University of Burgundy, Dijon Cedex, France

    Hocine Cherifi

  2. Università degli Studi di Milano, Milan, Italy

    Sabrina Gaito

  3. University of Aveiro, Aveiro, Portugal

    José Fernendo Mendes

  4. Universidad Carlos III de Madrid, Leganés, Madrid, Spain

    Esteban Moro

  5. Indiana University, Bloomington, IN, USA

    Luis Mateus Rocha

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Soldano, H., Santini, G., Bouthinon, D. (2020). Attributed Graph Pattern Set Selection Under a Distance Constraint. In: Cherifi, H., Gaito, S., Mendes, J., Moro, E., Rocha, L. (eds) Complex Networks and Their Applications VIII. COMPLEX NETWORKS 2019. Studies in Computational Intelligence, vol 882. Springer, Cham. https://doi.org/10.1007/978-3-030-36683-4_19

Download citation

Publish with us

Policies and ethics

Search

Navigation