All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 14 of 14

Showing per page

Cascading classifiers

Ethem Alpaydin, Cenk Kaynak (1998)

Kybernetika

We propose a multistage recognition method built as a cascade of a linear parametric model and a k -nearest neighbor ( k -NN) nonparametric classifier. The linear model learns a “rule” and the k -NN learns the “exceptions” rejected by the “rule.” Because the rule-learner handles a large percentage of the examples using a simple and general rule, only a small subset of the training set is stored as exceptions during training. Similarly during testing, most patterns are handled by the rule -learner and...

Classification Trees as a Technique for Creating Anomaly-Based Intrusion Detection Systems

Jecheva, Veselina, Nikolova, Evgeniya (2009)

Serdica Journal of Computing

Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection based on sequences of system calls. The point is to construct a model that describes normal or acceptable system activity using the classification trees approach. The created database is utilized as a basis for distinguishing...

Clustering of vaguely defined objects

Libor Žák (2003)

Archivum Mathematicum

This paper is concerned with the clustering of objects whose properties cannot be described by exact data. These can only be described by fuzzy sets or by linguistic values of previously defined linguistic variables. To cluster these objects we use a generalization of classic clustering methods in which instead of similarity (dissimilarity) of objects, used fuzzy similarity (fuzzy dissimilarity) to define the clustering of fuzzy objects.

Combining adaptive vector quantization and prototype selection techniques to improve nearest neighbour classifiers

Francesc J. Ferri (1998)

Kybernetika

Prototype Selection (PS) techniques have traditionally been applied prior to Nearest Neighbour (NN) classification rules both to improve its accuracy (editing) and to alleviate its computational burden (condensing). Methods based on selecting/discarding prototypes and methods based on adapting prototypes have been separately introduced to deal with this problem. Different approaches to this problem are considered in this paper and their main advantages and drawbacks are pointed out along with some...

Conceptual base of feature selection consulting system

Pavel Pudil, Jana Novovičová, Petr Somol, Radek Vrňata (1998)

Kybernetika

The paper briefly reviews recent advances in the methodology of feature selection (FS) and the conceptual base of a consulting system for solving FS problems. The reasons for designing a kind of expert or consulting system which would guide a less experienced user are outlined. The paper also attempts to provide a guideline which approach to choose with respect to the extent of a priori knowledge of the problem. The methods discussed here form the core of the software package being developed for...

Correlation-based feature selection strategy in classification problems

Krzysztof Michalak, Halina Kwaśnicka (2006)

International Journal of Applied Mathematics and Computer Science

In classification problems, the issue of high dimensionality, of data is often considered important. To lower data dimensionality, feature selection methods are often employed. To select a set of features that will span a representation space that is as good as possible for the classification task, one must take into consideration possible interdependencies between the features. As a trade-off between the complexity of the selection process and the quality of the selected feature set, a pairwise...

Croisements, ordres et ultramétriques

Edwin Diday (1983)

Mathématiques et Sciences Humaines

La représentation visuelle d'une hiérarchie induit un ordre sur les singletons. Si l'on désire représenter la même hiérarchie en tenant compte de contraintes extérieures (ordre des singletons induit par une autre hiérarchie, une partition, un indice de dissimilarité, par exemple) des croisements peuvent apparaître. Il y a un croisement dans la représentation visuelle d'une hiérarchie quand une branche horizontale (associée à un palier) est coupée par une branche verticale associée à un singleton....

Currently displaying 1 – 14 of 14

Page 1