The concepts of robust classification and intelligently controlling the search process of genetic algorithm (GA) are introduced and integrated with a conventional genetic classifier for development of a new version of it, which is called Intelligent and Robust GA-classifier (IRGA-classifier). It can efficiently approximate the decision hyperplanes in the feature space. It is shown experime...

in this paper, an unsupervised classification method using spatial contextual information for polarimetric sar (polsar) image classification is proposed. first, an unsupervised classification based on 2d h/▁α plane was performed, using cloude/pottier target decomposition algorithm. in order to compute the initial values of the cluster centers and hence a rapid convergence of the algorithm, the ...

This paper presents a variant of the AdaBoost algorithm for boosting Näıve Bayes text classifier, called AdaBUS, which combines active learning with boosting algorithm. Boosting has been evaluated to effectively improve the accuracy of machine-learning based classifiers. However, Näıve Bayes classifier, which is remarkably successful in practice for text classification problems, is known not to...

The paper deals with the extraction of features for statistical pattern recognition. In particular, the case of recognition with learning is considered. Bayes probability of correct classification is adopted as the extraction criterion. The problem with incomplete probabilistic information is discussed and Bayes-optimal feature extraction procedure is presented in detail. As method of solution ...

Prediction of fault-prone modules provides one way to support software quality engineering through improved scheduling and project control. There are many metrics and techniques available to investigate the accuracy of fault prone classes which may help software organizations for planning and performing testing activities. Bayes algorithms are being successfully applied for solving both classif...

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

Bayesian network classifiers are used in many fields, and one common class of classifiers are naive Bayes classifiers. In this paper, we introduce an approach for reasoning about Bayesian network classifiers in which we explicitly convert them into Ordered Decision Diagrams (ODDs), which are then used to reason about the properties of these classifiers. Specifically, we present an algorithm for...