Integrated multi-objective evolutionary automatic clustering method based on minimum spinning tree

A multi-objective evolution and automatic clustering technology, which is applied in the field of integrated multi-objective evolutionary automatic clustering, can solve the problems of reducing accuracy, reducing the classification accuracy of gene expression data, increasing the burden of classifier design, etc., and achieving enhanced search capabilities Effect

Active Publication Date: 2015-12-09
XIDIAN UNIV
View PDF4 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

This patented technology allows for efficient searching by generating minimal paths through large amounts of data without producing any legal or harmful side-effects from existing methods like Cohen's algorithms. It also enhances the efficiency of finding specific parts within these data points based on their similarity between them.

Problems solved by technology

Technological Problem addressed in this patents relates to improving the efficiency and effectiveness of analyzing complex datasets like genomics while also considering factors like structure bias and spuriousness among these variables. Existing methods require manual input and may result in errors due to lack of knowledge about specific attributes associated with each dataset' characteristics. Therefore there needs an improved way to efficiently identify relevant relationships within big data sources without manually labelled categorization techniques.

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
  • Integrated multi-objective evolutionary automatic clustering method based on minimum spinning tree
  • Integrated multi-objective evolutionary automatic clustering method based on minimum spinning tree
  • Integrated multi-objective evolutionary automatic clustering method based on minimum spinning tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] Combine below figure 1 The specific implementation steps of the present invention are further described in detail.

[0049] Step 1. Input the gene dataset to be clustered.

[0050] Step 2. Initialize.

[0051] When c>2, the category number interval of the initial population individual is [c-2,c+2], when c≤2, the category number interval of the initial population individual is [2,c+2], where c means The true number of categories of the gene dataset to be clustered.

[0052] Using the K-means algorithm, each value in the category number interval of the gene data set to be clustered is used as the number of categories of the gene data set to be clustered, and the gene data set to be clustered with the determined number of categories is clustered to obtain different The K-means base clustering population;

[0053] Using the average distance algorithm, each value in the category number interval of the gene data set to be clustered is used as the number of categories of t...

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 an integrated multi-objective evolutionary automatic clustering method based on minimum spinning tree through which the problem of poor processing effectiveness to a high dimensional dataset in the existing technology is overcome. The realization steps of the method comprise: (1) inputing a genetic dataset of a cluster to be clustered; (2) initializing the genetic dataset; (3) setting an iteration parameter; (4) calculating the similarity of clusters; (5) generating a minimum spinning tree; (6) cutting off the minimum spinning tree; (7) combining the clusters; (8) rapidly arranging non-domination in order; (9) calculating the crawling degree; (10) generating a new parent population; (11) judging the iteration number to be smaller than 50 or not; (12) selecting an optimum individuality; (13) and calculating the accuracy value of the optimum individuality. According to the invention, the operation speed of the method is fast; clustering analysis to various genetic datasets can be carried out effectively without presetting number of categories of the datasets; and the method can be applied to the high dimensional data analysis existing in the fields like biomedical recognition and tumor detection.

Description

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

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
Owner XIDIAN 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
Try Eureka
PatSnap group products