Abstract
We present a knowledge discovery method for graded attributes that is based on an interactive determination of implications (if-then-rules) holding between the attributes of a given data-set. The corresponding algorithm queries the user in an efficient way about implications between the attributes. The result of the process is a representative set of examples for the entire theory and a set of implications from which all implications that hold between the attributes can be deduced. In many instances, the exploration process may be shortened by the usage of the user’s background knowledge. That is, a set of of implications the user knows beforehand. The method was successfully applied in different real-life applications for discrete data. In this paper, we show that attribute exploration with background information can be generalized for graded attributes.
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.
