• Title/Summary/Keyword: optimal classification method

Search Result 368, Processing Time 0.021 seconds

Parameter Extraction for Based on AR and Arrhythmia Classification through Deep Learning (AR 기반의 특징점 추출과 딥러닝을 통한 부정맥 분류)

  • Cho, Ik-sung;Kwon, Hyeog-soong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.10
    • /
    • pp.1341-1347
    • /
    • 2020
  • Legacy studies for classifying arrhythmia have been studied in order to improve the accuracy of classification, Neural Network, Fuzzy, Machine Learning, etc. In particular, deep learning is most frequently used for arrhythmia classification using error backpropagation algorithm by solving the limit of hidden layer number, which is a problem of neural network. In order to apply a deep learning model to an ECG signal, it is necessary to select an optimal model and parameters. In this paper, we propose parameter extraction based on AR and arrhythmia classification through a deep learning. For this purpose, the R-wave is detected in the ECG signal from which noise has been removed, QRS and RR interval is modelled. And then, the weights were learned by supervised learning method through deep learning and the model was evaluated by the verification data. The classification rate of PVC is evaluated through MIT-BIH arrhythmia database. The achieved scores indicate arrhythmia classification rate of over 97%.

Various Quality Fingerprint Classification Using the Optimal Stochastic Models (최적화된 확률 모델을 이용한 다양한 품질의 지문분류)

  • Jung, Hye-Wuk;Lee, Jee-Hyong
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.1
    • /
    • pp.143-151
    • /
    • 2010
  • Fingerprint classification is a step to increase the efficiency of an 1:N fingerprint recognition system and plays a role to reduce the matching time of fingerprint and to increase accuracy of recognition. It is difficult to classify fingerprints, because the ridge pattern of each fingerprint class has an overlapping characteristic with more than one class, fingerprint images may include a lot of noise and an input condition is an exceptional case. In this paper, we propose a novel approach to design a stochastic model and to accomplish fingerprint classification using a directional characteristic of fingerprints for an effective classification of various qualities. We compute the directional value by searching a fingerprint ridge pixel by pixel and extract a directional characteristic by merging a computed directional value by fixed pixels unit. The modified Markov model of each fingerprint class is generated using Markov model which is a stochastic information extraction and a recognition method by extracted directional characteristic. The weight list of classification model of each class is decided by analyzing the state transition matrixes of the generated Markov model of each class and the optimized value which improves the performance of fingerprint classification using GA (Genetic Algorithm) is estimated. The performance of the optimized classification model by GA is superior to the model before the optimization by the experiment result of applying the fingerprint database of various qualities to the optimized model by GA. And the proposed method effectively achieved fingerprint classification to exceptional input conditions because this approach is independent of the existence and nonexistence of singular points by the result of analyzing the fingerprint database which is used to the experiments.

A Study on the Classification of Fault Motors using Sound Data (소리 데이터를 이용한 불량 모터 분류에 관한 연구)

  • Il-Sik, Chang;Gooman, Park
    • Journal of Broadcast Engineering
    • /
    • v.27 no.6
    • /
    • pp.885-896
    • /
    • 2022
  • Motor failure in manufacturing plays an important role in future A/S and reliability. Motor failure is detected by measuring sound, current, and vibration. For the data used in this paper, the sound of the car's side mirror motor gear box was used. Motor sound consists of three classes. Sound data is input to the network model through a conversion process through MelSpectrogram. In this paper, various methods were applied, such as data augmentation to improve the performance of classifying fault motors and various methods according to class imbalance were applied resampling, reweighting adjustment, change of loss function and representation learning and classification into two stages. In addition, the curriculum learning method and self-space learning method were compared through a total of five network models such as Bidirectional LSTM Attention, Convolutional Recurrent Neural Network, Multi-Head Attention, Bidirectional Temporal Convolution Network, and Convolution Neural Network, and the optimal configuration was found for motor sound classification.

