Markov chain Monte Carlo (MCMC)-based parallel sorting method

A classification method and the same technology, applied in the field of data classification, can solve problems such as time-consuming, and achieve the effect of shortening execution time and reducing communication overhead.

Active Publication Date: 2013-03-27
COMP NETWORK INFORMATION CENT CHINESE ACADEMY OF SCI
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in the face of a huge amount of data, the MCMC algorithm itself is very time-consuming, and the MC 3 The algorithm is more time-consuming

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
  • Markov chain Monte Carlo (MCMC)-based parallel sorting method
  • Markov chain Monte Carlo (MCMC)-based parallel sorting method
  • Markov chain Monte Carlo (MCMC)-based parallel sorting method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] The technical solutions of the present application will be described in further detail below with reference to the drawings and embodiments.

[0021] figure 1 It is a schematic diagram of a virtual topology structure of multiple processors according to an embodiment of the present invention. Place figure 1 As shown, 16 processors (P (1, 1), ... P (4, 4)) are used to operate the MCMC algorithm coupled with 8 chains, and the number of features contained in each individual in the training set containing the test sample It is 800, and all processors form a virtual two-dimensional topology structure, in which each row of processors respectively calculates the same Markov chain, thus realizing the parallel operation of MCMC algorithm; each column of processors respectively calculates the same data Perform calculations, and MC can be realized through the calculation of 16 processors 3 Parallel operation of algorithms.

[0022] figure 2 A kind of MC provided for the embod...

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 multi-channel multi-choice (MCMC)-based parallel sorting method. The sorting method comprises the following steps of: calculating likelihood estimation according to an initial state; calculating the posterior probability of parameters according to the likelihood estimation; performing MCMC simulation operation according to the posterior probability, and generating a novel state by taking the current state as the basis; calculating the acceptance probability according to the novel state, generating a first random number, taking the state at the next moment as a novel state when the first random number is less than the acceptance probability, otherwise keeping the current state invariable; generating a mark number of a Markov chain prepared to be exchanged in the same series of processors; and calculating the exchange probability when the Markov chain in the processor takes participates in exchange, generating a second random number, judging a comparison result of the exchange probability and the second random number, exchanging the heating parameters of the Markov chain during processing when the second random number is less than the exchange probability, otherwise avoiding exchange. According to the method, the execution time of an MC3 algorithm and an MCMC algorithm is shortened, and the communication overhead is reduced.

Description

technical field [0001] The invention relates to data classification technology, in particular to an MCMC-based parallel classification method. Background technique [0002] Aiming at the problem of data classification, there are currently many classification methods, and the single classification methods mainly include: decision tree, Bayesian, artificial neural network, K-nearest neighbor, support vector machine and classification based on association rules, etc. In addition, there are integrated learning methods for combining single classification methods, such as Bagging method and Boosting method. [0003] Among many classification methods, Bayesian classification algorithm is a kind of algorithm that uses probability and statistics knowledge to classify. When facing the classification problem of big data, the Bayesian algorithm based on statistics shows its advantages. The basic idea of ​​the Bayesian algorithm is the process of parameter post-verification probability...

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): G06F17/18
Inventor 迟学斌周纯葆郎显宇王珏邓笋根
Owner COMP NETWORK INFORMATION CENT CHINESE ACADEMY OF SCI
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