English
Related papers

Related papers: Discussion of: Treelets--An adaptive multi-scale b…

200 papers

We would like to congratulate Lee, Nadler and Wasserman on their contribution to clustering and data reduction methods for high $p$ and low $n$ situations. A composite of clustering and traditional principal components analysis, treelets is…

Applications · Statistics 2008-07-28 Catherine Tuglus , Mark J. van der Laan

In many modern applications, including analysis of gene expression and text documents, the data are noisy, high-dimensional, and unordered--with no particular meaning to the given order of the variables. Yet, successful learning is often…

Methodology · Statistics 2008-07-25 Ann B. Lee , Boaz Nadler , Larry Wasserman

We congratulate Lee, Nadler and Wasserman (henceforth LNW) on a very interesting paper on new methodology and supporting theory [arXiv:0707.0481]. Treelets seem to tackle two important problems of modern data analysis at once. For datasets…

Applications · Statistics 2008-07-28 Nicolai Meinshausen , Peter Bühlmann

Discussion of "Treelets--An adaptive multi-Scale basis for sparse unordered data" [arXiv:0707.0481]

Applications · Statistics 2008-07-28 Fionn Murtagh

Discussion of "Treelets--An adaptive multi-scale basis for sparse unordered data" [arXiv:0707.0481]

Applications · Statistics 2008-07-28 Robert Tibshirani

Discussion of "Treelets--An adaptive multi-scale basis for sparse unordered data" [arXiv:0707.0481]

Applications · Statistics 2008-07-28 Peter J. Bickel , Ya'acov Ritov

Rejoinder of "Treelets--An adaptive multi-scale basis for spare unordered data" [arXiv:0707.0481]

Applications · Statistics 2008-07-28 Ann B. Lee , Boaz Nadler , Larry Wasserman

Decision trees are widely-used classification and regression models because of their interpretability and good accuracy. Classical methods such as CART are based on greedy approaches but a growing attention has recently been devoted to…

Machine Learning · Computer Science 2021-12-16 Edoardo Amaldi , Antonio Consolo , Andrea Manno

In this paper, we investigate adaptive nonlinear regression and introduce tree based piecewise linear regression algorithms that are highly efficient and provide significantly improved performance with guaranteed upper bounds in an…

Machine Learning · Computer Science 2013-12-30 N. Denizcan Vanli , Suleyman S. Kozat

Treewidth is a parameter that measures how tree-like a relational instance is, and whether it can reasonably be decomposed into a tree. Many computation tasks are known to be tractable on databases of small treewidth, but computing the…

Databases · Computer Science 2019-01-23 Silviu Maniu , Pierre Senellart , Suraj Jog

We propose a new outline for adaptive dictionary learning methods for sparse encoding based on a hierarchical clustering of the training data. Through recursive application of a clustering method, the data is organized into a binary…

Machine Learning · Computer Science 2020-06-11 Renato Budinich , Gerlind Plonka

Sparse decision trees are one of the most common forms of interpretable models. While recent advances have produced algorithms that fully optimize sparse decision trees for prediction, that work does not address policy design, because the…

Machine Learning · Computer Science 2022-10-27 Ali Behrouz , Mathias Lecuyer , Cynthia Rudin , Margo Seltzer

Decision trees are important both as interpretable models amenable to high-stakes decision-making, and as building blocks of ensemble methods such as random forests and gradient boosting. Their statistical properties, however, are not well…

Machine Learning · Statistics 2021-10-20 Yan Shuo Tan , Abhineet Agarwal , Bin Yu

Ensembles of decision trees are a useful tool for obtaining for obtaining flexible estimates of regression functions. Examples of these methods include gradient boosted decision trees, random forests, and Bayesian CART. Two potential…

Methodology · Statistics 2018-09-18 Antonio Ricardo Linero , Yun Yang

Many fundamental statistical methods have become critical tools for scientific data analysis yet do not scale tractably to modern large datasets. This paper will describe very recent algorithms based on computational geometry which have…

We describe a new wavelet transform, for use on hierarchies or binary rooted trees. The theoretical framework of this approach to data analysis is described. Case studies are used to further exemplify this approach. A first set of…

Information Retrieval · Computer Science 2011-06-14 Fionn Murtagh

Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet,…

Computational Geometry · Computer Science 2023-05-18 Kathryn Gray , Mingwei Li , Reyan Ahmed , Md. Khaledur Rahman , Ariful Azad , Stephen Kobourov , Katy Börner

Shapelet-based algorithms are widely used for time series classification because of their ease of interpretation, but they are currently outperformed by recent state-of-the-art approaches. We present a new formulation of time series…

Computer Vision and Pattern Recognition · Computer Science 2022-06-10 Antoine Guillaume , Christel Vrain , Elloumi Wael

Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices…

Numerical Analysis · Mathematics 2022-08-23 Evan D. Gorman , Manuel E. Lladser

Variable trees are a new method for the exploration of discrete multivariate data. They display nested subsets and corresponding frequencies and percentages. Manual calculation of these quantities can be laborious, especially when there are…

Computation · Statistics 2021-02-08 Nick Barrowman , Richard J. Webster
‹ Prev 1 2 3 10 Next ›