Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David S. Vogel

dblp:43/5953 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2007
0000-0002-3591-8490ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
regression
0.122007
Scalable look-ahead linear regression trees · KDD 2007
1-dimensional splines as building blocks for improving accuracy of risk outcomes models · KDD 2004
Data mining › predictive modeling › regression
regression tree
0.112007
Scalable look-ahead linear regression trees · KDD 2007
Data mining › predictive modeling › classification
decision tree learning
0.012007
Scalable look-ahead linear regression trees · KDD 2007
Medical and health informatics › clinical prediction
risk prediction
0.012004
1-dimensional splines as building blocks for improving accuracy of risk outcomes models · KDD 2004

Methods — techniques the papers use, named apart from their topics

cubic spline transformation · 0.1linear regression · 0.1
YearPublicationVenuePosition
2007 Scalable look-ahead linear regression trees
abstract
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at the leaf nodes. The motivation behind Look-ahead Linear Regression Trees (LLRT) is that out of all the methods proposed to date, there has been no scalable approach to exhaustively evaluate all possible models in the leaf nodes in order to obtain an optimal split. Using several optimizations, LLRT is able to generate and evaluate thousands of linear regression models per second. This allows for a near-exhaustive evaluation of all possible splits in a node, based on the quality of fit of linear regression models in the resulting branches. We decompose the calculation of the Residual Sum of Squares in such a way that a large part of it is pre-computed. The resulting method is highly scalable. We observe it to obtain high predictive accuracy for problems with strong mutual dependencies between attributes. We report on experiments with two simulated and seven real data sets.
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
KDD1
2004 1-dimensional splines as building blocks for improving accuracy of risk outcomes models
abstract
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maximum linear correlation between the response variable and the predictors, especially when there are non-linear relationships between predictors and the response such as the medical data set used in this study. A spline based transformation method is proposed that is second order smooth, continuous, and minimizes the mean squared error between the response and each predictor. Since the computation time for generating this spline is O(n), the processing time is reasonable with massive data sets. In contrast to cubic smoothing splines, the resulting transformation equations also display a high level of efficiency for scoring. Data used for predicting health outcomes contains an abundance of non-linear relationships between predictors and the outcomes requiring an algorithm for modeling them accurately. Thus, a transformation that fits an adaptive cubic spline to each of a set of variables is proposed. These curves are used as a set of transformation functions on the predictors. A case study of how the transformed variables can be fed into a simple linear regression model to predict risk outcomes is presented. The results show significant improvement over the performance of the original variables in both linear and non-linear models.
David S. Vogel, Morgan C. Wang
KDD1