An approach of the Naive Bayes classifier for the document classification.
An efficient ART1 algorithm based on vector computation.
An evolutionary approach to constraint-regularized learning.
The success of machine learning methods for inducing models from data crucially depends on the proper incorporation of background knowledge about the model to be learned. The idea of constraint-regularized learning is to employ fuzzy set-based modeling techniques in order to express such knowledge in a flexible way, and to formalize it in terms of fuzzy constraints. Thus, background knowledge can be used to appropriately bias the learn ing process within the regularization framework of inductive...
An evolutionary approach to geometrical place problems.
An ILP model for a monotone graded classification problem
Motivation for this paper are classification problems in which data can not be clearly divided into positive and negative examples, especially data in which there is a monotone hierarchy (degree, preference) of more or less positive (negative) examples. We present a new formulation of a fuzzy inductive logic programming task in the framework of fuzzy logic in narrow sense. Our construction is based on a syntactical equivalence of fuzzy logic programs FLP and a restricted class of generalised annotated...
Análisis comparativo de cálculo de previsiones univariables y función de transferencia, mediante las metodologías de Box-Jenkins y redes neuronales.
Analysis of correlation based dimension reduction methods
Dimension reduction is an important topic in data mining and machine learning. Especially dimension reduction combined with feature fusion is an effective preprocessing step when the data are described by multiple feature sets. Canonical Correlation Analysis (CCA) and Discriminative Canonical Correlation Analysis (DCCA) are feature fusion methods based on correlation. However, they are different in that DCCA is a supervised method utilizing class label information, while CCA is an unsupervised method....
Analysis of monotonicity properties of some rule interestingness measures
Ant-based extraction of rules in simple decision systems over ontological graphs
In the paper, the problem of extraction of complex decision rules in simple decision systems over ontological graphs is considered. The extracted rules are consistent with the dominance principle similar to that applied in the dominancebased rough set approach (DRSA). In our study, we propose to use a heuristic algorithm, utilizing the ant-based clustering approach, searching the semantic spaces of concepts presented by means of ontological graphs. Concepts included in the semantic spaces are values...
Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning process executed...
Application of SVR with improved ant colony optimization algorithms in exchange rate forecasting
Approximable concepts, Chu spaces, and information systems.
Approximation of phenol concentration using novel hybrid computational intelligence methods
Artificial intelligence methods in diagnostics of analog systems
Artificial neural networks. A review from physical and mathematical points of view
Artificial neural networks in time series forecasting: a comparative analysis
Artificial neural networks (ANN) have received a great deal of attention in many fields of engineering and science. Inspired by the study of brain architecture, ANN represent a class of non-linear models capable of learning from data. ANN have been applied in many areas where statistical methods are traditionally employed. They have been used in pattern recognition, classification, prediction and process control. The purpose of this paper is to discuss ANN and compare them to non-linear time series...
Automatic Video Annotation with Forests of Fuzzy Decision Trees.
Â?Wahrscheinlichkeitslernen" in der statistischen Lerntheorie.
Bayesian estimation of mixtures with dynamic transitions and known component parameters
Probabilistic mixtures provide flexible “universal” approximation of probability density functions. Their wide use is enabled by the availability of a range of efficient estimation algorithms. Among them, quasi-Bayesian estimation plays a prominent role as it runs “naturally” in one-pass mode. This is important in on-line applications and/or extensive databases. It even copes with dynamic nature of components forming the mixture. However, the quasi-Bayesian estimation relies on mixing via constant...
Bias-variance decomposition in Genetic Programming
We study properties of Linear Genetic Programming (LGP) through several regression and classification benchmarks. In each problem, we decompose the results into bias and variance components, and explore the effect of varying certain key parameters on the overall error and its decomposed contributions. These parameters are the maximum program size, the initial population, and the function set used. We confirm and quantify several insights into the practical usage of GP, most notably that (a) the...