Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

103

Voted

KDD
2001
ACM

150views Data Mining» more KDD 2001»

Mining top-n local outliers in large databases

15 years 7 months ago

Mining top-n local outliers in large databases

Download www.cs.uiuc.edu

Wen Jin, Anthony K. H. Tung, Jiawei Han

Real-time Traffic

KDD 2001 |

claim paper

Related Content

» Efficient Algorithms for Mining Outliers from Large Data Sets

» LoOP local outlier probabilities

» Feature bagging for outlier detection

» Parallel Mining of Outliers in Large Database

» Mining distancebased outliers from large databases in any metric space

» Subspace outlier mining in large multimedia databases

» LOF Identifying DensityBased Local Outliers

» Robust Decision Trees Removing Outliers from Databases

» Algorithms for Mining DistanceBased Outliers in Large Datasets

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	KDD
Authors	Wen Jin, Anthony K. H. Tung, Jiawei Han

Comments (0)