• Smart Media Journal
• /
• v.10 no.3
• /
• pp.9-22
• /
• 2021

Basically, machine learning models use input data to produce results. Sometimes, the input data is too complicated for the models to learn useful patterns. Therefore, feature engineering is a crucial data preprocessing step for constructing a proper feature set to improve the performance of such models. One of the most efficient methods for automating feature engineering is the autoencoder, which transforms the data from its original space into a latent space. However certain factors, including the datasets, the machine learning models, and the number of dimensions of the latent space (denoted by k), should be carefully considered when using the autoencoder. In this study, we design a framework to compare two data preprocessing approaches: with and without autoencoder and to observe the impact of these factors on autoencoder. We then conduct experiments using autoencoders with classifiers on popular datasets. The empirical results provide a perspective regarding the best suited autoencoder for these factors.

• International Journal of Computer Science & Network Security
• /
• v.21 no.5
• /
• pp.129-132
• /
• 2021

Two feature selection approaches are analyzed in this study. First Approach used in this paper is Filter Approach which comprises of correlation technique. It provides two reduced feature sets using positive and negative correlation. Secondly Approach used in this paper is the wrapper approach which comprises of Sequential Forward Selection technique. The reduced feature set obtained by positive correlation results comprises of Rate of Acceleration, Intensity and Formant. The reduced feature set obtained by positive correlation results comprises of Rasta PLP, Log energy, Log power and Zero Crossing Rate. Pitch, Rate of Acceleration, Log Power, MFCC, LPCC is the reduced feature set yield as a result of Sequential Forwarding Selection.

• International journal of advanced smart convergence
• /
• v.11 no.2
• /
• pp.38-43
• /
• 2022

In this study, there are many difficulties in defining and judging creative people because there is no systematic analysis method using accurate standards or numerical values. Analyze and judge whether In the previous study, A study on the application of rule success cases through machine learning algorithm extraction, a case study was conducted to help verify or confirm the psychological personality test and aptitude test. We proposed a solution to a research problem in psychology using machine learning algorithms, Data Mining's Cross Industry Standard Process for Data Mining, and CRISP-DM, which were used in previous studies. After that, this study proposes a solution that helps to judge creative people by applying the feature selection algorithm. In this study, the accuracy was found by using seven feature selection algorithms, and by selecting the feature group classified by the feature selection algorithms, and the result of deriving the classification result with the highest feature obtained through the support vector machine algorithm was obtained.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.281-286
• /
• 2003

A large number of features are collected for problem solving in real life, but to utilize ail the features collected would be difficult. It is not so easy to collect of correct data about all features. In case it takes advantage of all collected data to learn, complicated learning model is created and good performance result can't get. Also exist interrelationships or hierarchical relations among the features. We can reduce feature's number analyzing relation among the features using heuristic knowledge or statistical method. Heuristic technique refers to learning through repetitive trial and errors and experience. Experts can approach to relevant problem domain through opinion collection process by experience. These properties can be utilized to reduce the number of feature used in learning. Experts generate a new feature (highly abstract) using raw data. This paper describes machine learning model that reduce the number of features used in learning using heuristic function and use abstracted feature by neural network's input value. We have applied this model to the win/lose prediction in pro-baseball games. The result shows the model mixing two techniques not only reduces the complexity of the neural network model but also significantly improves the classification accuracy than when neural network and heuristic model are used separately.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.4 s.304
• /
• pp.43-50
• /
• 2005

This paper proposes a new pattern recognition system combining the new adaptive feature weighting based on the genetic algorithm and the modified KNN(K Nearest-Neighbor) rules. The new feature weighting proposed herein avoids the overfitting and finds the Proper feature weighting value by determining the middle value of weights using GA. New GA operators are introduced to obtain the high performance of the system. Moreover, a class dependent feature weighting strategy is employed. Whilst the classical methods use the same feature space for all classes, the Proposed method uses a different feature space for each class. The KNN rule is modified to estimate the class of test pattern using adaptive feature space. Experiments were performed with the unconstrained handwritten numeral database of Concordia University in Canada to show the performance of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.39-49
• /
• 2000

