Efficient Construction of Regression Trees with Range and Region Splitting

Summary: Introduces regression-tree splits using 2D grid regions over pairs of numeric attributes, rather than conventional one-dimensional guillotine cuts. An efficient MSE-minimizing region-search algorithm yields more accurate and smaller trees. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 8608
Venue: VLDB
Year: 1997
Pagerank: 5.928365e-05
Overall Rank: 6,280 | 56.92%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Yasuhiko Morimoto (International Business Machines Tokyo Research Laboratory)
2. Hiromu Ishii (University of Tokyo)
3. Shinichi Morishita (International Business Machines Tokyo Research Laboratory)

BibTeX Citation

@article{morimoto_vldb97,
        title = {{Efficient Construction of Regression Trees with Range and Region Splitting}},
        author = {Morimoto, Yasuhiko and Ishii, Hiromu and Morishita, Shinichi},
        journal = {PVLDB},
        series = {{VLDB} '97},
        volume = {23},
        pages = {166--175},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,611	SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables	2001	SIGMOD	8.34729e-05
4,092	Traversing Itemset Lattices with Statistical Metric Pruning	2000	PODS	6.907339e-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.0006567919
27	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00052255472
240	An Effective Hash-Based Algorithm for Mining Association Rules	1995	SIGMOD	0.0002366381
456	Discovery of Multiple-Level Association Rules from Large Databases	1995	VLDB	0.00018124452
606	Mining Quantitative Association Rules in Large Relational Tables	1996	SIGMOD	0.00015804851
4,509	Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules	1996	VLDB	6.6548619e-05
4,565	Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization	1996	SIGMOD	6.6278063e-05
4,766	Mining Optimized Association Rules for Numeric Attributes	1996	PODS	6.5181854e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,230	Eliminating Redundant Feature Tests in Decision Tree and Random Forest Inference on SQL Predicates	2026	SIGMOD
2	3,162	Efficiently Approximating Selectivity Functions using Low Overhead Regression Models	2020	VLDB
3	4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD
4	7,151	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB
5	12,053	K-means Split Revisited: Well-grounded Approach and Experimental Evaluation	2016	SIGMOD
6	2,974	A Revised R*-tree in Comparison with Related Index Structures	2009	SIGMOD
7	1,994	RainForest - A Framework for Fast Decision Tree Construction of Large Datasets	1998	VLDB
8	1,373	A Model for the Prediction of R-tree Performance	1996	PODS
9	9,234	On Optimal Node Splitting for R-trees	1998	VLDB
10	4,509	Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules	1996	VLDB