Well-known Iris Data Set Research Articles

KARMA VERİ İKİLİLEŞTİRME YÖNTEMİ İLE YENİ BİR RASYONEL SINIFLANDIRMA YAKLAŞIMI

Classification algorithm is a supervised learning technique that is used to identify the category of new observations. However, in some cases, quantitative and qualitative data must be used together. With this approach, we tried to overcome the problems encountered in using quantitative and qualitative data together. In this paper, we model a new classification technique by converting all types of data to binary data because in real world, data are classified in different types such as binary, numeric or categorical. By this way, we develop a more accurate and efficient mixed data binarization approach for multi-attribute data classification problems. First, we determine the classes from available dataset and then we classify the new instances into these predetermined classes by using the new proposed data binarization approach. We show how each step of this algorithm could be performed efficiently with a numeric example. Then, we apply the proposed approach on a well-known iris dataset and our model show promising results and improvements over previous approaches.

Assessing the variability of posterior probabilities in Gaussian model-based clustering

We propose a variant of the bootstrap to assess the variability of posterior probabilities arising from Gaussian model-based clustering. The bootstrap variant uses predictions based on out-of-bootstrap-sample observations and then constructs confidence intervals for the posterior probabilities using the percentile method. The methodology outperforms the multivariate Delta method approach when comparing empirical coverage probabilities on simulated data. The proposed and multivariate Delta methods are also illustrated on the well-known Iris data set.

Rule Insertion Technique for Dynamic Cell Structure Neural Network

This paper discusses the idea of capturing an expert’s knowledge in the form of human understandable rules and then inserting these rules into a dynamic cell structure (DCS) neural network. The DCS is a form of self-organizing map that can be used for many purposes, including classification and prediction. This particular neural network is considered to be a topology preserving network that starts with no pre-structure, but assumes a structure once trained. The DCS has been used in mission and safety-critical applications, including adaptive flight control and health-monitoring in aerial vehicles. The approach is to insert expert knowledge into the DCS before training. Rules are translated into a pre-structure and then training data are presented. This idea has been demonstrated using the well-known Iris data set and it has been shown that inserting the pre-structure results in better accuracy with the same training.

The Iris dataset revisited. A partial ordering study

The well-known Iris data set has been studied applying partial ordering methodology. Previous studies, e.g., applying supervision learning such as neural networks (NN) and support-vector machines (SVM) perfectly distinguish between the three Iris subgroups, i.e., Iris Setosa, Iris Versicolour and Iris Virginica, respectively, in contrast to, e.g., K-means clustering that only separates the full Iris data set in two clusters. In the present study applying partial ordering methodology further discloses the difference between the different classification methods. The partial ordering data appears to be in perfect agreement with the results of the K-means clustering, which means that the clear separation in the three Iris subsets applying NN and SVM is neither recognized by clustering nor by partial ordering methodology.

A study of some fast inpainting methods with application to iris reconstruction

The human iris is an important biometrical element that can be successfully used for person identification. Because the image acquisition process does not provide complete information of the iris, this paper studies the problem of partial iris recognition. For texture characterization of the iris we used Local Binary Patterns, Dual Tree Complex Wavelet Transform and Daugman’s IrisCode. The evaluation of the results was made using the Equal Error Rate (EER) and AUC (Area Under the ROC Curve). The missing parts of the iris images were filled-in using patch-based inpainting. We then studied the effect and results on the iris recognition process of these inpainting methods. By using simple texture features and optimizing the inpainting method we achieved faster computations with very good recognition results. The methods were tested on UPOL, a well-known iris dataset. Our conclusion is that the inpainting process yields better results than those obtained for occluded irises.

A new heuristic possibilistic clustering algorithm for feature selection

The paper deals with the problem of selection of the most informative features. A new effective and efficient heuristic possibilistic clustering algorithm for feature selection is proposed. First, a brief description of basic concepts of the heuristic approach to possibilistic clustering is provided. A technique of initial data pre- processing is described and a fuzzy correlation measure is considered. The new algorithm is described and then illustrated on the well-known Iris data set benchmark and the results obtained are compared with those by us- ing the conventional, well-known and widely employed method of principal component analysis (PCA). Conclu- sions and suggestions for future research are given.

