Integrating constraint programming and itemset mining

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

Volumn 6322 LNAI, Issue PART 2, 2010, Pages 467-482

  Nijssen, Siegfried ^a   Guns, Tias ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING; GRAPH MINING; INTEGRATING CONSTRAINTS; ITEM SETS; ITEMSET MINING; LITTLE RESEARCH; PATTERN MINING; REDUNDANT REPRESENTATION; VERY LARGE DATABASE;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING SYSTEMS; MINING MACHINERY; SCALABILITY;

DATABASE SYSTEMS;

EID: 78049393926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15883-4_30     Document Type: Conference Paper

References (16)

1. 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 Press, Menlo Park (1996)
2. Arimura, H., Uno, T.: Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems. In: SDM, pp. 1087-1098. SIAM, Philadelphia (2009)
3. Boley, M., Horváth, T., Poigné, A., Wrobel, S.: Efficient closed pattern mining in strongly accessible set systems. In: Kok, J. N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 382-389. Springer, Heidelberg (2007)
4. Bonchi, F., Giannotti, F., Lucchese, C., Orlando, S., Perego, R., Trasarti, R.: A constraint-based querying system for exploratory pattern discovery. Inf. Syst. 34(1), 3-27 (2009)
5. Borgelt, C.: Efficient implementations of Apriori and Eclat. In: Workshop of Frequent Item Set Mining Implementations, FIMI (2003)
6. Bucila, C., Gehrke, J., Kifer, D., White, W. M.: Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Min. Knowl. Discov. 7(3), 241-272 (2003)
7. Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: MAFIA: A maximal frequent itemset algorithm. IEEE TKDE 17(11), 1490-1504 (2005)
8. De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: KDD, pp. 204-212 (2008)
9. Goethals, B., Zaki, M. J.: Advances in frequent itemset mining implementations: report on FIMI 2003. In: SIGKDD Explorations, volume 6, pp. 109-117 (2004)
10. Han, J., Lakshmanan, L. V. S., Ng, R. T.: Constraint-based multidimensional data mining. IEEE Computer 32(8), 46-50 (1999)
11. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1-12 (2000)
12. Nijssen, S., Guns, T., De Raedt, L.: Correlated itemset mining in ROC space: a constraint programming approach. In: KDD, pp. 647-656 (2009)
13. Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., Amsterdam (2006)
14. Schulte, C., Stuckey, P. J.: Efficient constraint propagation engines. Transactions on Programming Languages and Systems 31 (1) (2008)
15. Uno, T., Kiyomi, M., Arimura, H.: LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In: OSDM 2005: Proceedings of the 1st International Workshop on Open Source Data Mining, pp. 77-86 (2005)
16. Zaki, M. J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD, pp. 283-286 (1997)