Skip to main content
Top

2014 | OriginalPaper | Chapter

Generating Sample Points in General Metric Space

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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) 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)
2.
go back to reference Krishnamurthy, A.: Recovering euclidean distance matrix via a landmark MDS. In: Proceedings of the 6th Annual Machine Learning Symposium, October 2011 Krishnamurthy, A.: Recovering euclidean distance matrix via a landmark MDS. In: Proceedings of the 6th Annual Machine Learning Symposium, October 2011
3.
go back to reference Kruskal, J., Wish, M.: Multidimensional Scaling. SAGE Publications, Beverly Hills (1978) Kruskal, J., Wish, M.: Multidimensional Scaling. SAGE Publications, Beverly Hills (1978)
4.
go back to reference Abraham, I., Bartal, Y., Neiman, O.: On embedding of finite metric spaces into Hilbert space. Tech. Rep. (2006) Abraham, I., Bartal, Y., Neiman, O.: On embedding of finite metric spaces into Hilbert space. Tech. Rep. (2006)
5.
go back to reference Luukkainenen, J., Movahedi-Lankarani, H.: Minimal bi-Lipschitz embedding dimension of ultrametric spaces. Fundam. Math. 144(2), 181–193 (1994) Luukkainenen, J., Movahedi-Lankarani, H.: Minimal bi-Lipschitz embedding dimension of ultrametric spaces. Fundam. Math. 144(2), 181–193 (1994)
7.
go back to reference 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) 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)
8.
go back to reference Gunzburger, M., Burkardt, J.: Uniformity measures for point samples in hypercubes (2004) Gunzburger, M., Burkardt, J.: Uniformity measures for point samples in hypercubes (2004)
9.
go back to reference Philip, J.: The probability distribution of the distance between two random points in a box, Manuscript. Royal Institute of Technology, Stockholm (2007) Philip, J.: The probability distribution of the distance between two random points in a box, Manuscript. Royal Institute of Technology, Stockholm (2007)
10.
go back to reference 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) 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)
11.
go back to reference 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)CrossRef 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)CrossRef
12.
go back to reference Meersche, K., Soetaert, K., Oevelen, D.: xsample(): An r function for sampling linear inverse problems. J. Stat. Softw. 30(1), 1–15 (2009) Meersche, K., Soetaert, K., Oevelen, D.: xsample(): An r function for sampling linear inverse problems. J. Stat. Softw. 30(1), 1–15 (2009)
Metadata
Title
Generating Sample Points in General Metric Space
Author
László Kovács
Copyright Year
2014
DOI
https://doi.org/10.1007/978-3-319-00467-9_14

Premium Partner