Advertisement

Improved Prototype Embedding Based Generalized Median Computation by Means of Refined Reconstruction Methods

  • Andreas Nienkötter
  • Xiaoyi JiangEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10029)

Abstract

Learning a prototype from a set of given objects is a core problem in machine learning and pattern recognition. A popular approach to consensus learning is to formulate it as an optimization problem in terms of generalized median computation. Recently, a prototype-embedding approach has been proposed to transform the objects into a vector space, compute the geometric median, and then inversely transform back into the original space. This approach has been successfully applied in several domains, where the generalized median problem has inherent high computational complexity (typically \(\mathcal {NP}\)-hard) and thus approximate solutions are required. In this work we introduce three new methods for the inverse transformation. We show that these methods significantly improve the generalized median computation compared to previous methods.

References

  1. 1.
    Bache, K., Lichman, M.: UCI Machine Learning Repository. School of Information and Computer Sciences, University of California, Irvine (2013)Google Scholar
  2. 2.
    Borzeshi, E.Z., Piccardi, M., Riesen, K., Bunke, H.: Discriminative prototype selection methods for graph embedding. Pattern Recogn. 46(6), 1648–1657 (2013)CrossRefzbMATHGoogle Scholar
  3. 3.
    Cohen-Boulakia, S., Denise, A., Hamel, S.: Using medians to generate consensus rankings for biological data. In: Cushing, J.B., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 73–90. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-22351-8_5 CrossRefGoogle Scholar
  4. 4.
    Ferrer, M., Karatzas, D., Valveny, E., Bardají, I., Bunke, H.: A generic framework for median graph computation based on a recursive embedding approach. Comput. Vis. Image Underst. 115(7), 919–928 (2011)CrossRefGoogle Scholar
  5. 5.
    Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.: Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recogn. 43(4), 1642–1655 (2010)CrossRefzbMATHGoogle Scholar
  6. 6.
    Franek, L., Jiang, X.: Ensemble clustering by means of clustering embedding in vector spaces. Pattern Recogn. 47(2), 833–842 (2014)CrossRefzbMATHGoogle Scholar
  7. 7.
    Hakimi, S.: Location Theory. CRC Press, Boca Raton (2000)Google Scholar
  8. 8.
    de la Higuera, C., Casacuberta, F.: Topology of strings: median string is NP-complete. Theoret. Comput. Sci. 230(1), 39–48 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Jiang, X., Münger, A., Bunke, H.: On median graphs: properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1144–1151 (2001)CrossRefGoogle Scholar
  10. 10.
    Jiang, X., Wentker, J., Ferrer, M.: Generalized median string computation by means of string embedding in vector spaces. Pattern Recogn. Lett. 33(7), 842–852 (2012)CrossRefGoogle Scholar
  11. 11.
    Krivánek, M., Morávek, J.: NP-hard problems in hierarchical-tree clustering. Acta Informatica 23(3), 311–323 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Lundsteen, C., Phillip, J., Granum, E.: Quantitative analysis of 6985 digitized trypsin G-banded human metaphase chromosomes. Clin. Genet. 18, 355–370 (1980)CrossRefGoogle Scholar
  13. 13.
    Nienkötter, A., Jiang, X.: Distance-preserving vector space embedding for generalized median based consensus learning (2016, submitted for publication)Google Scholar
  14. 14.
    Riesen, K., Bunke, H.: Graph classification based on vector space embedding. Int. J. Pattern Recognit Artif Intell. 23(06), 1053–1081 (2009)CrossRefzbMATHGoogle Scholar
  15. 15.
    Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168–173 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Weiszfeld, E., Plastria, F.: On the point for which the sum of the distances to n given points is minimum. Ann. Oper. Res. 167(1), 7–41 (2009)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceUniversity of MünsterMünsterGermany

Personalised recommendations