• Proceedings of the Korean Statistical Society Conference
• /
• 2001.11a
• /
• pp.99-104
• /
• 2001

본 연구의 주된 목표는 1997년 주가자료를 데이터마이닝 기법인 로지스틱모형, 의사결정트리, 신경망, SVM(support vector machine), 뉴로퍼지모형을 사용하여 분석한 후 우리나라 경제상황을 진단하고 예측하는데 가장 적합한 모형을 찾고 그 모형을 해석하는데 있다. 1997년 주가자료를 훈련자료로 간주하여 그 당시 경제 상황에 따라 적절한 구간으로 나누고 훈련시킨 결과 중요한 변수로는 주가지수, 등락률 10일 이동분산, 10일 이동분산의 변동비로 나타났으며 적절한 기법으로는 의사결정트리, 신경망, SVM임을 알 수 있다. 1997년 이외의 주가자료를 데이터마이닝 기법(신경망, 의사결정트리, SVM)에 적용한 결과, 우리나라 경제상황을 고려해 볼 때 신경망이 가장 정확도가 좋은 기법으로 보여진다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.17-24
• /
• 2008

위치기반 서비스(LBS: Location Based Service)는 사용자의 현재 위치를 파악하여, 사용자의 위치를 고려한 유용한 정보를 제공하는 서비스를 일컫는다. 위치기반 서비스에는 디렉토리 서비스, 게이트웨이 서비스, 유틸리티 서비스, 표현 서비스, 경로 서비스 등이 있는데, 이러한 서비스를 개발하려면 필수적으로 사용자의 위치를 파악해야 한다. 본 논문에서는 옥내 무선근거리통신망 환경에서 Fingerprint 방식으로 의사결정트리를 이용한 옥내 측위 방법을 소개한다. 또한 이 측위 방법으로 실험 데이터를 수집하고, 이를 이용한 이동 패턴 정보 추출에 대하여 살펴본다. 실험을 위해 의사결정트리를 생성하는 알고리즘과 현재 위치를 판정하는 알고리즘을 소개하고, 이 알고리즘을 적용한 옥내 측위 프로그램을 이용한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.63-66
• /
• 2006

본 논문에서는 SNP데이터를 이용하여 간경화에 대한 감수성을 예측하기 위해 의사결정 트리를 이용하였다. 데이터는 간경화 환자와 정상환자 총 116명의 데이터를 사용하였으며, Feature 값으로는 간질환과 밀접한 연관성을 갖는 28개의 SNP데이터를 사용하였다. 실험방법은 각각의 SNP에 대하여 의사결정트리로 분류율을 측정한 후 가장 높은 분류율을 가지는 SNP부터 조합해 나가는 방식으로 C4.5 의사결정트리를 이용 leave-one-out cross validation으로 간경화와 정상을 구분하는 정확도를 측정하였다. 실험결과 간 질환 관련 SNP중 IL1RN-S130S, IRNGR2-Q64R, IL-10(-592), IL1B_S35S 4개의 SNP조합에서 65.52%의 정확도를 얻을 수 있었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.17-18
• /
• 2008

다변량 퍼지 의사결정트리(이하 MFDT)는 학습 모델의 구조가 간소하고 분류율이 높다는 장점 때문에 일반 퍼지 의사결정트리를 대신해 손동작 인식 시스템의 분류기로 사용되었다. 다양한 사용자의 손동작 특성을 분류하기 위해 여러 개의 인식 모델을 만들고 새로운 사용자에게 가장 적합한 모델을 선택해 사용하는 모델 선택 기법도 손동작 인식에 적용되었다. 모델 선택 과정을 통해 선택된 모델은 기존 모델 중에서 새로운 사용자의 특성에 가장 가깝지만 해당 사용자에 최적화된 모델이라고는 할 수 없다. 이 논문에서는 MFDT 모델을 새로 입력된 데이터를 이용해 적응시키는 방법을 설명하고 실험 결과를 통해 적응 성능을 검증한다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.3
• /
• pp.156-166
• /
• 2002

Decision tree induction is a kind of useful machine learning approach for extracting classification rules from a set of feature-based examples. According to the partitioning style of the feature space, decision trees are categorized into univariate decision trees and multivariate decision trees. Due to observation error, uncertainty, subjective judgment, and so on, real-world data are prone to contain some errors in their feature values. For the purpose of making decision trees robust against such errors, there have been various trials to incorporate fuzzy techniques into decision tree construction. Several researches hove been done on incorporating fuzzy techniques into univariate decision trees. However, for multivariate decision trees, few research has been done in the line of such study. This paper proposes a fuzzy decision tree induction method that builds fuzzy multivariate decision trees named fuzzy oblique decision trees, To show the effectiveness of the proposed method, it also presents some experimental results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1275-1282
• /
• 2014

