Modeling Clustered Data with Very Few Clusters

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intimate learning with very few labeled data

Learning with combining labeled and unlabeled data is believed to be more powerful than fully un-supervised learning in general, since a few labeled examples are normally not hard to obtain and may dramatically improve the learning performance. However, it can always happen that the learning turns to be impossible with very few labeled data, especially as the labels are extremely expensive. Thi...

متن کامل

Clustered regression with unknown clusters

We consider a collection of prediction experiments, which are clustered in the sense that groups of experiments exhibit similar relationship between the predictor and response variables. The experiment clusters as well as the regression relationships are unknown. The regression relationships define the experiment clusters, and in general, the predictor and response variables may not exhibit any...

متن کامل

Inference with Few Heterogeneous Clusters∗

Suppose estimating a model on each of a small number of potentially heterogeneous clusters yields approximately independent, unbiased and Gaussian parameter estimators. We make two contributions in this set-up. First, we show how to compare a ∗The authors would like to thank three anonymous referees and seminar and conference participants at various universities and conferences for helpful comm...

متن کامل

Inference with Few Heterogenous Clusters

Consider inference with a small number of potentially heterogeneous clusters. Suppose estimating the model on each cluster yields q asymptotically unbiased, independent Gaussian estimators with potentially heterogeneous variances. Following Ibragimov and Müller (2010), one can then conduct asymptotically valid inference with a standard t-test based on the q cluster estimators, since at conventi...

متن کامل

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Multivariate Behavioral Research

سال: 2016

ISSN: 0027-3171,1532-7906

DOI: 10.1080/00273171.2016.1167008