基于性能反馈的PSO算法速度上限调整策略

速度上限是影响微粒群算法性能的一个主要参数。针对现有调节策略存在参数统一设置、与微粒性能无关等缺点,本文提出一种基于性能反馈的调整策略,使得速度上限能随着个体性能的改变而动态调整,从而更加真实有效的模拟了鸟类觅食的群体行为特征。仿真结果表明该算法能较好地提高微粒群算法的计算效率。     

The Problem of local optimality with OSMOD

The possibility of obtaining locally optimal solutions with categorical data is pointed out for the original version of OSMOD development by Saito and Otsu. A revision of the initialization strategy in OSMOD is suggested, and its effectiveness in diminishing this possibility is demonstrated.     

Information on response requirements compared with information on food density as a reinforcer of observing in pigeons

On a variable-interval schedule, pecking the key to the pigeon's right (observing response) produced red or green displays relating to the delivery of grain and its dependence on pecking the key to the left (food key). During various blocks of sessions, mixed (no stimulus change) schedules including the following pairs of components were temporarily converted by the observing response to their corresponding multiple (correlated stimuli) schedules: variable-interval 60-s, extinction; variable-interval 60-s, variable-time (response-independent) 60-s; extinction, variable-time 60-s. Differences in food delivery maintained substantial rates of responding on the observing key, without regard to pecking requirements on the food key. Although stimuli correlated with differences in the response requirement on the food key maintained higher observing rates than those maintained by uncorrelated stimuli, they were much lower than those based on food. The value of predictive stimuli as reinforcers is determined by the value of the events predicted. In particular, the cost of pecking appears to be low, and this may place limitations on the applicability of energy-based and economic models of behavior.     

Clustering with relational constraint

The paper deals with clustering problems where grouping is constrained by a symmetric and reflexive relation. For solving clustering problems with relational constraints two methods are adapted: the standard hierarchical clustering procedure based on the Lance and Williams formula, and local optimization procedure, CLUDIA. To illustrate these procedures, clusterings of the European countries are given based on the developmental indicators where the relation is determined by the geographical neighbourhoods of countries.Extended version of the paper presented at the European meeting of the Psychometric Society, Groningen, June, 19–21, 1980.This work was supported in part by the Boris Kidri Fund, Yugoslavia.     

Optimization and the matching law as accounts of instrumental behavior

The interaction between instrumental behavior and environment can be conveniently described at a molar level as a feedback system. Two different possible theories, the matching law and optimization, differ primarily in the reference criterion they suggest for the system. Both offer accounts of most of the known phenomena of performance on concurrent and single variable-interval and variable-ratio schedules. The matching law appears stronger in describing concurrent performances, whereas optimization appears stronger in describing performance on single schedules.     

Optimal scaling by alternating length-constrained nonnegative least squares, with application to distance-based analysis

An important feature of distance-based principal components analysis, is that the variables can be optimally transformed. For monotone spline transformation, a nonnegative least-squares problem with a length constraint has to be solved in each iteration. As an alternative algorithm to Lawson and Hanson (1974), we propose the Alternating Length-Constrained Non-Negative Least-Squares (ALC-NNLS) algorithm, which minimizes the nonnegative least-squares loss function over the parameters under a length constraint, by alternatingly minimizing over one parameter while keeping the others fixed. Several properties of the new algorithm are discussed. A Monte Carlo study is presented which shows that for most cases in distance-based principal components analysis, ALC-NNLS performs as good as the method of Lawson and Hanson or sometimes even better in terms of the quality of the solution. Supported by The Netherlands Organization for Scientific Research (NWO) by grant nr. 030-56403 for the “PIONEER” project “Subject Oriented Multivariate Analysis” to the third author. We would like to thank the anonymous referees for their valuable remarks that have improved the quality of this paper.     

A Classification Framework using a Diverse Intensified Strawberry Optimized Neural Network (DISON) for Clinical Decision-making

A novel classification framework for clinical decision making that uses an Extremely Randomized Tree (ERT) based feature selection and a Diverse Intensified Strawberry Optimized Neural network (DISON) is proposed. DISON is a Feed Forward Artificial Neural Network where the optimization of weights and bias is done using a two phase training strategy. Two algorithms namely Strawberry Plant Optimization (SPO) algorithm and Gradient-descent Back-propagation algorithm are used sequentially to identify the optimum weights and bias. The novel two phase training method and the stochastic duplicate-elimination strategy of SPO helps in addressing the issue of local optima associated with conventional neural networks. The relevant attributes are selected based on the feature importance values computed using an ERT classifier.Vertebral Column, Pima Indian diabetes (PID), Cleveland Heart disease (CHD) and Statlog Heart disease (SHD) datasets from the University of California Irvine machine learning repository are used for experimentation. The framework has achieved an accuracy of 87.17% for Vertebral Column, 90.92% for PID, 93.67% for CHD and 94.5% for SHD. The classifier performance has been compared with existing works and is found to be competitive in terms of accuracy, sensitivity and specificity. Wilcoxon test confirms the statistical superiority of the proposed method.     

On the Determination of Minimal Facets and Edges of a Polyhedral Set

In this paper we investigate the image of a polyhedral set under a linear map. Moreover, we present an algorithm for the determination of so-called minimal facets and certain minimal irredundant proper edges of a convex polyhedral set in ℝ³. © 1997 John Wiley & Sons, Ltd.     

Pareto simulated annealing—a metaheuristic technique for multiple-objective combinatorial optimization

This paper presents a multiple-objective metaheuristic procedure—Pareto simulated annealing. The goal of the procedure is to find in a relatively short time a good approximation of the set of efficient solutions of a multiple-objective combinatorial optimization problem. The procedure uses a sample, of so-called generating solutions. Each solution explores its neighbourhood in a way similar to that of classical simulated annealing. Weights of the objectives, used for their local aggregation, are tuned in each iteration in order to assure a tendency for approaching the efficient solutions set while maintaining a uniform distribution of the generating solutions over this set. A computational experiment shows that the method is a better tool for approximating the efficient set than some previous proposals. © 1998 John Wiley & Sons, Ltd.     

Feedback functions, optimization, and the relation of response rate to reinforcer rate

The present experiment arranged a series of inverted U-shaped feedback functions relating reinforcer rate to response rate to test whether responding was consistent with an optimization account or with a one-to-one relation of response rate to reinforcer rate such as linear system theory's rate equation or Herrnstein's hyperbola. Reinforcer rate was arranged according to a quadratic equation with a maximum at a unique response rate. The experiment consisted of two phases, during which 6 Long Evans rats lever pressed for food. In the first phase of the experiment, the rats responded on six fixed-interval-plus-quadratic-feedback schedules, and in the second phase the rats responded on three variable-interval-plus-quadratic-feedback schedules. Responding in both phases was inconsistent with a one-to-one relation of response rate to reinforcer rate. Instead, different response rates were obtained at equivalent reinforcer rates. Responding did vary directly with the vertex of the feedback function in both phases, a finding consistent with optimization of reinforcer rate. The present results suggest that the feedback function relating reinforcer rate to response rate imposed by a reinforcement schedule can be an important determinant of behavior. Furthermore, the present experiment illustrates the benefit of arranging feedback functions to investigate assumptions about the variables that control schedule performance.