메뉴 건너뛰기




Volumn , Issue , 2014, Pages 49-60

Projected clustering for huge data sets in MapReduce

Author keywords

Huge data; MapReduce; Projected clustering

Indexed keywords

DATA MINING; DATABASE SYSTEMS; VIRTUAL REALITY;

EID: 85014420986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5441/002/edbt.2014.06     Document Type: Conference Paper
Times cited : (9)

References (16)
  • 1
    • 67149084291 scopus 로고    scopus 로고
    • Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering
    • March
    • Kriegel, H. P., Kröger, P., Zimek, A.: Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans. Knowl. Discov. Data 3 (1) (March 2009) 1:1-1:58
    • (2009) ACM Trans. Knowl. Discov. Data , vol.3 , Issue.1 , pp. 11-158
    • Kriegel, H.P.1    Kröger, P.2    Zimek, A.3
  • 3
    • 80052686089 scopus 로고    scopus 로고
    • Clustering very large multi-dimensional datasets with MapReduce
    • Apté, C., Ghosh, J., Smyth, P., eds.
    • Cordeiro, R. L. F., Jr., C. T., Traina, A. J. M., López, J., Kang, U., Faloutsos, C.: Clustering very large multi-dimensional datasets with MapReduce. In Apté, C., Ghosh, J., Smyth, P., eds.: KDD, ACM (2011) 690-698
    • (2011) KDD, ACM , pp. 690-698
    • Cordeiro, R.L.F.1    CT2    Traina, A.J.M.3    López, J.4    Kang, U.5    Faloutsos, C.6
  • 4
    • 0347718066 scopus 로고    scopus 로고
    • Fast algorithms for projected clustering
    • Delis, A., Faloutsos, C., Ghandeharizadeh, S., eds.:, ACM Press
    • Aggarwal, C. C., Procopiuc, C. M., Wolf, J. L., Yu, P. S., Park, J. S.: Fast algorithms for projected clustering. In Delis, A., Faloutsos, C., Ghandeharizadeh, S., eds.: SIGMOD Conference, ACM Press (1999) 61-72
    • (1999) SIGMOD Conference , pp. 61-72
    • Aggarwal, C.C.1    Procopiuc, C.M.2    Wolf, J.L.3    Yu, P.S.4    Park, J.S.5
  • 5
    • 0036361164 scopus 로고    scopus 로고
    • A Monte Carlo algorithm for fast projective clustering
    • Franklin, M. J., Moon, B., Ailamaki, A., eds.
    • Procopiuc, C. M., Jones, M., Agarwal, P. K., Murali, T. M.: A Monte Carlo algorithm for fast projective clustering. In Franklin, M. J., Moon, B., Ailamaki, A., eds.: SIGMOD Conference, ACM (2002) 418-427
    • (2002) SIGMOD Conference, ACM , pp. 418-427
    • Procopiuc, C.M.1    Jones, M.2    Agarwal, P.K.3    Murali, T.M.4
  • 7
    • 84901806243 scopus 로고    scopus 로고
    • MR-DSJ: Distance-based self-join for large-scale vector data analysis with mapreduce
    • Markl, V., Saake, G., Sattler, K. U., Hackenbroich, G., Mitschang, B., Härder, T., Köppen, V., eds.:, Volume 214 of LNI., GI
    • Seidl, T., Fries, S., Boden, B.: MR-DSJ: Distance-Based Self-Join for Large-Scale Vector Data Analysis with MapReduce. In Markl, V., Saake, G., Sattler, K. U., Hackenbroich, G., Mitschang, B., Härder, T., Köppen, V., eds.: BTW. Volume 214 of LNI., GI (2013) 37-56
    • (2013) BTW , pp. 37-56
    • Seidl, T.1    Fries, S.2    Boden, B.3
  • 8
    • 65449163900 scopus 로고    scopus 로고
    • Finding non-redundant, statistically significant regions in high dimensional data: A novel approach to projected and subspace clustering
    • Li, Y., Liu, B., Sarawagi, S., eds.
    • Moise, G., Sander, J.: Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In Li, Y., Liu, B., Sarawagi, S., eds.: KDD, ACM (2008) 533-541
    • (2008) KDD, ACM , pp. 533-541
    • Moise, G.1    Sander, J.2
  • 9
    • 84949487685 scopus 로고    scopus 로고
    • A scalable parallel subspace clustering algorithm for massive data sets
    • Nagesh, H. S., Goil, S., Choudhary, A. N.: A Scalable Parallel Subspace Clustering Algorithm for Massive Data sets. In: ICPP. (2000) 477-484
    • (2000) ICPP , pp. 477-484
    • Nagesh, H.S.1    Goil, S.2    Choudhary, A.N.3
  • 10
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. In: OSDI. (2004) 137-150
    • (2004) OSDI , pp. 137-150
    • Dean, J.1    Ghemawat, S.2
  • 11
    • 83055191163 scopus 로고    scopus 로고
    • External evaluation measures for subspace clustering
    • Macdonald, C., Ounis, I., Ruthven, I., eds.
    • Günnemann, S., Färber, I., Müller, E., Assent, I., Seidl, T.: External evaluation measures for subspace clustering. In Macdonald, C., Ounis, I., Ruthven, I., eds.: CIKM, ACM (2011) 1363-1372
    • (2011) CIKM, ACM , pp. 1363-1372
    • Günnemann, S.1    Färber, I.2    Müller, E.3    Assent, I.4    Seidl, T.5
  • 16
    • 56049109090 scopus 로고    scopus 로고
    • Map-reduce for machine learning on multicore
    • Schölkopf, B., Platt, J. C., Hoffman, T., eds.:, MIT Press
    • Chu, C. T., Kim, S. K., Lin, Y. A., Yu, Y., Bradski, G. R., Ng, A. Y., Olukotun, K.: Map-reduce for machine learning on multicore. In Schölkopf, B., Platt, J. C., Hoffman, T., eds.: NIPS, MIT Press (2006) 281-288
    • (2006) NIPS , pp. 281-288
    • Chu, C.T.1    Kim, S.K.2    Lin, Y.A.3    Yu, Y.4    Bradski, G.R.5    Ng, A.Y.6    Olukotun, K.7


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.