Rates of convergence for the cluster tree
نویسندگان
چکیده
For a density f on R, a high-density cluster is any connected component of {x : f(x) ≥ λ}, for some λ > 0. The set of all high-density clusters form a hierarchy called the cluster tree of f . We present a procedure for estimating the cluster tree given samples from f . We give finite-sample convergence rates for our algorithm, as well as lower bounds on the sample complexity of this estimation problem.
منابع مشابه
Almost Sure Convergence Rates for the Estimation of a Covariance Operator for Negatively Associated Samples
Let {Xn, n >= 1} be a strictly stationary sequence of negatively associated random variables, with common continuous and bounded distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1,Xk+1) based on histogram type estimators as well as the estimation of the covariance function of the limit empirical process induced by the se...
متن کاملA new model of (I+S)-type preconditioner for system of linear equations
In this paper, we design a new model of preconditioner for systems of linear equations. The convergence properties of the proposed methods have been analyzed and compared with the classical methods. Numerical experiments of convection-diffusion equations show a good im- provement on the convergence, and show that the convergence rates of proposed methods are superior to the other modified itera...
متن کاملStrong Convergence Rates of the Product-limit Estimator for Left Truncated and Right Censored Data under Association
Non-parametric estimation of a survival function from left truncated data subject to right censoring has been extensively studied in the literature. It is commonly assumed in such studies that the lifetime variables are a sample of independent and identically distributed random variables from the target population. This assumption is often prone to failure in practical studies. For instance, wh...
متن کاملOptimising a neural tree classifier using a genetic algorithm
Organising the output nodes of a competitive network into a tree structure may produce potential improvements in both convergence and recall rates. It may also make the network more stable in responding to changes in the data being classified. However a limitation of most clustering algorithms is that they require the number of classes to be predefined. This is a problem if no a-priori knowledg...
متن کاملTesting Regional Convergence in Iran's Economy
Convergence hypothesis is one of the results of neoclassical growth model, which has been examined recently. This hypothesis has two forms of absolute and conditional Beta-convergence and implies that regions with lower per capita output have higher per capita growth rates. Since there is no data for regional GDP in Iran, there has been n study to test convergence hypothesis in Iran. Our main c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010