• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1269-1276
• /
• 2023

Crop estimation is essential for the multinational meal and powerful demand due to its numerous aspects like soil, rain, climate, atmosphere, and their relations. The consequence of climate shift impacts the farming yield products. We operate the dataset with temperature, rainfall, humidity, etc. The current research focuses on feature selection with multifarious classifiers to assist farmers and agriculturalists. The crop yield estimation utilizing the feature selection approach is 96% accuracy. Feature selection affects a machine learning model's performance. Additionally, the performance of the current graph classifier accepts 81.5%. Eventually, the random forest regressor without feature selections owns 78% accuracy and the decision tree regressor without feature selections retains 67% accuracy. Our research merit is to reveal the experimental results of with and without feature selection significance for the proposed ten algorithms. These findings support learners and students in choosing the appropriate models for crop classification studies.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.79-89
• /
• 2016

In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees.

• Journal of the Korean Wood Science and Technology
• /
• v.24 no.2
• /
• pp.46-54
• /
• 1996

This study was carried out to investigate the vacuum drying characteristics of 50mm- and 75mm- thick tree disks of some domestic softwoods for substituting the conventional hardwoods as the materials for wood crafts. Though the elapsed drying times from green to in-use moisture content(MC) were largely shortened by vacuum drying, the tree disks treated by EWS couldn't be dried to in-use MC, and so sapwood stains also were occurred severely. We suggest EWS treatment is undesirable for the species with very high sapwood portion or vacuum drying with hot water circulation heating system. Heart checks were slight, but sapwood checks, which have never been trouble in drying process of tree disks, were severe. For the reasonable explanation it is suggested MC differences between sapwood and heartwood were large and most of tree disks had already no barks before drying test. Ginkgo was vacuum-dried with very slight drying defects such as heart checks, sapwood checks. V-cracks and sapwood stains. In Korean red pine and pitch pine V-cracks were severely occurred. And it was found the special feature that most of these defected tree disks contained several V-cracks within one tree disk. It can be considered as the causes that the region of sapwood was defected by the several checks at the early drying stage because of the steep MC gradient along the radial direction, and then at the later drying stage the drying stresses due to differential shrinkage were concentrated on these brittle spots.

• Journal of the Korean Society of Costume
• /
• v.55 no.1 s.91
• /
• pp.129-138
• /
• 2005

There has been a lot of debate between scholars around the folding screen painting, A Beauty under the Tree[조모입여병풍], a collection of Shosoin, Japan. Even though it is preserved in Japan, its distinguished Chinese feature made many scholars to think it might be made in China and be transmitted to Japan. However, the inspection of the material during $1973{\sim}1975$ has revealed an important fact, that is, the feather used in this screen painting belonged to Japanese bird feather. Moreover, a great amount of documents written in Tenbyo(천평승보, 8th century) period, which was thought to be used as the ground material of this painting. Therefore we can get many evidences saying that this painting was made in japan. In a basic sense, I stand on this side just because it has more evidences. However, we must be careful to make a final conclusion. Especially on the precious things like this painting screen, we must take whole considerations as possible as we can. First of all, we must consider whether Japan could have ability to make this. Second, there could be other possibility that Japanese repair the original one with their feathers or papers. In order to prove this, study on other pieces including painting screens should be done. I just suggest an objective international discussion. Lastly, I can find the common feature between the pieces of Shosoin and the ones of United Shilla, which could be influenced by same impact, the Silk road trade in a broad sense.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose the novel video retrieval algorithm using non-parametric based motion classification in the shot-based video indexing structure. The proposed system firstly gets the key frame and motion information from each shot segmented by scene change detection method, and then extracts visual features and non-parametric based motion information from them. Finally, we construct real-time retrieval system supporting similarity comparison of these spatio-temporal features. After the normalized motion vector fields is created from MPEG compressed stream, the extraction of non-parametric based motion feature is effectively achieved by discretizing each normalized motion vectors into various angle bins, and considering a mean, a variance, and a direction of these bins. We use the edge-based spatial descriptor to extract the visual feature in key frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.

• Journal of the Korean Society for information Management
• /
• v.36 no.2
• /
• pp.57-77
• /
• 2019

