Discovering relevant cross-graph cliques in dynamic networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5722 LNAI, Issue , 2009, Pages 513-522

  Cerf, Loïc ^a   Nguyen, Tran Bao Nhan ^a   Boulicaut, Jean François ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLOSED PATTERN; CONSTRAINT-BASED; DOMAIN KNOWLEDGE; DYNAMIC GRAPH; DYNAMIC NETWORK; GRAPH ADJACENCY MATRICES; PUBLIC BICYCLES; TERNARY RELATIONS;

INTELLIGENT SYSTEMS;

EID: 70349884040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04125-9_54     Document Type: Conference Paper

References (12)

1. Ganter, B., Stumme, G., Wille, R.: Formal Concept Analysis, Foundations and Applications. Springer, Heidelberg (2005)
2. Ji, L., Tan, K.-L., Tung, A.K.H.: Mining frequent closed cubes in 3D data sets. In: VLDB 2006: Proc. of the 32nd Int. Conf. on Very Large Data Bases, pp. 811-822. VLDB Endowment (2006)
3. Jaschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Trias-an algorithm for mining iceberg tri-lattices. In: ICDM 2006: Proc. of the Sixth Int. Conf. on Data Mining, pp. 907-911. IEEE Computer Society, Los Alamitos (2006)
4. Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Data-Peeler: Constraint-based closed pattern mining in n-ary relations. In: SDM 2008: Proc. of the Eighth SIAM Int. Conf. on Data Mining, pp. 37-48. SIAM, Philadelphia (2008)
5. Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Closed patterns meet n-ary relations. ACM Trans. on Knowledge Discovery from Data 3(1) (March 2009)
6. Wang, J., Zeng, Z., Zhou, L.: CLAN: An algorithm for mining closed cliques from large dense graph databases. In: ICDE 2006: Proc. of the 22nd Int. Conf. on Data Engineering, pp. 73-82. IEEE Computer Society, Los Alamitos (2006)
7. Jiang, D., Pei, J.: Mining frequent cross-graph quasi-cliques. ACM Trans. on Knowledge Discovery from Data 2(4) (January 2009)
8. 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)
9. Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In: ECML PKDD 2008: Proc. of the European Conf. on Machine Learning and Knowledge Discovery in Databases - Part II, pp. 33-49. Springer, Heidelberg (2008)
10. Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol.1057, pp. 3-17. Springer, Heidelberg (1996)
11. Casas-Garriga, G.: Discovering unbounded episodes in sequential data. In: Lavra¡c, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.2838, pp. 83-94. Springer, Heidelberg (2003)
12. Ding, B., Lo, D., Han, J., Khoo, S.-C.: effcient mining of closed repetitive gapped subsequences from a sequence database. In: ICDE 2009: Proc. of the 25th Int. Conf. on Data Engineering. IEEE Computer Society, Los Alamitos (2009)