• Asia pacific journal of information systems
• /
• v.19 no.2
• /
• pp.139-155
• /
• 2009

For the last few decades, many studies have tried to explore and unveil venture companies' success factors and unique features in order to identify the sources of such companies' competitive advantages over their rivals. Such venture companies have shown tendency to give high returns for investors generally making the best use of information technology. For this reason, many venture companies are keen on attracting avid investors' attention. Investors generally make their investment decisions by carefully examining the evaluation criteria of the alternatives. To them, credit rating information provided by international rating agencies, such as Standard and Poor's, Moody's and Fitch is crucial source as to such pivotal concerns as companies stability, growth, and risk status. But these types of information are generated only for the companies issuing corporate bonds, not venture companies. Therefore, this study proposes a method for evaluating venture businesses by presenting our recent empirical results using financial data of Korean venture companies listed on KOSDAQ in Korea exchange. In addition, this paper used multi-class SVM for the prediction of DEA-based efficiency rating for venture businesses, which was derived from our proposed method. Our approach sheds light on ways to locate efficient companies generating high level of profits. Above all, in determining effective ways to evaluate a venture firm's efficiency, it is important to understand the major contributing factors of such efficiency. Therefore, this paper is constructed on the basis of following two ideas to classify which companies are more efficient venture companies: i) making DEA based multi-class rating for sample companies and ii) developing multi-class SVM-based efficiency prediction model for classifying all companies. First, the Data Envelopment Analysis(DEA) is a non-parametric multiple input-output efficiency technique that measures the relative efficiency of decision making units(DMUs) using a linear programming based model. It is non-parametric because it requires no assumption on the shape or parameters of the underlying production function. DEA has been already widely applied for evaluating the relative efficiency of DMUs. Recently, a number of DEA based studies have evaluated the efficiency of various types of companies, such as internet companies and venture companies. It has been also applied to corporate credit ratings. In this study we utilized DEA for sorting venture companies by efficiency based ratings. The Support Vector Machine(SVM), on the other hand, is a popular technique for solving data classification problems. In this paper, we employed SVM to classify the efficiency ratings in IT venture companies according to the results of DEA. The SVM method was first developed by Vapnik (1995). As one of many machine learning techniques, SVM is based on a statistical theory. Thus far, the method has shown good performances especially in generalizing capacity in classification tasks, resulting in numerous applications in many areas of business, SVM is basically the algorithm that finds the maximum margin hyperplane, which is the maximum separation between classes. According to this method, support vectors are the closest to the maximum margin hyperplane. If it is impossible to classify, we can use the kernel function. In the case of nonlinear class boundaries, we can transform the inputs into a high-dimensional feature space, This is the original input space and is mapped into a high-dimensional dot-product space. Many studies applied SVM to the prediction of bankruptcy, the forecast a financial time series, and the problem of estimating credit rating, In this study we employed SVM for developing data mining-based efficiency prediction model. We used the Gaussian radial function as a kernel function of SVM. In multi-class SVM, we adopted one-against-one approach between binary classification method and two all-together methods, proposed by Weston and Watkins(1999) and Crammer and Singer(2000), respectively. In this research, we used corporate information of 154 companies listed on KOSDAQ market in Korea exchange. We obtained companies' financial information of 2005 from the KIS(Korea Information Service, Inc.). Using this data, we made multi-class rating with DEA efficiency and built multi-class prediction model based data mining. Among three manners of multi-classification, the hit ratio of the Weston and Watkins method is the best in the test data set. In multi classification problems as efficiency ratings of venture business, it is very useful for investors to know the class with errors, one class difference, when it is difficult to find out the accurate class in the actual market. So we presented accuracy results within 1-class errors, and the Weston and Watkins method showed 85.7% accuracy in our test samples. We conclude that the DEA based multi-class approach in venture business generates more information than the binary classification problem, notwithstanding its efficiency level. We believe this model can help investors in decision making as it provides a reliably tool to evaluate venture companies in the financial domain. For the future research, we perceive the need to enhance such areas as the variable selection process, the parameter selection of kernel function, the generalization, and the sample size of multi-class.

• Journal of Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.143-150
• /
• 2012

Computational techniques for topic classification can support qualitative research by automatically applying labels in preparation for qualitative analyses. This paper presents an evaluation of supervised learning techniques applied to one such use case, namely, that of labeling emotions, instructions and information in suicide notes. We train a collection of one-versus-all binary support vector machine classifiers, using cost-sensitive learning to deal with class imbalance. The features investigated range from a simple bag-of-words and n-grams over stems, to information drawn from syntactic dependency analysis and WordNet synonym sets. The experimental results are complemented by an analysis of systematic errors in both the output of our system and the gold-standard annotations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.55-65
• /
• 2000

This paper presents a linear programming based algorithm for pattern classification. Pattern classification is being considered to be critical in the area of artificial intelligence and business applications. Previous methods employing linear programming have been aimed at two-group discrimination with one or more linear discriminant functions. Therefore, there are some limitations in applying available linear programming formulations directly to general multi-class classification problems. The algorithm proposed in this manuscript is based on quadratic or polynomial discriminant functions, which allow more flexibility in covering the class regions in the N-dimensional space. The proposed algorithm is compared with other competitive methods of pattern classification in experimental results and is shown to be competitive enough for a general purpose classifier.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.487-492
• /
• 2011

