Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A disk-based algorithm for fast outlier detection in large datasets

From MaRDI portal
Publication:3520985
Jump to:navigation, search

zbMATH Open1161.68432MaRDI QIDQ3520985FDOQ3520985


Authors: Faxin Zhao, Yubin Bao, Huanliang Sun, Ge Yu Edit this on Wikidata


Publication date: 26 August 2008





Recommendations

  • An algorithm based on partition for outlier detection
  • A fast outlier detection algorithm for data streams based on dynamic grids
  • scientific article; zbMATH DE number 1934540
  • Fast mining of distance-based outliers in metric space
  • Efficient nested-loop based outlier detection algorithm for large data set


zbMATH Keywords

data miningCD-Tree


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Database theory (68P15)



Cited In (5)

  • Title not available (Why is that?)
  • Efficient nested-loop based outlier detection algorithm for large data set
  • Title not available (Why is that?)
  • An algorithm based on partition for outlier detection
  • Fast mining of distance-based outliers in metric space





This page was built for publication: A disk-based algorithm for fast outlier detection in large datasets

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3520985&oldid=16884723"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 23:45. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki