Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Sparse subspace clustering algorithm based on semi-supervision

A clustering algorithm and subspace technology, applied in computing, computer components, instruments, etc., can solve problems such as the inability to introduce semi-supervised frameworks, and achieve the effect of increasing applicability and improving clustering performance

Inactive Publication Date: 2017-07-14
JIANGNAN UNIV
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, as a sparse subspace clustering that is different from other clustering algorithms, the existing semi-supervised framework cannot be directly introduced into the sparse subspace model to guide data classification.

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
  • Sparse subspace clustering algorithm based on semi-supervision
  • Sparse subspace clustering algorithm based on semi-supervision
  • Sparse subspace clustering algorithm based on semi-supervision

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] specific implementation plan

[0030] The invention introduces the data prior information into the sparse subspace model, and establishes a semi-supervised framework on the sparse subspace clustering algorithm. Its specific process will be combined with figure 1 The overall flow chart of the algorithm shown is as follows:

[0031] Step 1: Establish a must-connected constraint matrix and a non-connected constraint matrix through the prior information of the data, the forms of which are shown in formula (1) and formula (2) respectively, and the establishment method has been explained in the summary of the invention.

[0032] Step 2: Introduce the data matrix Y and the constraint matrix MC, NC into the semi-supervised sparse subspace model, introduce the auxiliary matrix A and the Lagrange multiplier matrix Δ, and establish the Lagrang corresponding to the hard threshold or soft threshold form The daily augmentation function is shown in formula (5) and formula (6):

[0...

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 discloses a sparse subspace clustering algorithm based on semi-supervision. The sparse subspace clustering algorithm comprises the steps that data prior information is converted into a constraint matrix suitable for a sparse subspace model in the form of point pair constraint; interference of flag-free bits is eliminated in the form of Hadamard product, the state of the coefficient represented by different constraint conditions is also considered and corresponding constraint terms are established; and a semi-supervised sparse subspace model of two hard threshold and soft threshold forms is established by using the constraint terms, and a semi-supervised framework is accordingly established on the sparse subspace clustering algorithm. The clustering accuracy of the sparse subspace algorithm can still be maintained by the algorithm without prior information. Meanwhile, the performance advantages of the sparse subspace clustering algorithm are also absorbed so that the high-dimensional clustering problem containing interference information data can be directly and effectively processed, the clustering performance is ensured to be effectively enhanced under the condition of less known prior information and thus the algorithm applicability can be increased.

Description

technical field [0001] The invention belongs to the algorithm for data classification in the field of data mining, specifically a sparse subspace clustering algorithm based on semi-supervised learning Background technique [0002] Clustering is an unsupervised learning method. Its purpose is to gather the same kind of data together as much as possible and separate the different kinds of data as much as possible, so as to reveal the inherent nature and laws of the data and provide a basis for further data analysis. Sparse subspace clustering algorithm is a relatively advanced clustering algorithm at present, which can effectively deal with high-dimensional and noisy data. Different from other types of clustering algorithms, sparse subspace clustering uses data self-representation characteristics and data sparsity in a specific space to describe data, through a self-representation model with complete theoretical proof, that is, sparse subspace model, Obtain the sparse represe...

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
IPC IPC(8): G06K9/62
CPCG06F18/23G06F18/2155
Inventor 贾旋周治平张威赵晓晓
Owner JIANGNAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products