Real-valued all-dimensions search: low-overhead rapid searching over subsets of attributes

Authors:
Andrew Moore;Jeff Schneider
Affiliations:
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Venue:
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Year:
2002

Citing 12
Cited 2

Mining quantitative association rules in large relational tables

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Implementing data cubes efficiently

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Fast discovery of association rules

Advances in knowledge discovery and data mining
Efficient search for association rules

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering associations with numeric variables

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Inductive Learning Algorithms for Complex Systems Modeling

Inductive Learning Algorithms for Complex Systems Modeling
Constraint-Based Rule Mining in Large, Dense Databases

Data Mining and Knowledge Discovery
Learning Decision Lists

Machine Learning
The CN2 Induction Algorithm

Machine Learning
Rule-based anomaly pattern detection for detecting disease outbreaks

Eighteenth national conference on Artificial intelligence
OPUS: an efficient admissible algorithm for unordered search

Journal of Artificial Intelligence Research
Cached sufficient statistics for efficient machine learning with large datasets

Journal of Artificial Intelligence Research

The max-min hill-climbing Bayesian network structure learning algorithm

Machine Learning
A fast calculation of metric scores for learning Bayesian network

International Journal of Automation and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is about searching the combinatorial space of contingency tables during the inner loop of a nonlinear statistical optimization. Examples of this operation in various data analytic communities include searching for nonlinear combinations of attributes that contribute significantly to a regression (Statistics), searching for items to include in a decision list (machine learning) and association rule hunting (Data Mining). This paper investigates a new, efficient approach to this class of problems, called RADSEARCH (Real-valued All-Dimensions-tree Search). RADSEARCH finds the global optimum, and this gives us the opportunity to empirically evaluate the question: apart from algorithmic elegance what does this attention to optimality buy us? We compare RADSEARCH with other recent successful search algorithms such as CN2, PRIM, APriori, OPUS and DenseMiner. Finally, we introduce RADREG, a new regression algorithm for learning real-valued outputs based on RADSEARCHing for highorder interactions.