Adaptive similarity search in metric trees

Noha Yousri, Mohammed A. Ismail, Mohamed S. Kamel

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

2 Citations (Scopus)

Abstract

Metric trees are designed for improving efficiency of similarity search in high dimensional data. Searching a metric tree always terminates at leaf nodes, restricting the hierarchical search to a certain leaf level, and the linear search in leafs to a particular leaf size. This may result in performing additional unneeded distance comparisons, which increases the search time as the number of dimensions increases. It is proposed that the search adapts itself to the query in question, so as to avoid unneeded distance comparisons. Thus, the hierarchical search should terminate when no more searchspace pruning can be useful, and search then continues linearly through the un-pruned data space. Hierarchical search can thus stop any where above or below the original leaf level of a metric tree. Search rules are proposed to adapt the search to the query parameters. A modification to the metric tree is also suggested to adopt the proposed rules. High dimensional gene expression data sets are used to evaluate the new algorithm, showing speed ups of 55% compared to traditional search.

Original languageEnglish
Title of host publication2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007
Pages419-424
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007 - Montreal, QC, Canada
Duration: 7 Oct 200710 Oct 2007

Other

Other2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007
CountryCanada
CityMontreal, QC
Period7/10/0710/10/07

Fingerprint

Gene expression

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yousri, N., Ismail, M. A., & Kamel, M. S. (2007). Adaptive similarity search in metric trees. In 2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007 (pp. 419-424). [4414022] https://doi.org/10.1109/ICSMC.2007.4414022

Adaptive similarity search in metric trees. / Yousri, Noha; Ismail, Mohammed A.; Kamel, Mohamed S.

2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007. 2007. p. 419-424 4414022.

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

Yousri, N, Ismail, MA & Kamel, MS 2007, Adaptive similarity search in metric trees. in 2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007., 4414022, pp. 419-424, 2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007, Montreal, QC, Canada, 7/10/07. https://doi.org/10.1109/ICSMC.2007.4414022
Yousri N, Ismail MA, Kamel MS. Adaptive similarity search in metric trees. In 2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007. 2007. p. 419-424. 4414022 https://doi.org/10.1109/ICSMC.2007.4414022
Yousri, Noha ; Ismail, Mohammed A. ; Kamel, Mohamed S. / Adaptive similarity search in metric trees. 2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007. 2007. pp. 419-424
@inproceedings{e7c1152c19d54d4b828b6dfa9124648a,
title = "Adaptive similarity search in metric trees",
abstract = "Metric trees are designed for improving efficiency of similarity search in high dimensional data. Searching a metric tree always terminates at leaf nodes, restricting the hierarchical search to a certain leaf level, and the linear search in leafs to a particular leaf size. This may result in performing additional unneeded distance comparisons, which increases the search time as the number of dimensions increases. It is proposed that the search adapts itself to the query in question, so as to avoid unneeded distance comparisons. Thus, the hierarchical search should terminate when no more searchspace pruning can be useful, and search then continues linearly through the un-pruned data space. Hierarchical search can thus stop any where above or below the original leaf level of a metric tree. Search rules are proposed to adapt the search to the query parameters. A modification to the metric tree is also suggested to adopt the proposed rules. High dimensional gene expression data sets are used to evaluate the new algorithm, showing speed ups of 55{\%} compared to traditional search.",
author = "Noha Yousri and Ismail, {Mohammed A.} and Kamel, {Mohamed S.}",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ICSMC.2007.4414022",
language = "English",
isbn = "1424409918",
pages = "419--424",
booktitle = "2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007",

}

TY - GEN

T1 - Adaptive similarity search in metric trees

AU - Yousri, Noha

AU - Ismail, Mohammed A.

AU - Kamel, Mohamed S.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Metric trees are designed for improving efficiency of similarity search in high dimensional data. Searching a metric tree always terminates at leaf nodes, restricting the hierarchical search to a certain leaf level, and the linear search in leafs to a particular leaf size. This may result in performing additional unneeded distance comparisons, which increases the search time as the number of dimensions increases. It is proposed that the search adapts itself to the query in question, so as to avoid unneeded distance comparisons. Thus, the hierarchical search should terminate when no more searchspace pruning can be useful, and search then continues linearly through the un-pruned data space. Hierarchical search can thus stop any where above or below the original leaf level of a metric tree. Search rules are proposed to adapt the search to the query parameters. A modification to the metric tree is also suggested to adopt the proposed rules. High dimensional gene expression data sets are used to evaluate the new algorithm, showing speed ups of 55% compared to traditional search.

AB - Metric trees are designed for improving efficiency of similarity search in high dimensional data. Searching a metric tree always terminates at leaf nodes, restricting the hierarchical search to a certain leaf level, and the linear search in leafs to a particular leaf size. This may result in performing additional unneeded distance comparisons, which increases the search time as the number of dimensions increases. It is proposed that the search adapts itself to the query in question, so as to avoid unneeded distance comparisons. Thus, the hierarchical search should terminate when no more searchspace pruning can be useful, and search then continues linearly through the un-pruned data space. Hierarchical search can thus stop any where above or below the original leaf level of a metric tree. Search rules are proposed to adapt the search to the query parameters. A modification to the metric tree is also suggested to adopt the proposed rules. High dimensional gene expression data sets are used to evaluate the new algorithm, showing speed ups of 55% compared to traditional search.

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

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

U2 - 10.1109/ICSMC.2007.4414022

DO - 10.1109/ICSMC.2007.4414022

M3 - Conference contribution

SN - 1424409918

SN - 9781424409914

SP - 419

EP - 424

BT - 2007 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007

ER -