On the complexity of inducing categorical and quantitative association rules

Theoretical Computer Science

Volumn 314, Issue 1-2, 2004, Pages 217-249

  Angiulli, Fabrizio ^a   Ianni, Giovambattista ^a   Palopoli, Luigi ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

Author keywords

Computational complexity; Data mining

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER SCIENCE; DATA MINING; DATABASE SYSTEMS; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING;

ASSOCIATION RULES; CLUSTER ANALYSIS;

COMPUTATIONAL COMPLEXITY;

EID: 0842329849     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.12.017     Document Type: Article

References (27)

1. 0 and arithmetic circuits, in: Proc. 12th Ann. IEEE Conf. on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 134-148.
2. R. Agrawal, T. Imielinski, A.N. Swami, Mining association rules between sets of items in large databases, in: Proc. 1993 ACM SIGMOD Internat. Conf. on Management of Data, Washington, DC, ACM Press, New York, 1993, May 26-28, pp. 207-216.
3. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: VLDB'94, Proc. 20th Int. Conf. on Very Large Data Bases, Santiago de Chile, Chile, Morgan Kaufmann, Los Atlos, CA, 1994, September 12-15, pp. 487-499.
4. R. Agrawal, R. Srikant, Mining sequential patterns, in: Proc. 11th Internat. Conf. on Data Engineering, Taipei, Taiwan, IEEE Computer Society, Silver Spring, MD, 1995, March 6-10, pp. 3-14.
5. 0 circuits with negative constants, in: Proc. 23rd Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Springer, Berlin, 1998, pp. 409-417.
6. R.J. Bayardo Jr., R. Agrawal, Mining the most interesting rules, Proc. Fifth ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, San Diego, CA, USA, ACM, New York, 1999, August 15-18, pp. 145-154.
7. R.J. Bayardo Jr., R. Agrawal, D. Gunopulos, Constraint-based rule mining in large, dense databases, in: Proc. 15th Internat. Conf. on Data Engineering, Sydney, Australia, IEEE Computer Society, Silver Spring, MD, 1999, 23-26 March, pp. 188-197.
8. E. Boros, V. Gurvich, L. Khachiyan, K. Makino, On the complexity of generating maximal frequent and minimal infrequent sets, in: STACS: Ann. Symp. on Theoretical Aspects of Computer Science, Springer, Berlin, 2002, pp. 134-141.
9. T. Brijs, G. Swinnen, K. Vanhoof, G. Wets, Using association rules for product assortment decisions: a case study, in: Proc. Fifth ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, ACM Press, New York, 1999, pp. 254-260.
10. Eiter T., Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6):1995;1278-1304.
11. Fayyad U., Piatetsky-Shapiro G., Smyth P., Uthurusamy R. Advances in Knowledge Discovery and Data Mining. 1996;AAAI Press/MIT Press, Cambridge, MA.
12. Fredman M.L., Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms. 21(3):1996;618-628.
13. Fukuda T., Morimoto Y., Morishita S., Tokuyama T. Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization. Jagadish H.V., Mumick I.S. Proc. 1996 ACM SIGMOD Internat. Conf. on Management of Data, Montreal, Quebec, Canada. 1996, June 4-6;13-23 ACM Press, New York.
14. Garey M.R., Johnson D.S. Computers and Intractability; A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman, New York.
15. D. Gunopulos, H. Mannila, S. Saluja, Discovering all most specific sentences by randomized algorithms, in: ICDT'97, Proc. Sixth Internat. Conf., Delphi, Greece, Springer, New York, 1997, January 8-10, pp. 215-229.
16. A. Hajnal, W. Maass, P. Pudlk, M. Szegedy, G. Turan, Threshold circuits of bounded depth, Proc. 28th Ann. IEEE Symp. on Foundations of Computer Science, Los Angeles, USA, 1987, pp. 99-110.
17. J. Han, M. Kamber, Data Mining: Concepts and Techniques, in: J. Gray (Series Editor), The Morgan Kaufmann Series in Data Management Systems, 2000.
18. 1 J. Comput. System Sci. 41(3):1990;274-306.
19. S. Morishita, On classification and regression, Discovery Science, First International Conference (DS'98), Fukuoka, Japan, 1998, pp. 40-57.
20. S. Morishita, J. Sese, Traversing itemset lattice with statistical metric pruning, in: Proc. 19th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems, Dallas, TX, USA, ACM, New York, 2000, May 15-17, pp. 226-236.
21. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
22. Ruzzo W.L. On uniform circuit complexity. J. Comput. System Sci. 22(3):1981;365-383.
23. Srikant R., Agrawal R. Mining quantitative association rules in large relational tables. Jagadish H.V., Mumick I.S. Proc. 1996 ACM SIGMOD Internat. Conf. on Management of Data, Montreal, Quebec, Canada. 1996, June 4-6;1-12 ACM Press, New York.
24. Toivonen H. Sampling large databases for association rules. Vijayaraman T.M., Buchmann A.P., Mohan C., Sarda N.L. VLDB'96, Proc. 22th Internat. Conf. on Very Large Data Bases, Mumbai (Bombay), India. 1996, September 3-6;134-145 Morgan Kaufmann, Los Altos, CA.
25. J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, Elsevier, Amsterdam, MIT Press, Cambridge, MA, 1990.
26. Wijsen J., Meersman R. On the complexity of mining quantitative association rules. Data Mining Knowledge Discovery. 2(3):1998;263-281.
27. M. Zaki, M. Ogihara, Theoretical foundations of association rules, in: Proc. Third SIGMOD'98 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'98), Seattle, Washington, USA, 1998.