Parallel Computing TEDA Clustering Algorithm
The source code of the parallel computing TEDA clustering algorithm
이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
The package contains:
1. ParallelTEDAClustering.m - The source code of the parallel computing TEDA clustering algorithm;
2. demo.m - The demo
Reference:
Gu X., Angelov P.P., Gutierrez G., Iglesias J.A., Sanchis A. (2017) Parallel Computing TEDA for High Frequency Streaming Data Clustering. In: Angelov P., Manolopoulos Y., Iliadis L., Roy A., Vellasco M. (eds) Advances in Big Data. INNS 2016. Advances in Intelligent Systems and Computing, vol 529. Springer, Cham
Please cite this algorithm using the above reference if this code helps.
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
인용 양식
Gu X., Angelov P.P., Gutierrez G., Iglesias J.A., Sanchis A. (2017) Parallel Computing TEDA for High Frequency Streaming Data Clustering. In: Angelov P., Manolopoulos Y., Iliadis L., Roy A., Vellasco M. (eds) Advances in Big Data. INNS 2016. Advances in Intelligent Systems and Computing, vol 529. Springer, Cham
