• 제목/요약/키워드: learning algorithms

Search Result 2,242, Processing Time 0.033 seconds

Evolutionally optimized Fuzzy Polynomial Neural Networks Based on Fuzzy Relation and Genetic Algorithms: Analysis and Design (퍼지관계와 유전자 알고리즘에 기반한 진화론적 최적 퍼지다항식 뉴럴네트워크: 해석과 설계)

  • Park, Byoung-Jun;Lee, Dong-Yoon;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.2
    • /
    • pp.236-244
    • /
    • 2005
  • In this study, we introduce a new topology of Fuzzy Polynomial Neural Networks(FPNN) that is based on fuzzy relation and evolutionally optimized Multi-Layer Perceptron, discuss a comprehensive design methodology and carry out a series of numeric experiments. The construction of the evolutionally optimized FPNN(EFPNN) exploits fundamental technologies of Computational Intelligence. The architecture of the resulting EFPNN results from a synergistic usage of the genetic optimization-driven hybrid system generated by combining rule-based Fuzzy Neural Networks(FNN) with polynomial neural networks(PNN). FNN contributes to the formation of the premise part of the overall rule-based structure of the EFPNN. The consequence part of the EFPNN is designed using PNN. As the consequence part of the EFPNN, the development of the genetically optimized PNN(gPNN) dwells on two general optimization mechanism: the structural optimization is realized via GAs whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the EFPNN, the models are experimented with the use of several representative numerical examples. A comparative analysis shows that the proposed EFPNN are models with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

Base Location Prediction Algorithm of Serial Crimes based on the Spatio-Temporal Analysis (시공간 분석 기반 연쇄 범죄 거점 위치 예측 알고리즘)

  • Hong, Dong-Suk;Kim, Joung-Joon;Kang, Hong-Koo;Lee, Ki-Young;Seo, Jong-Soo;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.2
    • /
    • pp.63-79
    • /
    • 2008
  • With the recent development of advanced GIS and complex spatial analysis technologies, the more sophisticated technologies are being required to support the advanced knowledge for solving geographical or spatial problems in various decision support systems. In addition, necessity for research on scientific crime investigation and forensic science is increasing particularly at law enforcement agencies and investigation institutions for efficient investigation and the prevention of crimes. There are active researches on geographic profiling to predict the base location such as criminals' residence by analyzing the spatial patterns of serial crimes. However, as previous researches on geographic profiling use simply statistical methods for spatial pattern analysis and do not apply a variety of spatial and temporal analysis technologies on serial crimes, they have the low prediction accuracy. Therefore, this paper identifies the typology the spatio-temporal patterns of serial crimes according to spatial distribution of crime sites and temporal distribution on occurrence of crimes and proposes STA-BLP(Spatio-Temporal Analysis based Base Location Prediction) algorithm which predicts the base location of serial crimes more accurately based on the patterns. STA-BLP improves the prediction accuracy by considering of the anisotropic pattern of serial crimes committed by criminals who prefer specific directions on a crime trip and the learning effect of criminals through repeated movement along the same route. In addition, it can predict base location more accurately in the serial crimes from multiple bases with the local prediction for some crime sites included in a cluster and the global prediction for all crime sites. Through a variety of experiments, we proved the superiority of the STA-BLP by comparing it with previous algorithms in terms of prediction accuracy.

  • PDF

Recognition Method of Korean Abnormal Language for Spam Mail Filtering (스팸메일 필터링을 위한 한글 변칙어 인식 방법)

  • Ahn, Hee-Kook;Han, Uk-Pyo;Shin, Seung-Ho;Yang, Dong-Il;Roh, Hee-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.2
    • /
    • pp.287-297
    • /
    • 2011
  • As electronic mails are being widely used for facility and speedness of information communication, as the amount of spam mails which have malice and advertisement increase and cause lots of social and economic problem. A number of approaches have been proposed to alleviate the impact of spam. These approaches can be categorized into pre-acceptance and post-acceptance methods. Post-acceptance methods include bayesian filters, collaborative filtering and e-mail prioritization which are based on words or sentances. But, spammers are changing those characteristics and sending to avoid filtering system. In the case of Korean, the abnormal usages can be much more than other languages because syllable is composed of chosung, jungsung, and jongsung. Existing formal expressions and learning algorithms have the limits to meet with those changes promptly and efficiently. So, we present an methods for recognizing Korean abnormal language(Koral) to improve accuracy and efficiency of filtering system. The method is based on syllabic than word and Smith-waterman algorithm. Through the experiment on filter keyword and e-mail extracted from mail server, we confirmed that Koral is recognized exactly according to similarity level. The required time and space costs are within the permitted limit.

