메뉴 건너뛰기




Volumn 25, Issue 10, 2013, Pages 2302-2313

Inference-based naïve bayes: Turning naïve bayes cost-sensitive

Author keywords

classification; Cost sensitive classification; Na ve Bayes

Indexed keywords

BAYES METHOD; BIASED ESTIMATION; COST-SENSITIVE; COST-SENSITIVE CLASSIFICATION; ORDER RELATION; REAL-WORLD; TRAINING DATA;

EID: 84883299058     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2012.196     Document Type: Article
Times cited : (32)

References (53)
  • 1
    • 24044435942 scopus 로고    scopus 로고
    • Reducing multiclass to binary: A unifying approach for margin classifiers
    • E.L. Allwein, R.E. Schapire, and Y. Singer, "Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers," J. Machine Learning Research, vol. 1, pp. 113-141, 2000. (Pubitemid 33738778)
    • (2001) Journal of Machine Learning Research , vol.1 , Issue.2 , pp. 113-141
    • Allwein, E.L.1    Schapire, R.E.2    Singer, Y.3
  • 3
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • L. Breiman, "Bagging Predictors," Machine Learning, vol. 24, pp. 123-140, 1996. (Pubitemid 126724382)
    • (1996) Machine Learning , vol.24 , Issue.2 , pp. 123-140
    • Breiman, L.1
  • 4
    • 84926662675 scopus 로고
    • Nearest neighbor pattern classification
    • Jan
    • T.M. Cover and P.E. Hart, "Nearest Neighbor Pattern Classification," IEEE Trans. Information Theory, vol. IT-13, no. 1, pp. 21-27, Jan. 1967.
    • (1967) IEEE Trans. Information Theory , vol.IT-13 , Issue.1 , pp. 21-27
    • Cover, T.M.1    Hart, P.E.2
  • 6
    • 0031269184 scopus 로고    scopus 로고
    • On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
    • P. Domingos and M. Pazzani, "On the Optimality of the Simple Bayesian Classifier Under Zero-One Loss," Machine Learning, vol. 29, pp. 103-130, 1997. (Pubitemid 127510035)
    • (1997) Machine Learning , vol.29 , Issue.2-3 , pp. 103-130
    • Domingos, P.1    Pazzani, M.2
  • 13
    • 0031211090 scopus 로고    scopus 로고
    • A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
    • Y. Freund and R.E. Schapire, "A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting," J. Computer System Sciences, vol. 55, no. 1, pp. 119-139, 1997. (Pubitemid 127433398)
    • (1997) Journal of Computer and System Sciences , vol.55 , Issue.1 , pp. 119-139
    • Freund, Y.1    Schapire, R.E.2
  • 14
    • 21744462998 scopus 로고    scopus 로고
    • On bias, variance, 0/1-loss, and the curse-of-dimensionality
    • J.H. Friedman, "On Bias, Variance, 0/1-Loss, and the Curse-of-Dimensionality," Data Mining Knowledge Discovery, vol. 1, pp. 55-77, 1997. (Pubitemid 127721236)
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.1 , pp. 55-77
    • Friedman, J.H.1
  • 15
    • 0031276011 scopus 로고    scopus 로고
    • Bayesian Network Classifiers
    • N. Friedman, D. Geiger, and M. Goldszmidt, "Bayesian Network Classifiers," Machine Learning, vol. 29, nos. 2/3, pp. 131-163, 1997. (Pubitemid 127510036)
    • (1997) Machine Learning , vol.29 , Issue.2-3 , pp. 131-163
    • Friedman, N.1    Geiger, D.2    Goldszmidt, M.3
  • 17
    • 22944448429 scopus 로고    scopus 로고
    • Iterative bayes
    • J. Gama, "Iterative Bayes," Intelligent Data Analysis, vol. 4, pp. 475-488, 2000.
    • (2000) Intelligent Data Analysis , vol.4 , pp. 475-488
    • Gama, J.1
  • 18
    • 33646575961 scopus 로고    scopus 로고
    • On optimum choice of k in nearest neighbor classification
    • DOI 10.1016/j.csda.2005.06.007, PII S0167947305001374
    • A.K. Ghosh, "On Optimum Choice of k in Nearest Neighbor Classification," Computational Statistics Data Analysis, vol. 50, no. 11, pp. 3113-3123, 2006. (Pubitemid 43729105)
    • (2006) Computational Statistics and Data Analysis , vol.50 , Issue.11 , pp. 3113-3123
    • Ghosh, A.K.1
  • 19
    • 54349107695 scopus 로고    scopus 로고
    • Choice of neighbor order in nearest-neighbor classification
    • P. Hall, B.U. Park, and R. Samworth, "Choice of Neighbor Order in Nearest-Neighbor Classification," Annals Statistics, vol. 36, no. 5, pp. 2135-2152, 2008.
    • (2008) Annals Statistics , vol.36 , Issue.5 , pp. 2135-2152
    • Hall, P.1    Park, B.U.2    Samworth, R.3
  • 21
    • 0040453788 scopus 로고    scopus 로고
    • Statistical classification methods in consumer credit scoring: A review
    • D.J. Hand and W.E. Henley, "Statistical Classification Methods in Consumer Credit Scoring: A Review," J. Royal Statistical Soc.: Series A, vol. 160, no. 3, pp. 523-541, 1997.
    • (1997) J. Royal Statistical Soc.: Series A , vol.160 , Issue.3 , pp. 523-541
    • Hand, D.J.1    Henley, W.E.2
  • 23
    • 0032355984 scopus 로고    scopus 로고
    • Classification by pairwise coupling
    • T. Hastie and R. Tibshirani, "Classification by Pairwise Coupling," Annals Statistics, vol. 26, no. 2, pp. 451-471, 1998.
    • (1998) Annals Statistics , vol.26 , Issue.2 , pp. 451-471
    • Hastie, T.1    Tibshirani, R.2
  • 25
    • 70349337297 scopus 로고    scopus 로고
    • A novel bayes model: Hidden näve Bayes
    • Oct
    • L. Jiang, H. Zhang, and Z. Cai, "A Novel Bayes Model: Hidden näve Bayes," IEEE Trans. Knowledge Data Eng., vol. 21, no. 10, pp. 1361-1371, Oct. 2009.
    • (2009) IEEE Trans. Knowledge Data Eng , vol.21 , Issue.10 , pp. 1361-1371
    • Jiang, L.1    Zhang, H.2    Cai, Z.3
  • 26
    • 0001972236 scopus 로고    scopus 로고
    • Addressing the curse of imbalanced training sets: One-sided selection
    • M. Kubat and S. Matwin, "Addressing the Curse of Imbalanced Training Sets: One-Sided Selection," Proc. 14th Int'l Conf. Machine Learning, pp. 179-186, 1997.
    • (1997) Proc. 14th Int'l Conf. Machine Learning , pp. 179-186
    • Kubat, M.1    Matwin, S.2
  • 27
    • 33744526493 scopus 로고    scopus 로고
    • Bagging and boosting classification trees to predict churn
    • DOI 10.1509/jmkr.43.2.276
    • A. Lemmens and C. Croux, "Bagging and Boosting Classification Trees to Predict Churn," J. Marketing Research, vol. 43, no. 2, pp. 276-286, 2006. (Pubitemid 43813059)
    • (2006) Journal of Marketing Research , vol.43 , Issue.2 , pp. 276-286
    • Lemmens, A.1    Croux, C.2
  • 30
    • 0024771475 scopus 로고
    • Pattern classification using neural networks
    • Nov
    • R. Lippmann, "Pattern Classification Using Neural Networks," IEEE Commun. Magazine, vol. CM-27, no. 11, pp. 47-64, Nov. 1989.
    • (1989) IEEE Commun. Magazine , vol.CM-27 , Issue.11 , pp. 47-64
    • Lippmann, R.1
  • 31
    • 84945318292 scopus 로고    scopus 로고
    • Class probability estimation and cost-sensitive classification decisions
    • D. Margineantu, "Class Probability Estimation and Cost-Sensitive Classification Decisions," Proc. 13th European Conf. Machine Learning, pp. 270-281, 2002.
    • (2002) Proc. 13th European Conf. Machine Learning , pp. 270-281
    • Margineantu, D.1
  • 32
    • 0004255908 scopus 로고    scopus 로고
    • McGraw Hill
    • T.M. Mitchell, Machine Learning. McGraw Hill, http://www.cs.cmu.edu/tom/ NewChapters.html, 1997.
    • (1997) Machine Learning
    • Mitchell, T.M.1
  • 35
    • 36549012987 scopus 로고    scopus 로고
    • An evaluation of näve bayes variants in content-based learning for spam filtering
    • A.K. Seewald, "An Evaluation of näve Bayes Variants in Content-Based Learning for Spam Filtering," Intelligent Data Analysis, vol. 11, pp. 497-524, 2007.
    • (2007) Intelligent Data Analysis , vol.11 , pp. 497-524
    • Seewald, A.K.1
  • 36
    • 33750689152 scopus 로고    scopus 로고
    • Thresholding for making classifiers cost-sensitive
    • Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06
    • V.S. Sheng and C.X. Ling, "Thresholding for Making Classifiers Cost-Sensitive," Proc. 21st Nat'l Conf. Artificial Intelligence, pp. 476-481, 2006. (Pubitemid 44705329)
    • (2006) Proceedings of the National Conference on Artificial Intelligence , vol.1 , pp. 476-481
    • Sheng, V.S.1    Ling, C.X.2
  • 39
    • 0036565589 scopus 로고    scopus 로고
    • An instance-weighting method to induce cost-sensitive trees
    • DOI 10.1109/TKDE.2002.1000348
    • K.M. Ting, "An Instance-Weighting Method to Induce Cost-Sensitive Trees," IEEE Trans. Knowledge and Data Eng., vol. 14, no. 3, pp. 659-665, May/June 2002. (Pubitemid 34669622)
    • (2002) IEEE Transactions on Knowledge and Data Engineering , vol.14 , Issue.3 , pp. 659-665
    • Ting, K.M.1
  • 44
    • 44649091206 scopus 로고    scopus 로고
    • Instance weighting versus threshold adjusting for cost-sensitive classification
    • H. Zhao, "Instance Weighting versus Threshold Adjusting for Cost-Sensitive Classification," Knowledge Information Systems, vol. 15, pp. 321-334, 2008.
    • (2008) Knowledge Information Systems , vol.15 , pp. 321-334
    • Zhao, H.1
  • 46
    • 31344442851 scopus 로고    scopus 로고
    • Training cost-sensitive neural networks with methods addressing the class imbalance problem
    • DOI 10.1109/TKDE.2006.17
    • Z.-H. Zhou and X.-Y. Liu, "Training Cost-Sensitive Neural Networks with Methods Addressing the Class Imbalance Problem," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp. 63-77, Jan. 2006. (Pubitemid 43145089)
    • (2006) IEEE Transactions on Knowledge and Data Engineering , vol.18 , Issue.1 , pp. 63-77
    • Zhou, Z.-H.1    Liu, X.-Y.2
  • 47
    • 29644438050 scopus 로고    scopus 로고
    • Statistical comparisons of classifiers over multiple data sets
    • J. Demsar, "Statistical Comparisons of Classifiers over Multiple Data Sets," J. Machine Learning Research, vol. 7, pp. 1-30, 2006. (Pubitemid 43022939)
    • (2006) Journal of Machine Learning Research , vol.7 , pp. 1-30
    • Demsar, J.1
  • 48
    • 14944368253 scopus 로고    scopus 로고
    • Customer targeting: A neural network approach guided by genetic algorithms
    • DOI 10.1287/mnsc.1040.0296
    • Y. Kim, N. Street, G. Russell, and F. Menczer, "Customer Targeting: A Neural Network Approach Guided by Genetic Algorithms," Management Science, vol. 51, no. 2, pp. 264-276, 2005. (Pubitemid 40360167)
    • (2005) Management Science , vol.51 , Issue.2 , pp. 264-276
    • Kim, Y.1    Street, W.N.2    Russell, G.J.3    Menczer, F.4
  • 49
    • 14844351034 scopus 로고    scopus 로고
    • Not so naive Bayes: Aggregating one-dependence estimators
    • DOI 10.1007/s10994-005-4258-6
    • G.I. Webb, J.R. Boughton, and Z. Wang, "Not So näve Bayes: Aggregating One-Dependence Estimators," Machine Learning, vol. 58, pp. 5-24, 2005. (Pubitemid 40356736)
    • (2005) Machine Learning , vol.58 , Issue.1 , pp. 5-24
    • Webb, G.I.1    Boughton, J.R.2    Wang, Z.3
  • 53
    • 33847166276 scopus 로고    scopus 로고
    • A decision tree-based attribute weighting filter for naive Bayes
    • DOI 10.1016/j.knosys.2006.11.008, PII S0950705106002000, AI 2006
    • M. Hall, "A Decision Tree-Based Attribute Weighting Filter for näve Bayes," Knowledge-Based Systems, vol. 20, no. 2, pp. 120-126, 2007. (Pubitemid 46282455)
    • (2007) Knowledge-Based Systems , vol.20 , Issue.2 , pp. 120-126
    • Hall, M.1


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