Reduction in execution cost of k-nearest neighbor based outlier detection method

DOI10.1007/978-981-13-0023-3_6zbMATH Open1460.62066OpenAlexW2797788004MaRDI QIDQ5114856FDOQ5114856

Authors: Sanjoli Poddar, Bidyut Kr. Patra 

Publication date: 29 June 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-13-0023-3_6

Recommendations

• Outlier detection using binary decision diagrams
• scientific article; zbMATH DE number 1934540
• A precise ranking method for outlier detection
• Fast mining of distance-based outliers in metric space
• Discovery Science

zbMATH Keywords

\(k\)-nearest neighborexecution timedensity based outlier detection methodLOF (local outlier factor)

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Large deviations (60F10) Statistics of extreme values; tail inference (62G32) Order statistics; empirical distribution functions (62G30)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• A precise ranking method for outlier detection

Uses Software

• LOF

This page was built for publication: Reduction in execution cost of \(k\)-nearest neighbor based outlier detection method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114856)