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

基于Shapelet的多示例学习理论与算法

Theory and Algorithms for Shapelet-based Multiple-Instance Learning

Kyushu University(九州大学);AIP, RIKEN(理化学研究所人工智能研究中心);Keio University(庆应义塾大学);The University of Tokyo(东京大学)

Daiki Suehiro, Kohei Hatano, Eiji Takimoto, Shuji Yamamoto, Kenichi Bannai, Akiko Takeda

摘要:

我们提出了一种新的多实例学习(MIL),其中一个数据单元由一组称为包的实例组成。我们的目标是找到一个很好的分类袋的基础上的相似性与“shapelet”(或模式),其中的相似性袋与shapelet是最大的相似性的实例在袋。在以前的工作中,一些训练实例被选择为没有理论依据的形状。在我们的公式中,我们使用了所有可能的,因此有无穷多个形状,从而产生了更丰富的分类器。我们表明,制定是易于处理的,也就是说,它可以减少通过线性规划助推(LPBoost)凸(DC)的有限(实际上是多项式)大小的程序的差异。我们的理论结果也证明了以前的一些工作的原理。所提出的算法的时间复杂度高度依赖于训练样本中的所有实例的集合的大小。为了适用于包含大量实例的数据,我们还提出了一种启发式的算法选择,而不损失理论上的保证。我们的实证研究表明,我们的算法一致适用于时间序列分类的Shapelet学习任务和各种MIL任务,其精度与现有方法相当。此外,我们表明,所提出的算法使我们能够实现合理的计算时间的结果。

英文摘要:

We propose a new formulation of Multiple-Instance Learning (MIL), in which a unit of data consists of a set of instances called a bag. The goal is to find a good classifier of bags based on the similarity with a "shapelet" (or pattern), where the similarity of a bag with a shapelet is the maximum similarity of instances in the bag. In previous work, some of the training instances are chosen as shapelets with no theoretical justification. In our formulation, we use all possible, and thus infinitely many shapelets, resulting in a richer class of classifiers. We show that the formulation is tractable, that is, it can be reduced through Linear Programming Boosting (LPBoost) to Difference of Convex (DC) programs of finite (actually polynomial) size. Our theoretical result also gives justification to the heuristics of some of the previous work. The time complexity of the proposed algorithm highly depends on the size of the set of all instances in the training sample. To apply to the data containing a large number of instances, we also propose a heuristic option of the algorithm without the loss of the theoretical guarantee. Our empirical study demonstrates that our algorithm uniformly works for Shapelet Learning tasks on time-series classification and various MIL tasks with comparable accuracy to the existing methods. Moreover, we show that the proposed heuristics allow us to achieve the result with reasonable computational time.

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

↑