Prev: Applet

Go Back Home

HTML Documentation:

This html tutorial is mainly based on :

[RRS00]  Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim, Effiecient Algorithms for Mining Outliers from Large Data Sets,  In Proc. of the ACM SIGMOD International Conference on Management of Data, 2000.

Other References:

[BKSS90] N. Beckmann, H.P. Kriegel, R. Schneider and B. Segger. The R* Tree: an efficient and robust access method for Points and Rectangles. In Proc. of ACM SIGMOD, Pages 322-331, Atlantic City, NJ, May 1990

[KN98] Edwin Knorr and Raymond Ng, Algorithms for mining distance based outliers in large datasets. In Proc. of the VLDB Conference, Pages: 392-403, New York, USA, September 98.

[Sam89] H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1989.

[ZRL96] Tian Zhang, Raghu Ramakrishnan and Miron Livny. Birch An efficient data clustering method for very large databases. In proceeding of the ACM SIGMOD Conference on Management of Data, pages 103- 114, Montreal, Canada, June 1996.

Applet:

The applet code is based on an excellent applet on Nearest Neighbor rule. This applet can be found at http://cgm.cs.mcgill.ca/~soss/cs644/projects/perrier/Nearest.html

Acknowledgement:

I'd like to thank Erin Mcleish and Junaed Sattar for their valuable suggestions to enrich this project. 

Prev: Applet                                                                                                                                                    Go Back Home