• Title/Summary/Keyword: A statistical classifier

Search Result 145, Processing Time 0.024 seconds

Visualizing SVM Classification in Reduced Dimensions

  • Huh, Myung-Hoe;Park, Hee-Man
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.5
    • /
    • pp.881-889
    • /
    • 2009
  • Support vector machines(SVMs) are known as flexible and efficient classifier of multivariate observations, producing a hyperplane or hyperdimensional curved surface in multidimensional feature space that best separates training samples by known groups. As various methodological extensions are made for SVM classifiers in recent years, it becomes more difficult to understand the constructed model intuitively. The aim of this paper is to visualize various SVM classifications tuned by several parameters in reduced dimensions, so that data analysts secure the tangible image of the products that the machine made.

Accelerating the EM Algorithm through Selective Sampling for Naive Bayes Text Classifier (나이브베이즈 문서분류시스템을 위한 선택적샘플링 기반 EM 가속 알고리즘)

  • Chang Jae-Young;Kim Han-Joon
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.369-376
    • /
    • 2006
  • This paper presents a new method of significantly improving conventional Bayesian statistical text classifier by incorporating accelerated EM(Expectation Maximization) algorithm. EM algorithm experiences a slow convergence and performance degrade in its iterative process, especially when real online-textual documents do not follow EM's assumptions. In this study, we propose a new accelerated EM algorithm with uncertainty-based selective sampling, which is simple yet has a fast convergence speed and allow to estimate a more accurate classification model on Naive Bayesian text classifier. Experiments using the popular Reuters-21578 document collection showed that the proposed algorithm effectively improves classification accuracy.

Classifications of Hadiths based on Supervised Learning Techniques

  • AbdElaal, Hammam M.;Bouallegue, Belgacem;Elshourbagy, Motasem;Matter, Safaa S.;AbdElghfar, Hany A.;Khattab, Mahmoud M.;Ahmed, Abdelmoty M.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.11
    • /
    • pp.1-10
    • /
    • 2022
  • This study aims to build a model is capable of classifying the categories of hadith, according to the reliability of hadith' narrators (sahih, hassan, da'if, maudu) and according to what was attributed to the Prophet Muhammad (saying, doing, describing, reporting ) using the supervised learning algorithms, with a view to discover a relationship between these classifications, based on the outputs of this model, which might be useful to avoid the controversy and useless debate on automatic classifications of hadith, using some of the statistical methods such as chi-square, information gain and association rules. The experimental results showed that there is a relation between these classifications, most of Sahih hadiths are belong to saying class, and most of maudu hadiths are belong to reporting class. Also the best classifier had given high accuracy was MultinomialNB, it achieved higher accuracy reached up to 0.9708 %, for his ability to process high dimensional problems and identifying the most important features that are relevant to target data in training stage. Followed by LinearSVC classifier, reached up to 0.9655, and finally, KNeighborsClassifier reached up to 0.9644.

Prediction of extreme PM2.5 concentrations via extreme quantile regression

  • Lee, SangHyuk;Park, Seoncheol;Lim, Yaeji
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.3
    • /
    • pp.319-331
    • /
    • 2022
  • In this paper, we develop a new statistical model to forecast the PM2.5 level in Seoul, South Korea. The proposed model is based on the extreme quantile regression model with lasso penalty. Various meteorological variables and air pollution variables are considered as predictors in the regression model, and the lasso quantile regression performs variable selection and solves the multicollinearity problem. The final prediction model is obtained by combining various extreme lasso quantile regression estimators and we construct a binary classifier based on the model. Prediction performance is evaluated through the statistical measures of the performance of a binary classification test. We observe that the proposed method works better compared to the other classification methods, and predicts 'very bad' cases of the PM2.5 level well.

Fast Automatic Modulation Classification by MDC and kNNC (MDC와 kNNC를 이용한 고속 자동변조인식)

  • Park, Cheol-Sun;Yang, Jong-Won;Nah, Sun-Phil;Jang, Won
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.4
    • /
    • pp.88-96
    • /
    • 2007
  • This paper discusses the fast modulation classifiers capable of classifying both analog and digital modulation signals in wireless communications applications. A total of 7 statistical signal features are extracted and used to classify 9 modulated signals. In this paper, we investigate the performance of the two types of fast modulation classifiers (i.e. 2 nearest neighbor classifiers and 2 minimum distance classifiers) and compare the performance of these classifiers with that of the state of the art for the existing classification methods such as SVM Classifier. Computer simulations indicate good performance on an AWGN channel, even at low signal-to-noise ratios, in case of minimum distance classifiers (MDC for short) and k nearest neighbor classifiers (kNNC for short). Besides a good performance, these type classifiers are considered as ideal candidate to adapt real-time software radio because of their fast modulation classification capability.

