Theory and Algorithms for Shapelet-Based Multiple-Instance Learning

DOI10.1162/neco_a_01297zbMath1473.68169DBLPjournals/neco/SuehiroHTYBT20arXiv2006.01130OpenAlexW3104161109WikidataQ96293570 ScholiaQ96293570MaRDI QIDQ5131159

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

Publication date: 2 November 2020

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.01130

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• tslearn
• sktime

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of time series by shapelet transformation
• Solving the multiple instance problem with axis-parallel rectangles.
• Generalized random shapelet forests
• DC programming and DCA: thirty years of developments
• A theoretical and empirical analysis of support vector machine methods for multiple-instance classification
• Semi-infinite programming, duality, discretization and optimality conditions†
• 10.1162/153244303321897690
• Machine Learning: ECML 2004
• Linear programming boosting via column generation

This page was built for publication: Theory and Algorithms for Shapelet-Based Multiple-Instance Learning