1. Ankerst M., Breunig M. M., Kriegel H.-P., Sander J.: “OPTICS: Ordering Points To Identify the Clustering Structure”,Proc. ACM SIGMOD’99 Int. Conf. on Management of Data, Philadelphia, 1999, pp. 49–60.
2. Bradley P. S., Fayyad U., Reina C.: “Scaling Clustering Algorithms to Large Databases”, Proc.4th Int. Conf. on Knowledge Discovery and Data Mining, New York, NY, AAAI Press, 1998, pp. 9–15.
3. Berchthold S., Keim D., Kriegel H.-P.: “The X-Tree: An Index Structure for High-Dimensional Data”, 22nd Conf. on Very Large Data Bases, Bombay,India,1996, pp. 28–39.
4. DuMouchel W., Volinsky C., Johnson T., Cortez C., Pregibon D.: “Sqashing Flat Files Flatter”, Proc. 5th Int. Conf. on Knowledge Discovery and Data Mining, San Diego, CA, AAAI Press, 1999, pp. 6–15.
5. Ester M., Kriegel H.-P., Sander J., Xu X.: “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, 1996, pp. 226–231.