Finding the most interesting correlations in a database: How hard can it be?

Information Systems

Volumn 30, Issue 1, 2005, Pages 21-46

  Jermaine, Christopher ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; DATA MINING; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; STATISTICAL METHODS; THEOREM PROVING;

ASSOCIATION RULE (AR); ATTRIBUTES; CORRELATION METRICS; STATISTICAL FUNCTION;

DATABASE SYSTEMS;

EID: 4644372684     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2003.08.004     Document Type: Article

References (32)

1. K. Fujisawa, Y. Hamuro, N. Katoh, T. Tokuyama, K. Yada, Approximation of optimal two-dimensional association rules for categorical attributes using semidefinite programming, Discovery Science, Second International Conference (DS '99), Tokyo, Japan, December 1999, pp. 148-159.
2. K.S. Beyer, R. Ramakrishnan, Bottom-up computation of sparse and iceberg CUBEs, SIGMOD 1999, Proceedings of the ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, USA, June 1-3, 1999, pp. 359-370.
3. J. Gray, A. Bosworth, A. Layman, H. Pirahesh, Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-total, Proceedings of the 12th International Conference on Data Engineering, IEEE Computer Society, New Orleans, Louisiana, February 26-March 1, 1996, pp. 152-159.
4. R. Agrawal, T. Imielinski, A.N. Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SlGMOD International Conference on Management of Data, Washington, DC, May 26-28, 1993, pp. 207-216.
5. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94), Santiago de Chile, Chile, September 12-15, 1994, pp. 487-499.
6. J. Han, J. Pei, G. Dong, K. Wang, Efficient computation of iceberg cubes with complex measures, SIGMOD Conference 2001, Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, USA, May 21-24, 2001.
7. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J.D. Ullman, C. Yang, Finding interesting associations without support pruning, Proceedings of the 16th International Conference on Data Engineering, San Diego, CA, USA, 28 February-3 March, 2000, pp. 489-499.
8. S. Brin, R. Motwani, C. Silverstein, Beyond market baskets: generalizing association rules to correlations, Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, AZ, USA, May 13-15, 1997, pp. 265-276.
9. Citeseer: Scientific Literature Digital Library; http://citeseer.nj.nec.com/cs/.
10. DBLP Most Referenced; http://www.acm.org/sigmod/dblp/db/about/top.html.
11. S. Chakrabarti, S. Sarawagi, B. Dom, Mining surprising patterns using temporal description length, Proceedings of the 24th International Conference on Very Large Data Bases, New York City, NY, USA, August 24-27, 1998, pp. 606-617.
12. B. Padmanabhan, A. Tuzhilin, Small is beautiful: discovering the minimal set of unexpected patterns, Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, August 20-23, 2000, pp. 54-63.
13. B. Padmanabhan, A. Tuzhilin, A belief-driven method for discovering unexpected patterns, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, New York City, NY, USA, August 27-31, 1998, pp. 94-100.
14. S. Sarawagi, Explaining differences in multidimensional aggregates, Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, UK, September 7-10, 1999, pp. 42-53.
15. R.J. Bayardo Jr., Efficiently mining long patterns from databases, SIGMOD 1998, Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, June 2-4 1998, pp. 85-93.
16. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, TX, USA, May 16-18, 2000, pp. 1-12.
17. R.J. Bayardo Jr., R. Agrawal, Mining the most interesting rules, Proceedings of the Fifth ACM S1GKDD International Conference on Knowledge Discovery and Data Mining (KDD 1999), San Diego, CA, USA, August 15-18, 1999, pp. 145-154.
18. G.I. Webb, Efficient search for association rules, Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2000), Boston, MA, USA, August 20-23, 2000, pp. 99-107.
19. S. Morishita, J. Sese, Traversing itemset lattice with statistical metric pruning, Proceedings of the 19th ACM S1GMOD-SIGACT-S1GART Symposium on Principles of Database Systems (PODS 2000), Dallas, TX, USA, May 15-17, 2000, pp. 226-236.
20. M. Reisner, Cadillac desert: the American west and its disappearing water, Penguin USA (Paper), Revised edition, June 1993.
21. R. Peters, The maximum edge biclique problem is NP-complete, Tilburg University, Faculty of Economics and Business Administration Research Memorandum: RePEc:dgr:kubrem:2000789.
22. D. Gunopulos, H. Mannila, S. Saluja, Discovering all most specific sentences by randomized algorithms, Database Theory - ICDT '97, Sixth International Conference, Delphi, Greece, January 8-10, 1997, pp. 215-229.
23. Johnson D.S. The NP-completeness column: an ongoing guide: announcements, updates, and greatest hits. J. Algorithms. 8(3):1987;438-448.
24. M.J. Zaki and M. Ogihara, Theoretical foundations of association rules, Proceedings of the Third SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, ACM, June 1998, pp. 71-78.
25. S. Morishita, On classification and regression, Discovery Science, Proceedings of the First International Conference (DS '98), Fukuoka, Japan, December 14-16, 1998, pp. 40-57.
26. R. Rastogi, K. Shim, Mining optimized support rules for numeric attributes, Proceedings of the 15th International Conference on Data Engineering (ICDE 1999), Sydney, Australia, 23-26 March 1999, pp. 206-215.
27. Wijsen J., Meersman R. On the complexity of mining quantitative association rules. Data Mining Knowledge Discov. 2(3):1998;263-281.
28. U. Feige, Relations between average case complexity and approximation complexity, Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), ACM, Montréal, Qué., Canada, May 19-21, 2002, pp. 534-543.
29. Dunning T. Accurate methods for the statistics of surprise and coincidence. Comput. Linguistics. 19(1):1993;61-74.
30. Hochbaum D.S. Approximating clique and biclique problems. J. Algorithms. 29(1):1998;174-200.
31. D.S. Hochbaum, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA, 1997.
32. Arora S., Lund C. Hardness of approximations. Hochbaum D.S. Approximation Algorithms for NP-Hard Problems. 1997;PWS Publishing Company, Boston, MA. (Chapter 6).