Earticle

초록

영어

A framework of granular computing clustering algorithms is proposed in the paper. Firstly, granules are represented as the normal forms, such the diamond granule in 2-domensional space and hyperdiamond granule in N-dimensional space, sphere granule in 2-dimensional space and hypersphere granule in N-dimensional space. Secondly, operations between two granules are designed to realize the transformation between two spaces with different granularities. Thirdly, the threshold of granularity is used to control the join process between two granules. The performance of granular computing algorithms is evaluated by the experimental results on the data sets selected from machine learning repository.

목차

Abstract
 1. Introduction
 2. A Framework of GrCC
  2.1. Representation of Granules
  2.2. Operations between Two Granules
  2.3. The Framework of GrCC
 3. Experiments
 4. Conclusions
 References

키워드

저자

• Hongbing Liu [ School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, China ]
• Chunhua Liu [ School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, China ]
• Chang-an Wu [ School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605