Representation of approximate functional dependencies using partitions, discernibility matrix and association rules
Keywords:Approximate Functional Dependencies, association rules.
AbstractApproximate Functional Dependencies (AFD) and Association Rules are really meaningful knowledge in data mining. In this article, we first recall some basic concepts of rough set theory, error measures \(g_1\), \(g_2\) and \(g_3\) for functional dependencies. Then, based on the method of partitions and expectation in probability theory, we propose an error measure \(g_4\) to construct the discernibility matrix in a different way, defined error measures \(g_1\), \(g_2\), dependency degree \(\gamma\) and significance of Attributes \(\sigma\) from the discernibility matrix. Finally, a relationship between AFD and Association Rules via error measure \(g_4\) and confidence is presented.
Metrics Loading ...
How to Cite
T. D. Anh, “Representation of approximate functional dependencies using partitions, discernibility matrix and association rules”, JCC, vol. 30, no. 2, pp. 163–176, Jun. 2014.
License1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.
2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.