Adaptive spectrum transformation by topology preserving on indefinite proximity data

Similarity-based representation generates indefinite matrices, which are inconsistent with classical kernel-based learning frameworks. In this paper, we present an adaptive spectrum transformation method that provides a positive semidefinite ( psd ) kernel consistent with the intrinsic geometry of proximity data. In the proposed method, an indefinite similarity matrix is rectified by maximizing the Euclidian fac- tor ( EF ) criterion, which represents the similarity of the resulting feature space to Euclidean space. This maximization is achieved by modifying volume elements through applying a conformal transform over the similarity matrix. We performed several experiments to evaluate the performance of the proposed method in comparison with flip, clip, shift , and square spectrum transformation techniques on similarity matrices. Applying the resulting psd matrices as kernels in dimensionality reduction and clustering problems confirms the success of the proposed approach in adapting to data and preserving its topological information. Our experiments show that in classification applications, the superiority of the proposed method is considerable when the negative eigenfraction of the similarity matrix is significant.