DATA-PEELER: Constraint-based closed pattern mining in n-ary relations

Society for Industrial and Applied Mathematics - 8th SIAM International Conference on Data Mining 2008, Proceedings in Applied Mathematics 130

Volumn 1, Issue , 2008, Pages 37-48

  Cerf, Loïc ^a   Besson, Jérémy ^a   Robardet, Céline ^a   Boulicaut, Jean François ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY RELATION; CONSTRAINT-BASED; CONSTRAINT-BASED MINING; FREQUENT CLOSED SETS; ORDERS OF MAGNITUDE; PATTERN DISCOVERY; STATE-OF-THE-ART ALGORITHMS; TERNARY RELATIONS;

DATA MINING;

EID: 52649098497     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972788.4     Document Type: Conference Paper

References (20)

1. F. Afrati, G. Das, A. Gionis, H. Mannila, T. Mielikainen and P. Tsaparas, Mining Chains of Relations, IEEE ICDM'05, pp. 553-556.
2. R. Agrawal, T. Imielinski and A. Swami, Mining Association Rules between Sets of Items in Large Databases, ACM SIGMOD'93, pp. 207-216.
3. R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, VLDB'94), Morgan Kaufmann, pp. 487-499 (Introduction to the QUEST data generator).
4. J. Besson, C. Robardet, J-F. Boulicaut and S. Rome. Constraint-Eased Formal Concept Mining and its Application to Microarray Data Analysis. Intelligent Data Analysis 9(1), IOS Press (2005), pp. 59-82
5. S. Blachon, R. G. Pensa, J. Besson, C. Robardet, J.F.Boulicaut and O. Gandrillon. Clustering Formal Concepts to Discover Biologically Relevant Knowledge from Gene Expression Data, In Silico Biology 7(0033) (2007).
6. R. K. Brayton, C. T. McMullen, G. D. Hachtel and A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers (1984).
7. A. Gely, A Generic Algorithm for Generating Closed Sets of a Binary Relation, IFCA'05, Springer LNCS 3403, pp. 223-234.
8. G.C. Garriga, R. Khardon and Luc De Raedt, On Mining Closed Sets in Multi-Relational Data, IJCAI'07, pp. 804-809.
9. B. Goethals and M. Zaki. Advances in Frequent Itemset Mining Implementations: Report on FIMI'03, SIGKDD'04 Explorations 6(1), pp. 109-117.
10. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation, ACM SIGMOD'00, pp. 1-12.
11. R. Jaschke, A. Hotho, C. Schmitz, B. Ganter and G. Stumme, TRIAS: An Algorithm for Mining Iceberg Tri-Lattices, IEEE ICDM'06, pp. 907-911.
12. L. Ji, K-L. Tan and A. K. H. Tung, Mining Frequent Closed Cubes in 3D Data Sets, VLDB'06, Morgan Kaufmann, pp. 811-822.
13. M. Karnaugh, The Map Method for Synthesis of Combinational Logic Circuits, Transactions of American Institute of Electrical Engineers part I (November 1953), pp. 593-599.
14. D. Jiang, J. Pei, M. Ramanathan, C. Tang and A. Zhang, Mining Coherent Gene Clusters from Gene-Sample-Time Microarray Data, ACM SIGKDD'04, pp. 430-439.
15. E. L. McCluskey, Minimization of Boolean Functions, Bell System Technical Journal (April 1959), pp. 149-175.
16. J. Sun, D. Tao and C. Faloutsos, Beyond Streams and Graphs: Dynamic Tensor Analysis, ACM SIGKDD'06, pp. 374-383.
17. T. Uno, M. Kiyomi and H. Arimura, LCM ver.3: Collaboration of Array, Bitmap and Prefix Tree for Frequent Itemset Mining, ACM OSDM'05, pp. 77-86.
18. J. Wang, J. Han and J. Pei, CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets, ACM SIGKDD'03, pp. 236-245.
19. M. J. Zaki and C-J. Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, SIAM SDM'02.
20. L. Zhao and M. J. Zaki, TriCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data, ACM SIGMOD'05, pp. 694-705.