Toward Metric Indexes for Incremental Insertion and Querying
원문 초록
In this work we explore the use of metric index structures, which accelerate nearest neighbor queries, in the scenario where we need to interleave insertions and queries during deployment. This use-case is inspired by a real-life need in malware analysis triage, and is surprisingly understudied. Existing literature tends to either focus on only final query efficiency, often does not support incremental insertion, or does not support arbitrary distance metrics. We modify and improve three algorithms to support our scenario of incremental insertion and querying with arbitrary metrics, and evaluate them on multiple datasets and distance metrics while varying the value of $k$ for the desired number of nearest neighbors. In doing so we determine that our improved Vantage-Point tree of Minimum-Variance performs best for this scenario.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
EMBER2024 -- A Benchmark Dataset for Holistic Evaluation of Malware Classifiers
DecompileBench: A Comprehensive Benchmark for Evaluating Decompilers in Real-World Scenarios
CyberLLMInstruct: A New Dataset for Analysing Safety of Fine-Tuned LLMs Using Cyber Security Data
Is Function Similarity Over-Engineered? Building a Benchmark
Magika: AI-Powered Content-Type Detection
Know Your Neighborhood: General and Zero-Shot Capable Binary Function Search Powered by Call Graphlets
토론
이 논문과 연결된 포럼 글이 아직 없습니다.