Skip to main content

2014 | OriginalPaper | Buchkapitel

14. Special Metrics

verfasst von : Dan A. Simovici, Chabane Djeraba

Erschienen in: Mathematical Tools for Data Mining

Verlag: Springer London

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Clustering and classification, two central data mining activities, require the evaluation of degrees of dissimilarity between data objects.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Literatur
2.
Zurück zum Zitat M. Meilă, in International Conference on Machine Learning, Bonn, Germany, ed. by L. DeRaedt, S. Wrobel. Comparing clusterings: an axiomatic view (ACM, New York, 2005), pp. 577–584 M. Meilă, in International Conference on Machine Learning, Bonn, Germany, ed. by L. DeRaedt, S. Wrobel. Comparing clusterings: an axiomatic view (ACM, New York, 2005), pp. 577–584
3.
Zurück zum Zitat V.I. Levenshtein, Binary code capable of correcting deletions, insertions and substitutions. Cybern. Control Theory 163, 845–848 (1966) V.I. Levenshtein, Binary code capable of correcting deletions, insertions and substitutions. Cybern. Control Theory 163, 845–848 (1966)
4.
Zurück zum Zitat E. Chávez, G. Navarro, R. Baeza-Yates, J.L. Marroquín, Searching in metric spaces. ACM Comput. Surv. 33, 273–321 (2001)CrossRef E. Chávez, G. Navarro, R. Baeza-Yates, J.L. Marroquín, Searching in metric spaces. ACM Comput. Surv. 33, 273–321 (2001)CrossRef
5.
Zurück zum Zitat W.A. Burkhard, R.M. Keller, Some approaches to best-match file searching. Commun. ACM 16, 230–236 (1973)CrossRefMATH W.A. Burkhard, R.M. Keller, Some approaches to best-match file searching. Commun. ACM 16, 230–236 (1973)CrossRefMATH
6.
Zurück zum Zitat M.T. Orchard, A fast nearest-neighbor search algorithm. Int. Conf. Acoust. Speech Signal Process. 4, 2297–3000 (1991) M.T. Orchard, A fast nearest-neighbor search algorithm. Int. Conf. Acoust. Speech Signal Process. 4, 2297–3000 (1991)
7.
Zurück zum Zitat C.M. Huang, Q. Bi, G.S. Stiles, R.W. Harris, Fast full search equivalent encoding algorithms for image compression using vector quantization. IEEE Trans. Image Process. 1, 413–416 (1992)CrossRef C.M. Huang, Q. Bi, G.S. Stiles, R.W. Harris, Fast full search equivalent encoding algorithms for image compression using vector quantization. IEEE Trans. Image Process. 1, 413–416 (1992)CrossRef
8.
Zurück zum Zitat K. Zakloutal, M.H. Johnson, R.E. Ladner, in DIMACS Series in Discrete Mathematics: Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth Implementation Challenges, ed. by M.H. Goldwasser, D.S. Johnson, C.C. McGeogh. Nearest neighbor search for data compression (American Mathematical Society, Providence, 2002), pp. 69–86 K. Zakloutal, M.H. Johnson, R.E. Ladner, in DIMACS Series in Discrete Mathematics: Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth Implementation Challenges, ed. by M.H. Goldwasser, D.S. Johnson, C.C. McGeogh. Nearest neighbor search for data compression (American Mathematical Society, Providence, 2002), pp. 69–86
9.
Zurück zum Zitat A. Faragó, T. Linder, G. Lugosi, Fast nearest-neighbor search in dissimilarity spaces. IEEE Trans. Pattern Anal. Mach. Intell. 15, 957–962 (1993)CrossRef A. Faragó, T. Linder, G. Lugosi, Fast nearest-neighbor search in dissimilarity spaces. IEEE Trans. Pattern Anal. Mach. Intell. 15, 957–962 (1993)CrossRef
10.
Zurück zum Zitat M.M. Deza, M. Laurent, Geometry of Cuts and Metrics (Springer, Heidelberg, 1997) M.M. Deza, M. Laurent, Geometry of Cuts and Metrics (Springer, Heidelberg, 1997)
11.
Zurück zum Zitat K.L. Clarkson, in Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, ed. by G. Shakhnarovich, T. Darrell, P. Indyk. Nearest-neighbor searching and metric space dimensions (MIT Press, Cambridge, 2006), pp. 15–59 K.L. Clarkson, in Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, ed. by G. Shakhnarovich, T. Darrell, P. Indyk. Nearest-neighbor searching and metric space dimensions (MIT Press, Cambridge, 2006), pp. 15–59
12.
Zurück zum Zitat C. Böhm, S. Berthold, D.A. Keim, Searching in high-dimensional spaces—index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33, 322–373 (2001)CrossRef C. Böhm, S. Berthold, D.A. Keim, Searching in high-dimensional spaces—index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33, 322–373 (2001)CrossRef
13.
Zurück zum Zitat K. L. Clarkson, in Proceedings of the 29th ACM Symposium on Theory of Computation. Nearest neighbor queries in metric spaces, El Paso (ACM, New York, 1997), pp. 609–617 K. L. Clarkson, in Proceedings of the 29th ACM Symposium on Theory of Computation. Nearest neighbor queries in metric spaces, El Paso (ACM, New York, 1997), pp. 609–617
14.
Zurück zum Zitat E. Vidal, An algorithm for finding nearest neighbours in (approximately) average constant time. Pattern Recogn. Lett. 4, 145–157 (1986)CrossRef E. Vidal, An algorithm for finding nearest neighbours in (approximately) average constant time. Pattern Recogn. Lett. 4, 145–157 (1986)CrossRef
15.
Zurück zum Zitat E. Vidal, New formulation and improvements of the nearest neighbours in approximating end eliminating search algorithms (AESA). Pattern Recogn. Lett. 15, 1–7 (1994)CrossRef E. Vidal, New formulation and improvements of the nearest neighbours in approximating end eliminating search algorithms (AESA). Pattern Recogn. Lett. 15, 1–7 (1994)CrossRef
16.
Zurück zum Zitat T. L. Wang, D. Shasha, in Proceedings of the 16th VLDB Conference, ed. by D. McLeod, R. Sacks-Davis, and H.-J.Schek. Query processing for distance metrics, Brisbane (Morgan Kaufmann, San Francisco, 1990), pp. 602–613 T. L. Wang, D. Shasha, in Proceedings of the 16th VLDB Conference, ed. by D. McLeod, R. Sacks-Davis, and H.-J.Schek. Query processing for distance metrics, Brisbane (Morgan Kaufmann, San Francisco, 1990), pp. 602–613
17.
Zurück zum Zitat D. Shasha, T.L. Wang, New techniques for best-match retrieval. ACM Trans. Inf. Syst. 8, 140–158 (1990)CrossRef D. Shasha, T.L. Wang, New techniques for best-match retrieval. ACM Trans. Inf. Syst. 8, 140–158 (1990)CrossRef
18.
Zurück zum Zitat E. Deza, M.M. Deza, Dictionary of Distances (Elsevier, Amsterdam, 2006) E. Deza, M.M. Deza, Dictionary of Distances (Elsevier, Amsterdam, 2006)
19.
Zurück zum Zitat C. Zara, Personal communication (2013) C. Zara, Personal communication (2013)
Metadaten
Titel
Special Metrics
verfasst von
Dan A. Simovici
Chabane Djeraba
Copyright-Jahr
2014
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-6407-4_14