• The Korean Journal of Ecology
• /
• v.18 no.2
• /
• pp.207-218
• /
• 1995

Five non-stratified plant communities, Dichanthium-Artemisia-Themeda, Dichanthium- Plectranthes-Themeda, Plectranthes-Carex-Myrine, Heteropogon- Dichanthium-Dodonaea and Artemisia-Cynodon-Ber-beris were recognized in Girbanr hills, District Swat, during autumn, 1992. The indices of similarity showed that the communities were dissimilar. The percentage of leptophyllous and nanophyllous, terophytic and nanophanerophytic species were higher than other groups. These indicate dry and disturben conditions. Due to autumn season most of the species were entering in dormant stage. There was no tree layer on southern slopes while northern slopes had a poor layer of Pinus roxburghii. Deforestation, uprooting, terrace cultivation and overgrazing followed by erosion are the main ecological problems. The presence of isolated trees of Pinus roxburghii and stunted Olea ferruginea indicate that the original vegetation might have been of chirpine or Olea-Pinus type. The area having resource potential can be changed into a forest or rangeland by proper protection and management. Suggestions in favour of improvement are given.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.164-173
• /
• 2005

Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud detection, data reduction and variable screening, category merging, etc. We analyze waste database united with local information using decision tree techniques for environmental information. We can use these decision tree outputs for environmental preservation and improvement.

• Journal of the Korean Wood Science and Technology
• /
• v.10 no.3
• /
• pp.196-196
• /
• 1982

There is a heavy stocked wood volume in the forest of Kang-Won Province compared with the other forests of Korean Provinces. It mainly, however, consists of non-productive and inferior hardwoods and shrubs which grows naturally. -This naturally grown hardwood forest should be cut and reforested with more economical confierous and diciduous tree species by artificial and natural regeneration under the positive government support. This study was carried out to survey the reasonable and economical utilization measures on harvesting wood products when existing hardwood forest should be cut primarily. This is the rust report on the resources and the classification of tree species by the uses of wood growing in the hardwood forest of Kang-Won Province. According to the investigation, 321 hardwood species are growing in this forest, and 141 species of them are extremely not suitable for wood production. The usable species as fuel wood was 180, and these are able to classify into the 22 groups by the uses of wood.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.10a
• /
• pp.263-268
• /
• 2003

Breiman, Friedman, Olshen and Stone(1984)의 전체탐색법에 의한 회귀나무는 상대적으로 많은 분리가 가능한 변수로 분리기준이 정해지는 편의 현상을 갖고 있다. 본 연구에서는 이런 문제점을 해결할 수 있는 알고리즘을 제안하여 변수선택편의가 없는 회귀나무를 만들고자 한다. 제안하는 알고리즘은 노드의 분리변수를 선택하는 단계와 그 선택된 변수에 의해 이진분리를 위한 분리점을 찾는 단계로 구성되어 있다. 예측변수 중에서 목표변수와 가장 밀접하게 연관된 예측변수는 예측변수의 자료의 종류에 따라 스피어만의 순위상관계수에 의한 검정 혹은 크루스칼-왈리스의 통계량에 의한 검정을 수행하여 가장 통계적으로 유의한 변수로 선택하였고, 선택된 변수에만 Breiman et al.(1984)의 전체선택법을 적용하여 분리점을 결정하였다. 모의실험을 통해 변수선택편의, 변수선택력 , 그리고 평균제곱오차 측면에서 Breiman et al. (1984)의 CART(Classification and Regression Trees)와 제안한 알고리즘을 서로 비교하였다. 또한, 두 알고리즘을 실제 자료에 적용하여 효율을 서로 비교하였다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.6
• /
• pp.849-854
• /
• 2011

To minimize the spreading effect from the events of the system, a rule-based expert system is very effective. However, because the events of the large-scale system are diverse and the load condition is very variable, it is very difficult to construct the rule-based expert system. To solve this problem, this paper studies a methodology which constructs a rule-based expert system by applying a CART(Classification and Regression Trees) algorithm based decision tree determination method to event case examples.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.983-984
• /
• 2008

This paper proposes a variable break that can offset prediction error as well as a pre-selection methods, based on the variable break, for enhanced unit selection. In Japanese, a sentence consists of several APs (Accentual phrases) and MPs (Major phrases), and the breaks between these phrases must predicted to realize text-to-speech systems. An MP also consists of several APs and plays a decisive role in making synthetic speech natural and understandable because short pauses appear at its boundary. The variable break is defined as a break that is able to change easily from an AP to an MP boundary, or from an MP to an AP boundary. Using CART (Classification and Regression Trees), the variable break is modeled stochastically, and then we pre-select candidate units in the unit-selection process. As the experimental results show, it was possible to complement a break prediction error and improve the naturalness of synthetic speech.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1-4
• /
• 2003

Knowledge classification and expression of constructed knowledge have been main research issues in the field of knowledge representation. Constructed design knowledge of the former product loses its utility when new products with different structures are introduced to the market. In order to construct the design knowledge for a new product. designers need to reconstruct the design knowledge with new relationships. The design knowledge has been constructed with level trees, but it is difficult to rearrange the relations. Design DNA is proposed in this work in order to facilitate the rearrangement of design knowledge and give flexibility to knowledge structure. Design DNA is based on Layout-oriented domain knowledge and Function-oriented domain knowledge, which enables to generate new design knowledge that will result in new part geometries for given constraints on the part functions. Design DNA is applied to the design knowledge of lever system of the automatic transmission of passenger cars as an example.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.04a
• /
• pp.39-50
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID(Chi-square Automatic Interaction Detector) uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.803-816
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.358-365
• /
• 2016

We propose a novel application of random forest, a machine learning-based general classification algorithm, to analyze the influence of design attributes on the silicon-to-SPICE (S2S) gap. To improve modeling accuracy, we introduce magnification of learning data as well as randomization for the counting of design attributes to be used for each tree in the forest. From the automatically generated decision trees, we can extract the so-called importance and impact indices, which identify the most significant design attributes determining the S2S gap. We apply the proposed method to actual silicon data, and observe that the identified design attributes show a clear trend in the S2S gap. We finally unveil 10nm key fin-shaped field effect transistor (FinFET) structures that result in a large S2S gap using the measurement data from 10nm test vehicles specialized for model-hardware correlation.