Automated classification of software issue reports using machine learning techniques: an empirical study

2017 ◽  
Vol 13 (4) ◽  
pp. 279-297 ◽  
Author(s):  
Nitish Pandey ◽  
Debarshi Kumar Sanyal ◽  
Abir Hudait ◽  
Amitava Sen
Keyword(s):  
Machine Learning ◽  
Empirical Study ◽  
Machine Learning Techniques ◽  
Automated Classification ◽  
Learning Techniques ◽  
Issue Reports

A Brief Survey on Text Classification Using Various Machine Learning Techniques

2018 ◽  
Vol 8 (1) ◽  
pp. 14
Author(s):  
Padmavathi .S ◽  
M. Chidambaram
Keyword(s):  
Machine Learning ◽  
Text Classification ◽  
Fixed Number ◽  
Machine Learning Techniques ◽  
Online Information ◽  
Rule Based ◽  
Learning Techniques ◽  
Machine Learning Approach ◽  
Rule Based Approach

Text classification has grown into more significant in managing and organizing the text data due to tremendous growth of online information. It does classification of documents in to fixed number of predefined categories. Rule based approach and Machine learning approach are the two ways of text classification. In rule based approach, classification of documents is done based on manually defined rules. In Machine learning based approach, classification rules or classifier are defined automatically using example documents. It has higher recall and quick process. This paper shows an investigation on text classification utilizing different machine learning techniques.

Machine Learning Based Assembly of Fragments of Ancient Papyrus

2021 ◽  
Vol 14 (3) ◽  
pp. 1-21
Author(s):  
Roy Abitbol ◽  
Ilan Shimshoni ◽  
Jonathan Ben-Dov
Keyword(s):  
Machine Learning ◽  
Spatial Information ◽  
Real Life ◽  
Dead Sea ◽  
Machine Learning Techniques ◽  
Automated Classification ◽  
Learning Techniques ◽  
Test Batch ◽  
Validation Set ◽  
Local Edge

The task of assembling fragments in a puzzle-like manner into a composite picture plays a significant role in the field of archaeology as it supports researchers in their attempt to reconstruct historic artifacts. In this article, we propose a method for matching and assembling pairs of ancient papyrus fragments containing mostly unknown scriptures. Papyrus paper is manufactured from papyrus plants and therefore portrays typical thread patterns resulting from the plant’s stems. The proposed algorithm is founded on the hypothesis that these thread patterns contain unique local attributes such that nearby fragments show similar patterns reflecting the continuations of the threads. We posit that these patterns can be exploited using image processing and machine learning techniques to identify matching fragments. The algorithm and system which we present support the quick and automated classification of matching pairs of papyrus fragments as well as the geometric alignment of the pairs against each other. The algorithm consists of a series of steps and is based on deep-learning and machine learning methods. The first step is to deconstruct the problem of matching fragments into a smaller problem of finding thread continuation matches in local edge areas (squares) between pairs of fragments. This phase is solved using a convolutional neural network ingesting raw images of the edge areas and producing local matching scores. The result of this stage yields very high recall but low precision. Thus, we utilize these scores in order to conclude about the matching of entire fragments pairs by establishing an elaborate voting mechanism. We enhance this voting with geometric alignment techniques from which we extract additional spatial information. Eventually, we feed all the data collected from these steps into a Random Forest classifier in order to produce a higher order classifier capable of predicting whether a pair of fragments is a match. Our algorithm was trained on a batch of fragments which was excavated from the Dead Sea caves and is dated circa the 1st century BCE. The algorithm shows excellent results on a validation set which is of a similar origin and conditions. We then tried to run the algorithm against a real-life set of fragments for which we have no prior knowledge or labeling of matches. This test batch is considered extremely challenging due to its poor condition and the small size of its fragments. Evidently, numerous researchers have tried seeking matches within this batch with very little success. Our algorithm performance on this batch was sub-optimal, returning a relatively large ratio of false positives. However, the algorithm was quite useful by eliminating 98% of the possible matches thus reducing the amount of work needed for manual inspection. Indeed, experts that reviewed the results have identified some positive matches as potentially true and referred them for further investigation.

Sign in / Sign up

Export Citation Format

Share Document