ROUGH SET-BASED DECISION TREE USING A CORE ATTRIBUTE

DOI10.1142/S0219622008002946zbMath1161.68720OpenAlexW2109871244MaRDI QIDQ3520419

Sang-Wook Han, Jae-Yearn Kim

Publication date: 26 August 2008

Published in: International Journal of Information Technology & Decision Making (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219622008002946

zbMATH Keywords

discernibility matrixdecision tree classification algorithmIterative Dichotomiser

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

ADAPTIVE DATA MINING APPROACH FOR FLOW REDIRECTION IN MULTIHOMED MOBILE ROUTER ⋮ ON DOMINANCE RELATIONS IN DISJUNCTIVE SET-VALUED ORDERED INFORMATION SYSTEMS

Uses Software

• C4.5

Cites Work

• COMPARISON OF INTERESTINGNESS MEASURES FOR WEB USAGE MINING: AN EMPIRICAL STUDY
• Rough sets

This page was built for publication: ROUGH SET-BASED DECISION TREE USING A CORE ATTRIBUTE