Association Rule Mining Based on Multidimensional Pattern Relations

Article Preview

Abstract:

Most incremental mining and online mining algorithms concentrate on finding association rules or patterns consistent with entire current sets of data. Users cannot easily obtain results from only interesting portion of data. This may prevent the usage of mining from online decision support for multidimensional data. To provide adhoc, query driven, and online mining support, we first propose a relation called the multidimensional pattern relation to structurally and systematically store context and mining information for later analysis.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

243-245

Citation:

Online since:

April 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] R. Agrawal, T. Imielinksi, A. Swami, Mining association rules between sets of items in large database, in: ACM SIGMOD Conference, Washington, DC, USA, 1993, p.207–216.

DOI: 10.1145/170036.170072

Google Scholar

[2] R. Agrawal, T. Imielinksi, A. Swami, Database mining: a performance perspective, IEEE Transactions on Knowledge and Data Engineering 5 (6) (1993) 914–925.

DOI: 10.1109/69.250074

Google Scholar

[3] R. Agrawal, R. Srikant, Fast algorithm for mining association rules, in: ACM International Conference on Very Large Data Bases, 1994, p.487–499.

Google Scholar

[4] M.S. Chen, J. Han, P.S. Yu, Data mining: an overview from database perspective, IEEE Transactions on Knowledge and Data Engineering 8 (6) (1996) 866–883.

DOI: 10.1109/69.553155

Google Scholar

[5] J. Han, M. Kamber, Data mining: concepts and techniques, Morgan Kaufmann Publishers, Los Altos, CA, (2001).

Google Scholar