Bootstrap with Clustering in Two or More Dimensions
نویسندگان
چکیده
We propose a bootstrap procedure for data that may exhibit cluster dependence in two or more dimensions. We use insights from the theory of generalized U-statistics to analyze the large-sample properties of statistics that are sample averages from the observations pooled across clusters. The asymptotic distribution of these statistics may be non-standard if observations are dependent but uncorrelated within clusters. We show that there exists no procedure for estimating the limiting distribution of the sample mean under two-way clustering that achieves uniform consistency. However, we propose (a) one bootstrap procedure that is adaptive and point-wise consistent for any fixed data-generating process (DGP), (b) an alternative procedure that is uniformly consistent if we exclude the case of dependence with no correlation. The two procedures can be combined for uniformly valid, but conservative inference. For pivotal statistics, either procedure also provides pointwise asymptotic refinements over the Gaussian approximation when the limiting distribution is normal. We discuss several special cases and extensions, including V-statistics, subgraph densitities for network data, and non-exhaustive samples of matched data. JEL Classification: C1, C12, C23, C33
منابع مشابه
A bootstrap-based aggregate classifier for model-based clustering
In model-based clustering, a situation in which true class labels are unknown and that is therefore also referred to as unsupervised learning, observations are typically classified by the Bayes modal rule. In this study, we assess whether alternative classifiers from the classification or supervised-learning literature—developed for situations in which class labels are known—can improve the Bay...
متن کاملA conformal bootstrap approach to critical percolation in two dimensions
We study four-point functions of critical percolation in two dimensions, and more generally of the Potts model. We propose an exact ansatz for the spectrum: an infinite, discrete and non-diagonal combination of representations of the Virasoro algebra. Based on this ansatz, we compute four-point functions using a numerical conformal bootstrap approach. The results agree with Monte-Carlo computat...
متن کاملA new algorithm for hybrid hierarchical clustering with visualization and the bootstrap
We propose a hybrid clustering method, Hierarchical Ordered Partitioning And Collapsing Hybrid (HOPACH), which is a hierarchical tree of clusters. The methodology combines the strengths of both partitioning and agglomerative clustering methods. At each node, a cluster is partitioned into two or more smaller clusters with an enforced ordering of the clusters. Collapsing steps uniting the two clo...
متن کاملA New Method for Clustering Wireless Sensor Networks to Improve the Energy Consumption
Clustering is an effective approach for managing nodes in Wireless Sensor Network (WSN). A new method of clustering mechanism with using Binary Gravitational Search Algorithm (BGSA) in WSN, is proposed in this paper to improve the energy consumption of the sensor nodes. Reducing the energy consumption of sensors in WSNs is the objective of this paper that is through selecting the sub optimum se...
متن کاملارائه یک الگوریتم خوشه بندی برای داده های دسته ای با ترکیب معیارها
Clustering is one of the main techniques in data mining. Clustering is a process that classifies data set into groups. In clustering, the data in a cluster are the closest to each other and the data in two different clusters have the most difference. Clustering algorithms are divided into two categories according to the type of data: Clustering algorithms for numerical data and clustering algor...
متن کامل