• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.655-660
• /
• 2003

In general, Support Vector Machine has a good performance in binary classification, but it has the limitation on multi-pattern classification. So, we proposed an Import Vector Voting model for two or more labels classification. This model applied kernel bagging strategy to Import Vector Machine by Zhu. The proposed model used a voting strategy which averaged optimal kernel function from many kernel functions. In experiments, not only binary but multi-pattern classification problems, our proposed Import Vector Voting model showed good performance for given machine learning data.

• Journal of National Security and Military Science
• /
• s.1
• /
• pp.191-229
• /
• 2003

Multi-sensor data fusion techniques combine evidences from multiple sensors in order to get more accurate and efficient meaningful information through several process levels that may not be possible from a single sensor alone. One of the most important parts in the data fusion system is the identification fusion, and it can be categorized into physical models, parametric classification and cognitive-based models, and parametric classification technique is usually used in multi-sensor data fusion system by its characteristic. In this paper, we propose a novel heuristic identification fusion method in which we adopt desirable properties from not only parametric classification technique but also cognitive-based models in order to meet the realtime processing requirements.

• Asia pacific journal of information systems
• /
• v.21 no.2
• /
• pp.43-58
• /
• 2011

Support vector machines (SVMs), a machine learning technique, has been applied to not only binary classification problems such as bankruptcy prediction but also multi-class problems such as corporate credit ratings. However, in general, the performance of SVMs can be easily worse than the best alternative model to SVMs according to the selection of predictors, even though SVMs has the distinguishing feature of successfully classifying and predicting in a lot of dichotomous or multi-class problems. For overcoming the weakness of SVMs, this study has proposed an approach for selecting features for multi-class SVMs that utilize the impurity measures of classification trees. For the selection of the input features, we employed the C4.5 and CART algorithms, including the stepwise method of discriminant analysis, which is a well-known method for selecting features. We have built a multi-class SVMs model for credit rating using the above method and presented experimental results with data regarding S&P 500 companies.

• Korean Journal of Remote Sensing
• /
• v.28 no.3
• /
• pp.329-336
• /
• 2012

This paper give further assessment on the original DoP-CPD classification scheme. This paper provides some additional comparative study on the DoP-CPD with H/A/alpha classifier in terms of multi look effects and classification performances. The statistics and multi looking effects of the DoP and CPD were analyzed with measured polarimetric SAR data. DoP-CPD is less sensitive to the number of averaging pixels than the entropy-alpha technique. A DoP-CPD diagram with appropriate boundaries between six different classes was then developed based on the data analysis. A polarimetric SAR image DoP-CPD classification technique is verified with C-band polarimetric RADARSAT-2 images.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.101-110
• /
• 2022

Histopathological analysis of biopsy specimens is still used for diagnosis and classifying the brain tumors today. The available procedures are intrusive, time consuming, and inclined to human error. To overcome these disadvantages, need of implementing a fully automated deep learning-based model to classify brain tumor into multiple classes. The proposed CNN model with an accuracy of 92.98 % for categorizing tumors into five classes such as normal tumor, glioma tumor, meningioma tumor, pituitary tumor, and metastatic tumor. Using the grid search optimization approach, all of the critical hyper parameters of suggested CNN framework were instantly assigned. Alex Net, Inception v3, Res Net -50, VGG -16, and Google - Net are all examples of cutting-edge CNN models that are compared to the suggested CNN model. Using huge, publicly available clinical datasets, satisfactory classification results were produced. Physicians and radiologists can use the suggested CNN model to confirm their first screening for brain tumor Multi-classification.

• Journal of KIISE:Software and Applications
• /
• v.37 no.5
• /
• pp.378-385
• /
• 2010

The explosive increase in the use of email has made to need email classification efficiently and accurately. Current work on the email classification method have mainly been focused on a binary classification that filters out spam-mails. This methods are based on Support Vector Machines, Bayesian classifiers, rule-based classifiers. Such supervised methods, in the sense that the user is required to manually describe the rules and keyword list that is used to recognize the relevant email. Other unsupervised method using clustering techniques for the multi-category classification is created a category labels from a set of incoming messages. In this paper, we propose a new automatic email multi-category classification method using NMF for automatic category label construction method and dynamic category hierarchy method for the reorganization of email messages in the category labels. The proposed method in this paper, a large number of emails are managed efficiently by classifying multi-category email automatically, email messages in their category are reorganized for enhancing accuracy whenever users want to classify all their email messages.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.1E
• /
• pp.3-8
• /
• 1997

