skip to main content
10.1145/3132847.3133070acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

Compact Multiple-Instance Learning

Authors Info & Claims
Published:06 November 2017Publication History

ABSTRACT

The weakly supervised Multiple-Instance Learning (MIL) problem has been successfully applied in information retrieval tasks. Two related issues might affect the performance of MIL algorithms: how to cope with label ambiguities and how to deal with non-discriminative components, and we propose COmpact MultiPle-Instance LEarning (COMPILE) to consider them simultaneously. To treat label ambiguities, COMPILE seeks ground-truth positive instances in positive bags. By using weakly supervised information to learn data's short binary representations, COMPILE enhances discrimination via strengthening discriminative components and suppressing non-discriminative ones. We adapt block coordinate descent to optimize COMPILE efficiently. Experiments on text categorization empirically show: 1) COMPILE unifies disambiguation and data preprocessing successfully; 2) it generates short binary representations efficiently to enhance discrimination at significantly reduced storage cost.

References

  1. J. Amores. 2013. Multiple instance classification: Review, taxonomy and comparative study. Artif. Intell. Vol. 201 (2013), 81--105. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Andrews, I. Tsochantaridis, and T. Hofmann. 2003. Support vector machines for multiple-instance learning NIPS. 577--584. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J.F. Bonnans, J.C. Gilbert, C. Lemaréchal, and C.A. Sagastizábal. 2006. Numerical optimization: theoretical and practical aspects. Springer Science & Business Media. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Chai, H. Chen, L. Huang, and F. Shang. 2014. Maximum margin multiple-instance feature weighting. Pattern Recog., Vol. 47, 6 (2014), 2091--2103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R.O. Duda, P.E. Hart, and D.G. Stork. 2012. Pattern classification. John Wiley & Sons.Google ScholarGoogle Scholar
  6. Y. Gong and S. Lazebnik. 2011. Iterative quantization: A procrustean approach to learning binary codes CVPR. 817--824. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Wu-Jun Li and Dit-Yan Yeung. 2010. MILD: Multiple-Instance Learning via Disambiguation. IEEE Trans. Knowl. Data Eng. Vol. 22, 1 (2010), 76--89. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. F. Shen, C. Shen, W. Liu, and H.T. Shen. 2015. Supervised discrete hashing. In CVPR. 37--45.Google ScholarGoogle Scholar
  9. X. Shen, W. Liu, I. Tsang, F. Shen, and Q.S. Sun. 2017. Compressed K-Means for Large-Scale Clustering. In AAAI. 2527--2533.Google ScholarGoogle Scholar
  10. J. Wang and J.D. Zucker. 2000. Solving the Multiple-Instance Problem: A Lazy Learning Approach ICML. 1119--1126. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Wu, Z. Hong, S. Pan, X. Zhu, Z. Cai, and C. Zhang. 2014. Exploring features for complicated objects: Cross-view feature selection for multi-instance learning. In CIKM. 1699--1708. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M.L. Zhang and Z.H. Zhou. 2006. Adapting RBF neural networks to multi-instance learning. Neural Processing Letters Vol. 23, 1 (2006), 1--26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Q. Zhang, S.A. Goldman, et almbox.. 2001. EM-DD: An improved multiple-instance learning technique NIPS. 1073--1080. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Zhou, Z. Jorgensen, and M. Inge. 2007. Combating good word attacks on statistical spam filters with multiple instance learning ICTAI. 298--305. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Z.H. Zhou, K. Jiang, and M. Li. 2005. Multi-instance learning based web mining. Appl. Intell., Vol. 22, 2 (2005), 135--147. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Z.H. Zhou, Y.Y. Sun, and Y.F. Li. 2009. Multi-instance learning by treating instances as non-iid samples ICML. 1249--1256. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    CIKM '17: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management
    November 2017
    2604 pages
    ISBN:9781450349185
    DOI:10.1145/3132847

    Copyright © 2017 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 6 November 2017

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • short-paper

    Acceptance Rates

    CIKM '17 Paper Acceptance Rate171of855submissions,20%Overall Acceptance Rate1,861of8,427submissions,22%

    Upcoming Conference

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader