Abstract
Three algorithms — CubeMiner, Trias, and Data-Peeler — have been recently proposed to mine closed patterns in ternary relations, i.e., a generalization of the so-called formal concept extraction from binary relations. In this paper, we consider the specific context where a ternary relation denotes the value of a graph adjacency matrix (i. e., a Vertices × Vertices matrix) at different timestamps. We discuss the constraint-based extraction of patterns in such dynamic graphs. We formalize the concept of δ-contiguous closed 3-clique and we discuss the availability of a complete algorithm for mining them. It is based on a specialization of the enumeration strategy implemented in Data-Peeler. Indeed, the relevant cliques are specified by means of a conjunction of constraints which can be efficiently exploited. The added-value of our strategy for computing constrained clique patterns is assessed on a real dataset about a public bicycle renting system. The raw data encode the relationships between the renting stations during one year. The extracted δ-contiguous closed 3-cliques are shown to be consistent with our knowledge on the considered city.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others

References
Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD’93: Proc. SIGMOD Int. Conf. on Management of Data, pp. 207–216. ACM Press (1993)
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press (1996)
Antonie, M.L., Zaïane, O.R.: Mining positive and negative association rules: An approach for confined rules. In: PKDD’04: Proc. European Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 27–38. Springer (2004)
Besson, J., Robardet, C., Boulicaut, J.F., Rome, S.: Constraint-based formal concept mining and its application to microarray data analysis. Intelligent Data Analysis 9(1), 59–82 (2005)
Boulicaut, J.F., Besson, J.: Actionability and formal concepts: A data mining perspective. In: ICFCA’08: Proc. Int. Conf. on Formal Concept Analysis, pp. 14–31. Springer (2008)
Boulicaut, J.F., De Raedt, L., Mannila, H. (eds.): Constraint-Based Mining and Inductive Databases, LNCS, vol. 3848. Springer (2006)
Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Communications of the ACM 16(9), 575–576 (1973)
Casas-Garriga, G.: Discovering unbounded episodes in sequential data. In: PKDD’03: Proc. European Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 83–94. Springer (2003)
Cerf, L., Besson, J., Boulicaut, J.F.: Extraction de motifs fermés dans des relations n-aires bruitées. In: EGC’09: Proc. Journées Extraction et Gestion de Connaissances, pp. 163–168. Cepadues-Editions (2009)
Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Data-Peeler: Constraint-based closed pattern mining in n-ary relations. In: SDM’08: Proc. SIAM Int. Conf. on Data Mining, pp. 37–48. SIAM (2008)
Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Closed patterns meet n-ary relations. ACM Trans. on Knowledge Discovery from Data 3(1) (2009)
Cerf, L., Mougel, P.N., Boulicaut, J.F.: Agglomerating local patterns hierarchically with ALPHA. In: CIKM’09: Proc. Int. Conf. on Information and Knowledge Management, pp. 1753–1756. ACM Press (2009)
Cerf, L., Nguyen, T.B.N., Boulicaut, J.F.: Discovering relevant cross-graph cliques in dynamic networks. In: ISMIS’09: Proc. Int. Symp. on Methodologies for Intelligent Systems, pp. 513–522. Springer (2009)
Ding, B., Lo, D., Han, J., Khoo, S.C.: Efficient mining of closed repetitive gapped subsequences from a sequence database. In: ICDE’09: Proc. Int. Conf. on Data Engineering. IEEE Computer Society (2009)
Ganter, B., Stumme, G., Wille, R.: Formal Concept Analysis, Foundations and Applications. Springer (2005)
Jaschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Trias–an algorithm for mining iceberg tri-lattices. In: ICDM’06: Proc. Int. Conf. on Data Mining, pp. 907–911. IEEE Computer Society (2006)
Ji, L., Tan, K.L., Tung, A.K.H.: Mining frequent closed cubes in 3D data sets. In: VLDB’06: Proc. Int. Conf. on Very Large Data Bases, pp. 811–822. VLDB Endowment (2006)
Jiang, D., Pei, J.: Mining frequent cross-graph quasi-cliques. ACM Trans. on Knowledge Discovery from Data 2(4) (2009)
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters 27(3), 119–123 (1988)
Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Trans. on Knowledge Discovery from Data 1(1) (2007)
Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In: ECML PKDD’08: Proc. European Conf. on Machine Learning and Knowledge Discovery in Databases - Part II, pp. 33–49. Springer (2008)
Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In: KDD, pp. 189–194 (1996)
Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: SIGMOD’00: Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21–30. ACM Press (2000)
Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: EDBT’96: Proc. Int. Conf. on Extending Database Technology, pp. 3–17. Springer (1996)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC. Data & Knowledge Engineering 42(2), 189–222 (2002)
Uno, T., Kiyomi, M., Arimura, H.: LCM ver.3: Collaboration of array, bitmap and prefix tree for frequent itemset mining. In: OSDM’05: Proc. Int.Workshop on Open Source Data Mining, pp. 77–86. ACM Press (2005)
Wang, J., Zeng, Z., Zhou, L.: CLAN: An algorithm for mining closed cliques from large dense graph databases. In: ICDE’06: Proc. Int. Conf. on Data Engineering, pp. 73–82. IEEE Computer Society (2006)
Zaki, M.J., Hsiao, C.J.: CHARM: An efficient algorithm for closed itemset mining. In: SDM’02: Proc. SIAM Int. Conf. on Data Mining. SIAM (2002)
Zeng, Z., Wang, J., Zhou, L., Karypis, G.: Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Trans. on Database Systems 32(2), 13–42 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Cerf, L., Nguyen, B., Boulicaut, JF. (2010). Mining Constrained Cross-Graph Cliques in Dynamic Networks. In: Džeroski, S., Goethals, B., Panov, P. (eds) Inductive Databases and Constraint-Based Data Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7738-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7738-0_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7737-3
Online ISBN: 978-1-4419-7738-0
eBook Packages: Computer ScienceComputer Science (R0)