메뉴 건너뛰기




Volumn 4798 LNAI, Issue , 2007, Pages 447-459

Cost-time sensitive decision tree with missing values

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COST EFFECTIVENESS; DATA MINING; LEARNING SYSTEMS;

EID: 38348999247     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76719-0_44     Document Type: Conference Paper
Times cited : (6)

References (24)
  • 1
    • 38349010550 scopus 로고    scopus 로고
    • Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Francisco (1993)
    • Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Francisco (1993)
  • 4
    • 33746336969 scopus 로고    scopus 로고
    • Test Strategies for Cost-Sensitive Decision Trees
    • Ling, C.X., Sheng, S., Yang, Q.: Test Strategies for Cost-Sensitive Decision Trees. TKDE 18(8), 1055-1067 (2006)
    • (2006) TKDE , vol.18 , Issue.8 , pp. 1055-1067
    • Ling, C.X.1    Sheng, S.2    Yang, Q.3
  • 5
    • 33645690975 scopus 로고    scopus 로고
    • Test-Cost Sensitive Classification on Data with Missing Values
    • Yang, Q., Ling, C.X., Chai, X., Pan, R.: Test-Cost Sensitive Classification on Data with Missing Values. TKDE 18(5), 626-638 (2006)
    • (2006) TKDE , vol.18 , Issue.5 , pp. 626-638
    • Yang, Q.1    Ling, C.X.2    Chai, X.3    Pan, R.4
  • 6
    • 33749255623 scopus 로고    scopus 로고
    • Feature Value Acquisition in Testing: A Sequential Batch Test Algorithm
    • 2006
    • Sheng, V.S., Ling, C.X.: Feature Value Acquisition in Testing: A Sequential Batch Test Algorithm. In: ICML'2006, pp. 809-816 (2006)
    • (2006) ICML , pp. 809-816
    • Sheng, V.S.1    Ling, C.X.2
  • 8
    • 16244406546 scopus 로고    scopus 로고
    • Influence of waiting time on cost-effectiveness
    • Koopmanschap, M.A., et al.: Influence of waiting time on cost-effectiveness. Social Science & Medicine 60, 2501-2504 (2005)
    • (2005) Social Science & Medicine , vol.60 , pp. 2501-2504
    • Koopmanschap, M.A.1
  • 9
    • 4143100277 scopus 로고    scopus 로고
    • Waiting time information services: An evaluation of how well clearance time statistics can forecast a patient's wait
    • Cromwell, D.A.: Waiting time information services: An evaluation of how well clearance time statistics can forecast a patient's wait. Social Science & Medicine 59, 1937-1948 (2004)
    • (2004) Social Science & Medicine , vol.59 , pp. 1937-1948
    • Cromwell, D.A.1
  • 10
    • 0000865580 scopus 로고
    • Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm
    • Turney, P.D.: Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm. Journal of Artificial Intelligence Research 2, 369-409 (1995)
    • (1995) Journal of Artificial Intelligence Research , vol.2 , pp. 369-409
    • Turney, P.D.1
  • 12
    • 38149046554 scopus 로고    scopus 로고
    • Efficient Imputation Method for Missing Values
    • PAKDD, Springer, Heidelberg
    • Zhang, C.Q., et al.: Efficient Imputation Method for Missing Values. In: PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 1080-1087. Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI , vol.4426 , pp. 1080-1087
    • Zhang, C.Q.1
  • 14
  • 15
    • 0026154832 scopus 로고
    • The use of background knowledge in decision tree induction
    • Nunez, M.: The use of background knowledge in decision tree induction. Machine Learning 6, 231-250 (1991)
    • (1991) Machine Learning , vol.6 , pp. 231-250
    • Nunez, M.1
  • 16
    • 0027682298 scopus 로고
    • Cost-sensitive learning of classification knowledge and its applications in robotics
    • Tan, M.: Cost-sensitive learning of classification knowledge and its applications in robotics. Machine. Learning Journal 13, 7-33 (1993)
    • (1993) Machine. Learning Journal , vol.13 , pp. 7-33
    • Tan, M.1
  • 17
    • 0344324689 scopus 로고    scopus 로고
    • MetaCost: A General Method for Making Classifiers Cost-Sensitive
    • Domingos, P.: MetaCost: A General Method for Making Classifiers Cost-Sensitive. Knowledge Discovery and Data Mining, 155-164 (1999)
    • (1999) Knowledge Discovery and Data Mining , vol.155-164
    • Domingos, P.1
  • 20
    • 22944480876 scopus 로고    scopus 로고
    • Qin, Z., Zhang, C., Zhang, S.: Cost-sensitive Decision Trees with Multiple Cost Scales. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), 3339, Springer, Heidelberg (2004)
    • Qin, Z., Zhang, C., Zhang, S.: Cost-sensitive Decision Trees with Multiple Cost Scales. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, Springer, Heidelberg (2004)
  • 21
    • 33745616561 scopus 로고    scopus 로고
    • Ni, A.L., Zhu, X.F., Zhang, C.Q.: Any-Cost Discovery: Learning Optimal Classification Rules? In: Zhang, S., Jarvis, R. (eds.) AI 2005. LNCS (LNAI), 3809, pp. 123-132. Springer, Heidelberg (2005)
    • Ni, A.L., Zhu, X.F., Zhang, C.Q.: Any-Cost Discovery: Learning Optimal Classification Rules? In: Zhang, S., Jarvis, R. (eds.) AI 2005. LNCS (LNAI), vol. 3809, pp. 123-132. Springer, Heidelberg (2005)


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