arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.01901cs.LGcs.ITmath.ITstat.ML
收藏

置信度约束的最大熵多实例数据学习框架

Confidence-Constrained Maximum Entropy Framework for Learning from Multi-Instance Data

Oregon State University(俄勒冈州立大学)

Behrouz Behmardi, Forrest Briggs, Xiaoli Z. Fern, Raviv Raich

摘要:

多实例数据(其中每个对象(包)包含实例的集合)广泛存在于机器学习、计算机视觉、生物信息学、信号处理和社会科学中。我们提出了一个最大熵(ME)框架,从多实例数据学习。在这种方法中,每个袋子表示为一个分布使用ME的原则。我们引入了置信约束ME(CME)的概念,同时学习的分布空间的结构,并推断每个分布。每个密度下的共享结构用于从每个包内的实例中学习。建议的CME是免费的调谐参数。我们设计了一个快速的优化算法,能够处理大规模的多实例数据。在实验部分中,我们评估了所提出的方法在分布空间中的精确秩恢复方面的性能,并将其与正则化ME方法进行了比较。此外,我们比较了CME的性能与多实例学习(MIL)的国家的最先进的算法,并显示出相当的性能,在准确性与降低计算复杂性。

英文摘要:

Multi-instance data, in which each object (bag) contains a collection of instances, are widespread in machine learning, computer vision, bioinformatics, signal processing, and social sciences. We present a maximum entropy (ME) framework for learning from multi-instance data. In this approach each bag is represented as a distribution using the principle of ME. We introduce the concept of confidence-constrained ME (CME) to simultaneously learn the structure of distribution space and infer each distribution. The shared structure underlying each density is used to learn from instances inside each bag. The proposed CME is free of tuning parameters. We devise a fast optimization algorithm capable of handling large scale multi-instance data. In the experimental section, we evaluate the performance of the proposed approach in terms of exact rank recovery in the space of distributions and compare it with the regularized ME approach. Moreover, we compare the performance of CME with Multi-Instance Learning (MIL) state-of-the-art algorithms and show a comparable performance in terms of accuracy with reduced computational complexity.

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

↑