메뉴 건너뛰기




Volumn 179, Issue 24, 2009, Pages 4123-4139

RMAIN: Association rules maintenance without reruns through data

Author keywords

Approximate methods; Association rules; Data mining; Incremental maintenance; Knowledge based systems

Indexed keywords

APPROXIMATE ALGORITHMS; APPROXIMATE METHODS; AUTONOMOUS SYSTEMS; DATA-MINING TOOLS; DECISION SUPPORTS; FREQUENT ITEMSETS; INCREMENTAL APPROACH; INCREMENTAL MAINTENANCE; INCREMENTAL METHOD; INTERMEDIATE REPRESENTATIONS; KNOWLEDGE BASIS; MINING ASSOCIATIONS; REAL DATA SETS; RULE MINING ALGORITHMS; SET OF RULES; TRANSACTIONAL DATA; WIDE SPECTRUM;

EID: 70349745711     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.08.022     Document Type: Article
Times cited : (9)

References (58)
  • 5
    • 0038005421 scopus 로고    scopus 로고
    • A statistical theory for quantitative association rules
    • Aumann Y., and Lindell. A statistical theory for quantitative association rules. Journal of Intelligent Information Systems 20 3 (2003) 255-283
    • (2003) Journal of Intelligent Information Systems , vol.20 , Issue.3 , pp. 255-283
    • Aumann, Y.1    Lindell2
  • 9
  • 13
  • 14
    • 33846950629 scopus 로고    scopus 로고
    • Science and Technology Publishers (WNT), Warsaw, Poland (in Polish)
    • Cichosz P. Learning Systems (2000), Science and Technology Publishers (WNT), Warsaw, Poland (in Polish)
    • (2000) Learning Systems
    • Cichosz, P.1
  • 18
    • 39649083198 scopus 로고    scopus 로고
    • Ph.D. Thesis, Technical Report No. PRE, Institute of Applied Informatics, Wroclaw University of Technology, Wroclaw, in Polish
    • D. Dudek, Knowledge acquisition within an agent system using data mining methods, Ph.D. Thesis, Technical Report No. PRE 2, Institute of Applied Informatics, Wroclaw University of Technology, Wroclaw, 2005 (in Polish).
    • (2005) Knowledge acquisition within an agent system using data mining methods , pp. 2
    • Dudek, D.1
  • 19
    • 39649121902 scopus 로고    scopus 로고
    • Using data mining algorithms for statistical learning of a software agent
    • N.T. Nguyen, A. Grzech, R.J. Howlett, L.C. Jain (Eds, Proceedings of the First KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications KES-AMSTA, Springer-Verlag, Berlin, Heidelberg
    • D. Dudek, Using data mining algorithms for statistical learning of a software agent, in: N.T. Nguyen, A. Grzech, R.J. Howlett, L.C. Jain (Eds.), Proceedings of the First KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2007), Lecture Notes in Artificial Intelligence (LNAI), vol. 4496, Springer-Verlag, Berlin, Heidelberg, 2007, pp. 111-120.
    • (2007) Lecture Notes in Artificial Intelligence (LNAI , vol.4496 , pp. 111-120
    • Dudek, D.1
  • 20
    • 84974698287 scopus 로고    scopus 로고
    • Mining incremental association rules with generalized FP-tree
    • Proceedings of the Fifteenth Canadian Conference on Artificial Intelligence AI, Springer-Verlag, Berlin, Heidelberg
    • C.I. Ezeife, Y. Su, Mining incremental association rules with generalized FP-tree, in: Proceedings of the Fifteenth Canadian Conference on Artificial Intelligence (AI 2002), Lecture Notes in Computer Science (LNCS), Springer-Verlag, Berlin, Heidelberg, 2002.
    • (2002) Lecture Notes in Computer Science (LNCS
    • Ezeife, C.I.1    Su, Y.2
  • 23
    • 2442465323 scopus 로고    scopus 로고
    • Ph.D. Thesis, Transnational University of Limburg, Diepenbeek, Belgium
    • B. Goethals, Efficient frequent pattern mining, Ph.D. Thesis, Transnational University of Limburg, Diepenbeek, Belgium, 2002.
    • (2002) Efficient frequent pattern mining
    • Goethals, B.1
  • 29
    • 22644448804 scopus 로고    scopus 로고
    • Incremental discovering association rules: A concept lattice approach
    • N. Zhong, L. Zhou Eds, PAKDD'99, Springer-Verlag, Berlin, Heidelberg
    • K. Hu, Y. Lu, C.I. Shi, Incremental discovering association rules: a concept lattice approach, in: N. Zhong, L. Zhou (Eds.), PAKDD'99, Lecture Notes in Artificial Intelligence (LNAI), vol. 1571, Springer-Verlag, Berlin, Heidelberg, 1999, pp. 109-113.
    • (1999) Lecture Notes in Artificial Intelligence (LNAI , vol.1571 , pp. 109-113
    • Hu, K.1    Lu, Y.2    Shi, C.I.3
  • 31
    • 17644408058 scopus 로고    scopus 로고
    • Genetic algorithm based framework for mining fuzzy association rules
    • Kaya M., and Alhajj R. Genetic algorithm based framework for mining fuzzy association rules. Fuzzy Sets and Systems 152 (2005) 587-601
    • (2005) Fuzzy Sets and Systems , vol.152 , pp. 587-601
    • Kaya, M.1    Alhajj, R.2
  • 34
    • 0042850501 scopus 로고    scopus 로고
    • Progressive partition miner: an efficient algorithm for mining general temporal association rules
    • Lee C.-H., Chen M.-S., and Lin C.-R. Progressive partition miner: an efficient algorithm for mining general temporal association rules. IEEE Transactions on Knowledge and Data Engineering 15 4 (2003) 1004-1017
    • (2003) IEEE Transactions on Knowledge and Data Engineering , vol.15 , Issue.4 , pp. 1004-1017
    • Lee, C.-H.1    Chen, M.-S.2    Lin, C.-R.3
  • 35
    • 9944236785 scopus 로고    scopus 로고
    • Sliding window filtering: an efficient method for incremental mining on a time-variant database
    • Lee C.-H., Lin C.-R., and Chen M.-S. Sliding window filtering: an efficient method for incremental mining on a time-variant database. Information Systems 30 (2005) 227-244
    • (2005) Information Systems , vol.30 , pp. 227-244
    • Lee, C.-H.1    Lin, C.-R.2    Chen, M.-S.3
  • 36
    • 0012457091 scopus 로고    scopus 로고
    • Efficient graph-based algorithms for discovering and maintaining association rules in large databases
    • Lee G., Lee K.L., and Chen A.L.P. Efficient graph-based algorithms for discovering and maintaining association rules in large databases. Knowledge and Information Systems 3 (2001) 338-355
    • (2001) Knowledge and Information Systems , vol.3 , pp. 338-355
    • Lee, G.1    Lee, K.L.2    Chen, A.L.P.3
  • 39
    • 22444451988 scopus 로고    scopus 로고
    • Is sampling useful in data mining? A case in the maintenance of discovered association rules
    • Lee S.D., Cheung D.W., and Kao B. Is sampling useful in data mining? A case in the maintenance of discovered association rules. Data Mining and Knowledge Discovery 2 (1998) 233-262
    • (1998) Data Mining and Knowledge Discovery , vol.2 , pp. 233-262
    • Lee, S.D.1    Cheung, D.W.2    Kao, B.3
  • 41
    • 0036103365 scopus 로고    scopus 로고
    • Efficient adaptive-support association rule mining for recommender systems
    • Lin W., Alvarez S.A., and Ruiz C. Efficient adaptive-support association rule mining for recommender systems. Data Mining and Knowledge Discovery 6 (2002) 83-105
    • (2002) Data Mining and Knowledge Discovery , vol.6 , pp. 83-105
    • Lin, W.1    Alvarez, S.A.2    Ruiz, C.3
  • 42
    • 22944475382 scopus 로고    scopus 로고
    • Inducing multi-level association rules from multiple relations
    • Lisi F.A., and Malerba D. Inducing multi-level association rules from multiple relations. Machine Learning 55 (2004) 175-210
    • (2004) Machine Learning , vol.55 , pp. 175-210
    • Lisi, F.A.1    Malerba, D.2
  • 44
  • 46
    • 0036184255 scopus 로고    scopus 로고
    • Mining optimized association rules with categorical and numeric attributes
    • Rastogi R., and Shim K. Mining optimized association rules with categorical and numeric attributes. IEEE Transactions on Knowledge and Data Engineering 14 1 (2002) 29-50
    • (2002) IEEE Transactions on Knowledge and Data Engineering , vol.14 , Issue.1 , pp. 29-50
    • Rastogi, R.1    Shim, K.2
  • 47
    • 23844545242 scopus 로고    scopus 로고
    • A high-performance distributed algorithm for mining association rules
    • Schuster A., Wolff R., and Trock D. A high-performance distributed algorithm for mining association rules. Knowledge and Information Systems 7 (2005) 458-475
    • (2005) Knowledge and Information Systems , vol.7 , pp. 458-475
    • Schuster, A.1    Wolff, R.2    Trock, D.3
  • 48
    • 0033320738 scopus 로고    scopus 로고
    • New algorithms for efficient mining of association rules
    • Shen L., Shen H., and Cheng L. New algorithms for efficient mining of association rules. Information Sciences 118 (1999) 251-268
    • (1999) Information Sciences , vol.118 , pp. 251-268
    • Shen, L.1    Shen, H.2    Cheng, L.3
  • 49
    • 84947718804 scopus 로고    scopus 로고
    • An efficient approach for incremental association rule mining
    • N. Zhong, L. Zhou Eds, PAKDD'99, Springer-Verlag, Berlin, Heidelberg
    • P.S. Tsai, C.-C. Lee, A.L. Chen, An efficient approach for incremental association rule mining, in: N. Zhong, L. Zhou (Eds.), PAKDD'99, Lecture Notes in Artificial Intelligence (LNAI), vol. 1574, Springer-Verlag, Berlin, Heidelberg, 1999, pp. 74-83.
    • (1999) Lecture Notes in Artificial Intelligence (LNAI , vol.1574 , pp. 74-83
    • Tsai, P.S.1    Lee, C.-C.2    Chen, A.L.3
  • 50
    • 3343008958 scopus 로고    scopus 로고
    • Mining interesting association rules from customer databases and transaction databases
    • Tsai P.S., and Chen C.-M. Mining interesting association rules from customer databases and transaction databases. Information Systems 29 (2004) 685-696
    • (2004) Information Systems , vol.29 , pp. 685-696
    • Tsai, P.S.1    Chen, C.-M.2
  • 51
    • 15544363947 scopus 로고    scopus 로고
    • CBAR: an efficient method for mining association rules
    • Tsay Y.-J., and Chiang J.-Y. CBAR: an efficient method for mining association rules. Knowledge-Based Systems 18 (2005) 99-105
    • (2005) Knowledge-Based Systems , vol.18 , pp. 99-105
    • Tsay, Y.-J.1    Chiang, J.-Y.2
  • 52
    • 33645894491 scopus 로고    scopus 로고
    • Flexible online association rule mining based on multidimensional pattern relations
    • Wang C.-Y., Tseng S.-S., and Hong T.-P. Flexible online association rule mining based on multidimensional pattern relations. Information Sciences 176 (2006) 1752-1780
    • (2006) Information Sciences , vol.176 , pp. 1752-1780
    • Wang, C.-Y.1    Tseng, S.-S.2    Hong, T.-P.3
  • 55
    • 0033354342 scopus 로고    scopus 로고
    • Parallel and distributed association mining: a survey
    • Zaki M.J. Parallel and distributed association mining: a survey. IEEE Concurrency 7 4 (1999) 14-25
    • (1999) IEEE Concurrency , vol.7 , Issue.4 , pp. 14-25
    • Zaki, M.J.1
  • 57
    • 34147142304 scopus 로고    scopus 로고
    • EDUA: an efficient algorithm for dynamic database mining
    • Zhang S., Zhang J., and Zhang C. EDUA: an efficient algorithm for dynamic database mining. Information Sciences 177 (2007) 2756-2767
    • (2007) Information Sciences , vol.177 , pp. 2756-2767
    • Zhang, S.1    Zhang, J.2    Zhang, C.3
  • 58
    • 84949475682 scopus 로고    scopus 로고
    • Z. Zhou, C.I. Ezeife, A low-scan incremental association rule maintenance method based on the apriori property, in: E. Stroulia, S. Matwin (Eds.), AI 2001, Lecture Notes in Artificial Intelligence, 2056, Springer-Verlag, Berlin, Heidelberg, 2001, pp. 26-35.
    • Z. Zhou, C.I. Ezeife, A low-scan incremental association rule maintenance method based on the apriori property, in: E. Stroulia, S. Matwin (Eds.), AI 2001, Lecture Notes in Artificial Intelligence, vol. 2056, Springer-Verlag, Berlin, Heidelberg, 2001, pp. 26-35.


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