• 제목/요약/키워드: criterion of classification

Search Result 287, Processing Time 0.027 seconds

Developing Corporate Credit Rating Models Using Business Failure Probability Map and Analytic Hierarchy Process (부도확률맵과 AHP를 이용한 기업 신용등급 산출모형의 개발)

  • Hong, Tae-Ho;Shin, Taek-Soo
    • The Journal of Information Systems
    • /
    • v.16 no.3
    • /
    • pp.1-20
    • /
    • 2007
  • Most researches on the corporate credit rating are generally classified into the area of bankruptcy prediction and bond rating. The studies on bankruptcy prediction have focused on improving the performance in binary classification problem, since the criterion variable is categorical, bankrupt or non-bankrupt. The other studies on bond rating have predicted the credit ratings, which was already evaluated by bond rating experts. The financial institute, however, should perform effective loan evaluation and risk management by employing the corporate credit rating model, which is able to determine the credit of corporations. Therefore, this study presents a corporate credit rating method using business failure probability map(BFPM) and AHP(Analytic Hierarchy Process). The BFPM enables us to rate the credit of corporations according to business failure probability and data distribution or frequency on each credit rating level. Also, we developed AHP model for credit rating using non-financial information. For the purpose of completed credit rating model, we integrated the BFPM and the AHP model using both financial and non-financial information. Finally, the credit ratings of each firm are assigned by our proposed method. This method will be helpful for the loan evaluators of financial institutes to decide more objective and effective credit ratings.

  • PDF

Research on Subjective-type Grading System Using Syntactic-Semantic Tree Comparator (구문의미트리 비교기를 이용한 주관식 문항 채점 시스템에 대한 연구)

  • Kang, WonSeog
    • The Journal of Korean Association of Computer Education
    • /
    • v.21 no.6
    • /
    • pp.83-92
    • /
    • 2018
  • The subjective question is appropriate for evaluation of deep thinking, but it is not easy to score. Since, regardless of same scoring criterion, the graders are able to produce different scores, we need the objective automatic evaluation system. However, the system has the problem of Korean analysis and comparison. This paper suggests the Korean syntactic analysis and subjective grading system using the syntactic-semantic tree comparator. This system is the hybrid grading system of word based and syntactic-semantic tree based grading. This system grades the answers on the subjective question using the syntactic-semantic comparator. This proposed system has the good result. This system will be utilized in Korean syntactic-semantic analysis, subjective question grading, and document classification.

Model selection algorithm in Gaussian process regression for computer experiments

  • Lee, Youngsaeng;Park, Jeong-Soo
    • Communications for Statistical Applications and Methods
    • /
    • v.24 no.4
    • /
    • pp.383-396
    • /
    • 2017
  • The model in our approach assumes that computer responses are a realization of a Gaussian processes superimposed on a regression model called a Gaussian process regression model (GPRM). Selecting a subset of variables or building a good reduced model in classical regression is an important process to identify variables influential to responses and for further analysis such as prediction or classification. One reason to select some variables in the prediction aspect is to prevent the over-fitting or under-fitting to data. The same reasoning and approach can be applicable to GPRM. However, only a few works on the variable selection in GPRM were done. In this paper, we propose a new algorithm to build a good prediction model among some GPRMs. It is a post-work of the algorithm that includes the Welch method suggested by previous researchers. The proposed algorithms select some non-zero regression coefficients (${\beta}^{\prime}s$) using forward and backward methods along with the Lasso guided approach. During this process, the fixed were covariance parameters (${\theta}^{\prime}s$) that were pre-selected by the Welch algorithm. We illustrated the superiority of our proposed models over the Welch method and non-selection models using four test functions and one real data example. Future extensions are also discussed.

Classification of Gene Data Using Membership Function and Neural Network (소속 함수와 유전자 정보의 신경망을 이용한 유전자 타입의 분류)

  • Yeom, Hae-Young;Kim, Jae-Hyup;Moon, Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.4 s.304
    • /
    • pp.33-42
    • /
    • 2005
  • This paper proposes a classification method for gene expression data, using membership function and neural network. The gene expression is a process to produce mRNA and protains which generate a living body, and the gene expression data is important to find out the functions and correlations of genes. Such gene expression data can be obtained from DNA 칩 massively and quickly. However, thousands of gene expression data may not be useful until it is well organized. Therefore a classification method is necessary to find the characteristics of gene data acquired from the gene expression. In the proposed method, a set of gene data is extracted according to the fisher's criterion, because we assume that selected gene data is the well-classified data sample. However, the selected gene data does not guarantee well-classified data sample and we calculate feature values using membership function to reduce the influence of outliers in gene data. Feature vectors estimated from the selected feature values are used to train back propagation neural network. The experimental results show that the clustering performance of the proposed method has been improved compared to other existing methods in various gene expression data.