Random Forest (RF), a representative ensemble technique, was applied to automatic classification of journal articles in the field of library and information science. Especially, I performed various experiments on the main factors such as tree number, feature selection, and learning set size in terms of classification performance that automatically assigns class labels to domestic journals. Through this, I explored ways to optimize the performance of random forests (RF) for imbalanced datasets in real environments. Consequently, for the automatic classification of domestic journal articles, Random Forest (RF) can be expected to have the best classification performance when using tree number interval 100~1000(C), small feature set (10%) based on chi-square statistic (CHI), and most learning sets (9-10 years).

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.3
• /
• pp.531-539
• /
• 2019

This paper proposes the training features for malware family analysis and analyzes the multi-classification performance of ensemble models. We construct training data by extracting API and DLL information from malware executables and use Random Forest and XGBoost algorithms which are based on decision tree. API, API-DLL, and DLL-CM features for malware detection and family classification are proposed by analyzing frequently used API and DLL information from malware and converting high-dimensional features to low-dimensional features. The proposed feature selection method provides the advantages of data dimension reduction and fast learning. In performance comparison, the malware detection rate is 93.0% for Random Forest, the accuracy of malware family dataset is 92.0% for XGBoost, and the false positive rate of malware family dataset including benign is about 3.5% for Random Forest and XGBoost.

• Journal of the Korea Convergence Society
• /
• v.10 no.5
• /
• pp.35-42
• /
• 2019

Recently, as the Internet and various wearable devices have appeared, Internet technology has contributed to obtaining more convenient information and doing business. However, as the internet is used in various parts, the attack surface points that are exposed to attacks are increasing, Attempts to invade networks aimed at taking unfair advantage, such as cyber terrorism, are also increasing. In this paper, we propose a feature selection method to improve the classification performance of the class to classify the abnormal behavior in the network traffic. The UNSW-NB15 dataset has a rare class imbalance problem with relatively few instances compared to other classes, and an undersampling method is used to eliminate it. We use the SVM, k-NN, and decision tree algorithms and extract a subset of combinations with superior detection accuracy and RMSE through training and verification. The subset has recall values of more than 98% through the wrapper based experiments and the DT_PSO showed the best performance.

• The Journal of Korea Robotics Society
• /
• v.11 no.3
• /
• pp.115-126
• /
• 2016

This paper suggests the method of the spherical signature description of 3D point clouds taken from the laser range scanner on the ground vehicle. Based on the spherical signature description of each point, the extractor of significant environmental features is learned by the Deep Belief Nets for the urban structure classification. Arbitrary point among the 3D point cloud can represents its signature in its sky surface by using several neighborhood points. The unit spherical surface centered on that point can be considered to accumulate the evidence of each angular tessellation. According to a kind of point area such as wall, ground, tree, car, and so on, the results of spherical signature description look so different each other. These data can be applied into the Deep Belief Nets, which is one of the Deep Neural Networks, for learning the environmental feature extractor. With this learned feature extractor, 3D points can be classified due to its urban structures well. Experimental results prove that the proposed method based on the spherical signature description and the Deep Belief Nets is suitable for the mobile robots in terms of the classification accuracy.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.358-370
• /
• 2019

The main aim of this study is to select the optimal set of genes from microarray cancer datasets that contribute to the prediction of specific cancer types. This study proposes the enhancement of the feature selection filter algorithm based on Joe's normalized mutual information and its use for gene selection. The proposed algorithm is implemented and evaluated on seven benchmark microarray cancer datasets, namely, central nervous system, leukemia (binary), leukemia (3 class), leukemia (4 class), lymphoma, mixed lineage leukemia, and small round blue cell tumor, using five well-known classifiers, including the naive Bayes, radial basis function network, instance-based classifier, decision-based table, and decision tree. An average increase in the prediction accuracy of 5.1% is observed on all seven datasets averaged over all five classifiers. The average reduction in training time is 2.86 seconds. The performance of the proposed method is also compared with those of three other popular mutual information-based feature selection filters, namely, information gain, gain ratio, and symmetric uncertainty. The results are impressive when all five classifiers are used on all the datasets.