Closed patterns meet n-ary relations

ACM Transactions on Knowledge Discovery from Data

Volumn 3, Issue 1, 2009, Pages

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

^a UNIVERSITÉ DE LYON   (France)

^b Inst of Mathematics and Informatics   (Lithuania)

^c CNRS   (France)

^d VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Closed patterns; Constraint properties; Constraint based mining; N ary relations; Tiling

Indexed keywords

CLOSED PATTERNS; CONSTRAINT PROPERTIES; CONSTRAINT-BASED MINING; N-ARY RELATIONS; TILING;

MINING;

SET THEORY;

EID: 67149121799     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1497577.1497580     Document Type: Article

References (32)

1. AFRATI, F., DAS, G., GIONIS, A., MANNILA, H., MIELIKAINEN, T., AND TSAPARAS, P. 2005. Mining chains of relations. In Proceedings of the 5th IEEE International Conference on Data Mining (ICDM'05). IEEE Computer Society, 553-556. (Pubitemid 47385738)
2. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. N. 1993. Mining association rules between sets of items in large databases. In Proceedings of the ACMSIGMOD International Conference on Management of Data (SIGMOD'93). ACM Press, 207-216.
3. AGRAWAL, R. AND SRIKANT, R. 1994. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94). Morgan Kaufmann, 487-499. Introduction to the Quest data generator.
4. BESSON, J., ROBARDET, C., BOULICAUT, J.-F., AND ROME, S. 2005. Constraint-based formal concept mining and its application to microarray data analysis. Intell. Data Anal. 9, 1, 59-82.
5. BOULICAUT, J.-F. AND JEUDY, B. 2005. Constraint-Based data mining. In The Data Mining and Knowledge Discovery Handbook, O. Maimon and L. Rokach, Eds. Springer, 399-416.
6. BRAYTON, R. K., SANGIOVANNI-VINCENTELLI, A. L., MCMULLEN, C. T., AND HACHTEL, G. D. 1984. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic, Norwell, MA.
7. CERF, L., BESSON, J., ROBARDET, C., AND BOULICAUT, J.-F. 2008. DATA-PEELER: Constraint-Based closed pattern mining in n-ary relations. In Proceedings of the 8th SIAM International Conference on Data Mining (SDM'08). SIAM.
8. MCCLUSKEY, J. 1956. Minimization of Boolean functions. Bell Syst. Tech. J. 35, 5, 1417-1444.
9. GAO, M., JIANG, J.-H., JIANG, Y., LI, Y., SINHA, S., AND BRAYTON, R. 2000. MVSIS. In Notes of the IEEE International Workshop on Logic Synthesis. IEEE Computer Society.
10. GARRIGA, G. C., KHARDON, R., AND RAEDT, L. D. 2007. On mining closed sets in multi-relational data. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07). AAAI Press, 804-809.
11. GÉLY, A. 2005. A generic algorithm for generating closed sets of a binary relation. In Proceedings of the 3rd International Conference on Formal Concept Analysis (ICFCA'05). Lecture Notes in Computer Science, Vol, 3403, Springer, 223-234. (Pubitemid 41451234)
12. GOETHALS, B. AND ZAKI, M. J. 2004. Advances in frequent itemset mining implementations: Report on FIMI'03. ACM SIGKDD Explor. Newslett. 6, 1, 109-117.
13. GRAHNE, G. AND ZHU, J. 2005. Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans. Knowl. Data Eng. 17, 10, 1347-1362.
14. HAN, J., PEI, J., AND YIN, Y. 2000. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'00). ACM Press, 1-12.
15. JASCHKE, R., HOTHO, A., SCHMITZ, C., GANTER, B., AND STUMME, G. 2006. TRIAS-An algorithm for mining iceberg tri-lattices. In Proceedings of the 6th IEEE International Conference on Data Mining (ICDM'06). IEEE Computer Society, 907-911.
16. JI, L., TAN, K.-L., AND TUNG, A. K. H. 2006. Mining frequent closed cubes in 3D data sets. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB'06). VLDB Endowment, 811-822.
17. JIANG, D., PEI, J., RAMANATHAN, M., TANG, C., AND ZHANG, A. 2004. Mining coherent gene clusters from gene-sample-time microarray data. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'04). ACM Press, 430-439. (Pubitemid 40114953)
18. KARNAUGH, M. 1953. The map method for synthesis of combinational logic circuits. Trans. Amer. Institute Electric. Eng. Part I 72, 9, 593-599.
19. NG, R. T., LAKSHMANAN, L. V. S., HAN, J., AND PANG, A. 1998. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'98). ACM Press, 13-24. (Pubitemid 128655953)
20. PAN, F., CONG, G., TUNG, A. K., YANG, J., AND ZAKI, M. J. 2003. CARPENTER: Finding closed patterns in long biological datasets. In Proceedings of the ACM SIGKDD'03. ACM Press, 637-642.
21. PASQUIER, N., BASTIDE, Y., TAOUIL, R., AND LAKHAL, L. 1999. Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24, 1 (Jan.), 25-46.
22. PEI, J., HAN, J., AND LAKSHMANAN, L. V. S. 2001. Mining frequent item sets with convertible constraints. In Proceedings of the 17th International Conference on Data Engineering (ICDE'01). ACM Press, 433-442. (Pubitemid 32457145)
23. PEI, J., HAN, J., AND MAO, R. 2000. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Workshop on Research Issues in Data Mining and Knowledge Discovery (SIGMOD'00). ACM Press, 21-30.
24. PENSA, R. G. AND BOULICAUT, J.-F. 2005. Boolean property encoding for local set pattern discovery: An application to gene expression data analysis. In Local Pattern Detection. Vol. 3539. Springer, 115-134.
25. RUDELL, R. AND SANGIOVANNI-VINCENTELLI, A. 1985. Espresso-MV: Algorithms for multiple valued logic minimization. In Proceedings of the IEEE Custom International Circuit Conference. IEEE Computer Society, 230-234. (Pubitemid 16496080)
26. STUMME, G., TAOUIL, R., BASTIDE, Y., PASQUIER, N., AND LAKHAL, L. 2002. Computing iceberg concept lattices with titanic. Data Knowl. Eng. 42, 189-222. (Pubitemid 34545019)
27. SUN, J., TAO, D., AND FALOUTSOS, C. 2006. Beyond streams and graphs: Dynamic tensor analysis. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06). ACM Press, 374-383. (Pubitemid 44535534)
28. UNO, T., KIYOMI, M., AND ARIMURA, H. 2005. LCM ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining. In Proceedings of the 1st ACM International Workshop on Open Source Data Mining (OSDM'05). ACM Press, 77-86.
29. WANG, J., HAN, J., AND PEI, J. 2003. CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'03). ACM Press, 236-245.
30. WILLE, R. 1982. Restructuring lattice theory: An approach based on hierarchies of concepts. In Ordered Sets, I. Rival, Ed. Reidel, 445-470.
31. ZAKI, M. J. AND HSIAO, C. J. 2002. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the 2nd SIAM International Conference on Data Mining (SDM'02). SIAM.
32. ZHAO, L. AND ZAKI, M. J. 2005. TRICLUSTER: An effective algorithm for mining coherent clusters in 3D microarray data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'05). ACM Press, 694-705. (Pubitemid 43038968)