-
1
-
-
0032090765
-
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications
-
R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, "Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications", In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), 1998, pp. 94-105.
-
Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), 1998
, pp. 94-105
-
-
Agrawal, R.1
Gehrke, J.2
Gunopulos, D.3
Raghavan, P.4
-
2
-
-
0347718066
-
Fast Algorithms for Projected Clustering
-
C. C. Aggarwal, C. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park, "Fast Algorithms for Projected Clustering", In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99), 1999, pp. 61-72.
-
(1999)
Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99)
, pp. 61-72
-
-
Aggarwal, C.C.1
Procopiuc, C.2
Wolf, J.L.3
Yu, P.S.4
Park, J.S.5
-
4
-
-
84953806973
-
Scaling Clustering Algorithms to Large Databases
-
P. Bradely, U. Fayyad, and C. Reina, "Scaling Clustering Algorithms to Large Databases", In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98), 1998, pp. 8-15.
-
Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98), 1998
, pp. 8-15
-
-
Bradely, P.1
Fayyad, U.2
Reina, C.3
-
5
-
-
84947205653
-
When Is 'Nearest Neighbor' Meaningful?
-
K. Beyer, J. Goldstein, R. Ramakhrisnan, and U. Shaft, "When Is 'Nearest Neighbor' Meaningful?", In Proc. 7th Int. Conf. on Database Theory (ICDT'99), 1999, pp. 217-235.
-
Proc. 7th Int. Conf. on Database Theory (ICDT'99), 1999
, pp. 217-235
-
-
Beyer, K.1
Goldstein, J.2
Ramakhrisnan, R.3
Shaft, U.4
-
6
-
-
85170282443
-
A Density-Based Algorithm for Discovering Clusters in Large Spatial Database
-
M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, "A Density-Based Algorithm for Discovering Clusters in Large Spatial Database", In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96), 1996, pp. 226-231.
-
Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96), 1996
, pp. 226-231
-
-
Ester, M.1
Kriegel, H.-P.2
Sander, J.3
Xu, X.4
-
7
-
-
0002679222
-
Scalability for Clustering Algorithms Revisited
-
F. Farnstrom, J. Lewis, and C. Elkan, "Scalability for Clustering Algorithms Revisited", SIGKDD Explorations Vol. 2, 2000, pp. 51-57.
-
(2000)
SIGKDD Explorations
, vol.2
, pp. 51-57
-
-
Farnstrom, F.1
Lewis, J.2
Elkan, C.3
-
8
-
-
0032091595
-
CURE: An Efficient Clustering Algorithm for Large Databases
-
S. Guha, R. Rastogi, and K. Shim, "CURE: An Efficient Clustering Algorithm for Large Databases", In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), 1998, pp. 73-84.
-
Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), 1998
, pp. 73-84
-
-
Guha, S.1
Rastogi, R.2
Shim, K.3
-
9
-
-
1542292055
-
What Is the Nearest Neighbor in High Dimensional Spaces?
-
A. Hinneburg, C. C. Aggarwal, D. A. Keim, "What Is the Nearest Neighbor in High Dimensional Spaces?", In Proc. 26th Int. Conf. on Very Large Data Bases (VLDB '00), 2000, pp.. 506-515.
-
Proc. 26th Int. Conf. on Very Large Data Bases (VLDB '00), 2000
, pp. 506-515
-
-
Hinneburg, A.1
Aggarwal, C.C.2
Keim, D.A.3
-
14
-
-
0001457509
-
Some Methods for Classification and Analysis of Multivariate Observations
-
J. MacQueen, "Some Methods for Classification and Analysis of Multivariate Observations", In Proc. 5th Berkeley Symp. Math. Statist, Prob. Vol. 1, 1967, pp. 281-297.
-
(1967)
Proc. 5th Berkeley Symp. Math. Statist, Prob.
, vol.1
, pp. 281-297
-
-
MacQueen, J.1
-
15
-
-
0242387333
-
-
Technical Report 9906-010, Northwestern University
-
H. Nagesh, S. Goil, and A. Choudhary, "MAFIA: Efficient and Scalable Subspace Clustering for Very Large Data Sets", Technical Report 9906-010, Northwestern University, 1999.
-
(1999)
MAFIA: Efficient and Scalable Subspace Clustering for Very Large Data Sets
-
-
Nagesh, H.1
Goil, S.2
Choudhary, A.3
-
18
-
-
0003052357
-
WaveCtuster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
-
G. Sheikholeslami, S. Chatterjee, and A. Zhang, "WaveCtuster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases", In Proc. 1998 Int. Conf. on Very Large Data Bases (VLDB '98), 1998, pp. 428-439.
-
Proc. 1998 Int. Conf. on Very Large Data Bases (VLDB '98), 1998
, pp. 428-439
-
-
Sheikholeslami, G.1
Chatterjee, S.2
Zhang, A.3
-
19
-
-
0031479641
-
Data-Based Choice of Histogram Bin Width
-
M. P. Wand, "Data-Based Choice of Histogram Bin Width", The American Statistician Vol. 51, 1996, pp. 59-64.
-
(1996)
The American Statistician
, vol.51
, pp. 59-64
-
-
Wand, M.P.1
-
20
-
-
84994158589
-
STING: A Statistical Information Grid Approach to Spatial Data Mining
-
W. Wang, J. Yang, M. Muntz, "STING: A Statistical Information Grid Approach to Spatial Data Mining", In Proc. 1997 Int. Conf. on Very Large Data Bases (VLDB'97), 1997, pp. 186-195.
-
Proc. 1997 Int. Conf. on Very Large Data Bases (VLDB'97), 1997
, pp. 186-195
-
-
Wang, W.1
Yang, J.2
Muntz, M.3
-
21
-
-
0030157145
-
BIRCH: An efficient Data Clustering Method for Very Large Databases
-
T. Zhang, R. Ramakhrisnan, and M. Livny, "BIRCH: An efficient Data Clustering Method for Very Large Databases", In Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96), 1996, pp. 103-114.
-
Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96), 1996
, pp. 103-114
-
-
Zhang, T.1
Ramakhrisnan, R.2
Livny, M.3
|