• Title/Summary/Keyword: Classifier algorithm

Search Result 720, Processing Time 0.033 seconds

Medical Diagnosis Problem Solving Based on the Combination of Genetic Algorithms and Local Adaptive Operations (유전자 알고리즘 및 국소 적응 오퍼레이션 기반의 의료 진단 문제 자동화 기법 연구)

  • Lee, Ki-Kwang;Han, Chang-Hee
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.2
    • /
    • pp.193-206
    • /
    • 2008
  • Medical diagnosis can be considered a classification task which classifies disease types from patient's condition data represented by a set of pre-defined attributes. This study proposes a hybrid genetic algorithm based classification method to develop classifiers for multidimensional pattern classification problems related with medical decision making. The classification problem can be solved by identifying separation boundaries which distinguish the various classes in the data pattern. The proposed method fits a finite number of regional agents to the data pattern by combining genetic algorithms and local adaptive operations. The local adaptive operations of an agent include expansion, avoidance and relocation, one of which is performed according to the agent's fitness value. The classifier system has been tested with well-known medical data sets from the UCI machine learning database, showing superior performance to other methods such as the nearest neighbor, decision tree, and neural networks.

  • PDF

Generation and Selection of Nominal Virtual Examples for Improving the Classifier Performance (분류기 성능 향상을 위한 범주 속성 가상예제의 생성과 선별)

  • Lee, Yu-Jung;Kang, Byoung-Ho;Kang, Jae-Ho;Ryu, Kwang-Ryel
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.12
    • /
    • pp.1052-1061
    • /
    • 2006
  • This paper presents a method of using virtual examples to improve the classification accuracy for data with nominal attributes. Most of the previous researches on virtual examples focused on data with numeric attributes, and they used domain-specific knowledge to generate useful virtual examples for a particularly targeted learning algorithm. Instead of using domain-specific knowledge, our method samples virtual examples from a naive Bayesian network constructed from the given training set. A sampled example is considered useful if it contributes to the increment of the network's conditional likelihood when added to the training set. A set of useful virtual examples can be collected by repeating this process of sampling followed by evaluation. Experiments have shown that the virtual examples collected this way.can help various learning algorithms to derive classifiers of improved accuracy.

Neural-based prediction of structural failure of multistoried RC buildings

  • Hore, Sirshendu;Chatterjee, Sankhadeep;Sarkar, Sarbartha;Dey, Nilanjan;Ashour, Amira S.;Balas-Timar, Dana;Balas, Valentina E.
    • Structural Engineering and Mechanics
    • /
    • v.58 no.3
    • /
    • pp.459-473
    • /
    • 2016
  • Various vague and unstructured problems encountered the civil engineering/designers that persuaded by their experiences. One of these problems is the structural failure of the reinforced concrete (RC) building determination. Typically, using the traditional Limit state method is time consuming and complex in designing structures that are optimized in terms of one/many parameters. Recent research has revealed the Artificial Neural Networks potentiality in solving various real life problems. Thus, the current work employed the Multilayer Perceptron Feed-Forward Network (MLP-FFN) classifier to tackle the problem of predicting structural failure of multistoried reinforced concrete buildings via detecting the failure possibility of the multistoried RC building structure in the future. In order to evaluate the proposed method performance, a database of 257 multistoried buildings RC structures has been constructed by professional engineers, from which 150 RC structures were used. From the structural design, fifteen features have been extracted, where nine features of them have been selected to perform the classification process. Various performance measures have been calculated to evaluate the proposed model. The experimental results established satisfactory performance of the proposed model.