A research on the emotion classification and precision improvement of EEG(Electroencephalogram) data using machine learning algorithm (기계학습 알고리즘에 기반한 뇌파 데이터의 감정분류 및 정확도 향상에 관한 연구)

  • Lee, Hyunju;Shin, Dongil;Shin, Dongkyoo
    • Journal of Internet Computing and Services
    • /
    • v.20 no.5
    • /
    • pp.27-36
    • /
    • 2019
  • In this study, experiments on the improvement of the emotion classification, analysis and accuracy of EEG data were proceeded, which applied DEAP (a Database for Emotion Analysis using Physiological signals) dataset. In the experiment, total 32 of EEG channel data measured from 32 of subjects were applied. In pre-processing step, 256Hz sampling tasks of the EEG data were conducted, each wave range of the frequency (Hz); Theta, Slow-alpha, Alpha, Beta and Gamma were then extracted by using Finite Impulse Response Filter. After the extracted data were classified through Time-frequency transform, the data were purified through Independent Component Analysis to delete artifacts. The purified data were converted into CSV file format in order to conduct experiments of Machine learning algorithm and Arousal-Valence plane was used in the criteria of the emotion classification. The emotions were categorized into three-sections; 'Positive', 'Negative' and 'Neutral' meaning the tranquil (neutral) emotional condition. Data of 'Neutral' condition were classified by using Cz(Central zero) channel configured as Reference channel. To enhance the accuracy ratio, the experiment was performed by applying the attributes selected by ASC(Attribute Selected Classifier). In "Arousal" sector, the accuracy of this study's experiments was higher at "32.48%" than Koelstra's results. And the result of ASC showed higher accuracy at "8.13%" compare to the Liu's results in "Valence". In the experiment of Random Forest Classifier adapting ASC to improve accuracy, the higher accuracy rate at "2.68%" was confirmed than Total mean as the criterion compare to the existing researches.

Binary Tree Architecture Design for Support Vector Machine Using Dynamic Time Warping (DTW를 이용한 SVM 기반 이진트리 구조 설계)

  • Kang, Youn Joung;Lee, Jaeil;Bae, Jinho;Lee, Seung Woo;Lee, Chong Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.201-208
    • /
    • 2014
  • In this paper, we propose the classifier structure design algorithm using DTW. Proposed algorithm uses DTW result to design the binary tree architecture based on the SVM which classify the multi-class data. Design the binary tree architecture for Support Vector Machine(SVM-BTA) using the threshold criterion calculated by the sum columns in square matrix which components are the reference data from each class. For comparison the performance of the proposed algorithm, compare the results of classifiers which binary tree structure are designed based on database and k-means algorithm. The data used for classification is 333 signals from 18 classes of underwater transient noise. The proposed classifier has been improved classification performance compared with classifier designed by database system, and probability of detection for non-biological transient signal has improved compare with classifiers using k-means algorithm. The proposed SVM-BTA classified 68.77% of biological sound(BO), 92.86% chain(CHAN) the mechanical sound, and 100% of the 6 kinds of the other classes.

