Authors: Masahiro Nagao; Hirohisa Seki
Addresses: Department of Computer Science and Engineering, Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan ' Department of Computer Science and Engineering, Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan
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.
Keywords: multi-relational data mining; MRDM; closed patterns; quantitative association rules; FCA; inductive logic programming; ILP.
International Journal of Computational Intelligence Studies, 2017 Vol.6 No.4, pp.366 - 383
Available online: 23 Jan 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article