Generating Sample Points in General Metric Space (original) (raw)

Abstract

The importance of general metric spaces in modeling of complex objects is increasing. A key aspect in testing of algorithms on general metric spaces is the generation of appropriate sample set of objects. The chapter demonstrates that the usual way, i.e. the mapping of elements of some vector space into general metric space is not an optimal solution. The presented approach maps the object set into the space of distance-matrixes and proposes a random walk sample generation method to provide a better uniform distribution of test elements.

Similar content being viewed by others

References

  1. Socorro, R., Mico, L., Oncina, J.: Efficient search supporting several similarity queries by reordering pivots. In: Proceedings of the IAESTED Signal Processing, Pattern Recognition and Applications, pp. 114–141 (2011)
    Google Scholar
  2. Krishnamurthy, A.: Recovering euclidean distance matrix via a landmark MDS. In: Proceedings of the 6th Annual Machine Learning Symposium, October 2011
    Google Scholar
  3. Kruskal, J., Wish, M.: Multidimensional Scaling. SAGE Publications, Beverly Hills (1978)
    Google Scholar
  4. Abraham, I., Bartal, Y., Neiman, O.: On embedding of finite metric spaces into Hilbert space. Tech. Rep. (2006)
    Google Scholar
  5. Luukkainenen, J., Movahedi-Lankarani, H.: Minimal bi-Lipschitz embedding dimension of ultrametric spaces. Fundam. Math. 144(2), 181–193 (1994)
    Google Scholar
  6. Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math. 52(1–2), 46–52 (1985)
    Article MathSciNet MATH Google Scholar
  7. Faoutsos, C., Liu, K.: FastMap, a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. In: Proceedings of the International Conference on the Management of Data, ACM SIGMOD 1995, San Jose, CA, 163–174 (1995)
    Google Scholar
  8. Gunzburger, M., Burkardt, J.: Uniformity measures for point samples in hypercubes (2004)
    Google Scholar
  9. Philip, J.: The probability distribution of the distance between two random points in a box, Manuscript. Royal Institute of Technology, Stockholm (2007)
    Google Scholar
  10. Smith, R.: Efficient monte carlo procedures for generating points uniformly distributed over bounded regions. Tech. Rep. 81–1, University of Michigan, USA, January, p. 21 (1981)
    Google Scholar
  11. Xu, H., Agrafiotis, D.: Nearest neighbor search in general metric spaces using a tree data structure with simple heuristic. J. Chem. Inf. Comput. Sci. 43, 1933–1941 (2003)
    Article Google Scholar
  12. Meersche, K., Soetaert, K., Oevelen, D.: xsample(): An r function for sampling linear inverse problems. J. Stat. Softw. 30(1), 1–15 (2009)
    Google Scholar

Download references

Acknowledgments

This research was carried out as part of the TAMOP-4.2.1.B-10/2/KONV-2010-0001 project with support by the European Union, co-financed by the European Social Fund and the technical background was supported by the Hungarian National Scientific Research Fund Grant OTKA K77809.

Author information

Authors and Affiliations

  1. Department of Information Technology, University of Miskolc, Miskolc, Hungary
    László Kovács

Corresponding author

Correspondence toLászló Kovács .

Editor information

Editors and Affiliations

  1. Petru Maior University, Targu Mures, Romania
    Barna Iantovics
  2. Technical University of Sofia, Sofia, Bulgaria
    Roumen Kountchev

Rights and permissions

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Kovács, L. (2014). Generating Sample Points in General Metric Space. In: Iantovics, B., Kountchev, R. (eds) Advanced Intelligent Computational Technologies and Decision Support Systems. Studies in Computational Intelligence, vol 486. Springer, Cham. https://doi.org/10.1007/978-3-319-00467-9\_14

Download citation

Keywords

Publish with us