A statistical view of clustering performance through the theory of \(U\)-processes
From MaRDI portal
Publication:392047
DOI10.1016/j.jmva.2013.10.001zbMath1278.62095OpenAlexW2013151705MaRDI QIDQ392047
Publication date: 13 January 2014
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2013.10.001
cluster analysisminimax lower boundempirical risk minimizationU-processesfast ratesmedian clusteringpairwise dissimilarity
Related Items
Empirical variance minimization with applications in variance reduction and optimal control, Robust estimation of \(U\)-statistics, On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm, Concentration inequalities for two-sample rank processes with application to bipartite ranking, Quantile-based clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bagging predictors
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Overlaying classifiers: A practical approach to optimal scoring
- Limit theorems for \(U\)-processes
- Risk bounds for statistical learning
- Principles and theory for data mining and machine learning
- Strong consistency of k-means clustering
- The median procedure in cluster analysis and social choice theory
- A central limit theorem for k-means clustering
- Asymptotic distributions for clustering criteria
- Optimal aggregation of classifiers in statistical learning.
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Ranking and empirical minimization of \(U\)-statistics
- Approximation Theorems of Mathematical Statistics
- Theory of Classification: a Survey of Some Recent Advances
- Individual Convergence Rates in Empirical Vector Quantizer Design
- A Survey of Statistical Network Models
- On the Performance of Clustering in Hilbert Spaces
- Approximate Confidence Intervals for the Number of Clusters
- Uniform Central Limit Theorems
- Asymptotic Statistics
- Learning Theory
- The minimax distortion redundancy in empirical quantizer design
- A Framework for Feature Selection in Clustering
- A Sober Look at Clustering Stability
- Statistical inference on graphs
- NP-hardness of the computation of a median equivalence relation in classification (Régnier problem)
- Probability Inequalities for Sums of Independent Random Variables
- A Class of Statistics with Asymptotically Normal Distribution
- Aggregating inconsistent information
- Introduction to nonparametric estimation
- Random forests
