On the public citation graph
Dual‐tree fast exact max‐kernel search
0 signed · 69 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/sam.11207openalex-snapshot
A distributed kernel summation framework for general‐dimension machine learning
inferredcites →https://doi.org/10.1006/jmbi.1990.9999openalex-snapshot
Basic Local Alignment Search Tool
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bfb0020283openalex-snapshot
Predicting time series with support vector machines
inferredcites →https://doi.org/10.1007/pl00009449openalex-snapshot
Nearest Neighbor Queries in Metric Spaces
inferredcites →https://doi.org/10.1016/0020-0190(91)90074-ropenalex-snapshot
Satisfying general proximity / similarity queries with metric trees
inferredcites →https://doi.org/10.1016/0022-2836(81)90087-5openalex-snapshot
Identification of common molecular subsequences
inferredcites →https://doi.org/10.1016/0146-664x(80)90055-6openalex-snapshot
Oct-trees and their use in representing three-dimensional objects
inferredcites →https://doi.org/10.1073/pnas.85.8.2444openalex-snapshot
Improved tools for biological sequence comparison.
inferredcites →https://doi.org/10.1093/bioinformatics/bti1007openalex-snapshot
Protein function prediction via graph kernels
inferredcites →https://doi.org/10.1109/34.955110openalex-snapshot
A fast nearest-neighbor algorithm based on a principal axis search tree
inferredcites →https://doi.org/10.1109/iccv.2009.5459466openalex-snapshot
Kernelized locality-sensitive hashing for scalable image search
inferredcites →https://doi.org/10.1109/ipdps.2012.45openalex-snapshot
Accelerating Nearest Neighbor Search on Manycore Systems
inferredcites →https://doi.org/10.1109/mc.2009.263openalex-snapshot
Matrix Factorization Techniques for Recommender Systems
inferredcites →https://doi.org/10.1109/t-c.1975.224297openalex-snapshot
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
inferredcites →https://doi.org/10.1109/t-c.1975.224336openalex-snapshot
A Branch and Bound Clustering Algorithm
inferredcites →https://doi.org/10.1109/tc.1977.1674939openalex-snapshot
A Branch and Bound Algorithm for Feature Subset Selection
inferredcites →https://doi.org/10.1109/tc.1978.1675043openalex-snapshot
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
inferredcites →https://doi.org/10.1109/tkde.2003.1232265openalex-snapshot
A comparison of standard spell checking algorithms and a novel binary neural approach
inferredcites →https://doi.org/10.1109/tpami.2008.128openalex-snapshot
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
inferredcites →https://doi.org/10.1137/1.9781611972733.19openalex-snapshot
Nonparametric Density Estimation: Toward Computational Tractability
inferredcites →https://doi.org/10.1137/1.9781611972825.34openalex-snapshot
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
inferredcites →https://doi.org/10.1137/1.9781611972832.1openalex-snapshot
Fast Exact Max-kernel Search
inferredcites →https://doi.org/10.1142/9789812799623_0053openalex-snapshot
THE SPECTRUM KERNEL: A STRING KERNEL FOR SVM PROTEIN CLASSIFICATION
inferredcites →https://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
inferredcites →https://doi.org/10.1145/1374376.1374452openalex-snapshot
Random projection trees and low dimensional manifolds
inferredcites →https://doi.org/10.1145/1390156.1390171openalex-snapshot
Fast nearest neighbor retrieval for bregman divergences
inferredcites →https://doi.org/10.1145/1835804.1835882openalex-snapshot
Fast euclidean minimum spanning tree
inferredcites →https://doi.org/10.1145/2339530.2339677openalex-snapshot
Maximum inner-product search using cone trees
inferredcites →https://doi.org/10.1145/2339530.2339761openalex-snapshot
Fast algorithms for comprehensive n-point correlation estimates
inferredcites →https://doi.org/10.1145/293347.293348openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/509907.509965openalex-snapshot
Similarity estimation techniques from rounding algorithms
inferredcites →https://doi.org/10.1145/509907.510013openalex-snapshot
Finding nearest neighbors in growth-restricted metrics
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.48550/arxiv.1202.1568openalex-snapshot
Beyond Sentiment: The Manifold of Human Emotions
inferredcites →https://doi.org/10.48550/arxiv.1210.6293openalex-snapshot
MLPACK: A Scalable C++ Machine Learning Library
inferredcites →https://doi.org/10.48550/arxiv.1301.3877openalex-snapshot
The Anchors Hierachy: Using the triangle inequality to survive high dimensional data
inferredcites →https://doi.org/10.5220/0001787803310340openalex-snapshot
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces
inferredcites →https://doi.org/10.7551/mitpress/4908.003.0005openalex-snapshot
Nearest-Neighbor Searching and Metric Space Dimensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.5970openalex-snapshot
Multiattribute approximate nearest neighbor search based on navigable small world graph
inferred← citeshttps://doi.org/10.1007/978-3-319-25087-8_7openalex-snapshot
Faster Dual-Tree Traversal for Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-3-319-46759-7_17openalex-snapshot
Fast Approximate Furthest Neighbors with Data-Dependent Candidate Selection
inferred← citeshttps://doi.org/10.1007/s00778-026-00982-8openalex-snapshot
Balancing Relevance and Diversity in k-Maximum Inner Product Search
inferred← citeshttps://doi.org/10.1007/s10994-018-5711-7openalex-snapshot
Improved maximum inner product search with better theoretical guarantee using randomized partition trees
inferred← citeshttps://doi.org/10.1016/j.is.2017.12.010openalex-snapshot
Exploiting the structure of furthest neighbor search for fast approximate results
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00143openalex-snapshot
ProMIPS: Efficient High-Dimensional c-Approximate Maximum Inner Product Search with a Lightweight Index
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00040openalex-snapshot
Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/ijcnn.2017.7966218openalex-snapshot
Improved maximum inner product search with better theoretical guarantees
inferred← citeshttps://doi.org/10.1145/2996452openalex-snapshot
Exact and Approximate Maximum Inner Product Search with LEMP
inferred← citeshttps://doi.org/10.1145/3219819.3219971openalex-snapshot
Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search
inferred← citeshttps://doi.org/10.1145/3336191.3371830openalex-snapshot
Fast Item Ranking under Neural Network based Measures
inferred← citeshttps://doi.org/10.1145/3511808.3557098openalex-snapshot
Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation
inferred← citeshttps://doi.org/10.1145/3626772.3657728openalex-snapshot
GUITAR: Gradient Pruning toward Fast Neural Ranking
inferred← citeshttps://doi.org/10.14778/3503585.3503589openalex-snapshot
Fast neural ranking on bipartite graph indices
inferred← citeshttps://doi.org/10.1587/transinf.2020edp7132openalex-snapshot
AdaLSH: Adaptive LSH for Solving c-Approximate Maximum Inner Product Search Problem
inferred← citeshttps://doi.org/10.21105/joss.05026openalex-snapshot
mlpack 4: a fast, header-only C++ machine learning library
inferred← citeshttps://doi.org/10.22028/d291-26651openalex-snapshot
Algorithms for shared-memory matrix completion and maximum inner product search
inferred← citeshttps://doi.org/10.48550/arxiv.1501.05222openalex-snapshot
Plug-and-play dual-tree algorithm runtime analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1601.03754openalex-snapshot
Dual-tree $k$-means with bounded iteration runtime
inferred← citeshttps://doi.org/10.48550/arxiv.1605.09784openalex-snapshot
Fast approximate furthest neighbors with data-dependent hashing
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.