메뉴 건너뛰기




Volumn 175, Issue 12-13, 2011, Pages 1951-1983

Itemset mining: A constraint programming perspective

Author keywords

Constraint programming; Data mining; Itemset mining

Indexed keywords

ALGORITHMIC ISSUES; APPLICATION DOMAINS; CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMMING MODEL; CONSTRAINT PROGRAMMING SYSTEMS; CONSTRAINT-BASED; CONSTRAINT-BASED MINING; DATA MINING PROBLEMS; DATA MINING SYSTEM; FREQUENT ITEMSETS; HIGH-LEVEL MODELING; ITEM SETS; ITEMSET MINING; PERFORMANCE IMPROVEMENTS; RESEARCH QUESTIONS; SCALABLE IMPLEMENTATION; SEARCH ALGORITHMS; SPECIFIC TASKS; STATE-OF-THE-ART METHODS;

EID: 79959795007     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2011.05.002     Document Type: Article
Times cited : (157)

References (56)
  • 6
    • 33947492904 scopus 로고    scopus 로고
    • Global constraint catalogue: Past, present and future
    • DOI 10.1007/s10601-006-9010-8, Special Issue on Global Constraints
    • Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey, and Thierry Petit Global constraint catalogue: past, present and future Constraints 12 March 2007 21 62 (Pubitemid 46473889)
    • (2007) Constraints , vol.12 , Issue.1 , pp. 21-62
    • Beldiceanu, N.1    Carlsson, M.2    Demassey, S.3    Petit, T.4
  • 7
    • 70350406493 scopus 로고    scopus 로고
    • Minimising decision tree size as combinatorial optimisation
    • Lecture Notes in Computer Science Springer
    • Christian Bessiere, Emmanuel Hebrard, and Barry OSullivan Minimising decision tree size as combinatorial optimisation Principles and Practice of Constraint Programming Lecture Notes in Computer Science vol. 5732 2009 Springer 173 187
    • (2009) Principles and Practice of Constraint Programming , vol.5732 , pp. 173-187
    • Bessiere, C.1    Hebrard, E.2    Osullivan, B.3
  • 8
    • 7444236656 scopus 로고    scopus 로고
    • FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
    • Advances in Knowledge Discovery and Data Mining
    • Francesco Bonchi, and Bart Goethals FP-bonsai: the art of growing and pruning small fp-trees Advances in Knowledge Discovery and Data Mining Lecture Notes in Computer Science vol. 3056 2004 Springer 155 160 (Pubitemid 38824894)
    • (2004) Lecture Notes in Computer Science , Issue.3056 , pp. 155-160
    • Bonchi, F.1    Goethals, B.2
  • 9
    • 33846237753 scopus 로고    scopus 로고
    • Extending the state-of-the-art of constraint-based pattern discovery
    • DOI 10.1016/j.datak.2006.02.006, PII S0169023X06000383, Web data and schema management
    • Francesco Bonchi, and Claudio Lucchese Extending the state-of-the-art of constraint-based pattern discovery Data and Knowledge Engineering 60 2 2007 377 399 (Pubitemid 46096638)
    • (2007) Data and Knowledge Engineering , vol.60 , Issue.2 , pp. 377-399
    • Bonchi, F.1    Lucchese, C.2
  • 10
    • 0033338820 scopus 로고    scopus 로고
    • Constraint satisfaction problems: Algorithms and applications
    • DOI 10.1016/S0377-2217(98)00364-6
    • Sally C. Brailsford, Chris N. Potts, and Barbara M. Smith Constraint satisfaction problems: algorithms and applications European Journal of Operational Research 119 3 1999 557 581 (Pubitemid 30509793)
    • (1999) European Journal of Operational Research , vol.119 , Issue.3 , pp. 557-581
    • Brailsford, S.C.1    Potts, C.N.2    Smith, B.M.3
  • 11
    • 0037865635 scopus 로고    scopus 로고
    • DualMiner: A dual-pruning algorithm for itemsets with constraints
    • Cristian Bucila, Johannes Gehrke, Daniel Kifer, and Walker M. White DualMiner: a dual-pruning algorithm for itemsets with constraints Data Mining and Knowledge Discovery 7 3 2003 241 272
    • (2003) Data Mining and Knowledge Discovery , vol.7 , Issue.3 , pp. 241-272
    • Bucila, C.1    Gehrke, J.2    Kifer, D.3    White, W.M.4
  • 13
    • 34548741255 scopus 로고    scopus 로고
    • Discriminative frequent pattern analysis for effective classification
    • DOI 10.1109/ICDE.2007.367917, 4221720, 23rd International Conference on Data Engineering, ICDE 2007
    • Hong Cheng, Yan Xifeng, Jiawei Han, and Chih-Wei Hsu Discriminative frequent pattern analysis for effective classification Proceedings of the 23rd International Conference on Data Engineering 2007 IEEE 716 725 (Pubitemid 47422075)
    • (2007) Proceedings - International Conference on Data Engineering , pp. 716-725
    • Cheng, H.1    Yan, X.2    Han, J.3    Hsu, C.-W.4
  • 23
    • 14844361816 scopus 로고    scopus 로고
    • ROC n' rule learning - Towards a better understanding of covering algorithms
    • DOI 10.1007/s10994-005-5011-x
    • Johannes Fürnkranz, and Peter A. Flach ROC 'n' rule learning - towards a better understanding of covering algorithms Machine Learning 58 1 2005 39 77 (Pubitemid 40356739)
    • (2005) Machine Learning , vol.58 , Issue.1 , pp. 39-77
    • Furnkranz, J.1    Flach, P.A.2
  • 25
    • 79960558640 scopus 로고    scopus 로고
    • Gecode Team
    • Gecode Team http://www.gecode.org
  • 27
    • 27544478009 scopus 로고    scopus 로고
    • Advances in frequent itemset mining implementations: Report on FIMI03
    • Bart Goethals, Mohammed J. Zaki, Advances in frequent itemset mining implementations: report on FIMI03, in: SIGKDD Explorations Newsletter, vol. 6, 2004, pp. 109-117.
    • (2004) SIGKDD Explorations Newsletter , vol.6 , pp. 109-117
    • Goethals, B.1    Zaki, M.J.2
  • 28
    • 56049106887 scopus 로고    scopus 로고
    • Tight optimistic estimates for fast subgroup discovery
    • Lecture Notes in Computer Science Springer
    • Henrik Grosskreutz, Stefan Rüping, and Stefan Wrobel Tight optimistic estimates for fast subgroup discovery Machine Learning and Knowledge Discovery in Databases Lecture Notes in Computer Science vol. 5211 2008 Springer 440 456
    • (2008) Machine Learning and Knowledge Discovery in Databases , vol.5211 , pp. 440-456
    • Grosskreutz, H.1    Rüping, S.2    Wrobel, S.3
  • 29
    • 79957948731 scopus 로고    scopus 로고
    • K-Pattern set mining under constraints
    • Department of Computer Science, K.U. Leuven, October
    • Tias Guns, Siegfried Nijssen, Luc De Raedt, k-Pattern set mining under constraints, CW Reports CW596, Department of Computer Science, K.U. Leuven, October 2010.
    • (2010) CW Reports CW596
    • Guns, T.1    Nijssen, S.2    De Raedt, L.3
  • 31
    • 34547335088 scopus 로고    scopus 로고
    • Frequent pattern mining: Current status and future directions
    • DOI 10.1007/s10618-006-0059-1, 10th Anniversary Issue
    • Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan Frequent pattern mining: current status and future directions Data Mining and Knowledge Discovery 15 1 2007 55 86 (Pubitemid 47142811)
    • (2007) Data Mining and Knowledge Discovery , vol.15 , Issue.1 , pp. 55-86
    • Han, J.1    Cheng, H.2    Xin, D.3    Yan, X.4
  • 32
    • 34548735819 scopus 로고    scopus 로고
    • APRIORI-SD: Adapting association rule learning to subgroup discovery
    • Lecture Notes in Computer Science Springer
    • Branko Kavsek, Nada Lavrac, and Viktor Jovanoski APRIORI-SD: adapting association rule learning to subgroup discovery Advances in Intelligent Data Analysis Lecture Notes in Computer Science vol. 2810 2003 Springer 230 241
    • (2003) Advances in Intelligent Data Analysis , vol.2810 , pp. 230-241
    • Kavsek, B.1    Lavrac, N.2    Jovanoski, V.3
  • 33
    • 21944442464 scopus 로고    scopus 로고
    • Levelwise search and borders of theories in knowledge discovery
    • Heikki Mannila, and Hannu Toivonen Levelwise search and borders of theories in knowledge discovery Data Mining and Knowledge Discovery 1 3 1997 241 258
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.3 , pp. 241-258
    • Mannila, H.1    Toivonen, H.2
  • 36
    • 77953807631 scopus 로고    scopus 로고
    • Optimal constraint-based decision tree induction from itemset lattices
    • Siegfried Nijssen, and Élisa Fromont Optimal constraint-based decision tree induction from itemset lattices Data Mining and Knowledge Discovery 21 1 2010 9 51
    • (2010) Data Mining and Knowledge Discovery , vol.21 , Issue.1 , pp. 9-51
    • Nijssen, S.1    Fromont, É.2
  • 37
    • 78049393926 scopus 로고    scopus 로고
    • Integrating constraint programming and itemset mining
    • Lecture Notes in Computer Science Springer
    • Siegfried Nijssen, and Tias Guns Integrating constraint programming and itemset mining Machine Learning and Knowledge Discovery in Databases Lecture Notes in Computer Science vol. 6322 2010 Springer 467 482
    • (2010) Machine Learning and Knowledge Discovery in Databases , vol.6322 , pp. 467-482
    • Nijssen, S.1    Guns, T.2
  • 40
    • 84911977993 scopus 로고    scopus 로고
    • Discovering frequent closed itemsets for association rules
    • Lecture Notes in Computer Science Springer
    • Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal Discovering frequent closed itemsets for association rules Database Theory Lecture Notes in Computer Science vol. 1540 1999 Springer 398 416
    • (1999) Database Theory , vol.1540 , pp. 398-416
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4
  • 44
    • 84957371379 scopus 로고    scopus 로고
    • Search procedures and parallelism in constraint programming
    • Lecture Notes in Computer Science Springer
    • Laurent Perron Search procedures and parallelism in constraint programming Principles and Practice of Constraint Programming Lecture Notes in Computer Science vol. 1713 1999 Springer 346 360
    • (1999) Principles and Practice of Constraint Programming , vol.1713 , pp. 346-360
    • Perron, L.1
  • 46
    • 0012646053 scopus 로고    scopus 로고
    • Programming Constraint Services: High-Level Programming of Standard and New Constraint Services
    • Springer
    • Christian Schulte Programming Constraint Services: High-Level Programming of Standard and New Constraint Services Lecture Notes in Computer Science vol. 2302 2002 Springer
    • (2002) Lecture Notes in Computer Science , vol.2302
    • Schulte, C.1
  • 48
    • 84864843490 scopus 로고    scopus 로고
    • Answering the most correlated n association rules efficiently
    • Lecture Notes in Computer Science Springer
    • Jun Sese, and Shinichi Morishita Answering the most correlated n association rules efficiently Principles of Data Mining and Knowledge Discovery Lecture Notes in Computer Science vol. 2431 2002 Springer 410 422
    • (2002) Principles of Data Mining and Knowledge Discovery , vol.2431 , pp. 410-422
    • Sese, J.1    Morishita, S.2
  • 50
    • 26944467551 scopus 로고    scopus 로고
    • An efficient framework for mining flexible constraints
    • Lecture Notes in Computer Science Springer
    • Arnaud Soulet, and Bruno Crømilleux An efficient framework for mining flexible constraints Advances in Knowledge Discovery and Data Mining Lecture Notes in Computer Science vol. 3518 2005 Springer 43 64
    • (2005) Advances in Knowledge Discovery and Data Mining , vol.3518 , pp. 43-64
    • Soulet, A.1    Crømilleux, B.2
  • 54
    • 0032187332 scopus 로고    scopus 로고
    • Design, implementation, and evaluation of the constraint language cc (FD)
    • PII S0743106698100067
    • Pascal Van Hentenryck, Vijay A. Saraswat, and Yves Deville Design, implementation, and evaluation of the constraint language cc(FD) Journal of Logic Programming 37 1-3 1998 139 164 (Pubitemid 128415803)
    • (1998) Journal of Logic Programming , vol.37 , Issue.1-3 , pp. 139-164
    • Van Hentenryck, P.1    Saraswat, V.2    Deville, Y.3
  • 55
    • 34548792706 scopus 로고    scopus 로고
    • An Algorithm for Multi-relational Discovery of Subgroups
    • Principles of Data Mining and Knowledge Discovery
    • Stefan Wrobel An algorithm for multi-relational discovery of subgroups Principles of Data Mining and Knowledge Discovery Lecture Notes in Computer Science vol. 1263 1997 Springer 78 87 (Pubitemid 127097494)
    • (1997) Lecture Notes in Computer Science , Issue.1263 , pp. 78-87
    • Wrobel, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.