Classification of Sleep/Wakefulness using Nasal Pressure for Patients with Sleep-disordered Breathing (비강압력신호를 이용한 수면호흡장애 환자의 수면/각성 분류)

  • Park, Jong-Uk;Jeoung, Pil-Soo;Kang, Kyu-Min;Lee, Kyoung-Joung
    • Journal of Biomedical Engineering Research
    • /
    • v.37 no.4
    • /
    • pp.127-133
    • /
    • 2016
  • This study proposes the feasibility for automatic classification of sleep/wakefulness using nasal pressure in patients with sleep-disordered breathing (SDB). First, SDB events were detected using the methods developed in our previous studies. In epochs for normal breathing, we extracted the features for classifying sleep/wakefulness based on time-domain, frequency-domain and non-linear analysis. And then, we conducted the independent two-sample t-test and calculated Mahalanobis distance (MD) between the two categories. As a results, $SD_{LEN}$ (MD = 0.84, p < 0.01), $P_{HF}$ (MD = 0.81, p < 0.01), $SD_{AMP}$ (MD = 0.76, p = 0.031) and $MEAN_{AMP}$ (MD = 0.75, p = 0.027) were selected as optimal feature. We classified sleep/wakefulness based on support vector machine (SVM). The classification results showed mean of sensitivity (Sen.), specificity (Spc.) and accuracy (Acc.) of 60.5%, 89.0% and 84.8% respectively. This method showed the possibilities to automatically classify sleep/wakefulness only using nasal pressure.

Object Detection using Fuzzy Adaboost (퍼지 Adaboost를 이용한 객체 검출)

  • Kim, Kisang;Choi, Hyung-Il
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.5
    • /
    • pp.104-112
    • /
    • 2016
  • The Adaboost chooses a good set of features in rounds. On each round, it chooses the optimal feature and its threshold value by minimizing the weighted error of classification. The involved process of classification performs a hard decision. In this paper, we expand the process of classification to a soft fuzzy decision. We believe this expansion could allow some flexibility to the Adaboost algorithm as well as a good performance especially when the size of a training data set is not large enough. The typical Adaboost algorithm assigns a same weight to each training datum on the first round of a training process. We propose a new algorithm to assign different initial weights based on some statistical properties of involved features. In experimental results, we assess that the proposed method shows higher performance than the traditional one.

Opera Clustering: K-means on librettos datasets

  • Jeong, Harim;Yoo, Joo Hun
    • Journal of Internet Computing and Services
    • /
    • v.23 no.2
    • /
    • pp.45-52
    • /
    • 2022
  • With the development of artificial intelligence analysis methods, especially machine learning, various fields are widely expanding their application ranges. However, in the case of classical music, there still remain some difficulties in applying machine learning techniques. Genre classification or music recommendation systems generated by deep learning algorithms are actively used in general music, but not in classical music. In this paper, we attempted to classify opera among classical music. To this end, an experiment was conducted to determine which criteria are most suitable among, composer, period of composition, and emotional atmosphere, which are the basic features of music. To generate emotional labels, we adopted zero-shot classification with four basic emotions, 'happiness', 'sadness', 'anger', and 'fear.' After embedding the opera libretto with the doc2vec processing model, the optimal number of clusters is computed based on the result of the elbow method. Decided four centroids are then adopted in k-means clustering to classify unsupervised libretto datasets. We were able to get optimized clustering based on the result of adjusted rand index scores. With these results, we compared them with notated variables of music. As a result, it was confirmed that the four clusterings calculated by machine after training were most similar to the grouping result by period. Additionally, we were able to verify that the emotional similarity between composer and period did not appear significantly. At the end of the study, by knowing the period is the right criteria, we hope that it makes easier for music listeners to find music that suits their tastes.