In this paper, we proposed a new design methodology to improve the classification performance of the Nearest Prototype Classifier which is one of the simplest classification algorithm. To optimize the position vectors of the prototypes in the nearest prototype classifier, we use the differential evolutionary algorithm. The optimized position vectors of the prototypes result in the improvement of the classification performance. The new method to determine the class labels of the prototypes, which are defined by the differential evolutionary algorithm, is proposed. In addition, the experimental application covers a comparative analysis including several previously commonly encountered methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.4
• /
• pp.364-371
• /
• 2013

Emotion Recognition is one of the important part to develop in human-human and human computer interaction. In this paper, we have focused on the performance of multi-class SVM (Support Vector Machine) with Gaussian RFB (Radial Basis function) kernel, which has been used to solve the problem of emotion recognition from physiological signals and to improve the accuracy of emotion recognition. The experimental paradigm for data acquisition, visual-stimuli of IAPS (International Affective Picture System) are used to induce emotional states, such as fear, disgust, joy, and neutral for each subject. The raw signals of acquisited data are splitted in the trial from each session to pre-process the data. The mean value and standard deviation are employed to extract the data for feature extraction and preparing in the next step of classification. The experimental results are proving that the proposed approach of multi-class SVM with Gaussian RBF kernel with OVO (One-Versus-One) method provided the successful performance, accuracies of classification, which has been performed over these four emotions.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.11a
• /
• pp.251-256
• /
• 2004

The image classification is one of the most important studies in the remote sensing. In general, the MLC(Maximum Likelihood Classification) classification that in consideration of distribution of training information is the most effective way but it produces a bad result when we apply it to actual hyperspectral image with the same classification technique. The purpose of this research is to reveal that which one is the most effective and suitable way of the classification algorithms iii the hyperspectral image classification. To confirm this matter, we apply the MLC classification algorithm which has distribution information and SAM(Spectral Angle Mapper), SFF(Spectral Feature Fitting) algorithm which use average information of the training class to both multispectral image and hyperspectral image. I conclude this result through quantitative and visual analysis using confusion matrix could confirm that SAM and SFF algorithm using of spectral pattern in vector domain is more effective way in the hyperspectral image classification than MLC which considered distribution.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.9-17
• /
• 2023

In this paper, we propose a one-class vibration anomaly detection system for bearing defect diagnosis. In order to reduce the economic and time loss caused by bearing failure, an accurate defect diagnosis system is essential, and deep learning-based defect diagnosis systems are widely studied to solve the problem. However, it is difficult to obtain abnormal data in the actual data collection environment for deep learning learning, which causes data bias. Therefore, a one-class classification method using only normal data is used. As a general method, the characteristics of vibration data are extracted by learning the compression and restoration process through AutoEncoder. Anomaly detection is performed by learning a one-class classifier with the extracted features. However, this method cannot efficiently extract the characteristics of the vibration data because it does not consider the frequency characteristics of the vibration data. To solve this problem, we propose an AutoEncoder model that considers the frequency characteristics of vibration data. As for classification performance, accuracy 0.910, precision 1.0, recall 0.820, and f1-score 0.901 were obtained. The network design considering the vibration characteristics confirmed better performance than existing methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.153-159
• /
• 2011

Pan-So-Ri singing a story as song is one of Korea traditional musics. it divide into two sect(east-sect, west-sect), and it is hard to classify two sect without knowledge about Pan-So-Ri. In this paper, we have propose a Pan-So-Ri classification program using PCD(Pitch Class Distribution) and Naive Bayesian Classifier. Attribute value of classifier is each appearance frequency of pitch. Experiment is conducted two time with different rounding off location of probability value. Better one show correct classification with east-sect 80%, west-sect 97%, and total accuracy of 88%. this result is used our program.

• Journal of Pharmaceutical Investigation
• /
• v.40 no.spc
• /
• pp.1-7
• /
• 2010

Since the introduction of the biopharmaceutics classification system (BCS) in 1995, it has viewed as an effective tool to categorize drugs in terms of prediction for bioavailability (BA) and bioequivalence (BE). The BCS consist of four drug categories: class I (highly soluble and highly permeable), class II (low soluble and highly permeable), class III (highly soluble and low permeable) and class IV (low soluble and low permeable), and almost all drugs belong to one of these categories. Likewise, classifying drugs into four categories according to their solubility and permeability is simple and relatively not controversial, and thus the FDA adopted the BCS as a science-based approach in establishing a series of regulatory guidance for the industry. Actually, many pharmaceutical companies have gained a lot of benefits, which directly connect to cost loss and failure decrease in the early stage of drug development. Recently, instead of solubility, using dissolution characteristics (e.g. intrinsic dissolution rate) have provided an improvement in the classification in correlating more closely with in vivo drug dissolution rather than solubility by itself. Furthermore, a newly modified-version of BCS, biopharmaceutics drug disposition classification system (BDDCS), which classify drugs into four categories according to solubility and metabolism, has been introduced and gained much attention as a new insight in respect with the drug classification. This report gives a brief overview of the BCS and its implication, and also introduces the recent new trend of drug classification.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.3
• /
• pp.565-574
• /
• 2004

Classification tree algorithms including as CART by Brieman et al.(1984) in some aspects, recursively partition the data space with the aim of making the distribution of the class variable as pure as within each partition and consist of several steps. SUPPORT(smoothed and unsmoothed piecewise-polynomial regression trees) method of Chaudhuri et al(1994), a weighted averaging technique is used to combine piecewise polynomial fits into a smooth one. We focus on applying SUPPORT to a binary class variable. Logistic model is considered in the caculation techniques and the results are shown good classification rates compared with other methods as CART, QUEST, and CHAID.