arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0802.1244cs.LGstat.ML
收藏

小样本离散分布平衡混合分布的学习

Learning Balanced Mixtures of Discrete Distributions with Small Sample

Carnegie Mellon University(卡内基梅隆大学)

Shuheng Zhou

摘要:

我们研究了一个小样本的$n$个人的划分问题,从混合的$k$产品分布在一个布尔立方体$\{0, 1\}^K$根据他们的分布。每个分布由$\R^K$中的等位基因频率向量描述。给定两个分布,我们使用$γ$来表示$K$维度上频率的平均$\ell_2^2$距离,该距离测量它们之间的统计差异。我们研究的情况下,假设位是独立分布在$K$尺寸。这项工作表明,对于$k = 2$的平衡输入实例,某个基于图的优化函数以高概率返回正确的分区,其中在$n$个体上形成加权图$G$,其对应位向量之间的成对汉明距离定义边缘权重,只要$K = Ω(\ln n/γ)$和$Kn = \tildeΩ(\ln n/γ^2)$。该函数计算$G$的最大权重平衡切割,其中切割的权重是切割中所有边的权重之和。这个结果展示了高维特征空间中的一个很好的特性:人们可以权衡样本大小所需的特征数量,以完成某些任务,如聚类。

英文摘要:

We study the problem of partitioning a small sample of $n$ individuals from a mixture of $k$ product distributions over a Boolean cube $\{0, 1\}^K$ according to their distributions. Each distribution is described by a vector of allele frequencies in $\R^K$. Given two distributions, we use $γ$ to denote the average $\ell_2^2$ distance in frequencies across $K$ dimensions, which measures the statistical divergence between them. We study the case assuming that bits are independently distributed across $K$ dimensions. This work demonstrates that, for a balanced input instance for $k = 2$, a certain graph-based optimization function returns the correct partition with high probability, where a weighted graph $G$ is formed over $n$ individuals, whose pairwise hamming distances between their corresponding bit vectors define the edge weights, so long as $K = Ω(\ln n/γ)$ and $Kn = \tildeΩ(\ln n/γ^2)$. The function computes a maximum-weight balanced cut of $G$, where the weight of a cut is the sum of the weights across all edges in the cut. This result demonstrates a nice property in the high-dimensional feature space: one can trade off the number of features that are required with the size of the sample to accomplish certain tasks like clustering.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