Polynomial association rules with applications to logistic regression

ABSTRACT

A new class of associations (polynomial itemsets and polynomial association rules) is presented which allows for discovering nonlinear relationships between numeric attributes without discretization. For binary attributes, proposed associations reduce to classic itemsets and association rules. Many standard association rule mining algorithms can be adapted to finding polynomial itemsets and association rules. We applied polynomial associations to add non-linear terms to logistic regression models. Significant performance improvement was achieved over stepwise methods, traditionally used in statistics, with comparable accuracy.

REFERENCES

• 1: Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
• 2: A. Agresti. An Introduction to Categorical Data Analysis. John Wiley & Sons, Inc., New York, 1996.
• 3: K. Duan and S. Keerthi. Which is the best multiclass SVM method? An empirical study. In Multiple Classifier Systems, 6th International Workshop (MCS'05), pages 278--285, Seaside, CA, 2005.
• 4: S. Dzeroski and L. Todorovski. Discovering dynamics. In ICML, pages 97--103, 1993.
• 5: Yoav Freund , Robert E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Proceedings of the Second European Conference on Computational Learning Theory, p.23-37, March 13-15, 1995
• 6: J. Freyberger, N. T. Heffernan, and C. Ruiz. Using association rules to guide a search for best fitting transfer models of student learning. In Workshop on Analyzing Student-Tutor Interaction Logs to Improve Educational Outcomes at the 7th Annual Intelligent Tutoring Systems Conference, Maceio, Brazil, 2004.
• 7: J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. Technical report, Dept. of Statistics, Stanford University, 1998.
• 8: B. Goethals. Survey on frequent pattern mining. Manuscript, 2003.
• 9: R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2005. http://www.R-project.org.
• 10: Martin Scholz, Sampling-based sequential subgroup mining, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA [doi>10.1145/1081870.1081902]
• 11: Ramakrishnan Srikant , Rakesh Agrawal, Mining quantitative association rules in large relational tables, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.1-12, June 04-06, 1996, Montreal, Quebec, Canada
• 12: Michael Steinbach , Pang-Ning Tan , Hui Xiong , Vipin Kumar, Generalizing the notion of support, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA [doi>10.1145/1014052.1014141]
• 13: I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, 2005.
• 14: X. Yin and J. Han. CPAR: Classification based on predictive association rules. In SIAM International Conference on Data Mining (SDM), 2003.
• 15: R. Zembowicz and J. M. Zytkow. Discovery of equations: Experimental evaluation of convergence. In 10th National Conference on Artificial Intelligence (AAAI), pages 70--75, San Jose, CA, 1992.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.8 Database applications
          Subjects: Data mining

General Terms:
Algorithms, Experimentation, Performance

Keywords:
association rules, continuous attributes