메뉴 건너뛰기




Volumn 70, Issue 6, 2011, Pages 555-575

Reliable representations for association rules

Author keywords

Association rule mining; Closed itemsets; Data mining agents; Knowledge discovery; Redundant association rules

Indexed keywords

ASSOCIATION RULE MINING; CLOSED ITEMSETS; DATA MINING AGENTS; KNOWLEDGE DISCOVERY; REDUNDANT ASSOCIATION RULES;

EID: 79955922899     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2011.02.003     Document Type: Article
Times cited : (40)

References (38)
  • 4
    • 0037243046 scopus 로고    scopus 로고
    • Free-sets: A condensed representation of Boolean data for the approximation of frequency queries
    • Jean-Francois Boulicaut, Artur Bykowski, and Christophe Rigotti Free-sets: a condensed representation of Boolean data for the approximation of frequency queries Data Mining and Knowledge Discovery 7 2003 5 22
    • (2003) Data Mining and Knowledge Discovery , vol.7 , pp. 5-22
    • Boulicaut, J.-F.1    Bykowski, A.2    Rigotti, C.3
  • 5
    • 4944260909 scopus 로고    scopus 로고
    • Measuring the accuracy and interest of association rules: A new framework
    • F. Berzal, I. Blanco, D. Sanchez, and M.A. Vila Measuring the accuracy and interest of association rules: a new framework Intelligent Data Analysis 6 2002 221 235
    • (2002) Intelligent Data Analysis , vol.6 , pp. 221-235
    • Berzal, F.1    Blanco, I.2    Sanchez, D.3    Vila, M.A.4
  • 8
    • 0142008547 scopus 로고    scopus 로고
    • Dbc: A condensed representation of frequent patterns for efficient mining
    • A. Bykowski, and C. Rigotti Dbc: a condensed representation of frequent patterns for efficient mining Information Systems 28 2003 949 977
    • (2003) Information Systems , vol.28 , pp. 949-977
    • Bykowski, A.1    Rigotti, C.2
  • 9
    • 26844449861 scopus 로고    scopus 로고
    • Essential patterns: A perfect cover of frequent patterns
    • Data Warehousing and Knowledge Discovery: 7th International Conference, DaWaK 2005. Proceedings
    • Alain Casali, Rosine Cicchetti, and Lotfi Lakhal Essential patterns: a perfect cover of frequent patterns DaWaK 2005 428 437 (Pubitemid 41450423)
    • (2005) Lecture Notes in Computer Science , vol.3589 , pp. 428-437
    • Casali, A.1    Cicchetti, R.2    Lakhal, L.3
  • 11
    • 33847406228 scopus 로고    scopus 로고
    • Non-derivable itemset mining
    • DOI 10.1007/s10618-006-0054-6
    • Toon Calders, and Bart Goethals Non-derivable itemset mining Data Mining and Knowledge Discovery 14 1 2007 171 206 (Pubitemid 46345359)
    • (2007) Data Mining and Knowledge Discovery , vol.14 , Issue.1 , pp. 171-206
    • Calders, T.1    Goethals, B.2
  • 13
    • 61349160437 scopus 로고    scopus 로고
    • Establishing relationships among patterns in stock market data
    • Dietmar H. Dorr, and Anne M. Denton Establishing relationships among patterns in stock market data Data & Knowledge Engineering 68 3 2009 318 337
    • (2009) Data & Knowledge Engineering , vol.68 , Issue.3 , pp. 318-337
    • Dorr, D.H.1    Denton, A.M.2
  • 14
    • 0035178849 scopus 로고    scopus 로고
    • Mining association rules with improved semantics in medical databases
    • DOI 10.1016/S0933-3657(00)00092-0, PII S0933365700000920
    • M. Delgado, D. Sanchez, and M.-J. Martin-Bautista Mining association rules with improved semantics in medical databases Aritificial Intelligence in Medicine 21 2001 241 245 (Pubitemid 32012671)
    • (2001) Artificial Intelligence in Medicine , vol.21 , Issue.1-3 , pp. 241-245
    • Delgado, M.1    Sanchez, D.2    Martin-Bautista, M.J.3    Vila, M.-A.4
  • 19
    • 0032650246 scopus 로고    scopus 로고
    • Constraint-based multidimensional data mining
    • Jiawei Han, Laks V.S. Lakshmanan, and Raymond T. Ng Constraint-based multidimensional data mining IEEE Computer 32 8 1999 46 50
    • (1999) IEEE Computer , vol.32 , Issue.8 , pp. 46-50
    • Han, J.1    Lakshmanan, L.V.S.2    Ng, R.T.3
  • 20
    • 0003372359 scopus 로고    scopus 로고
    • Mining frequent patterns by pattern-growth: Methodology and implications
    • J. Han, and J. Pei Mining frequent patterns by pattern-growth: methodology and implications ACM SIGKDD Explorations Newsletter 2 2 2000 14 20
    • (2000) ACM SIGKDD Explorations Newsletter , vol.2 , Issue.2 , pp. 14-20
    • Han, J.1    Pei, J.2
  • 23
    • 67349284423 scopus 로고    scopus 로고
    • Non-redundant sequential rules - Theory and algorithm
    • David Lo, Siau-Cheng Khoo, and Limsoon Wong Non-redundant sequential rules - theory and algorithm Information Systems 34 2009 438 453
    • (2009) Information Systems , vol.34 , pp. 438-453
    • Lo, D.1    Khoo, S.-C.2    Wong, L.3
  • 24
    • 18844377659 scopus 로고    scopus 로고
    • Knowledge discovery by probabilistic clustering of distributed databases
    • Sally McClean, Bryan Scotney, Philip Morrow, and Kieran Greer Knowledge discovery by probabilistic clustering of distributed databases Data & Knowledge Engineering 54 2 2004 189 210
    • (2004) Data & Knowledge Engineering , vol.54 , Issue.2 , pp. 189-210
    • McClean, S.1    Scotney, B.2    Morrow, P.3    Greer, K.4
  • 26
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory mining and pruning optimizations of constrained associations rules
    • R.T. Ng, V.S. Lakshmanan, J. Han, and A. Pang Exploratory mining and pruning otimizations of constrained association rules Proceedings of the SIGMOD conference 1998 13 24 (Pubitemid 128655953)
    • (1998) SIGMOD Record , vol.27 , Issue.2 , pp. 13-24
    • Ng, R.T.1    Lakshmanan, L.V.S.2    Pang, A.3    Han, J.4
  • 28
    • 0033096890 scopus 로고    scopus 로고
    • Efficient mining of association rules using closed itemset lattices
    • N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal Efficient mining of association rules using closed itemset lattices Information Systems 24 1 1999 25 46
    • (1999) Information Systems , vol.24 , Issue.1 , pp. 25-46
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4
  • 35
    • 0000398336 scopus 로고
    • Restructuring lattices theory: An approach based on hierarchies of concepts
    • R. Wille Restructuring lattices theory: an approach based on hierarchies of concepts I. Rival, Ordered sets, Reidel 1982 Dordrecht-Boston
    • (1982) Ordered Sets, Reidel
    • Wille, R.1
  • 37
    • 4444337294 scopus 로고    scopus 로고
    • Mining non-redundant association rules
    • DOI 10.1023/B:DAMI.0000040429.96086.c7
    • M.J. Zaki Mining non-redundant association rules Data Mining and Knowledge Discovery 9 2004 223 248 (Pubitemid 39193158)
    • (2004) Data Mining and Knowledge Discovery , vol.9 , Issue.3 , pp. 223-248
    • Zaki, M.J.1


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