Twain: Two-end association miner with precise frequent exhibition periods

ACM Transactions on Knowledge Discovery from Data

Volumn 1, Issue 2, 2007, Pages

  Huang, Jen Wei ^a   Dai, Bi Ru ^b   Chen, Ming Syan ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Association; Temporal

Indexed keywords

ASSOCIATION RULES; DATABASE SYSTEMS; MATHEMATICAL MODELS; TIME VARYING SYSTEMS;

EXHIBITION PERIODS; LIMITED PRACTICABILITY;

DATA MINING;

EID: 34548222585     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1267066.1267069     Document Type: Article

References (46)

1. AGARWAL, R., AGGARWAL, C., AND PRASAD, V. 2000. A tree projection algorithm for generation of frequent itemsets. J. Para. Distrib. Comput. (Special Issue on High Performance Data Mining).
2. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, ACM, New York, 207-216.
3. AGRAWAL, R. AND SRIKANT, R. 1994. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, 478-499.
4. ALE, J. AND ROSSI, G. 2000. An approach to discovering temporal association rules. In Proceedings of the ACM Symposium on Applied Computing 1, ACM, New York, 294-300.
5. AYAD, A. M., EL-MAKKY, N. M., AND TAHA, Y. 2001. Incremental mining of constrained association rules. In Proceedings of the 1st ACM-SIAM Conference on Data Mining. ACM, New York.
6. BESEMANN, C. AND DENTON, A. 2005. Integration of profile hidden Markov model output into association rule mining. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, ACM, New York, 538-543.
7. BETTINI, C., WANG, X., AND JAJODIA, S. 1998. Mining temporal relationships with multiple granularities in time sequences. Bulle. IEEE Comput. Soc. Tech. Comm. Data Eng..
8. BLANCHARD, J., GUILLET, F., GRAS, R., AND BRIAND, H. 2005. Using information-theoretic measures to assess association rule interestingness. In Proceedings of the 5th IEEE International Conference on Data Mining. IEEE Computer Society Press, Los Alamitos, CA.
9. CHANG, C.-Y., CHEN, M.-S., AND LEE, C.-H. 2002. Mining general temporal association rules for items with different exhibition periods. In Proceedings of the 2nd IEEE International Conference on Data Mining. IEEE Computer Society Press, Los Alamitos, CA.
10. CHEN, J., HE, H., WILLIAMS, G., AND JIN, H. 2004. Temporal sequence associations for rare events. In Proceedings of the 8th Pacific Asia Conference on Knowledge Discovery and Data Mining.
11. CHEN, X. AND PETR, I. 2000. Discovering temporal association rules: algorithms, language and system. In Proceedings of the 16th IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
12. CHEN, X., PETROUNIAS, I., AND HEATHFIELD, H. 1998. Discovery of association rules in temporal databases. In Proceedings of the Issues and Applications of Database Technology.
13. COHEN, E., DATARY, M., FUJIWARAZ, S., GIONISX, A., INDYK, P., MOTWANIK, R., ULLMAN, J. D., AND YANGYY, C. 2001. Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng., 64-78.
14. HAN, J. AND FU, Y. 1995. Discovery of multiple-level association rules from large databases. In Proceedings of the 21th International Conference on Very Large Data Bases, 420-431.
15. HAN, J. AND KAMBER, M. 2000. Data Mining: Concepts and Techniques. Morgan-Kaufmann. San Francisco, CA.
16. HAN, J. AND PEI, J. 2000. Mining frequent patterns by pattern-growth: Methodology and implications. ACM SIGKDD Explorations (Special Issue on Scaleble Data Mining Algorithms). ACM, New York.
17. HAN, J., PEI, J., MORTAZAVI-ASL, B., CHEN, Q., DAYAL, U., AND HSU, M.-C. 2000a. FreeSpan: Frequent pattern-projected sequential pattern mining. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York. 355-359.
18. HAN, J., PEI, J., AND YIN, Y. 2000b. Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, ACM, New York. 486-493.
19. HARMS, S. K. AND DEOGUN, J. S. 2004. Sequential association rule mining with time lags. Journal of Intelligent Informatics Systems.
20. JIANG, N. AND GRUENWALD, L. 2006. An efficient algorithm to mine online data streams. In Proceedings of the 2006 KDD TDM Workshop.
21. KE, Y., CHENG, J., AND NG, W. 2006. MIC framework: An information-theoretic approach to quantitative association rule mining. In Proceedings of the 22nd IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
22. KIFER, D., BUCILA, C., GEHRKE, J., AND WHITE, W. 2002. DualMiner: A dual-pruning algorithm for itemsets with constraints. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York.
23. LAKSHMANAN, L., NG, R., HAN, J., AND PANG, A. 1998. Exploratory mining and pruning optimization of constrained associations rules. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. ACM, New York.
24. LAKSHMANAN, L. V. S., NG, R., HAN, J., AND PANG, A. 1999. Optimization of constrained frequent set queries with 2-variable constraints. In Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, ACM, New York. 157-168.
25. LEE, C.-H., CHEN, M.-S., AND LIN, C.-R. 2003. Progressive partition miner: An efficient algorithm for mining general temporal association rules. IEEE Trans. Knowl. Data Eng. 15, 4 (Aug.), 1004-1017.
26. LEE, C.-H., LIN, C.-R., AND CHEN, M.-S. 2001a. On mining general temporal association rules in a publication database. In Proceedings of the 1st IEEE International Conference on Data Mining. (Nov.). IEEE Computer Society Press, Los Alamitos, CA.
27. LEE, C.-H., LIN, C.-R., AND CHEN, M.-S. 2001b. Sliding-window filtering: An efficient algorithm for incremental mining. In Proceedings of the 10th ACM International Conference on Information and Knowledge Management. ACM, New York.
28. LIN, J.-L. AND DUNHAM, M. 1998. Mining association rules: Anti-skew algorithms. In Proceedings of the 14th IEEE International Conference on Data Engineering, IEEE Computer Society Press, Los Alamitos, CA. 486-493.
29. LIU, B., HSU, W., AND MA, Y. 1999. Mining association rules with multiple minimum supports. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York.
30. MUELLER, A. 1995. Fast sequential and parallel algorithms for association rule mining: A comparison. Tech. Rep. CS-TR-3515, Dept. of Computer Science, Univ. of Maryland, College Park, MD.
31. MUHONEN, B. G. J. AND TOIVONEN, H. 2005. Mining non-derivable association rules. In Proceedings of the 5th ACM SIAM Conference on Data Mining. ACM, New York.
32. NG, R. AND HAN, J. 1994. Efficient and effective clustering methods for spatial data mining. In Proceedings of the 20th International Conference on Very Large Data Bases, 144-155.
33. PARK, J.-S., CHEN, M.-S., AND YU, P. S. 1997. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowl. Data Eng. 9, 5 (Oct.), 813-825.
34. PEI, J. AND HAN, J. 2000. Can we push more constraints into frequent pattern mining? In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York.
35. PEI, J., HAN, J., MORTAZAVI-ASL, B., PINTO, H., CHEN, Q., DAYAL, U., AND HSU, M.-C. 2001. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of the 17th IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
36. SAVASERE, A., OMIECINSKI, E., AND NAVATHE, S. 1995. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21th International Conference on Very Large Data Bases, 432-444.
37. SRIKANT, R. AND AGRAWAL, R. 1995. Mining generalized association rules. In Proceedings of the 21th International Conference on Very Large Data Bases. 407-419.
38. SRIKANT, R. AND AGRAWAL, R. 1996. Mining quantitative association rules in large relational tables. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. ACM, New York.
39. STEINBACH, M., TAN, P.-N., AND KUMAR, V. 2005. Support envelopes: A technique for exploring the structure of association patterns. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. ACM, New York.
40. SZYMON AND JAROSZEWICZ. 2006. Polynomial association rules with applications to logistic regression. In Proceedings of the list ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. ACM, New York.
41. TANSEL, A. AND AYAN, N. 1998. Discovery of association rules in temporal databases. In Proceedings of the AAAI on Knowledge Discovery in Databases.
42. TOIVONEN, H. 1996. Sampling large databases for association rules. In Proceedings of the 22nd International Conference on Very Large Data Bases, 134-145.
43. WANG, K., HE, Y., AND HAN, J. 2000. Mining frequent itemsets using support constraints. In Proceedings of the 26th International Conference on Very Large Data Bases.
44. MUAN-HIEU, P., LE-MINH, N., TU-BAO, H., AND SUSUMU, H. 2005. Improving discriminative sequential learning with rare-but-important associations. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. ACM, New York.
45. YANG, C., FAYYAD, U., AND BRADLEY, P. 2001. Efficient discovery of error-tolerant frequent item-sets in high dimensions. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. ACM, New York.
46. ZHENG, Z., KOHAVI, R., AND MASON, L. 2001. Real world performance of association rule algorithms. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, F. Provost and R. Srikant, Eds. ACM, New York. 401-406.