Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17]

Journal of Information Science and Engineering, Vol. 31 No. 6, pp. 1849-1865 (November 2015)


Mining Non-Redundant Inter-Transaction Rules*


CHUN-SHENG WANG
Department of Information Management
Jinwen University of Science and Technology
New Taipei City, 231 Taiwan

Inter-transaction pattern and rule mining has been the subject of active research and has potential application in many areas. All the previous inter-transaction rule mining studies proposed generating a full set of inter-transaction rules (i.e., all frequent and confident rules) from a full set of inter-transaction patterns (i.e., all frequent patterns). However, generating a full set inter-transaction rules can be very expensive. In this paper, to resolve the explosive growth of inter-transaction rules, we propose a new research of mining non-redundant inter-transaction rules. We investigate and characterize non-r edundant inter-transaction rules, study the quality inter-transaction rule sets with respect to completeness and tightness. We develop an algorithm named NRITR-Miner to mine the non-redundant inter-transaction rules efficiently and an algorithm named ITR-Miner to mine the full-set of inter-transaction rules for comparing purpose. We demonstrate via experiments that the proposed algorithm is efficient and scalable, and outperform the compared algorithm in all cases.

Keywords: association rules, closed pattern, data mining, inter-transaction pattern, intertransaction rules, non-redundant rules

Full Text () Retrieve PDF document (201511_02.pdf)

Received July 24, 2014; revised September 29, 2014 & March 18, 2015; accepted March 26, 2015.
Communicated by Hsuan-Tien Lin.
* This work was supported by the Ministry of Science and Technology, Taiwan under Grant No. NSC 102-2410- H-228-002.