References

Agrawal, R., T. Imielinski and A. Swami, 1993. Mining association rules between sets of items in very large databases[C]. Proceedings of the ACM SIGMOD Conference on Management of Data, May 25-28, 1993, Washington, DC., USA., pp: 207-216.

Ale, J.M. and G.H. Rossi, 2000. An approach to discovering temporal association rules. Proc. ACM Symp. Applied Comput., 1: 294-300.
Direct Link  |  

Chan, K.C.C. and A.K.C. Wong, 1990. APACS: A system for the automatic analysis and classification of conceptual patterns. Comput. Intell., 6: 119-131.
CrossRef  |  Direct Link  |  

Chan, K.C.C. and W.H. Au, 1997. An effective algorithm for mining interesting quantitative association rules. Proceedings of the ACM Symposium on Applied Computing, February 28-March 1, 1997, San Jose, CA., USA., pp: 88-90.

Chen, M.S., J. Han and P.S. Yu, 1996. Data mining: An overview from a database perspective. IEEE Trans. Knowledge Data Eng., 8: 866-883.
CrossRef  |  Direct Link  |  

Han, E.H.S., G. Karypis and V. Kumar, 2000. Scalable parallel data mining for association rules. Trans. Knowl. Data Eng., 12: 728-737.

Han, J., J. Pei and Y. Yin, 2000. Mining frequent patterns without candidate generation. Proceedings of the ACM SIGMOD International Conference on Management of Data, May 15-18, 2000, Dallas, TX., USA., pp: 1-12.

Houtsma, M. and A. Swami, 1993. Set-oriented mining of association rules. Research Report RJ 9567, IBM Almaden Research Center.

Lakshmanan, L.V.S., C.K.S. Leung and R.T. Ng, 2000. The segment support map: Scalable mining of frequent itemsets. ACM SIGKDD Explorations Newsletter, 2: 21-27.
CrossRef  |  Direct Link  |  

Mata, J., J.L. Alvarez and J.C. Riquelme, 2002. Evolutionary computing and optimization: An evolutionary algorithm to discover numeric association rules. Proceedings of the ACM Symposium on Applied Computing, March 2002, Madrid, Spain -.

Natarajan, R. and B. Shekar, 2005. Data Mining (DM): Poster papers: A relatedness-based data-driven approach to determination of interestingness of association rules. Proceedings of the ACM Symposium on Applied Computing, March 13-17, 2005, Santa Fe, NM., USA -.

Park, J.S., M.S. Chen and P.S. Yu, 1997. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowl. Data Eng., 9: 813-825.
CrossRef  |  

Simoff, S.J., C. Djeraba and O.R. Zaiane, 2002. MDM/KDD2002: Multimedia data mining between promises and problems. ACM SIGKDD Explorations Newsletter, 4: 118-121.
CrossRef  |  Direct Link  |  

Srikant, R. and R. Agrawal, 1996. Mining quantitative association rules in large relational tables. Proceedings of the International Conference on Management of Data, June, 1996, New York, USA., pp: 1-12.

Zaki, M.J., M. Ogihara, S. Parthasarathy and W. Li, 1996. Parallel data mining for association rules on shared-memory multi-processors. Proceedings of the ACM/IEEE Conference on Supercomputing, November 17-22, 1996, Pittsburgh, PA., USA -.