메뉴 건너뛰기




Volumn , Issue , 2012, Pages 59-66

Efficient map/reduce-based DBSCAN algorithm with optimized data partition

Author keywords

cloud computing; data clustering; data mining; data partition; DBSCAN; Hadoop; Map Reduce

Indexed keywords

DATA CLUSTERING; DATA PARTITION; DBSCAN; HADOOP; MAP/REDUCE;

EID: 84866768237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLOUD.2012.42     Document Type: Conference Paper
Times cited : (91)

References (23)
  • 5
    • 79956324856 scopus 로고    scopus 로고
    • 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
  • 9
    • 79956257766 scopus 로고    scopus 로고
    • 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
  • 14
    • 84866771223 scopus 로고    scopus 로고
    • Hadoop, http://hadoop.apache.org.
  • 17
    • 35248883970 scopus 로고    scopus 로고
    • 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
  • 21
    • 0032083561 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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


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