메뉴 건너뛰기




Volumn 35, Issue , 2012, Pages 49-63

Computationally efficient induction of classification rules with the PMCRI and J-PMCRI frameworks

Author keywords

J PMCRI; Modular classification rule induction; Parallel computing; Parallel rule induction; PMCRI; Prism

Indexed keywords

ALTERNATIVE APPROACH; CLASSIFICATION RULES; COMPUTATIONALLY EFFICIENT; COMPUTING TECHNOLOGY; DATA MINING TECHNOLOGY; DIVIDE-AND-CONQUER APPROACH; J-PMCRI; LARGE AMOUNTS OF DATA; LARGE DATABASE; PARALLELISATION; PMCRI; RULE INDUCTION; TOPDOWN;

EID: 84866513770     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2012.04.014     Document Type: Article
Times cited : (21)

References (38)
  • 4
    • 84866503800 scopus 로고    scopus 로고
    • The evolving universe
    • A. Szalay The Evolving Universe ASSL 231 1998
    • (1998) ASSL , vol.231
    • Szalay, A.1
  • 6
    • 33744584654 scopus 로고
    • Induction of decision trees
    • R.J. Quinlan Induction of decision trees Machine Learning 1 1986 81 106
    • (1986) Machine Learning , vol.1 , pp. 81-106
    • Quinlan, R.J.1
  • 13
    • 31444437725 scopus 로고    scopus 로고
    • Inducer: A public domain workbench for data mining
    • M.A. Bramer Inducer: a public domain workbench for data mining International Journal of Systems Science 36 2005 909 919
    • (2005) International Journal of Systems Science , vol.36 , pp. 909-919
    • Bramer, M.A.1
  • 14
    • 84857372863 scopus 로고    scopus 로고
    • Ph.D. thesis, University of Portsmouth
    • F. Stahl, Parallel Rule Induction, Ph.D. thesis, University of Portsmouth, 2009.
    • (2009) Parallel Rule Induction
    • Stahl, F.1
  • 15
    • 0008779286 scopus 로고    scopus 로고
    • Automatic induction of classification rules from examples using N-prism
    • Springer-Verlag Cambridge
    • M.A. Bramer Automatic induction of classification rules from examples using N-prism Research and Development in Intelligent Systems vol. XVI 2000 Springer-Verlag Cambridge 99 121
    • (2000) Research and Development in Intelligent Systems , vol.16 , pp. 99-121
    • Bramer, M.A.1
  • 17
    • 8844251019 scopus 로고    scopus 로고
    • An information-theoretic approach to the pre-pruning of classification rules
    • B.N. M Musen, R. Studer, Kluwer
    • M.A. Bramer An information-theoretic approach to the pre-pruning of classification rules B.N. M Musen, R. Studer, Intelligent Information Processing 2002 Kluwer 201 212
    • (2002) Intelligent Information Processing , pp. 201-212
    • Bramer, M.A.1
  • 21
    • 70350240003 scopus 로고    scopus 로고
    • PMCRI: A parallel modular classification rule induction framework
    • Springer
    • F. Stahl, M.A. Bramer, and M. Adda PMCRI: A parallel modular classification rule induction framework MLDM 2009 Springer 148 162
    • (2009) MLDM , pp. 148-162
    • Stahl, F.1    Bramer, M.A.2    Adda, M.3
  • 23
    • 0002917243 scopus 로고
    • Blackboard systems
    • D. Corkill Blackboard systems AI Expert 6 1991 40 47
    • (1991) AI Expert , vol.6 , pp. 40-47
    • Corkill, D.1
  • 24
  • 25
    • 0003408496 scopus 로고    scopus 로고
    • Technical Report, University of California, Irvine, Department of Information and Computer Sciences
    • C.L. Blake, C.J. Merz, UCI Repository of Machine Learning Databases, Technical Report, University of California, Irvine, Department of Information and Computer Sciences, 1998.
    • (1998) UCI Repository of Machine Learning Databases
    • Blake, C.L.1    Merz, C.J.2
  • 31
    • 84857361640 scopus 로고    scopus 로고
    • Jmax-pruning: A facility for the information theoretic pruning of modular classification rules
    • F. Stahl, and M. Bramer Jmax-pruning: a facility for the information theoretic pruning of modular classification rules Knowledge-Based Systems 29 0 2012 12 19
    • (2012) Knowledge-Based Systems , vol.29 , Issue.0 , pp. 12-19
    • Stahl, F.1    Bramer, M.2
  • 32
    • 0036643222 scopus 로고    scopus 로고
    • Using J-pruning to reduce overfitting in classification trees
    • DOI 10.1016/S0950-7051(01)00163-0, PII S0950705101001630
    • M. Bramer Using J-pruning to reduce overfitting in classification trees Knowledge-Based Systems 15 5-6 2002 301 308 (Pubitemid 34302699)
    • (2002) Knowledge-Based Systems , vol.15 , Issue.5-6 , pp. 301-308
    • Bramer, M.1
  • 33
    • 84855917673 scopus 로고    scopus 로고
    • Improving the scalability of ILP-based multi-relational concept discovery system through parallelization
    • A. Mutlu, P. Senkul, and Y. Kavurucu Improving the scalability of ILP-based multi-relational concept discovery system through parallelization Knowledge-Based Systems 27 0 2012 352 368
    • (2012) Knowledge-Based Systems , vol.27 , Issue.0 , pp. 352-368
    • Mutlu, A.1    Senkul, P.2    Kavurucu, Y.3
  • 34
    • 84866494928 scopus 로고    scopus 로고
    • visited 08.11
    • http://hadoop.apache.org/ (visited 08.11).
  • 35
    • 84866503107 scopus 로고    scopus 로고
    • visited 12.11
    • http://www.cs.waikato.ac.nz/ml/weka/ (visited 12.11).
  • 38
    • 84949759783 scopus 로고    scopus 로고
    • Using J-pruning to reduce overfitting of classification rules in noisy domains
    • Springer-Verlag
    • M. Bramer Using J-pruning to reduce overfitting of classification rules in noisy domains DEXA - Database and Expert Systems Applications 2002 Springer-Verlag 433 442
    • (2002) DEXA - Database and Expert Systems Applications , pp. 433-442
    • Bramer, M.1


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