For high dimensional data, the redundant attributes of samplers will not only increase the complexity of the calculation, but also affect the accuracy of final result. The existing attribute reduction methods are encountering bottleneck problem of timeliness and spatiality. In order to looking for a relatively coarse attributes granularity of problem solving, this paper proposes an efficient at...

As computer architectures transition towards exponentially increasing parallelism we are forced to adopt parallelism at a fundamental level in the design of machine learning algorithms. In this paper we focus on parallel graphical model inference. We demonstrate that the natural, synchronous parallelization of belief propagation is highly inefficient. By bounding the achievable parallel perform...

Fraud is an ever present threat in online auctions. The anonymity of the Internet provides a hospitable environment to both buyers and sellers of disrepute. To combat this problem many solutions have been proposed which use belief propagation and social network analysis to identify fraudulent actors. In this paper, we mainly analyze NetProbe which uses belief propagation over Markov Random Fiel...

Consistent normal orientation is challenging in the presence of noise, non-uniformities and thin sharp features. None of any existing local or global methods is capable of orienting all point cloud models consistently, and none of them offers a mechanism to rectify the inconsistent normals. In this paper, we present a new normal orientation method based on the multi-source propagation technique...

In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and constraint propagation. Previous studies have demonstrated that designing special purpose constraint propagators for commonly occurring constraints can significantly improve the efficiency of a constraint programming a...

We study the performance of different message passing algorithms in the two-dimensional Edwards–Anderson model. We show that the standard belief propagation (BP) algorithm converges only at high temperature to a paramagnetic solution. Then, we test a generalized belief propagation (GBP) algorithm, derived from a cluster variational method (CVM) at the plaquette level. We compare its performance...

In this work, we propose a Hybrid particle swarm optimization-Simulated annealing algorithm and present a comparison with i) Simulated annealing algorithm and ii) Back propagation algorithm for training neural networks. These neural networks were then tested on a classification task. In particle swarm optimization behaviour of a particle is influenced by the experiential knowledge of the partic...

The back propagation algorithm calculates the weight changes of artificial neural networks, and a common approach is to use a training algorithm consisting of a learning rate and a momentum factor. The major drawbacks of above learning algorithm are the problems of local minima and slow convergence speeds. The addition of an extra term, called a proportional factor reduces the convergence of th...

In this paper, we proposed the design method of artificial neural networks using VHDL and implement in FPGA. VHDL is a programming language that has been designed and optimized for describing the behavior of digital systems. Back propagation algorithm for the design of a neuron is described. Back propagation is popular training algorithms for multilayer perceptrons. Over the last years many imp...