Advertisement

Efficient Soft-Constrained Clustering for Group-Based Labeling

  • Ryoma BiseEmail author
  • Kentaro Abe
  • Hideaki Hayashi
  • Kiyohito Tanaka
  • Seiichi Uchida
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11768)

Abstract

We propose a soft-constrained clustering method for group-based labeling of medical images. Since the idea of group-based labeling is to attach the label to a group of samples at once, we need to have groups (i.e., clusters) with high purity. The proposed method is formulated to achieve high purity even for difficult clustering tasks such as medical image clustering, where image samples of the same class are often very distant in their feature space. In fact, those images degrade the performance of conventional constrained clustering methods. Experiments with an endoscopy image dataset demonstrated that our method outperformed various state-of-the-art methods.

Notes

Acknowledgments

This work was supported by JSPS KAKENHI Grant Number JP19K22895 and AMED Grant Number JP18lk1010028.

References

  1. 1.
    Biswas, A., Jacobs, D.: Active image clustering: seeking constraints from humans to complement algorithms. In: Proceedings of CVPR, pp. 2152–2159 (2012)Google Scholar
  2. 2.
    Galleguillos, C., McFee, B., Lanckriet, G.: Iterative category discovery via multiple kernel metric learning. IJCV 108(1–2), 115–132 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bruce, M.W., Draper, A., Beveridge, J.R.: Efficient label collection for unlabeled image datasets. In: Proceedings of CVPR, pp. 4594–4602 (2015)Google Scholar
  4. 4.
    Wagstaff, K., Cardie, C., Rogers, S., Schrodl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of ICML, pp. 577–584 (2001)Google Scholar
  5. 5.
    Le, H.M., Eriksson, A., Do, T.-T., Milford, M.: A binary optimization approach for constrained k-means clustering. In: Jawahar, C.V., Li, H., Mori, G., Schindler, K. (eds.) ACCV 2018. LNCS, vol. 11364, pp. 383–398. Springer, Cham (2019).  https://doi.org/10.1007/978-3-030-20870-7_24CrossRefGoogle Scholar
  6. 6.
    Davidson, I., Ravi, S.S.: Clustering with constraints: feasibility issues and the k-means algorithm. In: Proceedings on SIAM Data Mining (2005)Google Scholar
  7. 7.
    Pelleg, D., Baras, D.: K-means with large and noisy constraint sets. In: Kok, J.N., Koronacki, J., Mantaras, R.L., Matwin, S., Mladenič, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 674–682. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-74958-5_67CrossRefGoogle Scholar
  8. 8.
    Basu, S., Banerjee, A., Mooney R.J.: Active semi-supervision for pairwise constrained clustering. In: Proceedings of SIAM on Data Mining, pp. 333–344 (2004)Google Scholar
  9. 9.
    Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: Proceedings of ICML, pp. 81–88 (2004)Google Scholar
  10. 10.
    Huang, G., Liu, Z., Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of CVPR (2017)Google Scholar
  11. 11.
    Rifkin, R.M., Lippert, R.A.: Notes on regularized least squares, Technical report, MIT-CSAIL (2007)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Ryoma Bise
    • 1
    Email author
  • Kentaro Abe
    • 1
  • Hideaki Hayashi
    • 1
  • Kiyohito Tanaka
    • 2
  • Seiichi Uchida
    • 1
  1. 1.Kyushu UniversityFukuoka CityJapan
  2. 2.Kyoto Second Red Cross HospitalKyotoJapan

Personalised recommendations