Three new classification methods for multi temporal images are proposed. They are named as a likelihood addition method, a likelihood majority method and a Dempster-Shafer's rule method. Basic strategies using these methods are to calculate likelihoods for each temporal data and to combine obtained likelihoods for final classification. These three methods use different combining algorithms. From classification experiments, following results were obtained. The method based on Dempster-Shafer's rule of combination showed about 12% improvement of classification accuracies compared to a conventional method. This method needed about 16% more processing times than that of a conventional method. The other two proposed method showed 1% to 5% increase of classification accuracies. However processing times of these two proposed method showed 1% to 5% increase of classification accuracies. However processing times of these two methods are almost the same with that of a conventional method. Among the newly proposed three methods, the Dempster-Shafer's rule method showed the highest classification accuracies with more processing time than those of other methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.115-120
• /
• 2005

In this paper, we propose a new robust content-based musical genre classification algorithm using multi-feature clustering(MFC) method. In contrast to previous works, this paper focuses on two practical issues of the system dependency problem on different input query patterns(or portions) and input query lengths which causes serious uncertainty of the system performance. In order to solve these problems, a new approach called multi-feature clustering(MFC) based on k-means clustering is proposed. To verify the performance of the proposed method, several excerpts with variable duration were extracted from every other position in a queried music file. Effectiveness of the system with MFC and without MFC is compared in terms of the classification accuracy. It is demonstrated that the use of MFC significantly improves the system stability of musical genre classification performance with higher accuracy rate.

• Korean Journal of Remote Sensing
• /
• v.23 no.3
• /
• pp.181-188
• /
• 2007

The objective of this research was to investigate the optimal land cover classification algorithm for the monitoring of North Korea with MODIS multi-temporal data based on monthly phenological characteristics. Three frequently used land cover classification algorithms, ISODATA1), SMA2), and SOM3) were employed for this study; the land cover categories were forest, grass, agricultural, wetland, barren, built-up, and water body. The outcomes of the study can be summarized as follows. First, the overall classification accuracy of ISODATA, SMA, and SOM was 69.03%, 64.28%, and 73.57%, respectively. Second, ISODATA and SMA resulted in a higher classification accuracy of forest and agricultural categories, but SOM performed better for the built-up area, bare soil, grassland, and water. A possible explanation for this difference would be related to the difference of sensitivity against the vegetation activity. This would be related to the capability of SOM to express all of their values without any loss of data by maintaining the topology between pixels of primitive data after classification, while ISODATA and SMA retain limited amount of data after normalization process. Third, we can conclude that SOM is the best algorithm for monitoring the land cover change of North Korea.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.116-119
• /
• 2005

As to the synthetical estimation of land covering parameters or the compounded land covering classification for multi-resolution satellite data, former researches mainly adopted linear or nonlinear regression models to describe the regression relationship of land covering parameters caused by the degradation of spatial resolution, in order to improve the retrieval accuracy of global land covering parameters based on 1;he lower resolution satellite data. However, these methods can't authentically represent the complementary characteristics of spatial resolutions among different satellite data at arithmetic level. To resolve the problem above, a new compounded land covering classification method at arithmetic level for multi-resolution satellite data is proposed in this .paper. Firstly, on the basis of unsupervised clustering analysis of the higher resolution satellite data, the likelihood distribution scatterplot of each cover type is obtained according to multiple-to-single spatial correspondence between the higher and lower resolution satellite data in some local test regions, then Parzen window approach is adopted to derive the real likelihood functions from the scatterplots, and finally the likelihood functions are extended from the local test regions to the full covering area of the lower resolution satellite data and the global covering area of the lower resolution satellite is classified under the maximum likelihood rule. Some experimental results indicate that this proposed compounded method can improve the classification accuracy of large-scale lower resolution satellite data with the support of some local-area higher resolution satellite data.