K-DSM uses per-feature kurtosis to set noise scales in DSM, enabling effective single-scale anomaly detection on tabular benchmarks in both semi-supervised and unsupervised settings.
Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data , pages=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
MCBP detects boundaries by computing discrete mean curvature from k-nearest neighbor patches on the data manifold, then decomposes data into low-curvature smooth and high-curvature boundary subsets to improve clustering.
citing papers explorer
-
Kurtosis-Guided Denoising Score Matching for Tabular Anomaly Detection
K-DSM uses per-feature kurtosis to set noise scales in DSM, enabling effective single-scale anomaly detection on tabular benchmarks in both semi-supervised and unsupervised settings.
-
A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning
MCBP detects boundaries by computing discrete mean curvature from k-nearest neighbor patches on the data manifold, then decomposes data into low-curvature smooth and high-curvature boundary subsets to improve clustering.