Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Multi-view spectral clustering algorithm based on tensor expansion

A spectral clustering algorithm and multi-view technology, applied in the field of data mining, can solve problems such as only considering the fusion of view information and ignoring the spatial structure relationship information of views

Inactive Publication Date: 2016-11-16
SUN YAT SEN UNIV +2
View PDF0 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] However, for the multi-view clustering problem, the existing methods almost all use matrix to represent the data of each view, only considering the information fusion of the view itself, ignoring the spatial structure relationship information between views

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multi-view spectral clustering algorithm based on tensor expansion
  • Multi-view spectral clustering algorithm based on tensor expansion
  • Multi-view spectral clustering algorithm based on tensor expansion

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0071] like figure 1 As shown, a multi-view spectral clustering algorithm based on tensor expansion, including the following steps:

[0072] S1: Represent each view through a graph structure to obtain its respective probability transition matrix;

[0073] S2: use a tensor represents the probability transition matrix of all views (such as Figure 2-4 As shown, the front slice of each tensor represents the probability transition matrix of a view), and a probability transition matrix P is obtained by using the data distribution law to model and solve;

[0074] S3: The probability transition matrix P is used as the key input of the spectral clustering algorithm based on the Markov chain, and the output result of the spectral clustering is calculated;

[0075] where n represents the total number of samples and m represents the total number of views.

[0076] Further, the specific process of the step S2 includes:

[0077] S21: pair tensor Perform Mode-1 expansion, such as ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a multi-view spectral clustering algorithm based on tensor expansion. All view data is expressed on the basis of a tensor and is expanded by the n-Mode multiplication of the tensor, the multidimensional constraint relationship (high-dimensional structure information) of multi-view data is analyzed, and key structure information is stored in view of thoughts of low rank representation and sparse representation so as to establish a solving model based on the tensor expansion. In addition, a noise problem in a practical data acquisition process is considered, and the noise tensor is added to carry out noise-proof processing. Since a non-convex low-rank constraint condition is in the presence in an optimization problem, direct solving is difficult, an optimal object needs to be subjected to convex relaxation, and then, and an ADMM (Alternating Direction Method of Multipliers) algorithm is used for carrying out optimal solving. An experiment result of certain real datasets indicates that a multi-view spectral clustering effect can be effectively improved.

Description

technical field [0001] The present invention relates to the field of data mining, more specifically, to a multi-view spectrum clustering algorithm based on tensor expansion. Background technique [0002] The multi-view clustering problem mainly improves the performance of clustering by integrating useful information in multiple views. At present, related algorithm research can be roughly divided into three categories: based on multi-image fusion algorithm, based on collaborative training algorithm, and based on subspace learning algorithm. [0003] First, based on the multi-image fusion algorithm. The idea of ​​this type of method is to construct a graph structure for each view, and then fuse these graph structures. In 2007, the research of Professor Dengyong Zhou and Professor Christopher J.C.Burges of Microsoft Research showed that a random walk was defined for each graph structure, and then a Markov mixture model was defined for all random walks to integrate information...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06K9/62
CPCG06F18/2321G06F18/295
Inventor 张燕柯戈扬潘炎印鉴
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com