메뉴 건너뛰기




Volumn 36, Issue 2 PART 1, 2009, Pages 2338-2351

Using decision trees to summarize associative classification rules

Author keywords

Decision trees; Rule summarization; Rule based classification

Indexed keywords

ASSOCIATION RULES; DECISION TREES; TREES (MATHEMATICS);

EID: 56349142600     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.12.031     Document Type: Article
Times cited : (42)

References (26)
  • 2
    • 84864832875 scopus 로고    scopus 로고
    • Calders, T., & Goethals, B. (2002). Mining all non-derivable frequent itemsets. In Proceedings of 2002 European conference on principles of data mining and knowledge discovery (pp. 74-85).
    • Calders, T., & Goethals, B. (2002). Mining all non-derivable frequent itemsets. In Proceedings of 2002 European conference on principles of data mining and knowledge discovery (pp. 74-85).
  • 3
    • 33750476333 scopus 로고    scopus 로고
    • A data-mining approach for retail knowledge discovery with consideration of the effect of shelf-space adjacency on sales
    • Chen Y.L., Chen J.M., and Tung C.W. A data-mining approach for retail knowledge discovery with consideration of the effect of shelf-space adjacency on sales. Decision Support Systems 42 3 (2006) 1503-1520
    • (2006) Decision Support Systems , vol.42 , Issue.3 , pp. 1503-1520
    • Chen, Y.L.1    Chen, J.M.2    Tung, C.W.3
  • 4
    • 0037507339 scopus 로고    scopus 로고
    • Constructing a multi-valued and multi-labeled decision tree
    • Chen Y.L., Hsu C.L., and Chou S.C. Constructing a multi-valued and multi-labeled decision tree. Expert Systems with Applications 25 2 (2003) 199-209
    • (2003) Expert Systems with Applications , vol.25 , Issue.2 , pp. 199-209
    • Chen, Y.L.1    Hsu, C.L.2    Chou, S.C.3
  • 5
    • 33746238956 scopus 로고    scopus 로고
    • TASC: Two-attribute-set clustering through decision tree construction
    • Chen Y.L., Hsu W.H., and Lee Y.H. TASC: Two-attribute-set clustering through decision tree construction. European Journal of Operational Research 174 2 (2006) 930-944
    • (2006) European Journal of Operational Research , vol.174 , Issue.2 , pp. 930-944
    • Chen, Y.L.1    Hsu, W.H.2    Lee, Y.H.3
  • 6
    • 13944255156 scopus 로고    scopus 로고
    • Market basket analysis in a multiple store environment
    • Chen Y.L., Tang K., Shen R.J., and Hu Y.H. Market basket analysis in a multiple store environment. Decision Support Systems 40 2 (2005) 339-354
    • (2005) Decision Support Systems , vol.40 , Issue.2 , pp. 339-354
    • Chen, Y.L.1    Tang, K.2    Shen, R.J.3    Hu, Y.H.4
  • 7
    • 35048837125 scopus 로고    scopus 로고
    • Dong, G., Zhang, X., Wong, L., & Li, J. (1999). CAEP: Classification by aggregating emerging patterns. In Proceedings of the second international conference on discovery science (pp. 30-42).
    • Dong, G., Zhang, X., Wong, L., & Li, J. (1999). CAEP: Classification by aggregating emerging patterns. In Proceedings of the second international conference on discovery science (pp. 30-42).
  • 8
    • 0346457323 scopus 로고    scopus 로고
    • Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W-Y. (1999). BOAT-Optimistic decision tree construction. In Proceedings of the 1999 ACM SIGMOD international conference on management of data (pp. 169-180).
    • Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W-Y. (1999). BOAT-Optimistic decision tree construction. In Proceedings of the 1999 ACM SIGMOD international conference on management of data (pp. 169-180).
  • 9
    • 23044519492 scopus 로고    scopus 로고
    • RainForest-A framework for fast decision tree construction of large datasets
    • Gehrke J., Ramakrishnan R., and Ganti V. RainForest-A framework for fast decision tree construction of large datasets. Data Mining and Knowledge Discovery 4 2-3 (2000) 127-162
    • (2000) Data Mining and Knowledge Discovery , vol.4 , Issue.2-3 , pp. 127-162
    • Gehrke, J.1    Ramakrishnan, R.2    Ganti, V.3
  • 10
    • 0030642745 scopus 로고    scopus 로고
    • Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H. (1997). Data mining, hypergraph transversals, and machine learning. In Proceedings of the 16th ACM symposium on principles of database systems (pp. 209-216).
    • Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H. (1997). Data mining, hypergraph transversals, and machine learning. In Proceedings of the 16th ACM symposium on principles of database systems (pp. 209-216).
  • 11
    • 78149328321 scopus 로고    scopus 로고
    • Han, J., Wang, J., Lu, Y., & Tzvetkov, P. (2002). Mining top-k frequent closed patterns without minimum support. In Proceedings of 2002 international conference on data mining (pp. 211-218).
    • Han, J., Wang, J., Lu, Y., & Tzvetkov, P. (2002). Mining top-k frequent closed patterns without minimum support. In Proceedings of 2002 international conference on data mining (pp. 211-218).
  • 12
    • 78149313084 scopus 로고    scopus 로고
    • Li, W., Han, J., & Pei, J. (2001). CMAR: Accurate and efficient classification based on multiple class-association rules. In Proceedings of. IEEE-ICDM (pp. 369-376).
    • Li, W., Han, J., & Pei, J. (2001). CMAR: Accurate and efficient classification based on multiple class-association rules. In Proceedings of. IEEE-ICDM (pp. 369-376).
  • 13
    • 56349146195 scopus 로고    scopus 로고
    • Liu, B., Hsu, W., & Ma, Y. (1998). Integrating classification and association rule mining. In Proceedings of the fourth international conference on knowledge discovery and data mining (pp. 80-86).
    • Liu, B., Hsu, W., & Ma, Y. (1998). Integrating classification and association rule mining. In Proceedings of the fourth international conference on knowledge discovery and data mining (pp. 80-86).
  • 14
    • 56349162191 scopus 로고    scopus 로고
    • Liu, B., Hsu, W., & Ma, Y. (1999). Pruning and summarizing the discovered associations. In Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (pp. 125-134).
    • Liu, B., Hsu, W., & Ma, Y. (1999). Pruning and summarizing the discovered associations. In Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (pp. 125-134).
  • 15
    • 0034593061 scopus 로고    scopus 로고
    • Liu, B., Hu, M., & Hsu, W. (2000). Multi-level organization and summarization of the discovered rules. In Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (pp. 208-217).
    • Liu, B., Hu, M., & Hsu, W. (2000). Multi-level organization and summarization of the discovered rules. In Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (pp. 208-217).
  • 16
    • 84897674228 scopus 로고    scopus 로고
    • Mehta, M., Agrawal, R., & Rissanen, J. (1996). SLIQ: A fast scalable classifier for data mining. In Proceedings of the fifth international conference on extending database technology (pp.18-32).
    • Mehta, M., Agrawal, R., & Rissanen, J. (1996). SLIQ: A fast scalable classifier for data mining. In Proceedings of the fifth international conference on extending database technology (pp.18-32).
  • 17
    • 84911977993 scopus 로고    scopus 로고
    • Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In Proceedings of seventh international conference on database theory (pp. 398-416).
    • Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In Proceedings of seventh international conference on database theory (pp. 398-416).
  • 18
    • 70349322209 scopus 로고    scopus 로고
    • Pei, J., Dong, G., Zou, W., & Han, J. (2002). On computing condensed frequent pattern bases. In Proceedings of 2002 international conference on data mining (pp. 378-385).
    • Pei, J., Dong, G., Zou, W., & Han, J. (2002). On computing condensed frequent pattern bases. In Proceedings of 2002 international conference on data mining (pp. 378-385).
  • 19
    • 33744584654 scopus 로고
    • Induction on decision trees
    • Quinlan J.R. Induction on decision trees. Machine Learning 1 (1986) 81-106
    • (1986) Machine Learning , vol.1 , pp. 81-106
    • Quinlan, J.R.1
  • 21
    • 8844252892 scopus 로고    scopus 로고
    • Quinlan, J. R., & Cameron-Jones, R. M. (1993). Foil: A midterm report. In Proceedings of the 1993 European conference on machine learning (pp. 3-20).
    • Quinlan, J. R., & Cameron-Jones, R. M. (1993). Foil: A midterm report. In Proceedings of the 1993 European conference on machine learning (pp. 3-20).
  • 22
    • 56349135498 scopus 로고    scopus 로고
    • Rastogi, R., & Shim, K. (1998). PUBLIC: A decision tree classifier that integrates building and pruning. In Proceedings of 24th international conference on very large data bases (pp. 404-415).
    • Rastogi, R., & Shim, K. (1998). PUBLIC: A decision tree classifier that integrates building and pruning. In Proceedings of 24th international conference on very large data bases (pp. 404-415).
  • 23
    • 56349130242 scopus 로고    scopus 로고
    • Shafer, J. C., Agrawal, R., & Mehta, M. (1996). SPRINT: A scalable parallel classifier for data mining. In Proceedings of 22nd international conference on very large data bases (pp. 544-555).
    • Shafer, J. C., Agrawal, R., & Mehta, M. (1996). SPRINT: A scalable parallel classifier for data mining. In Proceedings of 22nd international conference on very large data bases (pp. 544-555).
  • 24
    • 32344439809 scopus 로고    scopus 로고
    • Yan, X., Cheng, H., Han, J., & Xin, D. (2005). Summarizing itemset patterns: A profile-based approach. In Proceedings of 2005 ACM SIGKDD international conference on knowledge discovery and data mining (pp. 314-323).
    • Yan, X., Cheng, H., Han, J., & Xin, D. (2005). Summarizing itemset patterns: A profile-based approach. In Proceedings of 2005 ACM SIGKDD international conference on knowledge discovery and data mining (pp. 314-323).
  • 25
    • 0035789315 scopus 로고    scopus 로고
    • Yang, C., Fayyad, U., & Bradley, P. S. (2001). Efficient discovery of error-tolerant frequent itemsets in high dimensions. In Proceedings of 2001 ACM international conference on knowledge discovery in databases (pp. 194-203).
    • Yang, C., Fayyad, U., & Bradley, P. S. (2001). Efficient discovery of error-tolerant frequent itemsets in high dimensions. In Proceedings of 2001 ACM international conference on knowledge discovery in databases (pp. 194-203).
  • 26
    • 56349168071 scopus 로고    scopus 로고
    • Yin, X., & Han, J. (2003). CPAR: Classification based on predictive association rules. In Proceedings of the third SIAM international conference on data mining (pp. 208-217).
    • Yin, X., & Han, J. (2003). CPAR: Classification based on predictive association rules. In Proceedings of the third SIAM international conference on data mining (pp. 208-217).


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