Abstract
Abstract The problem of extracting knowledge from decision tables in terms of functional dependencies is one of the important problems in knowledge discovery and data mining. Based on some results in relational database, in this paper we propose two algorithms. The first one is to find all reducts of a consistent decision table. The second is to infer functional dependencies from a consistent decision table. The second algorithm is based on the result of the first. We show that the time complexity of the two algorithms proposed is exponential in the number of attributes in the worst case.
Sign-in/Register to access full text options 
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.
