Search results for "ComputingMethodologies_PATTERNRECOGNITION"
showing 10 items of 296 documents
CTR: A calculus of timed refinement
1995
This paper presents CTR — a process algebraic framework for loose specification of time quantity sensitive operational behaviour of reactive systems. CTR terms are provided both with operational and specification semantics (via the notion of specification refinement). Besides the intuitive justification of appropriateness of the refinement notion, a preservation theorem is proved for a timed variant of Hennessy-Milner logic. A comparison of CTR with the related formalism of Timed Modal Specifications, and with the timed process calculi TCCS due to Wang is given. Some pragmatics of the application of CTR is sketched on a critical resource access example.
Measuring Dissimilarity Between Curves by Means of Their Granulometric Size Distributions
2008
The choice of a dissimilarity measure between curves is a key point for clustering functional data. Functions are usually pointwise compared and, in many situations, this approach is not appropriate. Mathematical Morphology provides us with a toolbox to overcome this problem. We propose some dissimilarity measures based on morphological granulometries and their performance is evaluated on some functional datasets.
An integrated fuzzy cells-classifier
2007
This paper introduces a genetic algorithm able to combine different classifiers based on different distance functions. The use of a genetic algorithm is motivated by the fact that the combination phase is based on the optimization of a vote strategy. The method has been applied to the classification of four types of biological cells, results show an improvement of the recognition rate using the genetic algorithm combination strategy compared with the recognition rate of each single classifier.
A genetic integrated fuzzy classifier
2005
This paper introduces a new classifier, that is based on fuzzy-integration schemes controlled by a genetic optimisation procedure. Two different types of integration are proposed here, and are validated by experiments on real data sets of biological cells. The performance of our classifier is tested against a feed-forward neural network and a Support Vector Machine. Results show the good performance and robustness of the integrated classifier strategies.
Fuzzy Classifier Based on Fuzzy Decision Tree
2007
A popular method for making a fuzzy decision tree for classification is Fuzzy ID3 algorithm. We introduce a new approach that uses cumulative information estimations of initial data. Based on these estimations we propose a new greedy version of fuzzy ID3 algorithm to be used to generate understandable fuzzy classification rules. The goal is to find a sequence of rules that causes near minimal classification costs.
Combining one class fuzzy KNN’s
2007
This paper introduces a parallel combination of N > 2 one class fuzzy KNN (FKNN) classifiers. The classifier combination consists of a new optimization procedure based on a genetic algorithm applied to FKNN’s, that differ in the kind of similarity used. We tested the integration techniques in the case of N = 5 similarities that have been recently introduced to face with categorical data sets. The assessment of the method has been carried out on two public data set, the Masquerading User Data (www.schonlau.net) and the badges database on the UCI Machine Learning Repository (http://www.ics.uci.edu/~mlearn/). Preliminary results show the better performance obtained by the fuzzy integration …
An Approach to the Concept of Soft Fuzzy Proximity
2014
The purpose of this paper is to introduce the concept of soft fuzzy proximity. Firstly, we give the definitions of soft fuzzy proximity and Katsaras soft fuzzy proximity, and also we investigate the relations between the soft fuzzy proximity and slightly modified version of Katsaras soft fuzzy proximity. Secondly, we induce a soft fuzzy topology from a given soft fuzzy proximity by using soft fuzzy closure operator. Then, we obtain the initial soft fuzzy proximity from a given family of soft fuzzy proximities. So, we describe products in the category of soft fuzzy proximities. Finally, we show that a family of all soft fuzzy proximities on a given set constitutes a complete lattice.
Unsupervised tissue classification of brain MR images for voxel-based morphometry analysis
2016
In this article, a fully unsupervised method for brain tissue segmentation of T1-weighted MRI 3D volumes is proposed. The method uses the Fuzzy C-Means (FCM) clustering algorithm and a Fully Connected Cascade Neural Network (FCCNN) classifier. Traditional manual segmentation methods require neuro-radiological expertise and significant time while semiautomatic methods depend on parameter's setup and trial-and-error methodologies that may lead to high intraoperator/interoperator variability. The proposed method selects the most useful MRI data according to FCM fuzziness values and trains the FCCNN to learn to classify brain’ tissues into White Matter, Gray Matter, and Cerebro-Spinal Fluid in …
Fuzzy C-Means Inspired Free Form Deformation Technique for Registration
2009
This paper presents a novel method aimed to free form deformation function approximation for purpose of image registration. The method is currently feature-based. The algorithm is inspired to concepts derived from Fuzzy C-means clustering technique such as membership degree and cluster centroids. After algorithm explanation, tests and relative results obtained are presented and discussed. Finally, considerations on future improvements are elucidated.
Scalable Clustering by Iterative Partitioning and Point Attractor Representation
2016
Clustering very large datasets while preserving cluster quality remains a challenging data-mining task to date. In this paper, we propose an effective scalable clustering algorithm for large datasets that builds upon the concept of synchronization. Inherited from the powerful concept of synchronization, the proposed algorithm, CIPA (Clustering by Iterative Partitioning and Point Attractor Representations), is capable of handling very large datasets by iteratively partitioning them into thousands of subsets and clustering each subset separately. Using dynamic clustering by synchronization, each subset is then represented by a set of point attractors and outliers. Finally, CIPA identifies the…