제어로봇시스템학회:학술대회논문집
- 제어로봇시스템학회 2004년도 ICCAS
- /
- Pages.2029-2032
- /
- 2004
ICAIM;An Improved CAIM Algorithm for Knowledge Discovery
- Yaowapanee, Piriya (Research Center for Communication and Information Technology, Department of Computer Engineering, Faculty of Engineering, King Mongkut's Institue of Technology Ladkrabang) ;
- Pinngern, Ouen (Research Center for Communication and Information Technology, Department of Computer Engineering, Faculty of Engineering, King Mongkut's Institue of Technology Ladkrabang)
- 발행 : 2004.08.25
초록
The quantity of data were rapidly increased recently and caused the data overwhelming. This led to be difficult in searching the required data. The method of eliminating redundant data was needed. One of the efficient methods was Knowledge Discovery in Database (KDD). Generally data can be separate into 2 cases, continuous data and discrete data. This paper describes algorithm that transforms continuous attributes into discrete ones. We present an Improved Class Attribute Interdependence Maximization (ICAIM), which designed to work with supervised data, for discretized process. The algorithm does not require user to predefine the number of intervals. ICAIM improved CAIM by using significant test to determine which interval should be merged to one interval. Our goal is to generate a minimal number of discrete intervals and improve accuracy for classified class. We used iris plant dataset (IRIS) to test this algorithm compare with CAIM algorithm.