Complexity-penalized estimation of minimum volume sets for dependent data
DOI10.1016/J.JMVA.2010.04.009zbMATH Open1203.62105OpenAlexW2000976678MaRDI QIDQ990877FDOQ990877
Authors: J. Martínez 
Publication date: 1 September 2010
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2010.04.009
Recommendations
- Complexity \(L^0\)-penalized \(M\)-estimation: consistency in more dimensions
- On the consistency of minimum complexity nonparametric estimation
- Complexity of penalized likelihood estimation
- Fast algorithms for the minimum volume estimator
- Complexity penalized least squares estimators: Analytical results
- Conditional Minimum Volume Predictive Regions for Stochastic Processes
- Minimum complexity regression estimation with weakly dependent observations
- Minimum complexity density estimation
Nonparametric regression and quantile regression (62G08) Multivariate distribution of statistics (62H10) Inference from stochastic processes (62M99) Estimation in multivariate analysis (62H12) Computational learning theory (68Q32)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A classification framework for anomaly detection
- An Iterative Method for Estimating a Multivariate Mode and Isopleth
- Basic properties of strong mixing conditions. A survey and some open questions
- Calibrating the Excess Mass and Dip Tests of Modality
- Choosability and fractional chromatic numbers
- Choosing the window width when estimating a density
- Chromatic PAC-Bayes bounds for non-IID data: applications to ranking and stationary \(\beta \)-mixing processes
- Concentration and goodness-of-fit in higher dimensions: (Asymptotically) distribution-free methods
- Conditional Minimum Volume Predictive Regions for Stochastic Processes
- Conditions for linear processes to be strong-mixing
- Consistency and convergence rates of one-class SVMs and related algorithms
- Estimating the support of a high-dimensional distribution
- Estimation of a Convex Density Contour in Two Dimensions
- Estimation of a multivariate mode
- Excess Mass Estimates and Tests for Multimodality
- Large deviations and strong mixing
- Learning Theory
- Learning minimum volume sets
- Least angle regression. (With discussion)
- Measuring mass concentrations and estimating density contour clusters -- An excess mass approach
- Minimax-optimal classification with dyadic decision trees
- Minimum complexity regression estimation with weakly dependent observations
- Minimum volume sets and generalized quantile processes
- Mixing: Properties and examples
- Mode testing via the excess mass estimate
- Nonparametric conditional predictive regions for time series
- On optimal and data-based histograms
- Recent Developments in Nonparametric Density Estimation
- Set-indexed conditional empirical and quantile processes based on dependent data
- Subsampling
- The excess-mass ellipsiod
- Tree approximation and optimal encoding
- Using local dependencies within batches to improve large margin classifiers
- Wedgelets: Nearly minimax estimation of edges
Cited In (7)
- Statistical learning based on Markovian data maximal deviation inequalities and learning rates
- A computable plug-in estimator of minimum volume sets for novelty detection
- Learning minimum volume sets
- Sets that maximize probability and a related variational problem
- Mass volume curves and anomaly ranking
- Fast algorithms for the minimum volume estimator
- Set Estimation, Computation of Volumes and Data Safety
This page was built for publication: Complexity-penalized estimation of minimum volume sets for dependent data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990877)
