Mining association rules with multi-dimensional constraints

Journal of Systems and Software

Volumn 79, Issue 1, 2006, Pages 79-92

  Lee, Anthony J T ^a   Lin, Wan Chuen ^a   Wang, Chun Sheng ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Association rule; Constraint based mining; Data mining

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS;

APRIORI PROPERTY; ASSOCIATION RULE; CONSTRAINT-BASED MINING; SINGLE ATTRIBUTE VALUE;

DATA MINING;

EID: 31044435307     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2005.03.005     Document Type: Article

References (15)

1. Agrawal, R., Imielinski, T., Swami, A., 1993. Mining association rules between sets of items in large databases. In: Proceedings of ACM-SIGMOD, pp. 207-216.
2. Agrawal, R., Srikant, R., 1994. Fast algorithms for mining association rules. In: Proceedings of International Conference on Very Large Data Bases, pp. 487-499.
3. Agrawal, R., Srikant, R., 1995. Mining sequential patterns, In: Proceedings of IEEE International Conference on Data Engineering, pp. 3-14.
4. Boulicaut, J.-F., Jeudy, B., 2000. Using constraint for set mining: should we prune or not? In: Proceedings of Bases de Donn'ees Avanc'ees, pp. 221-237.
5. Bucila, C., Gehrke, J., Kifer, D., White, W., 2002. DualMiner: a dual-pruning algorithm for itemsets with constraints. In: Proceedings of ACM International Conference on Knowledge Discovery and Data Mining, pp. 42-51.
6. Gade, K., Wang, J., Karypis, G., 2004. Efficient closed pattern mining in the presence of tough block constraints. In: Proceedings of ACM International Conference on Knowledge Discovery and Data Mining, pp. 138-147.
7. Grahne, G., Lakshmanan, L.V.S., Wang, X., 2000. Efficient mining of constrained correlated sets. In: Proceedings of IEEE International Conference on Data Engineering, pp. 512-521.
8. Han, J., Dong, G., Yin, Y., 1999. Efficient mining of partial periodic patterns in time series database. In: Proceedings of IEEE International Conference Data Engineering, pp. 106-115.
9. Han, J., Pei, J., Yin, Y., 2000. Mining frequent patterns without candidate generation. In: Proceedings of ACM-SIGMOD, pp. 1-12.
10. Kifer, D., Gehrke, J., Bucila, C., White, W., 2003. How to quickly find a witness. In: Proceedings of ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 272-283.
11. A.J.T. Lee, and Y.T. Wang Efficient data mining for calling path patterns in GSM networks Information Systems 28 8 2003 929 948
12. Ng, R., Lakshmanan, L.V.S., Han, J., Pang, A., 1998. Exploratory mining and pruning optimizations of constrained association rules. In: Proceedings of ACM-SIGMOD, pp. 13-24.
13. Pei, J., Han, J., 2000. Can we push more constraints into frequent pattern mining? In: Proceedings of ACM International Conference on Knowledge Discovery and Data Mining, 350-354.
14. Pei, J., Han, J., Lakshmanan, L.V.S., 2001. Mining frequent itemsets with convertible constraints. In: Proceedings of IEEE International Conference on Data Engineering, pp. 433-442.
15. Srikant, R., Vu, Q., Agrawal, R., 1997. Mining association rules with item constraints. In: Proceedings of ACM International Conference on Knowledge Discovery and Data Mining, pp. 67-73.