이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
The package contains:
1. The recently introduced Self-Organised Direction Aware Data Partitioning Algorithm (SODA);
2. A demo for offline data partitioning;
3. A demo for conducting hybrid between the offline prime and the evolving extension.
SODA algorithm is for data partitioning.
Data partitioning is very close to clustering, but the end result will be the data clouds with irregular shapes instead of clusters with certain shapes.
Reference:
X. Gu, P. Angelov, D. Kangin, J. Principe, Self-organised direction aware data partitioning algorithm, Information Sciences, vol.423, pp. 80-95 , 2018.
If this code is helpful, please cite the above paper.
For any queries about the codes, please contact Prof. Plamen P. Angelov (p.angelov@lancaster.ac.uk) and Dr. Xiaowei Gu (x.gu3@lancaster.ac.uk)
Programmed by Xiaowei Gu
인용 양식
X. Gu, P. Angelov, D. Kangin, J. Principe, Self-organised direction aware data partitioning algorithm, Information Sciences, vol.423, pp. 80-95 , 2018.
