Fast iterative mining using sparsity-inducing loss functions

Hiroto Saigo, Hisashi Kashima, Koji Tsuda

Research output: Contribution to journalArticlepeer-review


Apriori-based mining algorithms enumerate frequent patterns efficiently, but the resulting large number of patterns makes it difficult to directly apply subsequent learning tasks. Recently, efficient iterative methods are proposed for mining discriminative patterns for classification and regression. These methods iteratively execute discriminative pattern mining algorithm and update example weights to emphasize on examples which received large errors in the previous iteration. In this paper, we study a family of loss functions that induces sparsity on example weights. Most of the resulting example weights become zeros, so we can eliminate those examples from discriminative pattern mining, leading to a significant decrease in search space and time. In computational experiments we compare and evaluate various loss functions in terms of the amount of sparsity induced and resulting speed-up obtained.

Original languageEnglish
Pages (from-to)1766-1773
Number of pages8
JournalIEICE Transactions on Information and Systems
Issue number8
Publication statusPublished - 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Fast iterative mining using sparsity-inducing loss functions'. Together they form a unique fingerprint.

Cite this