most citedLearning Efficient Anomaly Detectors from -NN Graphs

5 citations · 5 across the 2 of their papers we have counts for

collaborators

2 papers

cs.LG2015★ 5 cited

Learning Efficient Anomaly Detectors from -NN Graphs

Jing Qian, Jonathan Root, Venkatesh Saligrama

We propose a non-parametric anomaly detection algorithm for high dimensional data. We score each datapoint by its average -NN distance, and rank them accordingly. We then train…

stat.ML2013

Spectral Clustering with Unbalanced Data

Jing Qian, Venkatesh Saligrama

Spectral clustering (SC) and graph-based semi-supervised learning (SSL) algorithms are sensitive to how graphs are constructed from data. In particular if the data has proximal and…