| A Cost Model for Reverse Nearest Neighbor Query Processing on R-Trees Using Self Pruning
|
2021 |
Borutta, Felix |
| Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query Processing
|
2021 |
Hünemörder, Maximilian |
| Fairest Neighbors: Tradeoffs Between Metric Queries
|
2021 |
Hetland, Magnus Lie |
| Local Intrinsic Dimensionality and Graphs: Towards LID-aware Graph Embedding Algorithms
|
2021 |
Savic, Miloš |
| Relationships Between Local Intrinsic Dimensionality and Tail Entropy
|
2021 |
Bailey, James |
| The Effect of Random Projection on Local Intrinsic Dimensionality
|
2021 |
Houle, Michael E. |
| Handling Class Imbalance in k-Nearest Neighbor Classification by Balancing Prior Probabilities
|
2021 |
Gøttcke, Jonatan Møller Nuutinen |
| Towards an Italian Healthcare Knowledge Graph
|
2021 |
Postiglione, Marco |
| A Triangle Inequality for Cosine Similarity
|
2021 |
Schubert, Erich |
| Data-Driven Learned Metric Index: An Unsupervised Approach
|
2021 |
Slanináková, Terézia |
| Accelerating Spherical k-Means
|
2021 |
Schubert, Erich |
| MESS: Manifold Embedding Motivated Super Sampling
|
2021 |
Thordsen, Erik |
| What Makes a Good Movie Recommendation? Feature Selection for Content-Based Filtering
|
2021 |
Gawinecki, Maciej |
| Indexed Polygon Matching Under Similarities
|
2021 |
Luque-Suarez, Fernando |
| Graph Embedding in Vector Spaces Using Matching-traphs
|
2021 |
Fuchs, Mathias |
| An A*-algorithm for the Unordered Tree Edit Distance wıth Custom Costs
|
2021 |
Paaßen, Benjamin |
| Scaling Up Set Similarity Joins Using a Cost-Based Distributed-Paralle Framework
|
2021 |
Fier, Fabian |
| On Generalizing Permutation-Based Representations for Approximate Search
|
2021 |
Vadicamo, Lucia |
| Similarity vs. Relevance: From Simple Searches to Complex Discovery
|
2021 |
Skopal, Tomáš |
| Optimizing Fair Approximate Nearest Neighbor Searches Using Threaded B+ Trees
|
2021 |
Jafari, Omid |
Tag hinzufügen