메뉴 건너뛰기




Volumn , Issue , 2004, Pages 49-58

Interactive constrained frequent-pattern mining system

Author keywords

Constraint changes; Constraints; Data mining and knowledge discovery; Fp trees; Frequent sets; Interactive system; Succinctness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; HUMAN COMPUTER INTERACTION; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

EID: 5444257046     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (10)

References (25)
  • 1
    • 0027621699 scopus 로고    scopus 로고
    • Mining association roles between sets of items in large databases
    • R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Roles between Sets of Items in Large Databases", In Proc. SIGMOD 1993, pp. 207-216.
    • Proc. SIGMOD 1993 , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 3
    • 0001882616 scopus 로고    scopus 로고
    • Fast algorithms for mining association roles
    • R. Agrawal andR. Srikant, "Fast Algorithms for Mining Association Roles", In Proc. VLDB 1994, pp. 487-499.
    • Proc. VLDB 1994 , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 4
    • 0032091573 scopus 로고    scopus 로고
    • Efficiently mining long patterns from databases
    • R.J. Bayardo, "Efficiently Mining Long Patterns from Databases", In Proc. SIGMOD 1998, pp. 85-93.
    • Proc. SIGMOD 1998 , pp. 85-93
    • Bayardo, R.J.1
  • 5
    • 0032680184 scopus 로고    scopus 로고
    • Constraint-based rule mining in large, dense databases
    • R.J. Bayardo, R. Agrawal, and D. Gunopulos, "Constraint-Based Rule Mining in Large, Dense Databases", In Proc. ICDE 1999, pp. 188-197.
    • Proc. ICDE 1999 , pp. 188-197
    • Bayardo, R.J.1    Agrawal, R.2    Gunopulos, D.3
  • 6
    • 0034860134 scopus 로고    scopus 로고
    • Mining free itemsets under constraints
    • J.-F. Boulicaut and B. Jeudy, "Mining Free Itemsets under Constraints", In Proc. IDEAS 2001, pp. 322-329.
    • Proc. IDEAS 2001 , pp. 322-329
    • Boulicaut, J.-F.1    Jeudy, B.2
  • 7
    • 0031161999 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to correlations
    • S. Brin, R. Motwani, and C. Silverstein, "Beyond Market Baskets: Generalizing Association Rules to Correlations", In Proc. SIGMOD 1997, pp. 265-276.
    • Proc. SIGMOD 1997 , pp. 265-276
    • Brin, S.1    Motwani, R.2    Silverstein, C.3
  • 8
    • 0029733589 scopus 로고    scopus 로고
    • Maintenance of discovered association rules in large databases: An incremental updating technique
    • D.W. Cheung, J. Han, V.T. Ng, and C.Y. Wong, "Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique", In Proc. ICDE 1996, pp. 106-114.
    • Proc. ICDE 1996 , pp. 106-114
    • Cheung, D.W.1    Han, J.2    Ng, V.T.3    Wong, C.Y.4
  • 9
    • 84879079572 scopus 로고    scopus 로고
    • Incremental mining of frequent patterns with candidate generation or support constraint
    • W. Cheung and O.R. Zaïane, "Incremental Mining of Frequent Patterns with Candidate Generation or Support Constraint", In Proc. IDEAS 2003, pp. 111-116.
    • Proc. IDEAS 2003 , pp. 111-116
    • Cheung, W.1    Zaïane, O.R.2
  • 10
    • 0030156999 scopus 로고    scopus 로고
    • Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization
    • T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama, "Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization", In Proc. SIGMOD 1996, pp. 13-23.
    • Proc. SIGMOD 1996 , pp. 13-23
    • Fukuda, T.1    Morimoto, Y.2    Morishita, S.3    Tokuyama, T.4
  • 11
    • 0001741607 scopus 로고    scopus 로고
    • SPIRIT: Sequential pattern mining with regular expression constraints
    • M.N. Garofalkis, R. Rastogi, and K. Shim, "SPIRIT: Sequential Pattern Mining with Regular Expression Constraints", In Proc. VLDB 1999, pp. 223-234.
    • Proc. VLDB 1999 , pp. 223-234
    • Garofalkis, M.N.1    Rastogi, R.2    Shim, K.3
  • 13
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation", In Proc. SIGMOD 2000, pp. 1-12.
    • Proc. SIGMOD 2000 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 14
    • 0346457324 scopus 로고    scopus 로고
    • Online association rule mining
    • C. Hidber, "Online Association Rule Mining", In Proc. SIGMOD 1999, pp. 145-156.
    • Proc. SIGMOD 1999 , pp. 145-156
    • Hidber, C.1
  • 15
    • 3142594274 scopus 로고    scopus 로고
    • Efficient dynamic mining of constrained frequent sets
    • Dec.
    • L.V.S. Lakshmanan, C.K.-S. Leung, and R. Ng, "Efficient Dynamic Mining of Constrained Frequent Sets", ACM TODS, 28(4), Dec. 2003, pp. 337-389.
    • (2003) ACM TODS , vol.28 , Issue.4 , pp. 337-389
    • Lakshmanan, L.V.S.1    Leung, C.K.-S.2    Ng, R.3
  • 16
    • 0036208481 scopus 로고    scopus 로고
    • OSSM: A segmentation approach to optimize frequency counting
    • C.K.-S. Leung, R.T. Ng, and H. Mannila, "OSSM: A Segmentation Approach to Optimize Frequency Counting", In Proc. ICDE 2002, pp. 583-592.
    • Proc. ICDE 2002 , pp. 583-592
    • Leung, C.K.-S.1    Ng, R.T.2    Mannila, H.3
  • 17
    • 0031162287 scopus 로고    scopus 로고
    • Association rules over interval data
    • R.J. Miller and Y. Yang, "Association Rules over Interval Data", In Proc. SIGMOD 1997, pp. 452-461.
    • Proc. SIGMOD 1997 , pp. 452-461
    • Miller, R.J.1    Yang, Y.2
  • 18
    • 0013115617 scopus 로고    scopus 로고
    • Using a knowledge cache for interactive discovery of association rules
    • B. Nag, P.M. Deshpande, and D.J. DeWitt, "Using a Knowledge Cache for Interactive Discovery of Association Rules", In Proc. SIGKDD 1999, pp. 244-253.
    • Proc. SIGKDD 1999 , pp. 244-253
    • Nag, B.1    Deshpande, P.M.2    Dewitt, D.J.3
  • 19
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory mining and pruning optimizations of constrained associations rules
    • R.T. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, "Exploratory Mining and Pruning Optimizations of Constrained Associations Rules", In Proc. SIGMOD 1998, pp. 13-24.
    • Proc. SIGMOD 1998 , pp. 13-24
    • Ng, R.T.1    Lakshmanan, L.V.S.2    Han, J.3    Pang, A.4
  • 20
    • 0031220368 scopus 로고    scopus 로고
    • Using a hash-based method with transaction trimming for mining association rules
    • Sept/Oct
    • J.S. Park, M.-S. Chen, and P.S. Yu, "Using a Hash-Based Method with Transaction Trimming for Mining Association Rules", IEEE TKDE, 9(5), Sept/Oct 1997, pp. 813-825.
    • (1997) IEEE TKDE , vol.9 , Issue.5 , pp. 813-825
    • Park, J.S.1    Chen, M.-S.2    Yu, P.S.3
  • 21
    • 0035016447 scopus 로고    scopus 로고
    • Mining frequent itemsets with convertible constraints
    • J. Pei, J. Han, and L.V.S. Lakshmanan, "Mining Frequent Itemsets with Convertible Constraints", In Proc. ICDE 2001, pp. 433-442.
    • Proc. ICDE 2001 , pp. 433-442
    • Pei, J.1    Han, J.2    Lakshmanan, L.V.S.3
  • 22
    • 0032094477 scopus 로고    scopus 로고
    • Integrating association rule mining with relational database systems: Alternatives and implications
    • S. Sarawagi, S. Thomas, and R. Agrawal, "Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications", In Proc. SIGMOD 1998, pp. 343-354.
    • Proc. SIGMOD 1998 , pp. 343-354
    • Sarawagi, S.1    Thomas, S.2    Agrawal, R.3
  • 24
    • 85162588849 scopus 로고    scopus 로고
    • Mining association rules with item constraints
    • R. Srikant, Q. Vu, and R. Agrawal, "Mining Association Rules with Item Constraints", In Proc. KDD 1997, pp. 67-73.
    • Proc. KDD 1997 , pp. 67-73
    • Srikant, R.1    Vu, Q.2    Agrawal, R.3


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