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

High-dimensional data hypergraph model construction method based on feature induction

A technology of high-dimensional data and construction methods, applied in complex mathematical operations, character and pattern recognition, instruments, etc., can solve problems such as inability to cluster analysis of high-dimensional data sets, and achieve the effect of reducing the scale of the problem and improving the computing efficiency.

Inactive Publication Date: 2016-01-06
YANCHENG INST OF TECH
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, it is impossible to comprehensively perform cluster analysis on high-dimensional data sets.

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
  • High-dimensional data hypergraph model construction method based on feature induction
  • High-dimensional data hypergraph model construction method based on feature induction
  • High-dimensional data hypergraph model construction method based on feature induction

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0032] Such as figure 1 As shown, a high-dimensional data hypergraph model construction method based on feature induction includes the following steps:

[0033] S01: Discretize the t attribute values ​​of n data records in the high-dimensional data set D, use one data record as a row of the initial matrix X, and use the discretized attribute values ​​of the data record as columns to obtain the initial matrix X;

[0034] S02: Under non-negative conditions, initialize the characteristic base matrix U of the high-dimensional data set and the characteristic coefficient matrix V of the high-dimensional data set;

[0035] S03: Use the iterative function to repeatedly iterate U and V to obtain an approximate solution until the value of the objective function Q(X,U,V) is reduced to the set threshold, and a reduced-scale matrix U' is obtained, where Q(X,U, V) is a distance function; so that the scale of the problem can be significantly reduced, and it can reflect the characteristics o...

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 present invention discloses a high-dimensional data hypergraph model construction method based on feature induction. The method comprises the following steps: discretizing t attribute values of n data records of a high-dimensional data set D, using one data record as one row of an initial matrix X, and using the discretized attribute values of the data record as a column, thereby obtaining the initial matrix X; under the non-negative condition, initializing a high-dimensional data set feature-based matrix U and a high-dimensional data set feature coefficient matrix V; performing repeated iteration on the U and V by using an iteration function to obtain an approximate solution until a value of an objective function Q(X, U, V) is reduced to a set threshold, thereby obtaining a matrix U' with a reduced scale; and considering each row of the matrix U' as a data record, defining different attribute values as nodes of a hypergraph, and constructing one hyperedge of the hypergraph with each row of the matrix U', thereby obtaining the hypergraph G. The high-dimensional data hypergraph model construction method based on feature induction is capable of performing complete cluster analysis on a high-dimensional data set, and can further improve the operation efficiency of a high-dimensional data clustering algorithm.

Description

technical field [0001] The invention relates to a high-dimensional data clustering algorithm, in particular to a method for constructing a high-dimensional data hypergraph model based on feature induction. Background technique [0002] With the development of society, the amount of data has expanded rapidly, and the timeliness and complexity of data have far exceeded the current information processing capabilities. "Informatization" and "globalization" have become two important features of the 21st century. Driven by network technology, people's ability to produce and collect data has greatly improved in the past ten years, and the ability to obtain and produce data has greatly exceeded the ability to process data. Today, when data production and transmission capabilities are far greater than data analysis capabilities, although people are overwhelmed by data, they are hungry for knowledge. So data mining and knowledge discovery technology came into being and developed vig...

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): G06F17/16G06K9/62
Inventor 陈伟高直孟海涛徐秀芳韩立毛
Owner YANCHENG INST OF TECH
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