arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0507040cs.LGcs.AIcs.CV
收藏

连续无关数据的模式识别

Pattern Recognition for Conditionally Independent Data

Daniil Ryabko

摘要:

在这项工作中,我们考虑放松的独立同分布假设在模式识别(或分类)的任务,旨在使现有的学习算法适用于更广泛的任务。模式识别是基于一组给定的示例(对象和标签对)来猜测某个对象的离散标签。我们考虑确定性定义的标签的情况。传统上,这个任务是在假设样本是独立同分布的情况下进行研究的。然而,事实证明,许多模式识别理论的结果携带一个较弱的假设。也就是说,在条件独立和相同分布的对象的假设下,而唯一的假设的标签的分布是,每个标签的出现率应高于某个积极的阈值。我们发现了一个广泛的类别的学习算法的估计下实现的经典i.i.d.分类错误的概率。假设可以推广到条件独立同分布情况下的类似估计。例子.

英文摘要:

In this work we consider the task of relaxing the i.i.d assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider range of tasks. Pattern recognition is guessing a discrete label of some object based on a set of given examples (pairs of objects and labels). We consider the case of deterministically defined labels. Traditionally, this task is studied under the assumption that examples are independent and identically distributed. However, it turns out that many results of pattern recognition theory carry over a weaker assumption. Namely, under the assumption of conditional independence and identical distribution of objects, while the only assumption on the distribution of labels is that the rate of occurrence of each label should be above some positive threshold. We find a broad class of learning algorithms for which estimations of the probability of a classification error achieved under the classical i.i.d. assumption can be generalised to the similar estimates for the case of conditionally i.i.d. examples.

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

↑