Demo Data from VLDB 2026 / reviewers in the wild / expert
Mizuki Niihori
dblp:400/9956
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 44% Learning theory · 44% Trustworthy machine learning · 13% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory › hypothesis testing
selective inference |
0.9 | 1 | 2025 | Quantifying Statistical Significance of Deep Nearest Neighbor Anomaly Detection via Selective Inference · NeurIPS 2025 |
Machine learning › Probabilistic and Bayesian machine learning
statistical inference |
0.9 | 1 | 2025 | Quantifying Statistical Significance of Deep Nearest Neighbor Anomaly Detection via Selective Inference · NeurIPS 2025 |
Data mining
anomaly detection |
0.9 | 1 | 2025 | Quantifying Statistical Significance of Deep Nearest Neighbor Anomaly Detection via Selective Inference · NeurIPS 2025 |
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.3 | 1 | 2025 | Quantifying Statistical Significance of Deep Nearest Neighbor Anomaly Detection via Selective Inference · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
selective inference · 1.7p-values · 1.7k-nearest neighbors · 0.9k-nearest neighbor · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Quantifying Statistical Significance of Deep Nearest Neighbor Anomaly Detection via Selective InferenceabstractIn real-world applications, anomaly detection (AD) often operates without access to anomalous data, necessitating semi-supervised methods that rely solely on normal data.
Among these methods, deep $k$-nearest neighbor (deep $k$NN) AD stands out for its interpretability and flexibility, leveraging distance-based scoring in deep latent spaces.
Despite its strong performance, deep $k$NN lacks a mechanism to quantify uncertainty—an essential feature for critical applications such as industrial inspection.
To address this limitation, we propose a statistical framework that quantifies the significance of detected anomalies in the form of $p$-values, thereby enabling control over false positive rates at a user-specified significance level (e.g.,0.05).
A central challenge lies in managing selection bias, which we tackle using Selective Inference—a principled method for conducting inference conditioned on data-driven selections.
We evaluate our method on diverse datasets and demonstrate that it provides reliable AD well-suited for industrial use cases. Mizuki Niihori, Shuichi Nishino, Teruyuki Katsuoka, Tomohiro Shiraishi, Kouichi Taji, Ichiro Takeuchi |
NeurIPS | 1 |