Studies of Automatic Dental Cavity Detection System as an Auxiliary Tool for Diagnosis of Dental Caries in Digital X-ray Image (디지털 X-선 영상을 통한 치아우식증 진단 보조 시스템으로써 치아 와동 자동 검출 프로그램 연구)

  • Huh, Jangyong;Nam, Haewon;Kim, Juhae;Park, Jiman;Shin, Sukyoung;Lee, Rena
    • Progress in Medical Physics
    • /
    • v.26 no.1
    • /
    • pp.52-58
    • /
    • 2015
  • The automated dental cavity detection program for a new concept intra-oral dental x-ray imaging device, an auxiliary diagnosis system, which is able to assist a dentist to identify dental caries in an early stage and to make an accurate diagnosis, was to be developed. The primary theory of the automatic dental cavity detection program is divided into two algorithms; one is an image segmentation skill to discriminate between a dental cavity and a normal tooth and the other is a computational method to analyze feature of an tooth image and take an advantage of it for detection of dental cavities. In the present study, it is, first, evaluated how accurately the DRLSE (Direct Regularized Level Set Evolution) method extracts demarcation surrounding the dental cavity. In order to evaluate the ability of the developed algorithm to automatically detect dental cavities, 7 tooth phantoms from incisor to molar were fabricated which contained a various form of cavities. Then, dental cavities in the tooth phantom images were analyzed with the developed algorithm. Except for two cavities whose contours were identified partially, the contours of 12 cavities were correctly discriminated by the automated dental caries detection program, which, consequently, proved the practical feasibility of the automatic dental lesion detection algorithm. However, an efficient and enhanced algorithm is required for its application to the actual dental diagnosis since shapes or conditions of the dental caries are different between individuals and complicated. In the future, the automatic dental cavity detection system will be improved adding pattern recognition or machine learning based algorithm which can deal with information of tooth status.

Improved Focused Sampling for Class Imbalance Problem (클래스 불균형 문제를 해결하기 위한 개선된 집중 샘플링)

  • Kim, Man-Sun;Yang, Hyung-Jeong;Kim, Soo-Hyung;Cheah, Wooi Ping
    • The KIPS Transactions:PartB
    • /
    • v.14B no.4
    • /
    • pp.287-294
    • /
    • 2007
  • Many classification algorithms for real world data suffer from a data class imbalance problem. To solve this problem, various methods have been proposed such as altering the training balance and designing better sampling strategies. The previous methods are not satisfy in the distribution of the input data and the constraint. In this paper, we propose a focused sampling method which is more superior than previous methods. To solve the problem, we must select some useful data set from all training sets. To get useful data set, the proposed method devide the region according to scores which are computed based on the distribution of SOM over the input data. The scores are sorted in ascending order. They represent the distribution or the input data, which may in turn represent the characteristics or the whole data. A new training dataset is obtained by eliminating unuseful data which are located in the region between an upper bound and a lower bound. The proposed method gives a better or at least similar performance compare to classification accuracy of previous approaches. Besides, it also gives several benefits : ratio reduction of class imbalance; size reduction of training sets; prevention of over-fitting. The proposed method has been tested with kNN classifier. An experimental result in ecoli data set shows that this method achieves the precision up to 2.27 times than the other methods.

Students' Informal Knowledge of Division in Elementary School Mathematics (자연수의 나눗셈에 관한 초등학교 학생의 비형식적 지식)

  • Park, Hyoun-Mi;Kang, Wan
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.10 no.2
    • /
    • pp.221-242
    • /
    • 2006
  • For teaching division more effectively, it is necessary to know students' informal knowledge before they learned formal knowledge about division. The purpose of this study is to research students' informal knowledge of division and to analyze meaningful suggestions to link formal knowledge of division in elementary school mathematics. According to this purpose, two research questions were set up as follows: (1) What is the students' informal knowledge before they learned formal knowledge about division in elementary school mathematics? (2) What is the difference of thinking strategies between students who have learned formal knowledge and students who have not learned formal knowledge? The conclusions are as follows: First, informal knowledge of division of natural numbers used by grade 1 and 2 varies from using concrete materials to formal operations. Second, students learning formal knowledge do not use so various strategies because of limited problem solving methods by formal knowledge. Third, acquisition of algorithm is not a prior condition for solving problems. Fourth, it is necessary that formal knowledge is connected to informal knowledge when teaching mathematics. Fifth, it is necessary to teach not only algorithms but also various strategies in the area of number and operation.

  • PDF