Proposal of Weight Adjustment Methods Using Statistical Information in Fuzzy Weighted Mean Classifiers (퍼지 가중치 평균 분류기에서 통계 정보를 활용한 가중치 설정 기법의 제안)

  • Woo, Young-Woon;Heo, Gyeong-Yong;Kim, Kwang-Baek
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.9-15
    • /
    • 2009
  • The fuzzy weighted mean classifier is one of the most common classification models and could achieve high performance by adjusting the weights. However, the weights were generally decided based on the experience of experts, which made the resulting classifiers to suffer the lack of consistency and objectivity. To resolve this problem, in this paper, a weight deciding method based on the statistics of the data is introduced, which ensures the learned classifiers to be consistent and objective. To investigate the effectiveness of the proposed methods, Iris data set available from UCI machine learning repository is used and promising results are obtained.

A Fast Method for Face Detection based on PCA and SVM

  • Xia, Chun-Lei;Shin, Hyeon-Gab;Ha, Seok-Wun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.153-156
    • /
    • 2007
  • In this paper, we propose a fast face detection approach using PCA and SVM. In our detection system, first we filter the face potential area using statistical feature which is generated by analyzing local histogram distribution. And then, we use SVM classifier to detect whether there are faces present in the test image. Support Vector Machine (SVM) has great performance in classification task. PCA is used for dimension reduction of sample data. After PCA transform, the feature vectors, which are used for training SVM classifier, are generated. Our tests in this paper are based on CMU face database.

  • PDF

A Neural Net Classifier for Hangeul Recognition (한글 인식을 위한 신경망 분류기의 응용)

  • 최원호;최동혁;이병래;박규태
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.8
    • /
    • pp.1239-1249
    • /
    • 1990
  • In this paper, using the neural network design techniques, an adaptive Mahalanobis distance classifier(AMDC) is designed. This classifier has three layers: input layer, internal layer and output layer. The connection from input layer to internal layer is fully connected, and that from internal to output layer has partial connection that might be thought as an Oring. If two ormore clusters of patterns of one class are laid apart in the feature space, the network adaptively generate the internal nodes, whhch are corresponding to the subclusters of that class. The number of the output nodes in just same as the number of the classes to classify, on the other hand, the number of the internal nodes is defined by the number of the subclusters, and can be optimized by itself. Using the method of making the subclasses, the different patterns that are of the same class can easily be distinguished from other classes. If additional training is needed after the completion of the traning, the AMDC does not have to repeat the trainging that has already done. To test the performance of the AMDC, the experiments of classifying 500 Hangeuls were done. In experiment, 20 print font sets of Hangeul characters(10,000 cahracters) were used for training, and with 3 sets(1,500 characters), the AMDC was tested for various initial variance \ulcornerand threshold \ulcorner and compared with other statistical or neural classifiers.

  • PDF

Development of Fuzzy Support Vector Machine and Evaluation of Performance Using Ionosphere Radar Data (Fuzzy Twin Support Vector Machine 개발 및 전리층 레이더 데이터를 통한 성능 평가)

  • Cheon, Min-Kyu;Yoon, Chang-Yong;Kim, Eun-Tai;Park, Mig-Non
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.4
    • /
    • pp.549-554
    • /
    • 2008
  • Support Vector machine is the classifier which is based on the statistical training theory. Twin Support Vector Machine(TWSVM) is a kind of binary classifier that determines two nonparallel planes by solving two related SVM-type problems. The training time of TWSVM is shorter than that of SVM, but TWSVM doesn't shows worse performance than that of SVM. This paper proposes the TWSVM which is applied fuzzy membership, and compares the performance of this classifier with the other classifiers using Ionosphere radar data set.

PCA vs. ICA for Face Recognition

  • Lee, Oyoung;Park, Hyeyoung;Park, Seung-Jin
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.873-876
    • /
    • 2000
  • The information-theoretic approach to face recognition is based on the compact coding where face images are decomposed into a small set of basis images. Most popular method for the compact coding may be the principal component analysis (PCA) which eigenface methods are based on. PCA based methods exploit only second-order statistical structure of the data, so higher- order statistical dependencies among pixels are not considered. Independent component analysis (ICA) is a signal processing technique whose goal is to express a set of random variables as linear combinations of statistically independent component variables. ICA exploits high-order statistical structure of the data that contains important information. In this paper we employ the ICA for the efficient feature extraction from face images and show that ICA outperforms the PCA in the task of face recognition. Experimental results using a simple nearest classifier and multi layer perceptron (MLP) are presented to illustrate the performance of the proposed method.

  • PDF