113
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

Knowledge discovery in data sets with graded attributes

Pages 232-249 | Received 15 Jun 2014, Accepted 23 Dec 2014, Published online: 16 Sep 2015
 

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.

Notes

No potential conflict of interest was reported by the author.

1 We used Conexp-clj for the computation of the L-concepts. The freeware is available at https://github.com/exot/conexp-clj.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.