• Title/Summary/Keyword: intelligent classification

Search Result 915, Processing Time 0.023 seconds

The Classification of Electrocardiograph Arrhythmia Patterns using Fuzzy Support Vector Machines

  • Lee, Soo-Yong;Ahn, Deok-Yong;Song, Mi-Hae;Lee, Kyoung-Joung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.204-210
    • /
    • 2011
  • This paper proposes a fuzzy support vector machine ($FSVM_n$) pattern classifier to classify the arrhythmia patterns of an electrocardiograph (ECG). The $FSVM_n$ is a pattern classifier which combines n-dimensional fuzzy membership functions with a slack variable of SVM. To evaluate the performance of the proposed classifier, the MIT/BIH ECG database, which is a standard database for evaluating arrhythmia detection, was used. The pattern classification experiment showed that, when classifying ECG into four patterns - NSR, VT, VF, and NSR, VT, and VF classification rate resulted in 99.42%, 99.00%, and 99.79%, respectively. As a result, the $FSVM_n$ shows better pattern classification performance than the existing SVM and FSVM algorithms.

Rotation Invariant Histogram of Oriented Gradients

  • Cheon, Min-Kyu;Lee, Won-Ju;Hyun, Chang-Ho;Park, Mignon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.4
    • /
    • pp.293-298
    • /
    • 2011
  • In this paper, we propose a new image descriptor, that is, a rotation invariant histogram of oriented gradients (RIHOG). RIHOG overcomes a disadvantage of the histogram of oriented gradients (HOG), which is very sensitive to image rotation. The HOG only uses magnitude values of a pixel without considering neighboring pixels. The RIHOG uses the accumulated relative magnitude values of corresponding relative orientation calculated with neighboring pixels, which has an effect on reducing the sensitivity to image rotation. The performance of RIHOG is verified via the index of classification and classification of Brodatz texture data.

Improvement of ID3 Using Rough Sets (라프셋 이론이 적용에 의한 ID3의 개선)

  • Chung, Hong;Kim, Du-Wan;Chung, Hwan-Mook
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.170-174
    • /
    • 1997
  • This paper studies a method for making more efficient classification rules in the ID3 using the rough set theory. Decision tree technique of the ID3 always uses all the attributes in a table of examples for making a new decision tree, but rough set technique can in advance eleminate dispensable attributes. And the former generates only one type of classification rules, but the latter generates all the possibles types of them. The rules generated by the rough set technique are the simplist from as proved by the rough set theory. Therefore, ID3, applying the rough set technique, can reduct the size of the table of examples, generate the simplist form of the classification rules, and also implement an effectie classification system.

  • PDF

A Classification Method Using Data Reduction

  • Uhm, Daiho;Jun, Sung-Hae;Lee, Seung-Joo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.1-5
    • /
    • 2012
  • Data reduction has been used widely in data mining for convenient analysis. Principal component analysis (PCA) and factor analysis (FA) methods are popular techniques. The PCA and FA reduce the number of variables to avoid the curse of dimensionality. The curse of dimensionality is to increase the computing time exponentially in proportion to the number of variables. So, many methods have been published for dimension reduction. Also, data augmentation is another approach to analyze data efficiently. Support vector machine (SVM) algorithm is a representative technique for dimension augmentation. The SVM maps original data to a feature space with high dimension to get the optimal decision plane. Both data reduction and augmentation have been used to solve diverse problems in data analysis. In this paper, we compare the strengths and weaknesses of dimension reduction and augmentation for classification and propose a classification method using data reduction for classification. We will carry out experiments for comparative studies to verify the performance of this research.

Negative Selection Algorithm for DNA Sequence Classification

  • Lee, Dong Wook;Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.2
    • /
    • pp.231-235
    • /
    • 2004
  • According to revealing the DNA sequence of human and living things, it increases that a demand on a new computational processing method which utilizes DNA sequence information. In this paper we propose a classification algorithm based on negative selection of the immune system to classify DNA patterns. Negative selection is the process to determine an antigenic receptor that recognize antigens, nonself cells. The immune cells use this antigen receptor to judge whether a self or not. If one composes n group of antigenic receptor for n different patterns, they can classify into n patterns. In this paper we propose a pattern classification algorithm based on negative selection in nucleotide base level and amino acid level.

Big Numeric Data Classification Using Grid-based Bayesian Inference in the MapReduce Framework

  • Kim, Young Joon;Lee, Keon Myung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.313-321
    • /
    • 2014
  • In the current era of data-intensive services, the handling of big data is a crucial issue that affects almost every discipline and industry. In this study, we propose a classification method for large volumes of numeric data, which is implemented in a distributed programming framework, i.e., MapReduce. The proposed method partitions the data space into a grid structure and it then models the probability distributions of classes for grid cells by collecting sufficient statistics using distributed MapReduce tasks. The class labeling of new data is achieved by k-nearest neighbor classification based on Bayesian inference.

Multiclass SVM Model with Order Information

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.6 no.4
    • /
    • pp.331-334
    • /
    • 2006
  • Original Support Vsctor Machines (SVMs) by Vapnik were used for binary classification problems. Some researchers have tried to extend original SVM to multiclass classification. However, their studies have only focused on classifying samples into nominal categories. This study proposes a novel multiclass SVM model in order to handle ordinal multiple classes. Our suggested model may use less classifiers but predict more accurately because it utilizes additional hidden information, the order of the classes. To validate our model, we apply it to the real-world bond rating case. In this study, we compare the results of the model to those of statistical and typical machine learning techniques, and another multi class SVM algorithm. The result shows that proposed model may improve classification performance in comparison to other typical multiclass classification algorithms.

A Review of Artificial Intelligence Models in Business Classification

  • Han, In-goo;Kwon, Young-sig;Jo, Hong-kyu
    • Journal of Intelligence and Information Systems
    • /
    • v.1 no.1
    • /
    • pp.23-41
    • /
    • 1995
  • Business researchers have traditionally used statistical techniques for classification. In late 1980's, inductive learning started to be used for business classification. Recently, neural network began to be a, pp.ied for business classification. This study reviews the business classification studies, identifies a neural network a, pp.oach as the most powerful classification tool, and discusses the problems and issues in neural network a, pp.ications.

  • PDF

Adaptive Transform Image Coding by Fuzzy Subimage Classification

  • Kong, Seong-Gon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.2 no.2
    • /
    • pp.42-60
    • /
    • 1992
  • An adaptive fuzzy system can efficiently classify subimages into four categories according to image activity level for image data compression. The system estimates fuzzy rules by clustering input-output data generated from a given adaptive transform image coding process. The system encodes different images without modification and reduces side information when encoding multiple images. In the second part, a fuzzy system estimates optimal bit maps for the four subimage classes in noisy channels assuming a Gauss-Markov image model. The fuzzy systems respectively estimate the sampled subimage classification and the bit-allocation processes without a mathematical model of how outputs depend on inputs and without rules articulated by experts.

  • PDF

Effective Design of Inference Rule for Shape Classification

  • Kim, Yoon-Ho;Lee, Sang-Sock;Lee, Joo-Shin
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.417-422
    • /
    • 1998
  • This paper presents a method of object classification from dynamic image based on fuzzy inference algorithm which is suitable for low speed such as, conveyor, uninhabited transportation. At first, by using feature parameters of moving object, fuzzy if - then rule that can be able to adapt the wide variety of surroundings is developed. Secondly, implication function for fuzzy inference are compared with respect the proposed algorithm. Simulation results are presented to testify the performance and applicability of the proposed system.

  • PDF