By Topic

The Study on Data Mining Methods Based on Rough Set Theory and CART for Incomplete Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lei Hongyan ; Sch. of Comput. Sci. & Technol., Hunan Univ. of Arts & Sci., Changde, China ; Tian Wanglan ; Zou Hanbin

Many real-life data sets are incomplete, i.e., some attribute values are missing. Mining incomplete data sets is truly challenging. Among many methods of handling missing attribute values applied in data mining. We will discuss two approaches: rough sets combined with rule induction and the CART system based on surrogate splits. The main objective of this paper is to compare, through experiments, the quality of rough set approaches to missing attribute values with the well-known CART approach. In our experiments we used only lost value interpretation of missing attribute values.

Published in:

Circuits, Communications and System (PACCS), 2011 Third Pacific-Asia Conference on

Date of Conference:

17-18 July 2011