The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A novel sparse kernel density estimator is derived based on a regression approach, which selects a very small subset of significant kernels by means of the D-optimality experimental design criterion using an orthogonal forward selection procedure. The weights of the resulting sparse kernel model are calculated using the multiplicative nonnegative quadratic programming algorithm. The proposed method...
We consider a fully complex-valued radial basis function (RBF) network for regression application. The locally regularised orthogonal least squares (LROLS) algorithm with the D-optimality experimental design, originally derived for constructing parsimonious real-valued RBF network models, is extended to the fully complex-valued RBF network. Like its real-valued counterpart, the proposed algorithm...
Representation of knowledge within a neural model is an active field of research involved with the development of alternative structures, training algorithms, learning modes and applications. Radial Basis Function Neural Networks (RBFNNs) constitute an important part of the neural networks research as the operating principle is to discover and exploit similarities between an input vector and a feature...
In this paper, an improved clustering algorithm based Ant-Tree is used for recognition of certain kind of architectural symbols with prior knowledge in engineering drawings. Symbols are segmented from an AutoCAD format drawing and a vector of invariants based on pseudo-Zernike moments is calculated to represent the graphical feature of a symbol. A normalization method is used to make these moments...
Pattern mining gains more and more attention due to its useful applications in many areas, such as machine learning, database, multimedia, biology, and so on. Though there exist a lot of approaches for pattern mining, few of them consider the local distribution of the data. In the paper, we not only design six challenge datasets related to the local patterns, but also propose a new pattern mining...
The multi-robot task allocation (MRTA) especially in unknown complex environment is one of the fundamental problems, a mostly important object in research of multi-robot. The MRTA problem is initially formulated as a chance-constrained optimization problem. Monte Carlo simulation is used to verify the accuracy of the solution provided by the algorithm. Ant colony optimization (ACO) algorithm based...
With the rapid increase in the use of databases, missing data make up an important and unavoidable problem in data management and analysis. Because the mining of association rules can effectively establish the relationship among items in databases, therefore, discovered rules can be applied to predict the missing data. In this paper, we present a new method that uses association rules based on weighted...
This paper presents a novel adaptive synthetic (ADASYN) sampling approach for learning from imbalanced data sets. The essential idea of ADASYN is to use a weighted distribution for different minority class examples according to their level of difficulty in learning, where more synthetic data is generated for minority class examples that are harder to learn compared to those minority examples that...
Ranking support vector machine (RSVM) learning is equivalent to solving a convex quadratic programming problem. Currently there exists some difficulties for exact online ranking learning. This paper presents an exact and effective method that can solve the online ranking learning problem and shows the feasibility and finite convergence of the algorithm from the perspective of theoretical analysis...
Past decades, numerous spectral analysis based algorithms have been proposed for dimensionality reduction, which plays an important role in machine learning and artificial intelligence. However, most of these existing algorithms are developed intuitively and pragmatically, i.e., on the base of the experience and knowledge of experts for their own purposes. Therefore, it will be more informative to...
A few adaptive algorithms for generalized eigen-decomposition have been proposed, which are very useful in many applications such as digital mobile communications, blind signal separation, etc. These algorithms are all focusing on extracting principal generalized eigenvectors. However, in many practical applications such as dimension reduction and signal processing, extracting the minor generalized...
Research in computational intelligence (CI) has produced a huge collection of algorithms, grouped into the main CI paradigms. Development of a new CI algorithm requires such algorithm to be thoroughly benchmarked against existing algorithms, which requires researchers to implement already published algorithms. This re-implementation of existing algorithms unnecessarily wastes valuable time, and may...
CIlib is a recently developed open source library of computational intelligence (CI) algorithms. Developed in Java, and designed to be a generic framework of pluggable components, CIlib provides the CI researcher with a powerful tool to facilitate research in new CI techniques, and to easily benchmark against existing CI algorithms on a variety of problems. Consisting of a number of frameworks, including...
The aim of the present manuscript is to propose a pseudo-random number generation algorithm based on a learnable non-linear neural network whose implementation is based on look-up tables. The proposed neural network is able to generate pseudo-random numbers with arbitrary distribution on the basis of standard variate generators available within programming environments. The proposed method is not...
The present paper illustrates a geodesic-based learning algorithm over a curved parameter space for blind deconvolution application. The chosen deconvolving structure appears as a single neuron model whose learning rule arises from criterion-function minimization over a smooth manifold. In particular, we propose here a learning stepsize selection theory for the algorithm at hand. We consider the blind...
Nonnegative matrix factorization (NMF) is a widely-used method for multivariate analysis of nonnegative data, the goal of which is decompose a data matrix into a basis matrix and an encoding variable matrix with all of these matrices allowed to have only nonnegative elements. In this paper we present simple algorithms for orthogonal NMF, where orthogonality constraints are imposed on basis matrix...
In this paper, we examine necessary and sufficient conditions that ensure self-organization of the batch variant of the self-organizing map algorithm for 1-D networks and for quantized weights and inputs. Using Markov chain formalism, it is shown that the existing analysis for the original algorithm can be extended to also include the more general batch variant. Finally, simulations verify the theoretical...
The clustering problem consists in the discovery of interesting groups in a dataset. Such task is very important and widely tackled in the literature. In this paper, we propose an evolutionary method in order to obtain well formed and spatially separated clusters. The proposed algorithm uses a complete solution representation, each partition is represented by a length-variable chromosome. The variation...
This paper presents a new algorithm, called adaptive merging and growing algorithm (AMGA), for designing artificial neural networks (ANNs). The new algorithm merges and adds hidden neuron during training. The merging operation introduced here is a kind mixed mode operation that is equivalent to pruning two neurons and adding one neuron. Unlike most previous studies on designing ANNs, AMGA puts emphasis...
During CAD development and any kind of design optimisation over years a huge amount of geometries accumulate in a design department. To organize and structure these designs with respect to reusability, a hierarchical set of components on different scalings is extracted by the designers. This hierarchy allows to compose designs from several parts and to adapt the composition to the current task. Nevertheless,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.