A Study on Improved Image Matching Method using the CUDA Computing (CUDA 연산을 이용한 개선된 영상 매칭 방법에 관한 연구)

  • Cho, Kyeongrae;Park, Byungjoon;Yoon, Taebok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2749-2756
    • /
    • 2015
  • Recently, Depending on the quality of data increases, the problem of time-consuming to process the image is raised by being required to accelerate the image processing algorithms, in a traditional CPU and CUDA(Compute Unified Device Architecture) based recognition system for computing speed and performance gains compared to OpenMP When character recognition has been learned by the system to measure the input by the character data matching is implemented in an environment that recognizes the region of the well, so that the font of the characters image learning English alphabet are each constant and standardized in size and character an image matching method for calculating the matching has also been implemented. GPGPU (General Purpose GPU) programming platform technology when using the CUDA computing techniques to recognize and use the four cores of Intel i5 2500 with OpenMP to deal quickly and efficiently an algorithm, than the performance of existing CPU does not produce the rate of four times due to the delay of the data of the partition and merge operation proposed a method of improving the rate of speed of about 3.2 times, and the parallel processing of the video card that processes a result, the sequential operation of the process compared to CPU-based who performed the performance gain is about 21 tiems improvement in was confirmed.

Vehicle Headlight and Taillight Recognition in Nighttime using Low-Exposure Camera and Wavelet-based Random Forest (저노출 카메라와 웨이블릿 기반 랜덤 포레스트를 이용한 야간 자동차 전조등 및 후미등 인식)

  • Heo, Duyoung;Kim, Sang Jun;Kwak, Choong Sub;Nam, Jae-Yeal;Ko, Byoung Chul
    • Journal of Broadcast Engineering
    • /
    • v.22 no.3
    • /
    • pp.282-294
    • /
    • 2017
  • In this paper, we propose a novel intelligent headlight control (IHC) system which is durable to various road lights and camera movement caused by vehicle driving. For detecting candidate light blobs, the region of interest (ROI) is decided as front ROI (FROI) and back ROI (BROI) by considering the camera geometry based on perspective range estimation model. Then, light blobs such as headlights, taillights of vehicles, reflection light as well as the surrounding road lighting are segmented using two different adaptive thresholding. From the number of segmented blobs, taillights are first detected using the redness checking and random forest classifier based on Haar-like feature. For the headlight and taillight classification, we use the random forest instead of popular support vector machine or convolutional neural networks for supporting fast learning and testing in real-life applications. Pairing is performed by using the predefined geometric rules, such as vertical coordinate similarity and association check between blobs. The proposed algorithm was successfully applied to various driving sequences in night-time, and the results show that the performance of the proposed algorithms is better than that of recent related works.

Analysis of Disaster Safety Situation Classification Algorithm Based on Natural Language Processing Using 119 Calls Data (119 신고 데이터를 이용한 자연어처리 기반 재난안전 상황 분류 알고리즘 분석)

  • Kwon, Su-Jeong;Kang, Yun-Hee;Lee, Yong-Hak;Lee, Min-Ho;Park, Seung-Ho;Kang, Myung-Ju
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.10
    • /
    • pp.317-322
    • /
    • 2020
  • Due to the development of artificial intelligence, it is used as a disaster response support system in the field of disaster. Disasters can occur anywhere, anytime. In the event of a disaster, there are four types of reports: fire, rescue, emergency, and other call. Disaster response according to the 119 call also responds differently depending on the type and situation. In this paper, 1280 data set of 119 calls were tested with 3 classes of SVM, NB, k-NN, DT, SGD, and RF situation classification algorithms using a training data set. Classification performance showed the highest performance of 92% and minimum of 77%. In the future, it is necessary to secure an effective data set by disaster in various fields to study disaster response.

Evolution of Neural Network's Structure and Learn Patterns Based on Competitive Co-Evolutionary Method (경쟁적 공진화법에 의한 신경망의 구조와 학습패턴의 진화)

  • Joung, Chi-Sun;Lee, Dong-Wook;Jun, Hyo-Byung;Sim, Kwee-Bo
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.29-37
    • /
    • 1999
  • In general, the information processing capability of a neural network is determined by its architecture and efficient training patterns. However, there is no systematic method for designing neural network and selecting effective training patterns. Evolutionary Algorithms(EAs) are referred to as the methods of population-based optimization. Therefore, EAs are considered as very efficient methods of optimal system design because they can provide much opportunity for obtaining the global optimal solution. In this paper, we propose a new method for finding the optimal structure of neural networks based on competitive co-evolution, which has two different populations. Each population is called the primary population and the secondary population respectively. The former is composed of the architecture of neural network and the latter is composed of training patterns. These two populations co-evolve competitively each other, that is, the training patterns will evolve to become more difficult for learning of neural networks and the architecture of neural networks will evolve to learn this patterns. This method prevents the system from the limitation of the performance by random design of neural networks and inadequate selection of training patterns. In co-evolutionary method, it is difficult to monitor the progress of co-evolution because the fitness of individuals varies dynamically. So, we also introduce the measurement method. The validity and effectiveness of the proposed method are inspected by applying it to the visual servoing of robot manipulators.

  • PDF