ipsdk::math::SpectralClustering Class Reference

Spectral clustering algorithm associated to a kernel kmeans clustering algorithm. More...

#include <SpectralClustering.h>

Detailed Description

Spectral clustering algorithm associated to a kernel kmeans clustering algorithm.

Author

E.Noirfalise

Date

2018/08/14

Copyright

2018 Reactiv'IP, all right reserved.

Warning

this algorithm may request long processing times since it compute an eigen decomposition problem with size MxM where M is equal to number of input data. to reduce processing time, used can :

• sample input data to reduce input data size
• use a 'lighter' algorithm such as Kernel KMeans

See also

Jianbo Shi and Jitendra Malik, Normalized Cuts and Image Segmentation, ieee transactions on pattern analysis and machine intelligence, vol. 22, no. 8, august 2000

Dhillon, I.S. and Guan, Y. and Kulis, B. (2004). Kernel k-means: spectral clustering and normalized cuts. Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining. pp. 551–556.

https://en.wikipedia.org/wiki/Spectral_clustering

---

The documentation for this class was generated from the following file:

• /media/reactivipdev/Nightly/IPSDK_Patch/IPSDK_4_1/IPSDK_Nightly/include/public/IPSDKMath/Clustering/SpectralClustering.h