Classification of Fishing Gear (어구의 분류)

  • 김대안
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.32 no.1
    • /
    • pp.33-41
    • /
    • 1996
  • In order to obtain the most favourable classification system for fishing gears, the problems in the existing systems were investigated and a new system in which the fishing method was adopted as the criterion of classification and the kinds of fishing gears were obtained by exchanging the word method into gear in the fishing methods classified newly for eliminating the problems was established. The new system to which the actual gears are arranged is as follows ; (1)Harvesting gear \circled1Plucking gears : Clamp, Tong, Wrench, etc. \circled2Sweeping gears : Push net, Coral sweep net, etc. \circled3Dredging gears : Hand dredge net, Boat dredge net, etc. (2)Sticking gears \circled1Shot sticking gears : Spear, Sharp plummet, Harpoon, etc. \circled2Pulled sticking gears : Gaff, Comb, Rake, Hook harrow, Jerking hook, etc. \circled3Left sticking gears : Rip - hook set line. (3)Angling gears \circled1Jerky angling gears (a)Single - jerky angling gears : Hand line, Pole line, etc. (b)Multiple - jerky angling gears : squid hook. \circled2Idly angling gears (a)Set angling gears : Set long line. (b)Drifted angling gears : Drift long line, Drift vertical line, etc. \circled3Dragged angling gears : Troll line. (4)Shelter gears : Eel tube, Webfoot - octopus pot, Octopus pot, etc. (5)Attracting gears : Fishing basket. (6)Cutoff gears : Wall, Screen net, Window net, etc. (7)Guiding gears \circled1Horizontally guiding gears : Triangular set net, Elliptic set net, Rectangular set net, Fish weir, etc. \circled2Vertically guiding gears : Pound net. \circled3Deeply guiding gears : Funnel net. (8)Receiving gears \circled1Jumping - fish receiving gears : Fish - receiving scoop net, Fish - receiving raft, etc. \circled2Drifting - fish receiving gears (a)Set drifting - fish receiving gears : Bamboo screen, Pillar stow net, Long stow net, etc. (b)Movable drifting - fish receiving gears : Stow net. (9)Bagging gears \circled1Drag - bagging gears (a)Bottom - drag bagging gears : Bottom otter trawl, Bottom beam trawl, Bottom pair trawl, etc. (b)Midwater - drag gagging gears : Midwater otter trawl, Midwater pair trawl, etc. (c)Surface - drag gagging gears : Anchovy drag net. \circled2Seine - bagging gears (a)Beach - seine bagging gears : Skimming scoop net, Beach seine, etc. (b)Boat - seine bagging gears : Boat seine, Danish seine, etc. \circled3Drive - bagging gears : Drive - in dustpan net, Inner drive - in net, etc. (10)Surrounding gears \circled1Incomplete surrounding gears : Lampara net, Ring net, etc. \circled2Complete surrounding gears : Purse seine, Round haul net, etc. (11)Covering gears \circled1Drop - type covering gears : Wooden cover, Lantern net, etc. \circled2Spread - type covering gears : Cast net. (12)Lifting gears \circled1Wait - lifting gears : Scoop net, Scrape net, etc. \circled2Gatherable lifting gears : Saury lift net, Anchovy lift net, etc. (13)Adherent gears \circled1Gilling gears (a)Set gilling gears : Bottom gill net, Floating gill net. (b)Drifted gilling gears : Drift gill net. (c)Encircled gilling gears : Encircled gill net. (d)Seine - gilling gears : Seining gill net. (e)Dragged gilling gears : Dragged gill net. \circled2Tangling gears (a)Set tangling gears : Double trammel net, Triple trammel net, etc. (b)Encircled tangling gears : Encircled tangle net. (c)Dragged tangling gears : Dragged tangle net. \circled3Restrainting gears (a)Drifted restrainting gears : Pocket net(Gen - type net). (b)Dragged restrainting gears : Dragged pocket net. (14)Sucking gears : Fish pumps.

  • PDF

A Study on the Effect of Using Sentiment Lexicon in Opinion Classification (오피니언 분류의 감성사전 활용효과에 대한 연구)

  • Kim, Seungwoo;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.1
    • /
    • pp.133-148
    • /
    • 2014
  • Recently, with the advent of various information channels, the number of has continued to grow. The main cause of this phenomenon can be found in the significant increase of unstructured data, as the use of smart devices enables users to create data in the form of text, audio, images, and video. In various types of unstructured data, the user's opinion and a variety of information is clearly expressed in text data such as news, reports, papers, and various articles. Thus, active attempts have been made to create new value by analyzing these texts. The representative techniques used in text analysis are text mining and opinion mining. These share certain important characteristics; for example, they not only use text documents as input data, but also use many natural language processing techniques such as filtering and parsing. Therefore, opinion mining is usually recognized as a sub-concept of text mining, or, in many cases, the two terms are used interchangeably in the literature. Suppose that the purpose of a certain classification analysis is to predict a positive or negative opinion contained in some documents. If we focus on the classification process, the analysis can be regarded as a traditional text mining case. However, if we observe that the target of the analysis is a positive or negative opinion, the analysis can be regarded as a typical example of opinion mining. In other words, two methods (i.e., text mining and opinion mining) are available for opinion classification. Thus, in order to distinguish between the two, a precise definition of each method is needed. In this paper, we found that it is very difficult to distinguish between the two methods clearly with respect to the purpose of analysis and the type of results. We conclude that the most definitive criterion to distinguish text mining from opinion mining is whether an analysis utilizes any kind of sentiment lexicon. We first established two prediction models, one based on opinion mining and the other on text mining. Next, we compared the main processes used by the two prediction models. Finally, we compared their prediction accuracy. We then analyzed 2,000 movie reviews. The results revealed that the prediction model based on opinion mining showed higher average prediction accuracy compared to the text mining model. Moreover, in the lift chart generated by the opinion mining based model, the prediction accuracy for the documents with strong certainty was higher than that for the documents with weak certainty. Most of all, opinion mining has a meaningful advantage in that it can reduce learning time dramatically, because a sentiment lexicon generated once can be reused in a similar application domain. Additionally, the classification results can be clearly explained by using a sentiment lexicon. This study has two limitations. First, the results of the experiments cannot be generalized, mainly because the experiment is limited to a small number of movie reviews. Additionally, various parameters in the parsing and filtering steps of the text mining may have affected the accuracy of the prediction models. However, this research contributes a performance and comparison of text mining analysis and opinion mining analysis for opinion classification. In future research, a more precise evaluation of the two methods should be made through intensive experiments.

