• Journal of Information Processing Systems
• /
• 제18권4호
• /
• pp.500-509
• /
• 2022

With the rapid development of educational informatization, teaching methods become diversified characteristics, but a large number of information data restrict the evaluation on teaching subject and object in terms of the effect of English education. Therefore, this study adopts the concept of incremental learning and eigenvalue interval algorithm to improve the weighted decision tree, and builds an English education effect evaluation model based on association rules. According to the results, the average accuracy of information classification of the improved decision tree algorithm is 96.18%, the classification error rate can be as low as 0.02%, and the anti-fitting performance is good. The classification error rate between the improved decision tree algorithm and the original decision tree does not exceed 1%. The proposed educational evaluation method can effectively provide early warning of academic situation analysis, and improve the teachers' professional skills in an accelerated manner and perfect the education system.

• 한국정보처리학회논문지
• /
• 제3권6호
• /
• pp.1468-1472
• /
• 1996

본 연구에서는 CART(Classification and Regression Tree)가 예측을 함에 있어 통계적인 기법인 discriminant analysis와 비교된다. 은행 데이터를 사용하는 경우 discriminant analysis가 더 나은 성능을 보여줬으며, 보험 회사 데이터를 사용한 경 우 CART가 더 나은 성능을 보여줬다. 이러한 모순된 결과가 데이터의 성격을 분석함 으로 해석된다. 본 연구에서는 두가지 모델 모두 사용된 매개변수들인 사전 확률, 데 이터, 타입 I/II오류 코스트, 검증 방법에 의해 성능의 차이를 보여줬다.

• 디지털산업정보학회논문지
• /
• 제19권4호
• /
• pp.1-11
• /
• 2023

Clustering analysis is used in various fields including customer segmentation and clustering methods such as k-means are actively applied in the credit card customer segmentation. In this paper, we summarized the input features selection method of k-means clustering for the case of the credit card customer segmentation problem, and evaluated its feasibility through the analysis results. By using the label values of k-means clustering results as target features of a decision tree classification, we composed a method for prioritizing input features using the information gain of the branch. It is not easy to determine effectiveness with the clustering effectiveness index, but in the case of the CH index, cluster effectiveness is improved evidently in the method presented in this paper compared to the case of randomly determining priorities. The suggested method can be used for effectiveness of actively used clustering analysis including k-means method.

• 디지털산업정보학회논문지
• /
• 제20권2호
• /
• pp.1-10
• /
• 2024

For the purpose of predicting credit card customer churn accurately through data analysis, a model can be constructed with various machine learning algorithms, including decision tree. And feature importance has been utilized in selecting better input features that can improve performance of data analysis models for several application areas. In this paper, a method of utilizing feature importance calculated from the MDI method and its effects are investigated in the credit card customer churn prediction problem with classification trees. Compared with several random feature selections from case data, a set of input features selected from higher value of feature importance shows higher predictive power. It can be an efficient method for classifying and choosing input features necessary for improving prediction performance. The method organized in this paper can be an alternative to the selection of input features using feature importance in composing and using classification trees, including credit card customer churn prediction.

• 한국전기전자재료학회논문지
• /
• 제20권1호
• /
• pp.57-64
• /
• 2007

One of the cause of insulation failure in power cable is well known by electrical treeing discharge. This is occurred for imposed continuous stress at cable. And this event is related to safety, reliability and maintenance. In this paper, throughout analysis of partial discharge(PD) distribution when occurring the electrical tree, is studied for the purpose of knowing of electrical treeing discharge characteristics according to defects. Own characteristic of tree will be differently processed in each defect and this reason is the first purpose of this paper. To acquire PD data, three defective tree models were made. And their own data is shown by the phase-resolved partial discharge method (PRPD). As a result of PRPD, tree discharge sources have their own characteristics. And if other defects (void, metal particle) exist internal power cable then their characteristics are shown very different. This result Is related to the time of breakdown and this is importance of cable diagnosis. And classification method of PD sources was studied in this paper. It needs select the most useful method to apply PD data classification one of the proposed method. To meet the requirement, we select methods of different type. That is, neural network(NN-BP), adaptive neuro-fuzzy inference system and PCA-LDA were applied to result. As a result of, ANFIS shows the highest rate which value is 98 %. Generally, PCA-LDA and ANFIS are better than BP. Finally, we performed classification of tree progress using ANFIS and that result is 92 %.

• 시스템엔지니어링학술지
• /
• 제10권1호
• /
• pp.73-80
• /
• 2014

Designing test case flows for water crossing operation of a wheeled vehicle is a new attempt for which very limited experiences exist. In this paper, a Function Flow Block Diagram(FFBD) and a Classification Tree Method(CTM) were combined to see if this method is viable to generate the test case flows at the functional analysis stage. It was found that this method can be practically used for the very complicated test case generation.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.706-709
• /
• 2006

Cancer is one of the major causes of death; however, the survival rate can be increased if discovered at an early stage for timely treatment. According to the statistics of the World Health Organization of 2002, breast cancer was the most prevalent cancer for all cancers occurring in women worldwide, and it account for 16.8% of entire cancers inflicting Korean women today. In order to classify the type of breast cancer whether it is benign or malignant, this study was conducted with the use of the discriminant analysis and the decision tree of data mining with the breast cancer data disclosed on the web. The discriminant analysis is a statistical method to seek certain discriminant criteria and discriminant function to separate the population groups on the basis of observation values obtained from two or more population groups, and use the values obtained to allow the existing observation value to the population group thereto. The decision tree analyzes the record of data collected in the part to show it with the pattern existing in between them, namely, the combination of attribute for the characteristics of each class and make the classification model tree. Through this type of analysis, it may obtain the systematic information on the factors that cause the breast cancer in advance and prevent the risk of recurrence after the surgery.

• ETRI Journal
• /
• 제32권1호
• /
• pp.22-32
• /
• 2010

The pervasive game environments have activated explosive growth of the Internet over recent decades. Thus, understanding Internet traffic characteristics and precise classification have become important issues in network management, resource provisioning, and game application development. Naturally, much attention has been given to analyzing and modeling game traffic. Little research, however, has been undertaken on the classification of game traffic. In this paper, we perform an interpretive traffic analysis of popular game applications at the transport layer and propose a new classification method based on a simple decision tree, called an alternative decision tree (ADT), which utilizes the statistical traffic characteristics of game applications. Experimental results show that ADT precisely classifies game traffic from other application traffic types with limited traffic features and a small number of packets, while maintaining low complexity by utilizing a simple decision tree.

• International Journal of Advanced Culture Technology
• /
• 제4권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}$

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2019년도 춘계학술대회
• /
• pp.155-156
• /
• 2019

Classification and Regression Tree (CART), SVM (Support Vector Machine) 및 k-nearest neighbor classification (kNN)과 같은 기존 기계 학습 기반 감정 분석 방법은 정확성이 떨어졌습니다. 본 논문에서는 개선 된 kNN 분류 방법을 제안한다. 개선 된 방법 및 데이터 정규화를 통해 정확성 향상의 목적이 달성됩니다. 그 후, 3 가지 분류 알고리즘과 개선 된 알고리즘을 실험 데이터에 기초하여 비교 하였다.