Testing for the appropriate level of clustering in linear regression models
The overwhelming majority of empirical research that uses cluster-robust inference assumes that the clustering structure is known, even though there are often several possible ways in which a dataset could be clustered. We propose two tests for the correct level of clustering in regression models. One test focuses on inference about a single coefficient, and the other on inference about two or more coefficients. We provide both asymptotic and wild bootstrap implementations. The proposed tests work for a null hypothesis of either no clustering or `fine'' clustering against alternatives of `coarser'' clustering. We also propose a sequential testing procedure to determine the appropriate level of clustering. Simulations suggest that the bootstrap tests perform very well under the null hypothesis and can have excellent power. An empirical example suggests that using the tests leads to sensible inferences.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multilevel Gibbs Sampling for Bayesian Regression
Bayesian regression remains a simple but effective tool based on Bayesian inference techniques. For large-scale applications, with complicated posterior distributions, Markov Chain Monte Carlo methods are applied. To imp…
Bayesian InferenceClusteringregressionMultiple Kernel Clustering via Local Regression Integration
Multiple kernel methods less consider the intrinsic manifold structure of multiple kernel data and estimate the consensus kernel matrix with quadratic number of variables, which makes it vulnerable to the noise and outli…
ClusteringregressionLearning Hough Regression Models via Bridge Partial Least Squares for Object Detection
Popular Hough Transform-based object detection approaches usually construct an appearance codebook by clustering local image features. However, how to choose appropriate values for the parameters used in the clustering s…
ClusteringObjectobject-detectionObject Detection+1Systematically and efficiently improving $k$-means initialization by pairwise-nearest-neighbor smoothing
We present a meta-method for initializing (seeding) the $k$-means clustering algorithm called PNN-smoothing. It consists in splitting a given dataset into $J$ random subsets, clustering each of them individually, and mer…
ClusteringClosed-Form Training of Mahalanobis Distance for Supervised Clustering
Clustering is the task of grouping a set of objects so that objects in the same cluster are more similar to each other than to those in other clusters. The crucial step in most clustering algorithms is to find an appropr…
ClusteringFormMetric LearningStructured Prediction