Abstract
Attribute reduction is a key problem in the process of data mining and knowledge discovery. Up to now, many attribute reduction algorithms in incomplete decision tables have been proposed. However, the research results related to conditional attributes and reduct of incomplete decision tables are still limited. By relational database approach, this paper investigates some properties of conditional attributes and proposes an algorithm to determine all reductive attributes of consistent incomplete decision tables in polynomial time. The proposed algorithm is an effective tool to eliminate all redundant attributes in data pre-processing in order to improve the efficiency of data mining models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
