원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.8 No.12
2015.12
pp.225-230
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보