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

This is a discussion of paper "Treelets--An adaptive multi-scale basis for sparse unordered data" [arXiv:0707.0481] by Ann B. Lee, Boaz Nadler and Larry Wasserman. In this paper the authors defined a new type of dimension reduction…

Applications · Statistics 2008-07-28 Xing Qiu

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

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

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

Applications · Statistics 2008-07-28 Fionn Murtagh

In data analysis, latent variables play a central role because they help provide powerful insights into a wide variety of phenomena, ranging from biological to human sciences. The latent tree model, a particular type of probabilistic…

Machine Learning · Computer Science 2014-02-05 Raphaël Mourad , Christine Sinoquet , Nevin L. Zhang , Tengfei Liu , Philippe Leray

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

We consider the problem of sparse variable selection on high dimension heterogeneous data sets, which has been taking on renewed interest recently due to the growth of biological and medical data sets with complex, non-i.i.d. structures and…

Methodology · Statistics 2024-04-22 Hui Liu , Xiang Liu , Jing Diao , Wenting Ye , Xueling Liu , Dehui Wei

Tree-structured models are a powerful alternative to parametric regression models if non-linear effects and interactions are present in the data. Yet, classical tree-structured models might not be appropriate if data comes in clusters of…

Methodology · Statistics 2025-01-23 Nikolai Spuck , Matthias Schmid , Moritz Berger

We present convincing empirical evidence for an effective and general strategy for building accurate small models. Such models are attractive for interpretability and also find use in resource-constrained environments. The strategy is to…

Machine Learning · Computer Science 2024-04-30 Abhishek Ghose

Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from…

Machine Learning · Computer Science 2014-08-26 Houtao Deng

Clustering serves as a vital tool for uncovering latent data structures, and achieving both high accuracy and interpretability is essential. To this end, existing methods typically construct binary decision trees by solving mixed-integer…

Machine Learning · Computer Science 2026-02-17 Hayato Suzuki , Shunnosuke Ikeda , Yuichi Takano

Tree ensembles, such as random forests and boosted trees, are renowned for their high prediction performance. However, their interpretability is critically limited due to the enormous complexity. In this study, we present a method to make a…

Machine Learning · Statistics 2017-03-01 Satoshi Hara , Kohei Hayashi

Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the…

Data Structures and Algorithms · Computer Science 2010-11-23 Travis Gagie , Gonzalo Navarro , Simon J. Puglisi

Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model…

Machine Learning · Statistics 2016-06-20 Satoshi Hara , Kohei Hayashi

Constrained clustering is a semi-supervised task that employs a limited amount of labelled data, formulated as constraints, to incorporate domain-specific knowledge and to significantly improve clustering accuracy. Previous work has…

Machine Learning · Computer Science 2023-05-17 Pouya Shati , Eldan Cohen , Sheila McIlraith

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

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

Model interpretability has become an important problem in machine learning (ML) due to the increased effect that algorithmic decisions have on humans. Counterfactual explanations can help users understand not only why ML models make certain…

Machine Learning · Computer Science 2021-12-20 Ana Lucic , Harrie Oosterhuis , Hinda Haned , Maarten de Rijke
‹ Prev 1 2 3 10 Next ›