• International Journal of Advanced Culture Technology
• /
• v.4 no.2
• /
• pp.38-42
• /
• 2016

In the growing data saturated world, the question of "whether data can be used" has shifted to "can it be utilized effectively?" More data is being generated and utilized than ever before. As the collection of data increases, data mining techniques also must become more and more accurate. Thus, to ensure this data is effectively utilized, the analysis of the data must be efficient. Interpretation of results from the analysis of the data set presented, have their own on the basis it is possible to obtain the desired data. In the data mining method a decision tree, clustering, there is such a relationship has not yet been fully developed algorithm actually still impact of various factors. In this experiment, the classification method of data mining techniques is used with easy decision tree. Also, it is used special technology of one R and J48 classification technique in the decision tree. After selecting a rule that a small error in the "one rule" in one R classification, to create one of the rules of the prediction data, it is simple and accurate classification algorithm. To create a rule for the prediction, we make up a frequency table of each prediction of the goal. This is then displayed by creating rules with one R, state-of-the-art, classification algorithm while creating a simple rule to be interpreted by the researcher. While the following can be correctly classified the pattern specified in the classification J48, using the concept of a simple decision tree information theory for configuring information theory. To compare the one R algorithm, it can be analyzed error rate and accuracy. One R and J48 are generally frequently used two classifications${\ldots}$

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.713-716
• /
• 2005

In this paper, in order to identify and recognize attack patterns, we propose a Bayesian classification using frequent patterns. In theory, Bayesian classifiers guarantee the minimum error rate compared to all other classifiers. However, in practice this is not always the case owing to inaccuracies in the unrealistic assumption{ class conditional independence) made for its use. Our method addresses the problem of attribute dependence by discovering frequent patterns. It generates frequent patterns using an efficient FP-growth approach. Since the volume of patterns produced can be large, we propose a pruning technique for selection only interesting patterns. Also, this method estimates the probability of a new case using different product approximations, where each product approximation assumes different independence of the attributes. Our experiments show that the proposed classifier achieves higher accuracy and is more efficient than other classifiers.

• International Journal of Highway Engineering
• /
• v.20 no.2
• /
• pp.127-135
• /
• 2018

PURPOSES : This study develops various models that can estimate the pattern of road surface temperature changes using machine learning methods. METHODS : Both a thermal mapping system and weather forecast information were employed in order to collect data for developing the models. In previous studies, the authors defined road surface temperature data as a response, while vehicular ambient temperature, air temperature, and humidity were considered as predictors. In this research, two additional factors-road type and weather forecasts-were considered for the estimation of the road surface temperature change pattern. Finally, a total of six models for estimating the pattern of road surface temperature changes were developed using the MATLAB program, which provides the classification learner as a machine learning tool. RESULTS : Model 5 was considered the most superior owing to its high accuracy. It was seen that the accuracy of the model could increase when weather forecasts (e.g., Sky Status) were applied. A comparison between Models 4 and 5 showed that the influence of humidity on road surface temperature changes is negligible. CONCLUSIONS : Even though Models 4, 5, and 6 demonstrated the same performance in terms of average absolute error (AAE), Model 5 can be considered the optimal one from the point of view of accuracy.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.1E
• /
• pp.64-70
• /
• 1994

Predictive neural network models are powerful speech recognition models based on a nonlinear pattern prediction. But those models suffer from poor discrimination between acoustically similar words. In this paper we propose an discriminative training algorithm for predictive neural network models. This algorithm is derived from GPD (Generalized Probabilistic Descent) algorithm coupled with MCEF(Minimum Classification Error Formulation). It allows direct minimization of a recognition error rate. Evaluation of our training algoritym on ten Korean digits shows its effectiveness by 30% reduction of recognition error.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.105-112
• /
• 2006

In this study, we propose a simple preprocessing method for classification of basal cell carcinoma (BCC), which is one of the most common skin cancer. The preprocessing step consists of data clipping with a half Hanning window and dimension reduction with principal components analysis (PCA). The application of the half Hanning window deemphasizes the peak near $1650cm^{-1}$ and improves classification performance by lowering the false negative ratio. Classification results with various classifiers are presented to show the effectiveness of the proposed method. The classifiers include maximum a posteriori probability (MAP), k-nearest neighbor (KNN), probabilistic neural network (PNN), multilayer perceptron(MLP), support vector machine (SVM) and minimum squared error (MSE) classification. Classification results with KNN involving 216 spectra preprocessed with the proposed method gave 97.3% sensitivity, which is very promising results for automatic BCC detection.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.03a
• /
• pp.49-52
• /
• 1998

Neural Network has good performance in pattern classification, control and many other fields by learning ability. However, there is effective rule or systematic approach to determine optimal structure. In this paper, we propose a new method to find optimal structure of feed-forward multi-layer neural network as a kind of pruning method. That eliminating redundant elements of neural network. To find redundant elements we analysis error and weight changing with Rough Set Theory, in condition of executing back-propagation leaning algorithm.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.619-630
• /
• 2013

In this paper, we propose an edge directed color demosaicing algorithm considering color channel correlation. The proposed method consists of local region classification step and edge directional interpolation step. In the first step, each region of a given Bayer image is classified as normal edge, pattern edge, and flat regions by using intra channel and inter channel gradients. Especially, two criteria and verification process for the normal edge and pattern edge classification are used to reduce edge direction estimation error, respectively. In the second step, edge directional interpolation process is performed according to characteristics of the classified regions. For horizontal and vertical directional interpolations, missing color components are obtained from interpolation equations based on intra channel and inter channel correlations in order to improve the performance of the directional interpolations. The simulation results show that the proposed algorithm outperforms conventional approaches in both objective and subjective terms.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.11
• /
• pp.197-200
• /
• 1995

In this paper, we proposed the multi-step multi-layer artificial neural network(MMANN) to classify the chromosome, Which is used as a chromosome pattern classifier after learning. We extracted three chromosome morphological feature parameters such as centromeric index, relative length ratio, and relative area ratio by means of preprocessing method from ten chromosome images. The feature parameters of five chromosome images were used to learn neural network and the rest of them were used to classify the chromosome images. The experiment results show that the chromosome classification error is reduced much more, comparing with less feature parameters than that of the other researchers.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.959-961
• /
• 1995

The objective of most image proccessing applications is to extract meaningful information from one or more pictures. It is accomplished efficiently using neural networks, which is used in image classification and image recognition. In neural networks, background and meaningful information are processed with same weight in input layer. In this paper, we propose the image classification method using neural networks, especially EBP(Error Back Propagation). Preprocessing is needed. In preprocessing, background is compressed and meaningful information is emphasized. We use the quadtree approach, which is a hierarchical data structure based on a regular decomposition of space.