RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

    커널을 이용한 전역 클러스터링의 비선형화

    한글로보기

    https://www.riss.kr/link?id=A101701050

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    Fuzzy c-means (FCM) is a simple but efficient clustering algorithm using the concept of a fuzzy set that has been proved to be useful in many areas. There are, however, several well known problems with FCM, such as sensitivity to initialization, sensitivity to outliers, and limitation to convex clusters. In this paper, global fuzzy c-means (G-FCM) and kernel fuzzy c-means (K-FCM) are combined to form a non-linear variant of G-FCM, called kernel global fuzzy c-means (KG-FCM). G-FCM is a variant of FCM that uses an incremental seed selection method and is effective in alleviating sensitivity to initialization. There are several approaches to reduce the influence of noise and accommodate non-convex clusters, and K-FCM is one of them. K-FCM is used in this paper because it can easily be extended with different kernels. By combining G-FCM and K-FCM, KG-FCM can resolve the shortcomings mentioned above. The usefulness of the proposed method is demonstrated by experiments using artificial and real world data sets.
    번역하기

    Fuzzy c-means (FCM) is a simple but efficient clustering algorithm using the concept of a fuzzy set that has been proved to be useful in many areas. There are, however, several well known problems with FCM, such as sensitivity to initialization, sensi...

    Fuzzy c-means (FCM) is a simple but efficient clustering algorithm using the concept of a fuzzy set that has been proved to be useful in many areas. There are, however, several well known problems with FCM, such as sensitivity to initialization, sensitivity to outliers, and limitation to convex clusters. In this paper, global fuzzy c-means (G-FCM) and kernel fuzzy c-means (K-FCM) are combined to form a non-linear variant of G-FCM, called kernel global fuzzy c-means (KG-FCM). G-FCM is a variant of FCM that uses an incremental seed selection method and is effective in alleviating sensitivity to initialization. There are several approaches to reduce the influence of noise and accommodate non-convex clusters, and K-FCM is one of them. K-FCM is used in this paper because it can easily be extended with different kernels. By combining G-FCM and K-FCM, KG-FCM can resolve the shortcomings mentioned above. The usefulness of the proposed method is demonstrated by experiments using artificial and real world data sets.

    더보기

    참고문헌 (Reference)

    1 A. Asuncion, "UCI Machine Learning Repository"

    2 A.Likas, "The global k-means clustering algorithm" 36 (36): 451-461, 2003

    3 W. Wang, "The global fuzzy c-means clustering algorithm" 3604-3607, 2006

    4 R. Xu, "Survey of clustering algorithms" 16 (16): 645-678, 2005

    5 J.B.MacQueen, "Some methods for classification and analysis of multivariate observations" 281-297, 1966

    6 R. J. Hathaway, "Optimization of clustering criteria by reformulation" 3 (3): 241-245, 1995

    7 A.M.Bagirov, "Modified global k-means algorithm for minimum sum-of-squares clustering problems" 41 (41): 3192-3199, 2008

    8 M. Girolami, "Mercer kernel-based clustering in feature space" 13 (13): 780-784, 2002

    9 J. He, "Initialization of cluster refinement algorithms: A review and comparative study" 297-302, 2004

    10 M. Meila, "Comparing clusterings-an information based distance" 98 (98): 873-895, 2007

    1 A. Asuncion, "UCI Machine Learning Repository"

    2 A.Likas, "The global k-means clustering algorithm" 36 (36): 451-461, 2003

    3 W. Wang, "The global fuzzy c-means clustering algorithm" 3604-3607, 2006

    4 R. Xu, "Survey of clustering algorithms" 16 (16): 645-678, 2005

    5 J.B.MacQueen, "Some methods for classification and analysis of multivariate observations" 281-297, 1966

    6 R. J. Hathaway, "Optimization of clustering criteria by reformulation" 3 (3): 241-245, 1995

    7 A.M.Bagirov, "Modified global k-means algorithm for minimum sum-of-squares clustering problems" 41 (41): 3192-3199, 2008

    8 M. Girolami, "Mercer kernel-based clustering in feature space" 13 (13): 780-784, 2002

    9 J. He, "Initialization of cluster refinement algorithms: A review and comparative study" 297-302, 2004

    10 M. Meila, "Comparing clusterings-an information based distance" 98 (98): 873-895, 2007

    11 M.Filippone, "A survey of kernel and spectral methods for clustering" 41 (41): 176-190, 2008

    12 H.-S.Tsai, "A study on kernel-based clustering algorithms" Chung Yuan Christian University 2007

    더보기

    동일학술지(권/호) 다른 논문

    동일학술지 더보기

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2026 평가 재인증평가 신청대상 (재인증)
    2020-01-01 등재 등재학술지 유지 (재인증) KCI등재
    2017-01-01 등재 등재학술지 유지 (계속평가) KCI등재
    2013-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2010-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2007-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    2006-01-01 등재 등재후보 1차 PASS (등재후보1차) KCI등재후보
    2004-07-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.44 0.44 0.44
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.43 0.38 0.58 0.15
    더보기

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