Data Exploration by Representative Region Selection: Axioms and Convergence
From MaRDI portal
Publication:4958552
DOI10.1287/moor.2020.1115zbMath1473.62104OpenAlexW3139457119WikidataQ114598547 ScholiaQ114598547MaRDI QIDQ4958552
Alexander S. Estes, Michael O. Ball, David J. Lovell
Publication date: 14 September 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2020.1115
data analysisunsupervised learningdensity estimationdata summarizationrepresentative region selection
Density estimation (62G07) Asymptotic properties of nonparametric inference (62G20) Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05) Statistical aspects of big data and data science (62R07)
Cites Work
- On the Devroye-Györfi methods of correcting density estimators
- Bee colony optimization for the \(p\)-center problem
- Bibliography on domination in graphs and some basic definitions of domination parameters
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- Multivariate mode hunting: Data analytic tools with measures of significance
- Clustering to minimize the maximum intercluster distance
- On improving density estimators which are not bona fide functions
- Strong consistency of k-means clustering
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Lexicographic local search and the \(p\)-center problem.
- Experimental analysis of Heuristic algorithms for the dominating set problem
- Dominant, an algorithm for the \(p\)-center problem.
- Summarizing categorical data by clustering attributes
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- A survey of kernel and spectral methods for clustering
- Consistency of spectral clustering
- Density estimation
- Consistency of random forests
- A New Formulation and Resolution Method for the p-Center Problem
- Dimension Reduction: A Guided Tour
- Approximate clustering via core-sets
- On coresets for k-means and k-median clustering
- A Best Possible Heuristic for the k-Center Problem
- Consistency of Single Linkage for High-Density Clusters
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Correction of Density Estimators that are not Densities
- Multivariate Density Estimation
- On the Uniform Convergence of the Frequencies of Occurrence of Events to Their Probabilities
- Computer Aided Design of Experiments
- The m-Center Problem
- On clustering validation techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