Development of Pose-Invariant Face Recognition System for Mobile Robot Applications

  • Lee, Tai-Gun;Park, Sung-Kee;Kim, Mun-Sang;Park, Mig-Non
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.783-788
    • /
    • 2003
  • In this paper, we present a new approach to detect and recognize human face in the image from vision camera equipped on the mobile robot platform. Due to the mobility of camera platform, obtained facial image is small and pose-various. For this condition, new algorithm should cope with these constraints and can detect and recognize face in nearly real time. In detection step, ‘coarse to fine’ detection strategy is used. Firstly, region boundary including face is roughly located by dual ellipse templates of facial color and on this region, the locations of three main facial features- two eyes and mouth-are estimated. For this, simplified facial feature maps using characteristic chrominance are made out and candidate pixels are segmented as eye or mouth pixels group. These candidate facial features are verified whether the length and orientation of feature pairs are suitable for face geometry. In recognition step, pseudo-convex hull area of gray face image is defined which area includes feature triangle connecting two eyes and mouth. And random lattice line set are composed and laid on this convex hull area, and then 2D appearance of this area is represented. From these procedures, facial information of detected face is obtained and face DB images are similarly processed for each person class. Based on facial information of these areas, distance measure of match of lattice lines is calculated and face image is recognized using this measure as a classifier. This proposed detection and recognition algorithms overcome the constraints of previous approach [15], make real-time face detection and recognition possible, and guarantee the correct recognition irregardless of some pose variation of face. The usefulness at mobile robot application is demonstrated.

  • PDF

Analysis of Malignant Tumor Using Texture Characteristics in Breast Ultrasonography (유방 초음파 영상에서 질감 특성을 이용한 악성종양 분석)

  • Cho, Jin-Young;Ye, Soo-Young
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.20 no.2
    • /
    • pp.70-77
    • /
    • 2019
  • Breast ultrasound readings are very important to diagnose early breast cancer. In Ultrasonic inspection, it shows a significant difference in image quality depending on the ultrasonic equipment, and there is a large difference in diagnosis depending on the experience and skill of the inspector. Therefore, objective criteria are needed for accurate diagnosis and treatment. In this study, we analyzed texture characteristics by applying GLCM (Gray Level Co-occurrence Matrix) algorithm and extracted characteristic parameters and diagnosed breast cancer using neural network classifier. Breast ultrasound images were classified into normal, benign and malignant tumors and six texture parameters were extracted. Fourteen cases of normal, malignant and benign tumor diagnosed by mammography were studied by using the extracted six parameters and learning by multi - layer perceptron neural network back propagation learning method. As a result of classification using 51 normal images, 62 benign tumor images, and 74 malignant tumor images of the learned model, the classification rate was 95.2%.

Optimizing Feature Extractioin for Multiclass problems Based on Classification Error (다중 클래스 데이터를 위한 분류오차 최소화기반 특징추출 기법)

  • Choi, Eui-Sun;Lee, Chul-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.2
    • /
    • pp.39-49
    • /
    • 2000
  • In this paper, we propose an optimizing feature extraction method for multiclass problems assuming normal distributions. Initially, We start with an arbitrary feature vector Assuming that the feature vector is used for classification, we compute the classification error Then we move the feature vector slightly in the direction so that classification error decreases most rapidly This can be done by taking gradient We propose two search methods, sequential search and global search In the sequential search, an additional feature vector is selected so that it provides the best accuracy along with the already chosen feature vectors In the global search, we are not constrained to use the chosen feature vectors Experimental results show that the proposed algorithm provides a favorable performance.

  • PDF

