1[1]Hang T. BIRCH. An efficient data clustering method for very large database. In: Proc of the ACM SIGMOD International Conf. on Management of Data Montreal: ACM press, 1996,83 ～ 94.
2[2]Udipto Guha, Rastogi R, Shim K. CURE: A clustering algorithm for large databases. Technical report, Bell Laboratories, Mucray Hill, 1997,67 ～ 78,1998,73 ～ 84.
3[3]Martin Ester, Hans- Peter Kriegel, Jorg Sander, Xiaowei Xu. A desitybased algorithm for Discovery clusters in large spatial databs e with noise.In Proc. Of 2th International Conference on knowledge Discovery in Databases and Data Mining, Portland, Oregon, August, 1996.
4[4]Gehrke J,Agrawal R,Gunopulos D,Raghavan P.Automatic Subspace Glustering of High Dimensional Data for Data Mining Applications. ACM SIGMOD, 1998,72(2) :94 ～ 105.
5[5]Christopher J., Philip K., Systems for Knowledge Discovery in Databases.IEEE Trans. On Knowledge and Data Engineering. 1993,5 (6) :903 ～ 913.
6[6]OPERSKI K., Han J., Adhikary J., Mining Knowledge in geographic data. In Comm. ACM 1997.
7[7]Fayyad U., Haussler D., Mining Scientific Data, Communication of the ACM, 1996,39(11).
8[8]Inmon W. ,Building the Data Warehouse. Boston:QED Technical Publishing Croup, 1992,163 ～ 312.