The Changes in Polysomnographic Sleep Variables by Periodic Limb Movements During Sleep (주기성 사지운동증에 따른 수면다원검사 상 수면 변수들의 변화)

  • Choi, Jongbae;Choi, Jae-Won;Lee, Yu-Jin;Koo, Jae-Woo;Jeong, Do-Un
    • Sleep Medicine and Psychophysiology
    • /
    • v.24 no.1
    • /
    • pp.24-31
    • /
    • 2017
  • Objectives: Periodic limb movement disorder (PLMD) has been debated with regard to its clinical significance and diagnostic criteria. The current diagnostic criterion for PLMD in adults has been changed from periodic limb movement index (PLMI) > 5/hour to PLMI > 15/hour by the International Classification of Sleep Disorders (ICSD). In this study, we aimed to investigate the changes in polysomnographic sleep variables according to PLMI and to determine the relevance of the diagnostic criterion for PLMD. Methods: Out of 4195 subjects who underwent standard polysomnography, we selected 666 subjects (370 males and 296 females, aged $47.1{\pm}14.8$) who were older than 17 years and were not diagnosed with primary insomnia, sleep apnea, narcolepsy, or REM sleep behavior disorder. Subjects were divided into three groups according to PLMI severity: group 1 ($PLMI{\leq}5$), group 2 (5 < $PLMI{\leq}15$), and group 3 (PLMI > 15). Demographic and polysomnographic sleep variables and Epworth sleepiness scale (ESS) were compared among the three groups. Results: There were significant differences among the three groups in age and gender. Sleep efficiency (SE) and stage 3 sleep percentage in group 1 were significantly higher than those in groups 2 and 3. The wake after sleep onset (WASO) score in group 1 was significantly lower than those in groups 2 and 3. However, there were no significant differences in SE, stage 3 sleep percentage, or WASO between groups 2 and 3. Sleep latency (SL) in group 1 was significantly lower than that in group 3, but there was no difference in SL between group 2 and group 3. ESS score in group 1 was significantly higher than that in group 3, but there was no difference between group 2 and group 3. Partial correlation analysis adjusted by age showed that PLMI was significantly related to SE and WASO. Conclusion: This study suggests that PLMI influences polysomnographic sleep variables. In addition, we found the individuals who did not have PLMD but had PLMI > 5 were not different in polysomnographic sleep variables from the individuals who had PLMD according to the current criterion. These results raise questions about the relevance of the current diagnostic criterion of PLMD.

Evaluation of Damaged Stand Volume in Burned Area of Mt. Weol-A using Remotely Sensed Data (위성자료를 이용한 산화지의 입목 손실량 평가)

  • Ma, Ho-Seop;Chung, Young-Gwan;Jung, Su-Young;Choi, Dong-Wook
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.2 no.2
    • /
    • pp.79-86
    • /
    • 1999
  • This study was carried out to estimate the area of damaged forest and the volume of stand tree in burned area, Mt. Weol-A in eastern Chinju, Korea using digital maps derived from supervised classification of Landsat thematic mapper(TM) imagery as reference data. Criterion laser estimator and WinDENDRO$^{tm}$(v. 6.3b) system as a computer-aided tree ring measuring system were used to measure a volume and age of sampled tree. The sample site had been chosen in unburned areas having the same terrain condition and forest type of burned areas. The tree age, diameter at breast height, tree height and volume of the sample tree selected from sample site in unburned area were 27years, 20.9cm, 9.7m and $0.1396m^3$ respectively. Total stand volume of sample site was estimated $2.9316m^3$/0.04ha, Damaged stand volume evaluated to about $16,007m^3$ in the burned area of 218.4ha.

  • PDF