Too much information exists in ubiquitous environment, and therefore it is not easy to obtain the appropriately classified information from the available data set. Decision tree algorithm is useful in the field of data mining or machine learning system, as it is fast and deduces good result on the problem of classification. Sometimes, however, a decision tree may have leaf nodes which consist of only a few or noise data. The decisions made by those weak leaves will not be effective and therefore should be excluded in the decision process. This paper proposes a method using a classifier, UChoo, for solving a classification problem, and suggests an effective method of decision process involving only the important leaves and thereby excluding the noisy leaves. The experiment shows that this method is effective and reduces the erroneous decisions and can be applied when only important decisions should be made.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.643-652
• /
• 2006

Decision trees are mainly used for the classification and prediction in data mining. The distribution of spatial data and relationships with their neighborhoods are very important when conducting classification for spatial data mining in the real world. Spatial decision trees in previous works have been designed for reflecting spatial data characteristic by rating Euclidean distance. But it only explains the distance of objects in spatial dimension so that it is hard to represent the distribution of spatial data and their relationships. This paper proposes a decision tree based on spatial entropy that represents the distribution of spatial data with the dispersion and dissimilarity. The dispersion presents the distribution of spatial objects within the belonged class. And dissimilarity indicates the distribution and its relationship with other classes. The rate of dispersion by dissimilarity presents that how related spatial distribution and classified data with non-spatial attributes we. Our experiment evaluates accuracy and building time of a decision tree as compared to previous methods. We achieve an improvement in performance by about 18%, 11%, respectively.

• Nuclear Medicine and Molecular Imaging
• /
• v.41 no.4
• /
• pp.299-308
• /
• 2007

Purpose: The aim of this study was to develop a bioinformatics software and to test it in serum samples of papillary thyroid cancer using mass spectrometry (SELDI-TOF-MS). Materials and Methods: Development of 'Protein analysis' software performing decision tree analysis was done by customizing C4.5. Sixty-one serum samples from 27 papillary thyroid cancer, 17 autoimmune thyroiditis, 17 controls were applied to 2 types of protein chips, CM10 (weak cation exchange) and IMAC3 (metal binding - Cu). Mass spectrometry was performed to reveal the protein expression profiles. Decision trees were generated using 'Protein analysis' software, and automatically detected biomarker candidates. Validation analysis was performed for CM10 chip by random sampling. Results: Decision tree software, which can perform training and validation from profiling data, was developed. For CM10 and IMAC3 chips, 23 of 113 and 8 of 41 protein peaks were significantly different among 3 groups (p<0.05), respectively. Decision tree correctly classified 3 groups with an error rate of 3.3% for CM10 and 2.0% for IMAC3, and 4 and 7 biomarker candidates were detected respectively. In 2 group comparisons, all cancer samples were correctly discriminated from non-cancer samples (error rate = 0%) for CM10 by single node and for IMAC3 by multiple nodes. Validation results from 5 test sets revealed SELDI-TOF-MS and decision tree correctly differentiated cancers from non-cancers (54/55, 98%), while predictability was moderate in 3 group classification (36/55, 65%). Conclusion: Our in-house software was able to successfully build decision trees and detect biomarker candidates, therefore it could be useful for biomarker discovery and clinical follow up of papillary thyroid cancer.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2000.05a
• /
• pp.115-121
• /
• 2000

본 연구는 인공신경망 모형에서 최적 입력 변수를 선정하기 위하여 새로운 선처리 기법인 약체연결뉴런 제거법을 제안하고 그 예측력의 우월성을 순수 인공신경망과 의사결정트리로 선처리한 인공신경망 모델과 각각 비교했으며, 그 결과를 보면 본 연구에서 제안하고 있는 약체연결뉴런 제거법에 의해 입력변수 선정과정을 거친 모델의 성과가 순수 인공신경망이나 의사결정트리로 선처리한 인공신경망 모델에 비해 예측적중율이 우수한 것으로 나타났다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.1
• /
• pp.69-74
• /
• 2021

Internet access is also increasing as online activities increase due to the influence of Corona 19. However, network attacks are also diversifying by malicious users, and DDoS among the attacks are increasing year by year. These attacks are detected by intrusion detection systems and can be prevented at an early stage. Various data sets are used to verify intrusion detection algorithms, but in this paper, CICIDS2017, the latest traffic, is used. DDoS attack traffic was analyzed using the decision tree. In this paper, we analyzed the traffic by using the decision tree. Through the analysis, a decisive feature was found, and the accuracy of the decisive feature was confirmed by proceeding the decision tree to prove the accuracy of detection. And the contents of false positive and false negative traffic were analyzed. As a result, learning the feature and the two features showed that the accuracy was 98% and 99.8% respectively.