An FCA approach to mining quantitative association rules from multi-relational data
by Masahiro Nagao; Hirohisa Seki
International Journal of Computational Intelligence Studies (IJCISTUDIES), Vol. 6, No. 4, 2017

Abstract: In this paper, we propose an algorithm for mining quantitative association rules (ARs) from a multi-relational database (MRDB). A MRDB contains multiple tables (relations), and attributes in a table are either categorical or quantitative (or numerical). To handle numerical data in a pattern, we consider (logical) conjunctions with interval constraints, using the notion of closed interval patterns (CIPs) proposed by Kaytoue et al. in formal concept analysis (FCA). We then present an algorithm for mining strong quantitative ARs, namely they satisfy both a minimum support and a minimum confidence. We also propose a pruning method tailored to computing CIPs in an AR. We give some experimental results, which show the effectiveness of the proposed method, compared with the conventional methods such as a discretisation-based approach or an optimisation-based approach.

Online publication date: Mon, 29-Jan-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Intelligence Studies (IJCISTUDIES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com