An approximate oracle for distance in metric spaces

Yanling Yang, Kaizhong Zhang, Xiong Wang, Jason T L Wang, Dennis Shasha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we present a new data structure for estimating distances in a pseudo-metric space. Given are a database of objects and a distance function for the objects, which is a pseudo-metric. We map the objects to vectors in a pseudo-Euclidean space with a reasonably low dimension while preserving the distance between two objects approximately. Such a data structure can be used as an approximate oracle to process a broad class of pattern-matching based queries. Experimental results on both synthetic and real data show the good performance of the oracle in distance estimation.

Original languageEnglish (US)
Title of host publicationCombinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings
Pages104-117
Number of pages14
Volume1448 LNCS
StatePublished - 1998
Event9th Annual Symposium on Combinatorial Pattern Matching, CPM 1998 - Piscataway, NJ, United States
Duration: Jul 20 1998Jul 22 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1448 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other9th Annual Symposium on Combinatorial Pattern Matching, CPM 1998
CountryUnited States
CityPiscataway, NJ
Period7/20/987/22/98

Fingerprint

Metric space
Data structures
Pseudometric
Pattern matching
Data Structures
Pseudo-Euclidean Space
Pattern Matching
Distance Function
Query
Object
Experimental Results

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yang, Y., Zhang, K., Wang, X., Wang, J. T. L., & Shasha, D. (1998). An approximate oracle for distance in metric spaces. In Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings (Vol. 1448 LNCS, pp. 104-117). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1448 LNCS).

An approximate oracle for distance in metric spaces. / Yang, Yanling; Zhang, Kaizhong; Wang, Xiong; Wang, Jason T L; Shasha, Dennis.

Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings. Vol. 1448 LNCS 1998. p. 104-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1448 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yang, Y, Zhang, K, Wang, X, Wang, JTL & Shasha, D 1998, An approximate oracle for distance in metric spaces. in Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings. vol. 1448 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1448 LNCS, pp. 104-117, 9th Annual Symposium on Combinatorial Pattern Matching, CPM 1998, Piscataway, NJ, United States, 7/20/98.
Yang Y, Zhang K, Wang X, Wang JTL, Shasha D. An approximate oracle for distance in metric spaces. In Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings. Vol. 1448 LNCS. 1998. p. 104-117. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Yang, Yanling ; Zhang, Kaizhong ; Wang, Xiong ; Wang, Jason T L ; Shasha, Dennis. / An approximate oracle for distance in metric spaces. Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings. Vol. 1448 LNCS 1998. pp. 104-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0f0db2ab1ee4414b99a6da35551d4c2f,
title = "An approximate oracle for distance in metric spaces",
abstract = "In this paper we present a new data structure for estimating distances in a pseudo-metric space. Given are a database of objects and a distance function for the objects, which is a pseudo-metric. We map the objects to vectors in a pseudo-Euclidean space with a reasonably low dimension while preserving the distance between two objects approximately. Such a data structure can be used as an approximate oracle to process a broad class of pattern-matching based queries. Experimental results on both synthetic and real data show the good performance of the oracle in distance estimation.",
author = "Yanling Yang and Kaizhong Zhang and Xiong Wang and Wang, {Jason T L} and Dennis Shasha",
year = "1998",
language = "English (US)",
isbn = "3540647392",
volume = "1448 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "104--117",
booktitle = "Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings",

}

TY - GEN

T1 - An approximate oracle for distance in metric spaces

AU - Yang, Yanling

AU - Zhang, Kaizhong

AU - Wang, Xiong

AU - Wang, Jason T L

AU - Shasha, Dennis

PY - 1998

Y1 - 1998

N2 - In this paper we present a new data structure for estimating distances in a pseudo-metric space. Given are a database of objects and a distance function for the objects, which is a pseudo-metric. We map the objects to vectors in a pseudo-Euclidean space with a reasonably low dimension while preserving the distance between two objects approximately. Such a data structure can be used as an approximate oracle to process a broad class of pattern-matching based queries. Experimental results on both synthetic and real data show the good performance of the oracle in distance estimation.

AB - In this paper we present a new data structure for estimating distances in a pseudo-metric space. Given are a database of objects and a distance function for the objects, which is a pseudo-metric. We map the objects to vectors in a pseudo-Euclidean space with a reasonably low dimension while preserving the distance between two objects approximately. Such a data structure can be used as an approximate oracle to process a broad class of pattern-matching based queries. Experimental results on both synthetic and real data show the good performance of the oracle in distance estimation.

UR - http://www.scopus.com/inward/record.url?scp=84877330430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877330430&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84877330430

SN - 3540647392

SN - 9783540647393

VL - 1448 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 104

EP - 117

BT - Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings

ER -