Earticle

초록

영어

As Internet has been wildly spreaded and it's technique is advanced, the use of computers has been routinized and almost data are stored in computers. Accordingly, many companies and researchers have tried to find the relations in these tremendous data and the one way is to use clustering algorithm which is used to find out similar data set in the entire data set and to discover the common properties. In early period, clustering algorithm was performed based on a main memory of a computer and PAM(Partitioning Around Medoids) was representative, which can be complemented k-means algorithm defeat. PAM performs clustering by using the medoid of data instead of means. PAM works well in small data set but it is difficult to apply it to large data set. Therefore, CLARA(Clutering LARge Application) shows up to be used in large data set. This algorithm samples data from large data set and applies PAM to the sample data. CLARA has limits caused by the fixed samples in each clustering stage and has a problem that if the good mediod is not sampled then the result of the clustering becomes not good. CLARANS(Clustering Large Application based upon Randomized Search) overcomes these problems by drawing a sample with some randomness. This algorithm executes clustering using k mediod set extracted in the processing of clustering in each stage. The main objective is to compare and analyze the algorithms which are popularly used for the clustering of big data.

목차

Abstract
1. 서론
2. PAM(Partioning Around Medoid)
3. CLARA(Clustering LARge Application)
4. CLARANS( Clustering Large Application based upon RANdomized Search)
5. 빅 데이터 처리를 위한 효율적 군집화
6. 결론
7. 참고문헌

저자

• 이순근 [ 강릉원주대학교 산업정보경영공학과 ]
• 임영문 [ 강릉원주대학교 산업정보경영공학과 ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  대한안전경영과학회 학술대회논문집

• 간기

  부정기

• 수록기간

  1999~2022

• 십진분류

  KDC 530 DDC 620