NV-tree: an efficient disk-based index for approximate search in very large high-dimensional collections.
- DOI
- 10.1109/tpami.2008.130
- Published
- 2009 May
- Container
- IEEE transactions on pattern analysis and machine intelligence
- Publisher
- Not recorded
- Open access
- unknown
Credibility signals
limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1109/tpami.2008.130,
title = {NV-tree: an efficient disk-based index for approximate search in very large high-dimensional collections.},
author = {Lejsek H and Asmundsson FH and Jónsson Bt and Amsaleg L},
year = {2009},
journal = {IEEE transactions on pattern analysis and machine intelligence},
doi = {10.1109/tpami.2008.130},
url = {https://doi.org/10.1109/tpami.2008.130}
}RIS
TY - JOUR TI - NV-tree: an efficient disk-based index for approximate search in very large high-dimensional collections. AU - Lejsek H AU - Asmundsson FH AU - Jónsson Bt AU - Amsaleg L PY - 2009 JO - IEEE transactions on pattern analysis and machine intelligence DO - 10.1109/tpami.2008.130 UR - https://doi.org/10.1109/tpami.2008.130 ER -
APA
H, L., FH, A., Bt, J., & L, A. (2009). NV-tree: an efficient disk-based index for approximate search in very large high-dimensional collections.. IEEE transactions on pattern analysis and machine intelligence. https://doi.org/10.1109/tpami.2008.130
Source records
- pubmed · retrieved 2026-09-24T23:06:47.449Z