The invention relates to the field of
machine learning and
pattern recognition, and particularly discloses a variance-
covariance subspace distance-based multi-kernel
subspace clustering method, which comprises the following steps of: S1, acquiring a high-dimensional
data matrix, calculating a variance-
covariance matrix and second-order statistical information thereof, defining a preliminary VCSD kernel value and obtaining a VCSD kernel matrix through
exponential transformation and normalization, constructing a multi-core
pool of r base cores; s2, constructing an optimized objective function based on non-negative matrix factorization, and solving to obtain a local affinity feature map of a block
diagonal structure under constraint conditions; s3, capturing high-order feature association through a
matrix method, and converting
tensor optimization into matrix operation; s4, solving the target function by adopting an alternating optimization strategy, reducing the calculation complexity, and generating a target affinity graph; and S5, clustering the target affinity spectrum, and outputting a result. According to the technical scheme provided by the invention, the problems of missing statistical characteristics,
complex calculation and nuclear
noise interference of the existing method are solved, and the clustering precision and efficiency are effectively improved.