Automatic Graph Building Approach for Spectral Clustering
Spectral clustering techniques have shown their capability to identify the data relationships using graph analysis, achieving better accuracy than traditional algorithms as k-means. Here, we propose a methodology to build automatically a graph representation over the input data for spectral clustering based approaches by taking into account the local and global sample structure. Regarding this, both the Euclidean and the geodesic distances are used to identify the main relationships between a given point and neighboring samples around it. Then, given the information about the local data structure, we estimate an affinity matrix by means of Gaussian kernel. Synthetic and real-world datasets are tested. Attained results show how our approach outperforms, in most of the cases, benchmark methods.
KeywordsGraph analysis kernel function spectral clustering
- 2.Ng, A.Y., Jordan, M.I., Weiss, Y., et al.: On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 2, 849–856 (2002)Google Scholar
- 3.Perona, P., Zelnik-Manor, L.: Self-tuning spectral clustering. Advances in Neural Information Processing Systems 17, 1601–1608 (2004)Google Scholar
- 4.Pokharel, R., Seth, S., Príncipe, J.: Additive kernel least mean square. In: IJCNN (2013)Google Scholar
- 5.Liping, C., Xuchuan, Z., Jiancheng, S.: The approach of adaptive spectral clustering analyze on high dimensional data. In: ICCIS, pp. 160–162 (2010)Google Scholar
- 6.Garcia, C., Flenner, A., Percus, A.: Multiclass semi-supervised learning on graphs using ginzburg-landau functional minimization. In: Pattern Recognition Applications and Methods (2013)Google Scholar