In this paper, we propose an optimizing feature extraction method for multiclass problems assuming normal distributions. Initially, We start with an arbitrary feature vector Assuming that the feature vector is used for classification, we compute the classification error Then we move the feature vector slightly in the direction so that classification error decreases most rapidly This can be done by taking gradient We propose two search methods, sequential search and global search In the sequential search, an additional feature vector is selected so that it provides the best accuracy along with the already chosen feature vectors In the global search, we are not constrained to use the chosen feature vectors Experimental results show that the proposed algorithm provides a favorable performance.

• Journal of the Korean Society for information Management
• /
• v.35 no.2
• /
• pp.63-88
• /
• 2018

This research evaluated differences of classification performance for feature selection methods using LDA topic model and Doc2Vec which is based on word embedding using deep learning, feature corpus sizes and classification algorithms. In addition to find the feature corpus with high performance of classification, an experiment was conducted using feature corpus was composed differently according to the location of the document and by adjusting the size of the feature corpus. Conclusionally, in the experiments using deep learning evaluate training frequency and specifically considered information for context inference. This study constructed biomedical document dataset, Disease-35083 which consisted biomedical scholarly documents provided by PMC and categorized by the disease category. Throughout the study this research verifies which type and size of feature corpus produces the highest performance and, also suggests some feature corpus which carry an extensibility to specific feature by displaying efficiency during the training time. Additionally, this research compares the differences between deep learning and existing method and suggests an appropriate method by classification environment.

• Journal of Biomedical Engineering Research
• /
• v.20 no.4
• /
• pp.435-442
• /
• 1999

A fuzzy-ART(adaptive resonance theory) network for the PVC(premature ventricular contraction) classification using wavelet coefficient is designed. This network consists of the feature extraction and learning of the fuzzy-ART network. In the first step, we have detected the QRS from the ECG signal in order to set the threshold range for feature extraction and the detected QRS was divided into several frequency bands by wavelet transformation using Haar wavelet. Among the low-frequency bands, only the 6th coefficient(D6) are selected as the input feature. After that, the fuzzy-ART network for classification of the PVC is learned by using input feature which comprises of binary data converted by applying threshold to D6. The MIT/BIH database including the PVC is used for the evaluation. The designed fuzzy-ART network showed the PVC classification ratio of 96.52%.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.133-149
• /
• 1996

In order to reduce the trial-and-errors in design and production of injection molded plastic parts, there has been much research effort not only on CAE systems which simulate the injection molding process, but also on CAD systems which support initial design and re-design of plastic parts and their molds. The CAD systems and CAE systems have been developed independently with being built on different basis. That is, CAD systems manipulate the part shapes and the design features in a complete solid model, while CAE systems work on shell meshes generated on the abstract sheet model or medial surface of the part. Therefore, it is required to support the two types of geometric models and feature information in one environment to integrate CAD and CAE systems for accelerating the design speed. A feature-based non-manifold geometric modeling system has been developed to provide an integrated environment for design and analysis of injection molding products. In this system, the geometric models for CAD and CAE systems are represented by a non-manifold boundary representation and they are merged into a single geometric model. The suitable form of geometric model for any application can be extracted from this model. In addition, the feature deletion and interaction problem of the feature-based design system has been solved clearly by introducing the non-manifold Boolean operation based on 'merge and selection' algorithm. The sheet modeling capabilities were also developed for easy modeling of thin plastic parts.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.121-127
• /
• 2009

The Multistage Feature-based Classification Model(MFCM) is proposed in this paper. MFCM does not use whole feature vectors extracted from the original data at once to classify each data, but use only groups related to each feature vector to classify separately. In the training stage, the contribution rate calculated from each feature vector group is drew throughout the accuracy of each feature vector group and then, in the testing stage, the final classification result is obtained by applying weights corresponding to the contribution rate of each feature vector group. In this paper, the proposed MFCM algorithm is applied to the problem of music genre classification. The results demonstrate that the proposed MFCM outperforms conventional algorithms by 7% - 13% on average in terms of classification accuracy.