This paper proposes a spectral clustering method using k-means and weighted Mahalanobis distance (Referred to as MDLSC) enhance the degree of correlation between data points improve accuracy Laplacian matrix eigenvectors. First, we used coefficient weight calculate any two constructed set; then, based on matrix, K-nearest neighborhood (KNN) algorithm construct similarity matrix. Secondly, regul...

Class overlapping is one of the bottlenecks in data mining and pattern recognition, and affects the classification accuracy and generalization ability directly. In Mahalanobis-Taguchi System (MTS), the normal samples are used to construct reference space, while the abnormal samples are used to verify the validity of the reference space. If there is a class overlapping between the normal samples...

Within the framework of kernel methods, linear data methods have almost completely been extended to their nonlinear counterparts. In this paper, we focus on nonlinear kernel techniques based on the Mahalanobis distance. Two approaches are distinguished here. The first one assumes an invertible covariance operator, while the second one uses a regularized covariance. We discuss conceptual and exp...

Definition In learning systems with kernels, the shape and size of a kernel plays a critical role for accuracy and generalization. Most kernels have a distance metric parameter, which determines the size and shape of the kernel in the sense of a Mahalanobis distance. Advanced kernel learning tune every kernel’s distance metric individually, instead of turning one global distance metric for all ...