Multi-class classification with probabilistic discriminant partial least squares ( p-DPLS)

This work describes multi-classification based on binary probabilistic discriminant partial least squares ( p-DPLS) models, developed with the strategy one-against-one and the principle of winner-takes-all. The multi-classification problem is split into binary classification problems with p-DPLS models. The results of these models are combined to obtain the final classification result. The classification criterion uses the specific characteristics of an object (position in the multivariate space and prediction uncertainty) to estimate the reliability of the classification, so that the object is assigned to the class with the highest reliability. This new methodology is tested with the well-known Iris data set and a data set of Italian olive oils. When compared with CART and SIMCA, the proposed method has better average performance of classification, besides giving a statistic that evaluates the reliability of classification. For the olive oil set the average percentage of correct classification for the training set was close to 84% with p-DPLS against 75% with CART and 100% with SIMCA, while for the test set the average was close to 94% with p-DPLS as against 50% with CART and 62% with SIMCA.

A new procedure to optimize the selection of groups in a classification tree: Applications for ecological data

Agglomerative cluster analyses encompass many techniques, which have been widely used in various fields of science. In biology, and specifically ecology, datasets are generally highly variable and may contain outliers, which increase the difficulty to identify the number of clusters. Here we present a new criterion to determine statistically the optimal level of partition in a classification tree. The criterion robustness is tested against perturbated data (outliers) using an observation or variable with values randomly generated. The technique, called Random Simulation Test (RST), is tested on (1) the well-known Iris dataset [Fisher, R.A., 1936. The use of multiple measurements in taxonomic problems. Ann. Eugenic. 7, 179–188], (2) simulated data with predetermined numbers of clusters following Milligan and Cooper [Milligan, G.W., Cooper, M.C., 1985. An examination of procedures for determining the number of clusters in a data set. Psychometrika 50, 159–179] and finally (3) is applied on real copepod communities data previously analyzed in Beaugrand et al. [Beaugrand, G., Ibanez, F., Lindley, J.A., Reid, P.C., 2002. Diversity of calanoid copepods in the North Atlantic and adjacent seas: species associations and biogeography. Mar. Ecol. Prog. Ser. 232, 179–195]. The technique is compared to several standard techniques. RST performed generally better than existing algorithms on simulated data and proved to be especially efficient with highly variable datasets.

On the use of divergence distance in fuzzy clustering

Clustering algorithms divide up a dataset into a set of classes/clusters, where similar data objects are assigned to the same cluster. When the boundary between clusters is ill defined, which yields situations where the same data object belongs to more than one class, the notion of fuzzy clustering becomes relevant. In this course, each datum belongs to a given class with some membership grade, between 0 and 1. The most prominent fuzzy clustering algorithm is the fuzzy c-means introduced by Bezdek (Pattern recognition with fuzzy objective function algorithms, 1981), a fuzzification of the k-means or ISODATA algorithm. On the other hand, several research issues have been raised regarding both the objective function to be minimized and the optimization constraints, which help to identify proper cluster shape (Jain et al., ACM Computing Survey 31(3):264---323, 1999). This paper addresses the issue of clustering by evaluating the distance of fuzzy sets in a feature space. Especially, the fuzzy clustering optimization problem is reformulated when the distance is rather given in terms of divergence distance, which builds a bridge to the notion of probabilistic distance. This leads to a modified fuzzy clustering, which implicitly involves the variance---covariance of input terms. The solution of the underlying optimization problem in terms of optimal solution is determined while the existence and uniqueness of the solution are demonstrated. The performances of the algorithm are assessed through two numerical applications. The former involves clustering of Gaussian membership functions and the latter tackles the well-known Iris dataset. Comparisons with standard fuzzy c-means (FCM) are evaluated and discussed.

Investigating visual exploration of geospatial data: An exploratory usability experiment for visual data mining

This study presents a small exploratory usability experiment with the goal to observe how people visually explore geospatial data. The well-known iris dataset from pattern recognition was put into geographical context for this experiment, in order to provide the participants with a dataset with easily observable spatial and other relationships. The participants were given free hand to explore this dataset with a visual data mining system in any way they liked. The protocols collected during the experiment with the thinking-aloud method were analysed with the aim to understand what types of hypotheses the participants formed, which visualisations they used to either derive, confirm or reject their hypotheses and what exploration strategies they adopted.

