Database Reference
In-Depth Information
[3] V. Ganti, R. Ramakrishnan, J. Gehrke, A.L. Powell, and J.C. French:, “Clustering large datasets in arbitrary metric
spaces,”
Proc. Intl. Conf. on Data Engineering
, pp. 502-511, 1999.
[4] H. Garcia-Molina, J.D. Ullman, and J. Widom,
Database Systems: The Complete Book
Second Edition, Prentice-
Hall, Upper Saddle River, NJ, 2009.
[5] S. Guha, R. Rastogi, and K. Shim, “CURE: An efficient clustering algorithm for large databases,”
Proc. ACM
SIGMOD Intl. Conf. on Management of Data
, pp. 73-84, 1998.
[6] T. Zhang, R. Ramakrishnan, and M. Livny, “BIRCH: an efficient data clustering method for very large databases,”
Proc. ACM SIGMOD Intl. Conf. on Management of Data
, pp. 103-114, 1996.
1
You can prove this fact by evaluating a double integral, but we shall not do the math here, as it is not central to the dis-
cussion.
2
This space would not be Euclidean, of course, but the principles regarding hierarchical clustering carry over, with
some modifications, to non-Euclidean clustering.
3
Do not forget that the term “cluster” has two completely different meanings in this section.
