參考文獻 |
Reference
[1] A.K. Jain , M.N. Murty and P.J. Flynn “Data Clustering:A Review”, ACM Computing
[2] Ankerst M., Breunign M., Kriegel H.p. and Sander J., “OPTICS: Ordering points to identify the clustering structure,” In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’99), pp.49-60, Philadelphia, PA, June 1999
[3] A. Hinneburg and D. A. Keim, "An Efficient Approach to Clustering in Large Multimedia Databases with Noise", KDD'98, New York, Aug. 1998.
[4] Ester M., Kriegel H.P., Sander J. and Xu x., “Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, “In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD’94), pp.226-231, Portland, OR, Aug.1996
[5] Fisher, D.H.” Knowledge acquisition via incremental conceptual clustering,” Machine Learning, 2, pp.139-172,1987
[6] Guha S., Rastogi R. and Shim K., “CURE: An efficient clustering algorithm for large databases,” In Proc. 1998 ACM-SIGMOD Int. Conf. Management of DATA (SIGMOD’98), pp.73-84, Seattle, WA, June 1998
[7] Guha S., Rastogi R. and Shim K., “ROCK: A Robust Clustering Algorithm For Categorical Attribute,” In Proc. 1999 Int. Conf. data Engineering (ICDE’99) pp.512-521, Sydney, Australia, Mar.1999
[8] Gotileb, g. C. and Kumar, S. “Semantic clustering of index terms“, J. ACM 15, pp.493-513, 1968
[9] Han J. and Kamber M., “Data Mining: Concepts and techniques”, Morgan Kaufmann, 2000.
[10] J. H.Gennari, P. Langley, and D. Fisher” Models of Incremental Concept Formation”, Artificial Intelligence, 40,11-61, 1989
[11] Karypis G., Han E.H. and Kumar V., “CHAMELEON: Hierarchical Clustering Using Dynamic Modeling,” IEEE Computer, Vol. 32, No. 8, pp.68-75, (1999)
[12] Kaufman, L. and Rousseeuw, P.J. (1986), Clustering Large Data Sets, in Pattern Elsevier/North-Holland, 425-437
[13] Kaufman L. and Rousseeuw PJ, “Finding Groups in Data: An Introduction to Cluster Analysis,” John wiley &Sons, 1990.
[14] MacQueen J., “Some Methods for Classification and Analysis of Multivariate Observations,” Berkeley Symp. Math. Stat. and Prob., Vol. 1, pp.281-297, 1967
[15] Ng R. and Han J., “Efficient and Effective Clustering Method for Spatial Data Mining,” In Proc. 1994 Int. conf. Very Large Databases (VLDB’94), pp.144-155, Santiago, chile, Sept. 1994
[16] Ozawa, K. “A Stratificational overlapping cluster scheme”, Pattern Recogn. 18, pp.279-286, 1985
[17] Rose, K., gurewitz, E., and Fox, G. C. “Deterministic annealing approach to constrained clustering”, IEEE Trans. Pattern Anal. Intell.15, pp.785-794, March.1993
[18] R. Carraghan and P.M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters 9,pp.375-382, 1990.
[19] Sheikholeslami G., Chatterjee S., and Zhang A., “WaveCluster: A multi-resolution clustering approach for very large spatial databases,” In Proc. 1998 Int. Conf. Very Large Databases (VLD’98), pp.428-439, New York, Aug.1998
[20] Stutz and P. Cheeseman, “Bayesian Approach to Classification,” In Maximum Entropy and Bayesian Methods, Cambridge, 1994, eds. J. Skilling and S. Sibisi. Dordrecht, The Netherlands: Kluwer Academic Publishers. 315
[21] Wang W., Yang and Muntz R., “A Statistical Information grid Approach to Spatial Data Mining, “In Proc. 1997 Int. Conf. Very Large Data Bases(VLDB’97), pp.186-195, Athens, Greece, Aug.1997
[22] Zhang T., Ramakrishnan R. and Livny M., “BIRCH: An Efficient Data Clustering Method for very Large Databases,” In Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data(SIGMOD’96),pp.103-114,1996
[23] Zahn, C. T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Compute. C-20, pp.68-86, Apr.1971
[24] http://www.dcs.gla.ac.uk/~iain/keith/data/concepts/34.htm
[25] http://www.clustan.com/hierarchical_cluster_analysis.html
[26]http://met.psu.edu/~arnottj/newclusterpage/Cluster_Analysis_Description.html |