A mixed-integer programming approach to multi-class data classification problem

This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perform poorly for multi-class data classification problems. The proposed approach is based on the use of hyper-boxes for defining boundaries of the classes that include all or some of the points in that set. A mixed-integer programming model is developed for representing existence of hyper-boxes and their boundaries. In addition, the relationships among the discrete decisions in the model are represented using propositional logic and then converted to their equivalent integer constraints using Boolean algebra. The proposed approach for multi-class data classification is illustrated on an example problem. The efficiency of the proposed method is tested on the well-known IRIS data set. The computational results on the illustrative example and the IRIS data set show that the proposed method is accurate and efficient on multi-class data classification problems.

Design of Output Codes for Fast Covering Learning using Basic Decomposition Techniques

We propose the design of output codes for solving the classification problem in Fast Covering Learning Algorithm (FCLA). For a complex multi-class problem normally the classifiers are constructed by combining the outputs of several binary ones. In this paper, we use the basic methods of decomposition; one per class (OPC) and Error Correcting Output Code (ECOC) with FCLA, binary to binary mapping algorithm as a base binary learner. The methods have been tested on Fisher’s well-known Iris data set and experimental results show that the classification ability is improved by using ECOC method.

Kernel method for clustering based on optimal target vector

We introduce Ising models, suitable for dichotomic clustering, with couplings that are (i) both ferro- and anti-ferromagnetic (ii) depending on the whole data-set and not only on pairs of samples. Couplings are determined exploiting the notion of optimal target vector, here introduced, a link between kernel supervised and unsupervised learning. The effectiveness of the method is shown in the case of the well-known iris data-set and in benchmarks of gene expression levels, where it works better than existing methods for dichotomic clustering.

Finding Fuzzy Rules for IRIS by Neural Network with Weighted Fuzzy Membership Function

Fuzzy neural networks have been successfully applied to analyze/generate predictive rules for medical or diagnostic data. However, most approaches proposed so far have not considered the weights for the membership functions much. This paper presents a neural network with weighted fuzzy membership functions. In our approach, the membership functions can capture the concentrated and essential information that affects the classification of the input patterns. To verify the performance of the proposed model, well-known Iris data set is performed. According to the results, the weighted membership functions enhance the prediction accuracy. The architecture of the proposed neural network with weighted fuzzy membership functions and the details of experimental results for the data set is discussed in this paper.

Advanced data preprocessing using fuzzy clustering techniques

In this paper we describe a method of advanced data preprocessing for pattern classification using a fuzzy classification system (FCS). Input pattern vectors are transformed using a matrix before classification to improve classification results and to simplify the FCS. The transformation matrix is calculated using the prototypes obtained with fuzzy clustering methods. The data preprocessed in this way are often classifiable more easily than the original data. Results obtained with the new method using artificially created data and the well-known Iris data set are presented.

A composite classifier system design: Concepts and methodology

This study explores the scope for achieving enhanced recognition system performance through deployment of a composite classifier system consisting of two or more component classifiers which belong to different categories. The domains of deployment of these individual components (classifiers) are determined by optimal partitioning of the problem space. The criterion for such optimal partitioning is determined in each case by the characteristics of the classifier components. An example, in terms of partitioning the feature space for optimal deployment of a composite system consisting of the linear and nearest neighbor (NN) classifiers as its components, is presented to illustrate the concepts, the associated methodology, and the possible benefits one could expect through such composite classifier system design. Here, the optimality of the partitioning is dictated by the linear class separability limitation of the linear classifier and the computational demand characteristics of the NN classifier. Accordingly, the criterion for the optimal feature space partitioning is set to be the minimization of the domain of application of the NN classifier, subject to the constraint that the linear classifier is to be deployed only in regions satisfying the underlying assumption of linear separability of classes. While many alternatives are available for the solution of the resulting constrained optimization problem, a specific technique-Sequential Weight Increasing Factor Technique (SWIFT)- was employed here for convenience in view of previous successful experience with this technique in other application areas. Numerical results derived using the well-known IRIS data set are furnished to demonstrate the effectiveness of the new concepts and methodology.