RISS 학술연구정보서비스

검색
다국어 입력

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

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

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • SCOPUSKCI등재

        Incremental Fuzzy Clustering Based on a Fuzzy Scatter Matrix

        Liu, Yongli,Wang, Hengda,Duan, Tianyi,Chen, Jingli,Chao, Hao Korea Information Processing Society 2019 Journal of information processing systems Vol.15 No.2

        For clustering large-scale data, which cannot be loaded into memory entirely, incremental clustering algorithms are very popular. Usually, these algorithms only concern the within-cluster compactness and ignore the between-cluster separation. In this paper, we propose two incremental fuzzy compactness and separation (FCS) clustering algorithms, Single-Pass FCS (SPFCS) and Online FCS (OFCS), based on a fuzzy scatter matrix. Firstly, we introduce two incremental clustering methods called single-pass and online fuzzy C-means algorithms. Then, we combine these two methods separately with the weighted fuzzy C-means algorithm, so that they can be applied to the FCS algorithm. Afterwards, we optimize the within-cluster matrix and betweencluster matrix simultaneously to obtain the minimum within-cluster distance and maximum between-cluster distance. Finally, large-scale datasets can be well clustered within limited memory. We implemented experiments on some artificial datasets and real datasets separately. And experimental results show that, compared with SPFCM and OFCM, our SPFCS and OFCS are more robust to the value of fuzzy index m and noise.

      • KCI등재

        Incremental fuzzy clustering based on a fuzzy scatter matrix

        Yongli Liu,Hengda Wang,Tianyi Duan,Jingli Chen,Hao Chao 한국정보처리학회 2019 Journal of information processing systems Vol.15 No.2

        For clustering large-scale data, which cannot be loaded into memory entirely, incremental clustering algorithmsare very popular. Usually, these algorithms only concern the within-cluster compactness and ignore thebetween-cluster separation. In this paper, we propose two incremental fuzzy compactness and separation (FCS)clustering algorithms, Single-Pass FCS (SPFCS) and Online FCS (OFCS), based on a fuzzy scatter matrix. Firstly, we introduce two incremental clustering methods called single-pass and online fuzzy C-meansalgorithms. Then, we combine these two methods separately with the weighted fuzzy C-means algorithm, sothat they can be applied to the FCS algorithm. Afterwards, we optimize the within-cluster matrix and betweenclustermatrix simultaneously to obtain the minimum within-cluster distance and maximum between-clusterdistance. Finally, large-scale datasets can be well clustered within limited memory. We implemented experimentson some artificial datasets and real datasets separately. And experimental results show that, compared withSPFCM and OFCM, our SPFCS and OFCS are more robust to the value of fuzzy index m and noise.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