메뉴 건너뛰기




Volumn 9, Issue 2, 2006, Pages 157-179

Learning accurate and concise naïve Bayes classifiers from attribute value taxonomies and data

Author keywords

Attribute value taxonomies; AVT based na ve Bayes learner; Partially specified data

Indexed keywords

TAXONOMIES;

EID: 33644505547     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-005-0211-z     Document Type: Article
Times cited : (48)

References (46)
  • 5
    • 0034069495 scopus 로고    scopus 로고
    • Gene ontology: Tool for the unification of biology
    • The Gene Ontology Consortium
    • Ashburner M, et al (2000) Gene ontology: Tool for the unification of biology. The Gene Ontology Consortium. Nat Gen 25:25-29
    • (2000) Nat Gen , vol.25 , pp. 25-29
    • Ashburner, M.1
  • 8
    • 33644538718 scopus 로고    scopus 로고
    • Deduplication and group detection using links
    • KDD workshop on link analysis and group detection, Aug. 2004 Seattle
    • Bhattacharya I, Getoor L (2004) Deduplication and group detection using links. KDD workshop on link analysis and group detection, Aug. 2004. Seattle
    • (2004)
    • Bhattacharya, I.1    Getoor, L.2
  • 9
    • 19544373409 scopus 로고    scopus 로고
    • A framework for learning from distributed data using sufficient statistics and its application to learning decision trees
    • Caragea D, Silvescu A, Honavar V (2004) A framework for learning from distributed data using sufficient statistics and its application to learning decision trees. Int J Hybrid Intell Syst 1:80-89
    • (2004) Int J Hybrid Intell Syst , vol.1 , pp. 80-89
    • Caragea, D.1    Silvescu, A.2    Honavar, V.3
  • 11
    • 0030122846 scopus 로고    scopus 로고
    • Evaluating aggregate operations over imprecise data
    • Chen A, Chiu J, Tseng F (1996) Evaluating aggregate operations over imprecise data. IEEE Trans Knowl Data En 8:273-284
    • (1996) IEEE Trans Knowl Data En , vol.8 , pp. 273-284
    • Chen, A.1    Chiu, J.2    Tseng, F.3
  • 12
    • 84943242305 scopus 로고    scopus 로고
    • Knowledge discovery in multi-label phenotype data
    • Proceedings of the fifth European conference on principles of data mining and knowledge discovery. Springer, Berlin Heidelberg New York
    • Clare A, King R (2001) Knowledge discovery in multi-label phenotype data. In: Proceedings of the fifth European conference on principles of data mining and knowledge discovery. Lecture notes in computer science, vol 2168. Springer, Berlin Heidelberg New York, pp 42-53
    • (2001) Lecture Notes in Computer Science , vol.2168 , pp. 42-53
    • Clare, A.1    King, R.2
  • 14
    • 0024936405 scopus 로고
    • Resolving database incompatibility: An approach to performing relational operations over mismatched domains
    • DeMichiel L (1989) Resolving database incompatibility: An approach to performing relational operations over mismatched domains. IEEE Trans Knowl Data Eng 1:485-493
    • (1989) IEEE Trans Knowl Data Eng , vol.1 , pp. 485-493
    • DeMichiel, L.1
  • 15
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm
    • Dempster A, Laird N, Rubin D (1977) Maximum likelihood from incomplete data via the EM algorithm. J Royal Stat Soc, Series B 39:1-38
    • (1977) J Royal Stat Soc Series B , vol.39 , pp. 1-38
    • Dempster, A.1    Laird, N.2    Rubin, D.3
  • 16
    • 84942916008 scopus 로고    scopus 로고
    • Using feature hierarchies in Bayesian network learning
    • Proceedings of symposium on abstraction, reformulation, and approximation 2000. Springer, Berlin Heidelberg New York
    • desJardins M, Getoor L, Koller D (2000) Using feature hierarchies in Bayesian network learning. In: Proceedings of symposium on abstraction, reformulation, and approximation 2000. Lecture notes in artificial intelligence, vol 1864, Springer, Berlin Heidelberg New York, pp 260-270
    • (2000) Lecture Notes in Artificial Intelligence , vol.1864 , pp. 260-270
    • des Jardins, M.1    Getoor, L.2    Koller, D.3
  • 17
    • 0027805752 scopus 로고
    • Abstract-driven pattern discovery in databases
    • Dhar V, Tuzhilin A (1993) Abstract-driven pattern discovery in databases. IEEE Trans Knowl Data Eng 5:926-938
    • (1993) IEEE Trans Knowl Data Eng , vol.5 , pp. 926-938
    • Dhar, V.1    Tuzhilin, A.2
  • 18
    • 0031269184 scopus 로고    scopus 로고
    • On the optimality of the simple Bayesian classifier under zero-one loss
    • Domingos P, Pazzani M (1997) On the optimality of the simple Bayesian classifier under zero-one loss. Mach Learn 29:103-130
    • (1997) Mach Learn , vol.29 , pp. 103-130
    • Domingos, P.1    Pazzani, M.2
  • 21
    • 0024082469 scopus 로고    scopus 로고
    • Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
    • Haussler D (1998) Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. Artif Intell 36:177-221
    • (1998) Artif Intell , vol.36 , pp. 177-221
    • Haussler, D.1
  • 22
    • 0003471413 scopus 로고    scopus 로고
    • Advances in high performance knowledge representation
    • University of Maryland Institute for Advanced Computer Studies, Dept. of Computer Science, Univ. of Maryland, July 1996. CS-TR-3672 (Also cross-referenced as UMIACS-TR-96-56)
    • Hendler J, Stoffel K, Taylor M (1996) Advances in high performance knowledge representation. University of Maryland Institute for Advanced Computer Studies, Dept. of Computer Science, Univ. of Maryland, July 1996. CS-TR-3672 (Also cross-referenced as UMIACS-TR-96-56)
    • (1996)
    • Hendler, J.1    Stoffel, K.2    Taylor, M.3
  • 24
    • 0012307201 scopus 로고    scopus 로고
    • Improving simple Bayes
    • Tech. Report, Data mining and visualization group, Silicon Graphics Inc
    • Kohavi R, Becker B, Sommerfield D (1997) Improving simple Bayes. Tech. Report, Data mining and visualization group, Silicon Graphics Inc.
    • (1997)
    • Kohavi, R.1    Becker, B.2    Sommerfield, D.3
  • 25
    • 23044521957 scopus 로고    scopus 로고
    • Applications of data mining to electronic commerce Data
    • Kohavi R, Provost P (2001) Applications of data mining to electronic commerce. Data Min Knowl Discov 5:5-10
    • (2001) Min Knowl Discov , vol.5 , pp. 5-10
    • Kohavi, R.1    Provost, P.2
  • 26
    • 3242806004 scopus 로고    scopus 로고
    • Lessons and challenges from mining retail E-commerce data. Special Issue: Data mining lessons learned
    • Kohavi R, Mason L, Parekh R, Zheng Z (2004) Lessons and challenges from mining retail E-commerce data. Special Issue: Data mining lessons learned. Mach Learn 57:83-113
    • (2004) Mach Learn , vol.57 , pp. 83-113
    • Kohavi, R.1    Mason, L.2    Parekh, R.3    Zheng, Z.4
  • 30
    • 0035518032 scopus 로고    scopus 로고
    • Aggregation of imprecise and uncertain information in databases
    • McClean S, Scotney B, Shapcott M (2001) Aggregation of imprecise and uncertain information in databases. IEEE Trans Know Data Eng 13:902-912
    • (2001) IEEE Trans Know Data Eng , vol.13 , pp. 902-912
    • McClean, S.1    Scotney, B.2    Shapcott, M.3
  • 32
    • 0026154832 scopus 로고
    • The use of background knowledge in decision tree induction
    • Núñez M (1991) The use of background knowledge in decision tree induction. Mach Learn 6:231-250
    • (1991) Mach Learn , vol.6 , pp. 231-250
    • Núñez, M.1
  • 33
    • 8844261754 scopus 로고
    • The role of prior knowledge in inductive learning
    • Pazzani M, Kibler D (1992) The role of prior knowledge in inductive learning. Mach Learn 9:54-97
    • (1992) Mach Learn , vol.9 , pp. 54-97
    • Pazzani, M.1    Kibler, D.2
  • 36
    • 0003500248 scopus 로고
    • C4.5: Programs for machine learning
    • Morgan Kaufmann, San Mateo, CA
    • Quinlan JR (1993) C4.5: Programs for machine learning. Morgan Kaufmann, San Mateo, CA
    • (1993)
    • Quinlan, J.R.1
  • 37
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • Rissanen J (1978) Modeling by shortest data description. Automatica 14:37-38
    • (1978) Automatica , vol.14 , pp. 37-38
    • Rissanen, J.1
  • 38
    • 0002096830 scopus 로고    scopus 로고
    • Document clustering using word clusters via the information bottleneck method
    • Slonim N, Tishby N (2000) Document clustering using word clusters via the information bottleneck method. ACM SIGIR 2000. pp 208-215
    • (2000) ACM SIGIR 2000 , pp. 208-215
    • Slonim, N.1    Tishby, N.2
  • 39
    • 33646521672 scopus 로고    scopus 로고
    • Ontology-based induction of high level classification rules
    • SIGMOD data mining and knowledge discovery workshop Tuscon, Arizona
    • Taylor M, Stoffel K, Hendler J (1997) Ontology-based induction of high level classification rules. SIGMOD data mining and knowledge discovery workshop, Tuscon, Arizona
    • (1997)
    • Taylor, M.1    Stoffel, K.2    Hendler, J.3
  • 40
    • 0028529307 scopus 로고
    • Knowledge-based artificial neural networks
    • Towell G, Shavlik J (1994) Knowledge-based artificial neural networks. Artif Intell 70:119-165
    • (1994) Artif Intell , vol.70 , pp. 119-165
    • Towell, G.1    Shavlik, J.2
  • 41
    • 19544387383 scopus 로고    scopus 로고
    • A target centric ontology for intrusion detection: Using DAML+OIL to classify intrusive behaviors
    • January 2004, Cambridge University Press
    • Undercoffer J, et al (2004) A target centric ontology for intrusion detection: Using DAML+OIL to classify intrusive behaviors. Knowledge Engineering Review - Special Issue on Ontologies for Distributed Systems, January 2004, Cambridge University Press
    • (2004) Knowledge Engineering Review - Special Issue on Ontologies for Distributed Systems
    • Undercoffer, J.1
  • 44
    • 62649104314 scopus 로고    scopus 로고
    • Ontology-driven induction of decision trees at multiple levels of abstraction
    • Proceedings of symposium on abstraction, reformulation, and approximation 2002. Springer, Berlin Heidelberg New York
    • Zhang J, Silvescu A, Honavar V (2002) Ontology-driven induction of decision trees at multiple levels of abstraction. In: Proceedings of symposium on abstraction, reformulation, and approximation 2002. Lecture notes in artificial intelligence, vol 2371. Springer, Berlin Heidelberg New York, pp 316-323
    • (2002) Lecture Notes in Artificial Intelligence , vol.2371 , pp. 316-323
    • Zhang, J.1    Silvescu, A.2    Honavar, V.3
  • 46
    • 19544364846 scopus 로고    scopus 로고
    • AVT-NBL: An algorithm for learning compact and accurate naive Bayes classifiers from attribute value taxonomies and data
    • IEEE Computer Society
    • Zhang J, Honavar V (2004) AVT-NBL: An algorithm for learning compact and accurate naive Bayes classifiers from attribute value taxonomies and data. In: Proceedings of the fourth IEEE international conference on data mining. IEEE Computer Society, pp 289-296
    • (2004) Proceedings of the Fourth IEEE International Conference on Data Mining , pp. 289-296
    • Zhang, J.1    Honavar, V.2


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