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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Interior operators p are monotonic, idempotent and such that for any X, \(p(X) \le X\).
- 2.
- 3.
References
Atzmueller, M., Doerfel, S., Mitzlaff, F.: Description-oriented community detection using exhaustive subgroup discovery. Inf. Sci. 329, 965–984 (2016)
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)
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)
Batagelj, V., Zaversnik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 5(2), 129–145 (2011)
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)
Galbrun, E., Gionis, A., Tatti, N.: Overlapping community detection in labeled graphs. Data Min. Knowl. Discov. 28(5–6), 1586–1610 (2014)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604–632 (1999)
Lazega, E.: The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership. Oxford University Press, Oxford (2001)
McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415–444 (2001)
Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)
Seidman, S.B.: Network structure and minimum degree. Soc. Networks 5, 269–287 (1983)
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)
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)
Soldano, H., Santini, G., Bouthinon, D., Bary, S., Lazega, E.: Bi-pattern mining of attributed networks. Appl. Network Sci. 4(1), 37 (2019)
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
Spyropoulou, E., Bie, T.D., Boley, M.: Interesting pattern mining in multi-relational data. Data Min. Knowl. Discov. 28(3), 808–849 (2014)
Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: mining itemsets that compress. Data Min. Knowl. Disc. 23(1), 169–214 (2011)
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
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
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
DOI: https://doi.org/10.1007/978-3-030-36683-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36682-7
Online ISBN: 978-3-030-36683-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)