메뉴 건너뛰기




Volumn 176, Issue 12, 2006, Pages 1752-1780

Flexible online association rule mining based on multidimensional pattern relations

Author keywords

Association rule; Constraint based mining; Data mining; Data warehouse; Incremental mining; Multidimensional mining

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA WAREHOUSES; DATABASE SYSTEMS; INFORMATION ANALYSIS; ONLINE SYSTEMS;

EID: 33645894491     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.05.005     Document Type: Article
Times cited : (36)

References (40)
  • 2
    • 0027621699 scopus 로고    scopus 로고
    • R. Agrawal, T. Imielinksi, A. Swami, Mining association rules between sets of items in large database, in: ACM SIGMOD Conference, Washington, DC, USA, 1993, pp. 207-216.
  • 4
    • 33645882085 scopus 로고    scopus 로고
    • R. Agrawal, R. Srikant, Fast algorithm for mining association rules, in: ACM International Conference on Very Large Data Bases, 1994, pp. 487-499.
  • 5
    • 0029212693 scopus 로고    scopus 로고
    • R. Agrawal, R. Srikant, Mining sequential patterns, in: IEEE International Conference on Data Engineering, 1995, pp. 3-14.
  • 7
    • 85175742182 scopus 로고    scopus 로고
    • R.J. Bayardo, R. Agrawal, D. Gunopulos, Constraint-based rule mining in large, dense databases, in: IEEE International Conference on Data Engineering, 1999, pp. 188-197.
  • 8
    • 0008707038 scopus 로고    scopus 로고
    • K. Beyer, R. Ramakrishnan, Bottom-up computation of sparse and iceberg cubes, in: ACM SIGMOD Conference, 1999, pp. 359-370.
  • 9
    • 0031161999 scopus 로고    scopus 로고
    • S. Brin, R. Motwani, C Silverstein, Beyond market baskets: generalizing association rules to correlations, in: ACM SIGMOD Conference, Tucson, AZ, USA, 1997, pp. 265-276.
  • 10
    • 0031162961 scopus 로고    scopus 로고
    • S. Brin, R. Motwani, J.D. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: ACM SIGMOD Conference, Tucson, AZ, USA, 1997, pp. 255-264.
  • 11
    • 0344811122 scopus 로고    scopus 로고
    • An overview of data warehousing and OLAP technology
    • Chaudhuri S., and Dayal U. An overview of data warehousing and OLAP technology. ACM SIGMOD Record 26 (1997) 65-74
    • (1997) ACM SIGMOD Record , vol.26 , pp. 65-74
    • Chaudhuri, S.1    Dayal, U.2
  • 13
    • 0029733589 scopus 로고    scopus 로고
    • D.W. Cheung, J. Han, V.T. Ng, C.Y. Wong, Maintenance of discovered association rules in large databases: an incremental updating approach, in: IEEE International Conference on Data Engineering, 1996, pp. 106-114.
  • 14
    • 33645865405 scopus 로고    scopus 로고
    • D.W. Cheung, S.D. Lee, B. Kao, A general incremental technique for maintaining discovered association rules, in: Proceedings of Database Systems for Advanced Applications, Melbourne, Australia, 1997, pp. 185-194.
  • 15
    • 33645849705 scopus 로고    scopus 로고
    • M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, J.D. Ullman, Computing iceberg queries efficiently, in: ACM International Conference on Very Large Data Bases, 1998, pp. 299-310.
  • 16
    • 33645872275 scopus 로고    scopus 로고
    • R. Feldman, Y. Aumann, A. Amir, H. Mannila, Efficient algorithms for discovering frequent sets in incremental databases, ACM SIGMOD Workshop on DMKD, USA, 1997, pp. 59-66.
  • 17
    • 0034998229 scopus 로고    scopus 로고
    • G. Grahne, L.V.S. Lakshmanan, X. Wang, M.H. Xie, On dual mining: from patterns to circumstances and back, in: IEEE International Conference on Data Engineering, 2001, pp. 195-204.
  • 20
    • 0039253846 scopus 로고    scopus 로고
    • J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: ACM SIGMOD Conference, 2000, pp. 1-12.
  • 21
    • 0346457324 scopus 로고    scopus 로고
    • C. Hidber, Online association rule mining, in: ACM SIGMOD Conference, USA, 1999, pp. 145-156.
  • 24
    • 33645871703 scopus 로고    scopus 로고
    • M. Kamber, J. Han, J.Y. Chiang, Metarule-guided mining of multi-dimensional association rules using data cubes, in: The International Conference on Knowledge Discovery and Data Mining, 1997, pp. 207-210.
  • 25
    • 35048863497 scopus 로고    scopus 로고
    • H. Kona, S. Chakravarthy, Partitioned approach to association rule mining over multiple databases, in: The International Conference on Data Warehousing and Knowledge Discovery, 2004, pp. 320-330.
  • 26
    • 0347087668 scopus 로고    scopus 로고
    • L.V.S. Lakshmanan, R. Ng, J. Han, A. Pang, Optimization of constrained frequent set queries with 2-variable constraints, in: ACM SIGMOD Conference, Philadelphia, PA, USA, 1999, pp. 157-168.
  • 27
    • 0036208335 scopus 로고    scopus 로고
    • B. Lan, B.C. Ooi, K.L. Tan, Efficient indexing structures for mining frequent patterns, in: IEEE International Conference on Data Engineering, 2002, pp. 453-462.
  • 28
    • 33645841220 scopus 로고    scopus 로고
    • H. Mannila, H. Toivonen, A.I. Verkamo, Efficient algorithm for discovering association rules, in: The AAAI Workshop on Knowledge Discovery in Databases, 1994, pp. 181-192.
  • 29
    • 33645850282 scopus 로고    scopus 로고
    • H. Mannila, H. Toivonen, On an algorithm for finding all interesting sentences, in: The European Meeting on Cybernetics and Systems Research, vol. II, 1996.
  • 30
    • 0032092760 scopus 로고    scopus 로고
    • R.T. Ng, L.V.S. Lakshmanan, J. Han, A. Pang, Exploratory mining and pruning optimizations of constrained associations Rules, in: ACM SIGMOD Conference, Seattle, WA, USA, 1998, pp. 13-24.
  • 31
    • 0031220368 scopus 로고    scopus 로고
    • Using a hash-based method with transaction trimming for mining association rules
    • Park J.S., Chen M.S., and Yu P.S. Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering 9 5 (1997) 812-825
    • (1997) IEEE Transactions on Knowledge and Data Engineering , vol.9 , Issue.5 , pp. 812-825
    • Park, J.S.1    Chen, M.S.2    Yu, P.S.3
  • 32
    • 0035751901 scopus 로고    scopus 로고
    • H. Pinto, J. Han, J. Pei, K. Wang, in: Multi-dimensional sequential pattern mining, in: ACM International Conference on Information and Knowledge Management, 2001, 81-88.
  • 33
    • 33645872867 scopus 로고    scopus 로고
    • N.L. Sarda, N.V. Srinivas, An adaptive algorithm for incremental mining of association rules, in: IEEE International Workshop on Database and Expert Systems, 1998, pp. 240-245.
  • 34
    • 33645890141 scopus 로고    scopus 로고
    • A. Savasere, E. Omiecinski, S. Navathe. An efficient algorithm for mining association rules in large databases, in: ACM International Conference on Very Large Data Bases, 1995, pp. 432-444.
  • 35
    • 33645853932 scopus 로고    scopus 로고
    • S. Thomas, S. Bodagala, K. Alsabti, S. Ranka, in: An efficient algorithm for the incremental update of association rules in large databases, in: The International Conference on Knowledge Discovery and Data Mining, 1997, pp. 263-266.
  • 36
    • 84945313061 scopus 로고    scopus 로고
    • K. Wang, L. Tang, J. Han, J. Liu, Top down FP-Growth for association rule mining, in: Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, 2002, pp. 334-340.
  • 37
    • 0029456781 scopus 로고    scopus 로고
    • J. Widom, Research problems in data warehousing, in: ACM International Conference on Information and Knowledge Management, 1995.
  • 38
    • 0037339975 scopus 로고    scopus 로고
    • Synthesizing high-frequency rules from different data sources
    • Wu X., and Zhang S. Synthesizing high-frequency rules from different data sources. IEEE Transactions on Knowledge and Data Engineering 15 2 (2003) 353-367
    • (2003) IEEE Transactions on Knowledge and Data Engineering , vol.15 , Issue.2 , pp. 353-367
    • Wu, X.1    Zhang, S.2
  • 40
    • 0035788918 scopus 로고    scopus 로고
    • Z. Zheng, R. Kohavi, L. Mason, Real world performance of association rule algorithms, in: The International Conference on Knowledge Discovery and Data Mining, 2001.


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