Study on Implementation of an MPLS Switch Supporting Diffserv with VOQ-PHB (Diffserv 지원 VOQ-PHB방식의 MPLS 스위치의 구현에 관한 연구)

  • 이태원;김영철
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.5
    • /
    • pp.133-142
    • /
    • 2004
  • Recently, the growth of Internet and a variety of multimedia services through Internet increasingly demands high-speed packet transmission, the new routing function, and QoS guarantee on conventional routers. Thus, a new switching mechanical called the MPLS(Multi-Protocol Label Switching), was proposed by IETF(Internet Engineering Task Force) as a solution to meet these demands. In addition the deployment of MPLS network supporting Differentiated Services is required. In this paper, we propose the architecture of the MPLS switch supporting Differentiated Services in the MPLS-based network. The traffic conditioner consists of a classifier, a meter, and a marker. The VOQ-PHB module, which combines input Queue with each PHB queue, is implemented to utilize the resources efficiently. It employs the Priority-iSLIP scheduling algorithm to support high-speed switching. We have designed and verified the new and fast hardware architecture of VOQ-PHB and the traffic conditioner for QoS and high-speed switching using NS-2 simulator. In addition, the proposed architecture is modeled in VHDL, synthesized and verified by the VSS analyzer from SYNOPSYS. Finally, to justify the validity of the hardware architecture, the proposed architecture is placed and routed using Apollo tool.

A Study on the Rule-Based Selection of Trainging Set for the Classification of Satellite Imagery (위성 영상 분류를 위한 규칙 기반 훈련 집합 선택에 관한 연구)

  • Um, Gi-Mun;Lee, Kwae-Hi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1763-1772
    • /
    • 1996
  • The conventional training set selection methods for the satellite image classification usually depend on the manual selection using data from the direct measurements of the ground or the ground map. However this task takes much time and cost, and some feature values vary in wide ranges even if they are in the same class. Such feature values can increase the robustness of the neural net but learning time becomes longer. In this paper,we propose anew training set selection algorithm using a rule-based method. By the technique proposed, the SPOT multispectral Imagery is classified in 3 bands, and the pixels which satisfy the rule are employed as the training sets for the neutralist classifier. The experimental results show faster initial convergence and almost the same or better classification accuracy. We also showed an improvement of the classification accuracy by using texture features and NDV1.

  • PDF

Facial Feature Verification System based on SVM Classifier (SVM 분류기에 의한 얼굴 특징 식별 시스템)

  • Park Kang Ryoung;Kim Jaihie;Lee Soo-youn
    • The KIPS Transactions:PartB
    • /
    • v.11B no.6
    • /
    • pp.675-682
    • /
    • 2004
  • With the five-day workweek system in bank and the increased usage of ATM(Automatic Toller Machine), it is required that the financial crime using stolen credit card should be prevented. Though a CCTV camera is usually installed in near ATM, an intelligent criminal can cheat it disguising himself with sunglass or mask. In this paper, we propose facial feature verification system which can detect whether the user's face can be Identified or not, using image processing algorithm and SVM(Support Vector Machine). Experimental results show that FAR(Error Rate for accepting a disguised man as a non-disguised one) is 1% and FRR(Error Rate for rejecting a normal/non-disguised man as a disguised one) is 2% for training data. In addition, it shows the FAR of 2.5% and the FRR of 1.43% for test data.

Weighted Bayesian Automatic Document Categorization Based on Association Word Knowledge Base by Apriori Algorithm (Apriori알고리즘에 의한 연관 단어 지식 베이스에 기반한 가중치가 부여된 베이지만 자동 문서 분류)

  • 고수정;이정현
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.2
    • /
    • pp.171-181
    • /
    • 2001
  • The previous Bayesian document categorization method has problems that it requires a lot of time and effort in word clustering and it hardly reflects the semantic information between words. In this paper, we propose a weighted Bayesian document categorizing method based on association word knowledge base acquired by mining technique. The proposed method constructs weighted association word knowledge base using documents in training set. Then, classifier using Bayesian probability categorizes documents based on the constructed association word knowledge base. In order to evaluate performance of the proposed method, we compare our experimental results with those of weighted Bayesian document categorizing method using vocabulary dictionary by mutual information, weighted Bayesian document categorizing method, and simple Bayesian document categorizing method. The experimental result shows that weighted Bayesian categorizing method using association word knowledge base has improved performance 0.87% and 2.77% and 5.09% over weighted Bayesian categorizing method using vocabulary dictionary by mutual information and weighted Bayesian method and simple Bayesian method, respectively.

  • PDF