Mining rank-correlated sets of numerical attributes

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 96-105

  Calders, Toon ^a   Goethals, Bart ^a   Jaroszewicz, Szymon ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b WEST POMERANIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Data mining; Numerical; Rank Correlation

Indexed keywords

ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; NUMERICAL METHODS; PATTERN RECOGNITION; REAL TIME SYSTEMS;

DISCRETIZATION METHODS; NUMERICAL ATTRIBUTES; RANK CORRELATION;

DATA MINING;

EID: 33749545979     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150417     Document Type: Conference Paper

References (17)

1. R. Agrawal, T. Imielinski, and A.N. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD, pages 207-216, 1993.
2. Y. Aumann and Y. Lindell. A statistical theory for quantitative association rules. In Proc. ACM SIGKDD, pages 261-270, 1999.
3. J. L. Bentley and J H. Friedman. Data structures for range searching. ACM Comput. Surv., 11(4):397-409, 1979.
4. F. Bodon and L. Schmidt-Thieme. The relation of closed itemset mining, complete pruning strategies and item ordering in apriori-based fim algorithms. In Proc. PKDD, pages 437-444, 2005.
5. T. Calders and B. Goethals. Depth-first non-derivable itemset mining. In Proc. SIAM DM, 2005.
6. P. Diaconis and R. Graham. Spearman's footrule as a measure of disarray. J. of the Royal Statistical Society, Series B, 39(2):262-268, 1977.
7. S. Dzeroski and L. Todorovski. Discovering dynamics: From inductive logic programming to machine discovery. Journal of Intelligent Information Systems, 4:89-108, 1995.
8. P. W. Frey and D. J. Slate. Letter recognition using Holland-style adaptive classifiers. Machine Learning, 6(2), 1991.
9. B. Goethals. Frequent set mining. In In The Data Mining and Knowledge Discovery Handbook, chapter 17, pages 377-397. 2005.
10. S. Hettich and S. D. Bay. The UCI KDD Archive [http://kdd.ics.uci.edu] Irvine, CA: University of California, Dept. of inf. and comp. science, 1999.
11. S. Jaroszewicz and T. Scheffer. Fast discovery of unexpected patterns in data, relative to a bayesian network. In Proc. ACM SIGKDD, pages 118-127, 2005.
12. M. Kendall. Rank Correlation Methods. Oxford University Press, 1990.
13. A.M. Liebetrau. Measures of Association, volume 32 of Quantitative Applications in the Social Sciences. Sage Publications, Inc., 1983.
14. H. Lu, L. Feng, and J. Han. Beyond intra-transaction association analysis: Mining multi-dimensional inter-transaction association rules. ACM Transactions on Information Systems, 18(4):423-454, 2000.
15. G.I. Webb S. Huang. Discarding insignificant rules during impact rule discovery in large databases. In Proc. SIAM DM, pages 541-545, 2005.
16. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. ACM SIGMOD, 1996.
17. M. Steinbach, Tan P.-N., Xiong H., and V. Kumar. Generalizing the notion of support. In Proc. ACM SIGKDD, pages 689-694, 2004.