scholarly journals Performance Evaluation on the Learning Algorithm for Automatic Classification of Q&A Documents

2006 ◽  
Vol 13D (1) ◽  
pp. 133-138
Author(s):  
Jung-Min Choi ◽  
Byoung-Soo Lee
2019 ◽  
pp. 089443931986921 ◽  
Author(s):  
Matthias Schonlau ◽  
Hyukjun Gweon ◽  
Marika Wenemark

Text data from open-ended questions in surveys are challenging to analyze and are often ignored. Open-ended questions are important though because they do not constrain respondents’ answers. Where open-ended questions are necessary, often human coders manually code answers. When data sets are large, it is impractical or too costly to manually code all answer texts. Instead, text answers can be converted into numerical variables, and a statistical/machine learning algorithm can be trained on a subset of manually coded data. This statistical model is then used to predict the codes of the remainder. We consider open-ended questions where the answers are coded into multiple labels (all-that-apply questions). For example, in the open-ended question in our Happy example respondents are explicitly told they may list multiple things that make them happy. Algorithms for multilabel data take into account the correlation among the answer codes and may therefore give better prediction results. For example, when giving examples of civil disobedience, respondents talking about “minor nonviolent offenses” were also likely to talk about “crimes.” We compare the performance of two different multilabel algorithms (random k-labelsets [RAKEL], classifier chains [CC]) to the default method of binary relevance (BR) which applies single-label algorithms to each code separately. Performance is evaluated on data from three open-ended questions (Happy, Civil Disobedience, and Immigrant). We found weak bivariate label correlations in the Happy data (90th percentile: 7.6%), and stronger bivariate label correlations in the Civil Disobedience (90th percentile: 17.2%) and Immigrant (90th percentile: 19.2%) data. For the data with stronger correlations, we found both multilabel methods performed substantially better than BR using 0/1 loss (“at least one label is incorrect”) and had little effect when using Hamming loss (average error). For data with weak label correlations, we found no difference in performance between multilabel methods and BR. We conclude that automatic classification of open-ended questions that allow multiple answers may benefit from using multilabel algorithms for 0/1 loss. The degree of correlations among the labels may be a useful prognostic tool.


2021 ◽  
Vol 2089 (1) ◽  
pp. 012058
Author(s):  
P. Giriprasad Gaddam ◽  
A Sanjeeva reddy ◽  
R.V. Sreehari

Abstract In the current article, an automatic classification of cardiac arrhythmias is presented using a transfer deep learning approach with the help of electrocardiography (ECG) signal analysis. Now a days, an ECG waveform serves as a powerful tool used for the analysis of cardiac arrhythmias (irregularities). The goal of the present work is to implement an algorithm based on deep learning for classification of different cardiac arrhythmias. Initially, the one dimensional (1-D) ECG signals are transformed to two dimensional (2-D) scalogram images with the help of Continuous Wavelet(CWT). Four different categories of ECG waveform were selected from four PhysioNet MIT-BIH databases, namely arrhythmia database, Normal Sinus Rhythm database, Malignant Ventricular Ectopy database and BIDMC Congestive heart failure database to examine the proposed technique. The major interest of the present study is to develop a transferred deep learning algorithm for automatic categorization of the mentioned four different heart diseases. Final results proved that the 2-D scalogram images trained with a deep convolutional neural network CNN with transfer learning technique (AlexNet) pepped up with a prominent accuracy of 95.67%. Hence, it is worthwhile to say the above stated algorithm demonstrates as an effective automated heart disease detection tool


Author(s):  
Paul DeCosta ◽  
Kyugon Cho ◽  
Stephen Shemlon ◽  
Heesung Jun ◽  
Stanley M. Dunn

Introduction: The analysis and interpretation of electron micrographs of cells and tissues, often requires the accurate extraction of structural networks, which either provide immediate 2D or 3D information, or from which the desired information can be inferred. The images of these structures contain lines and/or curves whose orientation, lengths, and intersections characterize the overall network.Some examples exist of studies that have been done in the analysis of networks of natural structures. In, Sebok and Roemer determine the complexity of nerve structures in an EM formed slide. Here the number of nodes that exist in the image describes how dense nerve fibers are in a particular region of the skin. Hildith proposes a network structural analysis algorithm for the automatic classification of chromosome spreads (type, relative size and orientation).


Author(s):  
Yashpal Jitarwal ◽  
Tabrej Ahamad Khan ◽  
Pawan Mangal

In earlier times fruits were sorted manually and it was very time consuming and laborious task. Human sorted the fruits of the basis of shape, size and color. Time taken by human to sort the fruits is very large therefore to reduce the time and to increase the accuracy, an automatic classification of fruits comes into existence.To improve this human inspection and reduce time required for fruit sorting an advance technique is developed that accepts information about fruits from their images, and is called as Image Processing Technique.


Sign in / Sign up

Export Citation Format

Share Document