10,328 research outputs found
A Method to Construct an Extension of Fuzzy Information Granularity Based on Fuzzy Distance
In fuzzy granular computing, a fuzzy granular structure is the collection of
fuzzy information granules and fuzzy information granularity is used to
measure the granulation degree of a fuzzy granular structure.
In general, the fuzzy information granularity characterizes discernibility ability
among fuzzy information granules in a fuzzy granular structure. In recent years,
researchers have proposed some concepts of fuzzy information granularity based
on partial order relations. However, the existing forms of fuzzy information granularity
have some limitations when evaluating the fineness/coarseness between two fuzzy
granular structures. In this paper, we propose an extension of fuzzy information
granularity based on a fuzzy distance measure.
We prove theoretically and experimentally that the proposed fuzzy information
granularity is the best one to distinguish fuzzy granular structures.
ACM Computing Classification System (1998): I.5.2, I.2.6
Automatic generation of fuzzy classification rules using granulation-based adaptive clustering
A central problem of fuzzy modelling is the generation of fuzzy rules that fit the data to the highest possible extent. In this study, we present a method for automatic generation of fuzzy rules from data. The main advantage of the proposed method is its ability to perform data clustering without the requirement of predefining any parameters including number of clusters. The proposed method creates data clusters at different levels of granulation and selects the best clustering results based on some measures. The proposed method involves merging clusters into new clusters that have a coarser granulation. To evaluate performance of the proposed method, three different datasets are used to compare performance of the proposed method to other classifiers: SVM classifier, FCM fuzzy classifier, subtractive clustering fuzzy classifier. Results show that the proposed method has better classification results than other classifiers for all the datasets used
Examples of Artificial Perceptions in Optical Character Recognition and Iris Recognition
This paper assumes the hypothesis that human learning is perception based,
and consequently, the learning process and perceptions should not be
represented and investigated independently or modeled in different simulation
spaces. In order to keep the analogy between the artificial and human learning,
the former is assumed here as being based on the artificial perception. Hence,
instead of choosing to apply or develop a Computational Theory of (human)
Perceptions, we choose to mirror the human perceptions in a numeric
(computational) space as artificial perceptions and to analyze the
interdependence between artificial learning and artificial perception in the
same numeric space, using one of the simplest tools of Artificial Intelligence
and Soft Computing, namely the perceptrons. As practical applications, we
choose to work around two examples: Optical Character Recognition and Iris
Recognition. In both cases a simple Turing test shows that artificial
perceptions of the difference between two characters and between two irides are
fuzzy, whereas the corresponding human perceptions are, in fact, crisp.Comment: 5th Int. Conf. on Soft Computing and Applications (Szeged, HU), 22-24
Aug 201
Classifying sequences by the optimized dissimilarity space embedding approach: a case study on the solubility analysis of the E. coli proteome
We evaluate a version of the recently-proposed classification system named
Optimized Dissimilarity Space Embedding (ODSE) that operates in the input space
of sequences of generic objects. The ODSE system has been originally presented
as a classification system for patterns represented as labeled graphs. However,
since ODSE is founded on the dissimilarity space representation of the input
data, the classifier can be easily adapted to any input domain where it is
possible to define a meaningful dissimilarity measure. Here we demonstrate the
effectiveness of the ODSE classifier for sequences by considering an
application dealing with the recognition of the solubility degree of the
Escherichia coli proteome. Solubility, or analogously aggregation propensity,
is an important property of protein molecules, which is intimately related to
the mechanisms underlying the chemico-physical process of folding. Each protein
of our dataset is initially associated with a solubility degree and it is
represented as a sequence of symbols, denoting the 20 amino acid residues. The
herein obtained computational results, which we stress that have been achieved
with no context-dependent tuning of the ODSE system, confirm the validity and
generality of the ODSE-based approach for structured data classification.Comment: 10 pages, 49 reference
Dynamic Fuzzy c-Means (dFCM) Clustering and its Application to Calorimetric Data Reconstruction in High Energy Physics
In high energy physics experiments, calorimetric data reconstruction requires
a suitable clustering technique in order to obtain accurate information about
the shower characteristics such as position of the shower and energy
deposition. Fuzzy clustering techniques have high potential in this regard, as
they assign data points to more than one cluster,thereby acting as a tool to
distinguish between overlapping clusters. Fuzzy c-means (FCM) is one such
clustering technique that can be applied to calorimetric data reconstruction.
However, it has a drawback: it cannot easily identify and distinguish clusters
that are not uniformly spread. A version of the FCM algorithm called dynamic
fuzzy c-means (dFCM) allows clusters to be generated and eliminated as
required, with the ability to resolve non-uniformly distributed clusters. Both
the FCM and dFCM algorithms have been studied and successfully applied to
simulated data of a sampling tungsten-silicon calorimeter. It is seen that the
FCM technique works reasonably well, and at the same time, the use of the dFCM
technique improves the performance.Comment: 15 pages, 10 figures. It is accepted for publication in NIM
- …