-
4
-
-
0003585297
-
-
Morgan Kaufmann Publishers, San Francisco, CA
-
J. Han, M. Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, San Francisco, CA, 2001, pp. 335-391.
-
(2001)
Data Mining Concepts and Techniques
, pp. 335-391
-
-
Han, J.1
Kamber, M.2
-
5
-
-
79956324856
-
DPSP: Distributed Progressive Sequential Pattern Mining on the Cloud
-
Jen-Wei Huang, Su-Chen Lin and Ming-Syan Chen, "DPSP: Distributed Progressive Sequential Pattern Mining on the Cloud," Lecture Notes in Computer Science, 2010, Volume 6119/2010, 27-34
-
(2010)
Lecture Notes in Computer Science
, vol.6119
, Issue.2010
, pp. 27-34
-
-
Huang, J.-W.1
Lin, S.-C.2
Chen, M.-S.3
-
7
-
-
77956246010
-
Web-scale computer vision using mapreduce for multimedia data mining
-
WHITE, B., YEH, T., LIN, J., AND DAVIS, L. 2010. Web-scale computer vision using mapreduce for multimedia data mining. Proceedings of the Tenth International Workshop on Multimedia Data Mining, 1-10.
-
(2010)
Proceedings of the Tenth International Workshop on Multimedia Data Mining
, pp. 1-10
-
-
White, B.1
Yeh, T.2
Lin, J.3
Davis, L.4
-
8
-
-
85170282443
-
A density-based algorithm for discovering clusters in large spatial databases with noise
-
M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in: Proceedings of Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, 1996, pp. 226-231.
-
Proceedings of Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, 1996
, pp. 226-231
-
-
Ester, M.1
Kriegel, H.-P.2
Sander, J.3
Xu, X.4
-
9
-
-
79956257766
-
TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality
-
Szczuka, M. (ed.) RSCTC 2010. Springer, Heidelberg
-
Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality. In: Szczuka, M. (ed.) RSCTC 2010. LNCS, vol. 6086, pp. 60-69. Springer, Heidelberg (2010)
-
(2010)
LNCS
, vol.6086
, pp. 60-69
-
-
Kryszkiewicz, M.1
Lasek, P.2
-
10
-
-
16244363661
-
An efficient density-based clustering algorithm for large databases
-
IEEE Computer Society
-
EL-SONBATY, Y., ISMAIL, M. A., AND FAROUK, M. 2004. An efficient density-based clustering algorithm for large databases. In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04). IEEE Computer Society, 673-677.
-
(2004)
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04)
, pp. 673-677
-
-
El-Sonbaty, Y.1
Ismail, M.A.2
Farouk, M.3
-
11
-
-
0003136237
-
Efficient and Effective Clustering Methods for spatial data mining
-
R.T. Ng and J. Han.:" Efficient and Effective Clustering Methods for spatial data mining", Proc. 20th Int. Conf. on Very Large Data Bases, santiago, Chile, 1994, pages 144-155
-
Proc. 20th Int. Conf. on Very Large Data Bases, Santiago, Chile, 1994
, pp. 144-155
-
-
Ng, R.T.1
Han, J.2
-
12
-
-
34548134109
-
GRIDBSCAN: GRId Density-Based Spatial Clustering of Applications with Noise
-
Ozge Uncu, William A. Gruver, Dilip B. Kotak. GRIDBSCAN: GRId Density-Based Spatial Clustering of Applications with Noise. In IEEE International Conference on Systems, Man and Cybernetics, Taipei, Taiwan, 2006 , pp. 2976-2981
-
IEEE International Conference on Systems, Man and Cybernetics, Taipei, Taiwan, 2006
, pp. 2976-2981
-
-
Uncu, O.1
Gruver, W.A.2
Kotak, D.P.3
-
14
-
-
84866771223
-
-
Hadoop, http://hadoop.apache.org.
-
-
-
-
15
-
-
0347172110
-
OPTICS: Ordering points to identify the clustering structure
-
M. Ankerst, M.M. Breunig, H.-P. Kriegel, J. Sander, OPTICS: Ordering points to identify the clustering structure, in: Proceedings of ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, 1999, pp. 49-60
-
Proceedings of ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, 1999
, pp. 49-60
-
-
Ankerst, M.1
Breunig, M.M.2
Kriegel, H.-P.3
Sander, J.4
-
16
-
-
85140527321
-
An efficient approach to clustering in large multimedia databases with noise
-
th International Conference on Knowledge Discovery and Data Mining, New York City, NY, 1998, pp. 58-65.
-
th International Conference on Knowledge Discovery and Data Mining, New York City, NY, 1998
, pp. 58-65
-
-
Hinneburg, A.1
Keim, D.A.2
-
17
-
-
35248883970
-
A new fast clustering algorithm based on reference and density
-
Proceedings of WAIM, Springer
-
S. Ma, T.J. Wang, S.W. Tang, D.Q. Yang, J. Gao, A new fast clustering algorithm based on reference and density, in: Proceedings of WAIM, Lectures Notes in Computer Science, 2762, Springer, 2003, pp. 214-225
-
(2003)
Lectures Notes in Computer Science
, vol.2762
, pp. 214-225
-
-
Ma, S.1
Wang, T.J.2
Tang, S.W.3
Yang, D.Q.4
Gao, J.5
-
18
-
-
49749100044
-
Recommendation via query cen-tered random walk on k-partite graph
-
Cheng, H., Tan, P.-N., Sticklen, J., Punch, W.F.: Recommendation via query cen-tered random walk on k-partite graph. In: Proc. of Intl. Conf. on Data Mining, pp. 457-462 (2007).
-
(2007)
Proc. of Intl. Conf. on Data Mining
, pp. 457-462
-
-
Cheng, H.1
Tan, P.-N.2
Sticklen, J.3
Punch, W.F.4
-
19
-
-
12244308134
-
Parallel computation of high dimen-sional robust correlation and covariance matrices
-
Chilson, J., Ng, R., Wagner, A., Zamar, R.: Parallel computation of high dimen-sional robust correlation and covariance matrices. In: Proc. of Intl. Conf. on Knowl-edge Discovery and Data Mining, August 2004, pp. 533-538 (2004).
-
(2004)
Proc. of Intl. Conf. on Knowl-edge Discovery and Data Mining, August 2004
, pp. 533-538
-
-
Chilson, J.1
Ng, R.2
Wagner, A.3
Zamar, R.4
-
20
-
-
38049134850
-
Multi-party, privacy-preserving distributed data mining using a game theoretic framework
-
Kargupta, H., Das, K., Liu, K.: Multi-party, privacy-preserving distributed data mining using a game theoretic framework. In: Proc. of European Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 523-531 (2007)
-
(2007)
Proc. of European Conf. on Principles and Practice of Knowledge Discovery in Databases
, pp. 523-531
-
-
Kargupta, H.1
Das, K.2
Liu, K.3
-
21
-
-
0032083561
-
Multidimensional access methods
-
V. Gaede and O. Günther, "Multidimensional access methods," ACM Comput. Surv., vol. 30, no. 2, pp. 170-231, 1998.
-
(1998)
ACM Comput. Surv.
, vol.30
, Issue.2
, pp. 170-231
-
-
Gaede, V.1
Günther, O.2
-
22
-
-
0032686723
-
CHAMELEON: A hierarchical clustering algorithm using dynamic modeling
-
G. Karypis, E. H. Han, and V. Kumar, "CHAMELEON: A hierarchical clustering algorithm using dynamic modeling," Computer, vol. 32, no. 8, pp. 68-75, 1999.
-
(1999)
Computer
, vol.32
, Issue.8
, pp. 68-75
-
-
Karypis, G.1
Han, E.H.2
Kumar, V.3
|