Efficient Construction of Regression Trees with Range and Region Splitting

Summary: Efficient regression-tree construction with region-based tests: grid-regions over pairs of numeric attributes, expressed as relational queries. An algorithm computes the optimal region R to minimize MSE after the split, yielding smaller trees and better accuracy than guillotine cuts. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8417
Venue: VLDB
Year: 1997
Pagerank: 5.7552641e-05
Overall Rank: 5,020 | 65.08%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,908	SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables	2001	SIGMOD	7.9306333e-05
3,454	Traversing Itemset Lattices with Statistical Metric Pruning	2000	PODS	7.0778482e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
13	Mining Association Rules between Sets of Items in Large Databases	1993	SIGMOD	0.0010864752
36	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00076161096
117	An Effective Hash-Based Algorithm for Mining Association Rules	1995	SIGMOD	0.00045896865
227	Discovery of Multiple-Level Association Rules from Large Databases	1995	VLDB	0.00032284058
599	Mining Quantitative Association Rules in Large Relational Tables	1996	SIGMOD	0.00019394214
3,770	Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules	1996	VLDB	6.7779074e-05
4,218	Mining Optimized Association Rules for Numeric Attributes	1996	PODS	6.3511866e-05
4,398	Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization	1996	SIGMOD	6.2225159e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,448	Multi-Dimensional Regression Analysis of Time-Series Data Streams	2002	VLDB	8.8032353e-05
3,954	Efficiently Approximating Selectivity Functions using Low Overhead Regression Models	2020	VLDB	6.5926838e-05
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
11,852	K-means Split Revisited: Well-grounded Approach and Experimental Evaluation	2016	SIGMOD	4.1945683e-05
7,054	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB	4.8496866e-05
3,255	A Revised R*-tree in Comparison with Related Index Structures	2009	SIGMOD	7.3160522e-05
1,455	RainForest - A Framework for Fast Decision Tree Construction of Large Datasets	1998	VLDB	0.00011899821
1,528	A Model for the Prediction of R-tree Performance	1996	PODS	0.00011497734
9,018	On Optimal Node Splitting for R-trees	1998	VLDB	4.4091374e-05
3,770	Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules	1996	VLDB	6.7779074e-05