A NEW METHOD FOR SOLVING THE NONLINEAR SECOND-ORDER BOUNDARY VALUE DIFFERENTIAL EQUATIONS

  • Effati, S.;Kamyad, A.V.;Farahi, M.H.
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.1
    • /
    • pp.183-193
    • /
    • 2000
  • In this paper we use measure theory to solve a wide range of second-order boundary value ordinary differential equations. First, we transform the problem to a first order system of ordinary differential equations(ODE's)and then define an optimization problem related to it. The new problem in modified into one consisting of the minimization of a linear functional over a set of Radon measures; the optimal measure is then approximated by a finite combination of atomic measures and the problem converted approximatly to a finite-dimensional linear programming problem. The solution to this problem is used to construct the approximate solution of the original problem. Finally we get the error functional E(we define in this paper) for the approximate solution of the ODE's problem.

An Improvement of AdaBoost using Boundary Classifier

  • Lee, Wonju;Cheon, Minkyu;Hyun, Chang-Ho;Park, Mignon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.2
    • /
    • pp.166-171
    • /
    • 2013
  • The method proposed in this paper can improve the performance of the Boosting algorithm in machine learning. The proposed Boundary AdaBoost algorithm can make up for the weak points of Normal binary classifier using threshold boundary concepts. The new proposed boundary can be located near the threshold of the binary classifier. The proposed algorithm improves classification in areas where Normal binary classifier is weak. Thus, the optimal boundary final classifier can decrease error rates classified with more reasonable features. Finally, this paper derives the new algorithm's optimal solution, and it demonstrates how classifier accuracy can be improved using the proposed Boundary AdaBoost in a simulation experiment of pedestrian detection using 10-fold cross validation.

DB Configuration Method for Optimal Design of Building System (건축전기설비의 최적설계를 위한 DB 구성방안)

  • Hwang, Sung-Wook;Jung, Jae-Yoon;Kim, Jung-Hoon;Cho, Sung-Won
    • Proceedings of the KIEE Conference
    • /
    • 2005.11c
    • /
    • pp.2-4
    • /
    • 2005
  • This paper includes level classification of electrical equipments and basic research of database system for optimal design of electrical equipments. Data for building usage, area, input voltage and type, transformer were surveyed and analyzed. Additionally, the environment of high-efficient end-use was investigated for application to design building system. For the constmction of database system, the type and size of data was analyzed.

  • PDF

A Study on Optimal Pervious/Impervious Map Generation Method for Urban Impervious Surface Management based on GIS (GIS기반의 도시지역 불투수면 관리를 위한 최적 투수/불투수도 제작 방법에 관한 연구)

  • Oh, Seong Kwang;Kim, Kye Hyun;Lee, Chol Young;Ryu, Kwang Hyun
    • Journal of Korean Society on Water Environment
    • /
    • v.31 no.2
    • /
    • pp.120-133
    • /
    • 2015
  • Due to increasing impervious surfaces resulting from urbanization and industrialization which are directly linked to urban inundation and non-point pollutants runoff, there is a need to manage them systematically. A management over urban impervious surfaces calls for pervious/impervious maps, which enable viewing the distribution of impervious surfaces. Nevertheless, relevant data are absent as now. In this respect, despite the diversity of proposed methods, pilot implementation and accuracy verification have never been conducted. Therefore, this study is aimed to produce a pilot pervious/impervious map based on previously proposed methods and to elucidate its pros and cons with a view to proposing a method for producing a GIS-based optimal pervious/impervious map. Following previously proposed methods, a pervious/impervious map of Bupyeong-gu, Incheon was produced. Then, a method of producing optimal pervious/impervious maps applicable to urban areas was proposed through the comparison of pros and cons of relevant spatial data. As a result, the map had been confirmed 99.2% of classification accuracy. Based on the present findings, future studies should establish a standardized method for producing. Also, this method should be used to produce pervious/impervious maps of other regions so that it can be applied to managing impervious surfaces in major urban areas nationwide.