On the public citation graph

Selecting vantage objects for similarity indexing

0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-47977-5_47openalex-snapshot
A Pseudo-Metric for Weighted Point Sets
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/s101150050009openalex-snapshot
An Index Structure for Data Mining and Clustering
inferredcites →https://doi.org/10.1016/j.patcog.2005.06.012openalex-snapshot
Prototype selection for dissimilarity-based classifiers
inferredcites →https://doi.org/10.1016/s0031-3203(00)00120-5openalex-snapshot
Efficient image retrieval through vantage objects
inferredcites →https://doi.org/10.1016/s0031-3203(02)00326-6openalex-snapshot
The choice of vantage objects for image retrieval
inferredcites →https://doi.org/10.1016/s0167-8655(03)00065-5openalex-snapshot
Pivot selection techniques for proximity searching in metric spaces
inferredcites →https://doi.org/10.1109/34.75509openalex-snapshot
An efficiently computable metric for comparing polygonal shapes
inferredcites →https://doi.org/10.1109/cvpr.2000.855850openalex-snapshot
Shape descriptors for non-rigid shapes with a single closed contour
inferredcites →https://doi.org/10.1109/cvpr.2004.1315173openalex-snapshot
Boostmap: a method for efficient approximate similarity rankings
inferredcites →https://doi.org/10.1109/iccv.1998.710701openalex-snapshot
A metric for distributions with applications to image databases
inferredcites →https://doi.org/10.1109/tpami.2003.1195989openalex-snapshot
Properties of embedding methods for similarity searching in metric spaces
inferredcites →https://doi.org/10.1142/9789812797988_0005openalex-snapshot
Efficient and Robust Retrieval by Shape Content through Curvature Scale Space
inferredcites →https://doi.org/10.1145/223784.223812openalex-snapshot
FastMap
inferredcites →https://doi.org/10.1145/253260.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferredcites →https://doi.org/10.1145/3130348.3130373openalex-snapshot
Evaluating Evaluation Measure Stability
inferredcites →https://doi.org/10.1145/328939.328959openalex-snapshot
Indexing large metric spaces for similarity search queries
inferredcites →https://doi.org/10.1145/345508.345543openalex-snapshot
Evaluating evaluation measure stability
inferredcites →https://doi.org/10.1145/502807.502808openalex-snapshot
Searching in metric spaces
inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot
R-trees
inferredcites →https://doi.org/10.1184/r1/6610748openalex-snapshot
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
inferredcites →https://doi.org/10.5072/zenodo.243694openalex-snapshot
Using transportation distances for measuring melodic similarity
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_11openalex-snapshot
Multimedia Retrieval Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_9openalex-snapshot
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
inferred← citeshttps://doi.org/10.1007/s00778-007-0062-1openalex-snapshot
Reference-based indexing for metric spaces with costly distance measures
inferred← citeshttps://doi.org/10.1007/s00778-021-00691-4openalex-snapshot
Pivot selection algorithms in metric spaces: a survey and experimental study
inferred← citeshttps://doi.org/10.1016/j.jss.2006.03.051openalex-snapshot
The MPEG-7 Multimedia Database System (MPEG-7 MMDB)
inferred← citeshttps://doi.org/10.1109/cinti.2012.6496786openalex-snapshot
Balancing methods for the QT-GHT structure
inferred← citeshttps://doi.org/10.1109/sisap.2009.21openalex-snapshot
Optimal Pivots to Minimize the Index Size for Metric Access Methods
inferred← citeshttps://doi.org/10.1145/2000486.2000490openalex-snapshot
Selecting vantage objects for similarity indexing
inferred← citeshttps://doi.org/10.1145/3503823.3503899openalex-snapshot
Entity Resolution in Dissimilarity Spaces
inferred← citeshttps://doi.org/10.1177/102986490901300109openalex-snapshot
Some vantage indexing approaches for rhythmic and melodic search
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.