scholarly journals Upper Bounding Graph Edit Distance Based on Rings and Machine Learning

2021 ◽  
pp. 2151008 ◽  
Author(s):  
David B. Blumenthal ◽  
Johann Gamper ◽  
Sébastien Bougleux ◽  
Luc Brun
Keyword(s):  
Machine Learning ◽  
Edit Distance ◽  
Distance Measure ◽  
Graph Matching ◽  
Machine Learning Techniques ◽  
Graph Edit Distance ◽  
Local Structures ◽  
Learning Techniques ◽  
Inexact Graph Matching ◽  
Node Labels

The graph edit distance (GED) is a flexible distance measure which is widely used for inexact graph matching. Since its exact computation is [Formula: see text]-hard, heuristics are used in practice. A popular approach is to obtain upper bounds for GED via transformations to the linear sum assignment problem with error-correction (LSAPE). Typically, local structures and distances between them are employed for carrying out this transformation, but recently also machine learning techniques have been used. In this paper, we formally define a unifying framework LSAPE-GED for transformations from GED to LSAPE. We also introduce rings, a new kind of local structures designed for graphs where most information resides in the topology rather than in the node labels. Furthermore, we propose two new ring-based heuristics RING and RING-ML, which instantiate LSAPE-GED using the traditional and the machine learning-based approach for transforming GED to LSAPE, respectively. Extensive experiments show that using rings for upper bounding GED significantly improves the state of the art on datasets where most information resides in the graphs’ topologies. This closes the gap between fast but rather inaccurate LSAPE-based heuristics and more accurate but significantly slower GED algorithms based on local search.

Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations

2015 ◽  
Vol 29 (02) ◽  
pp. 1550011 ◽  
Author(s):  
Kaspar Riesen ◽  
Andreas Fischer ◽  
Horst Bunke
Keyword(s):  
Edit Distance ◽  
Graph Matching ◽  
Upper Bounds ◽  
Data Sets ◽  
Optimal Assignment ◽  
Graph Edit Distance ◽  
Lower And Upper Bounds ◽  
Local Structures ◽  
Major Benefit ◽  
Optimal Node

The concept of graph edit distance (GED) is still one of the most flexible and powerful graph matching approaches available. Yet, exact computation of GED can be solved in exponential time complexity only. A previously introduced approximation framework reduces the computation of GED to an instance of a linear sum assignment problem. Major benefit of this reduction is that an optimal assignment of nodes (including local structures) can be computed in polynomial time. Given this assignment an approximate value of GED can be immediately derived. Yet, this approach considers local — rather than the global — structural properties of the graphs only, and thus GED derived from the optimal node assignment generally overestimates the true edit distance. Recently, it has been shown how the existing approximation framework can be exploited to additionally derive a lower bound of the exact edit distance without any additional computations. In this paper we make use of regression analysis in order to predict the exact GED using these two bounds. In an experimental evaluation on diverse graph data sets we empirically verify the gain of distance accuracy of the estimated GEDs compared to both bounds.

Using machine learning techniques to reduce data annotation time

2006 ◽  
Author(s):  
Christopher Schreiner ◽  
Kari Torkkola ◽  
Mike Gardner ◽  
Keshu Zhang
Keyword(s):  
Machine Learning ◽  
Machine Learning Techniques ◽  
Data Annotation ◽  
Learning Techniques

Using Machine Learning Algorithms on Prediction of Stock Price

2020 ◽  
Vol 12 (2) ◽  
pp. 84-99
Author(s):  
Li-Pang Chen
Keyword(s):  
Machine Learning ◽  
Stock Price ◽  
Short Term Memory ◽  
Machine Learning Algorithms ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Short Term ◽  
Learning Techniques ◽  
Historical Database ◽  
Long Short Term Memory

In this paper, we investigate analysis and prediction of the time-dependent data. We focus our attention on four different stocks are selected from Yahoo Finance historical database. To build up models and predict the future stock price, we consider three different machine learning techniques including Long Short-Term Memory (LSTM), Convolutional Neural Networks (CNN) and Support Vector Regression (SVR). By treating close price, open price, daily low, daily high, adjusted close price, and volume of trades as predictors in machine learning methods, it can be shown that the prediction accuracy is improved.

389-P: Ability for Detecting or Predicting Hypoglycemia with the Aid of Machine Learning Techniques: A Meta-analysis

Diabetes ◽  
2020 ◽  
Vol 69 (Supplement 1) ◽  
pp. 389-P
Author(s):  
SATORU KODAMA ◽  
MAYUKO H. YAMADA ◽  
YUTA YAGUCHI ◽  
MASARU KITAZAWA ◽  
MASANORI KANEKO ◽  
...  
Keyword(s):  
Machine Learning ◽  
Meta Analysis ◽  
Machine Learning Techniques ◽  
Learning Techniques

A Comparative Study of Different Machine Learning Algorithms for Disease Prediction

2017 ◽  
Vol 7 (7) ◽  
pp. 172
Author(s):  
Anantvir Singh Romana
Keyword(s):  
Machine Learning ◽  
Subsequent Treatment ◽  
Machine Learning Algorithms ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Disease Prediction ◽  
Classification Problems ◽  
Learning Techniques ◽  
Neural Network Classifiers ◽  
Diagnostic Detection

Accurate diagnostic detection of the disease in a patient is critical and may alter the subsequent treatment and increase the chances of survival rate. Machine learning techniques have been instrumental in disease detection and are currently being used in various classification problems due to their accurate prediction performance. Various techniques may provide different desired accuracies and it is therefore imperative to use the most suitable method which provides the best desired results. This research seeks to provide comparative analysis of Support Vector Machine, Naïve bayes, J48 Decision Tree and neural network classifiers breast cancer and diabetes datsets.

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.

A Literature Review Study of Software Defect Prediction using Machine Learning Techniques

2018 ◽  
Vol 6 (6) ◽  
pp. 300 ◽  
Author(s):  
Feidu Akmel ◽  
Ermiyas Birihanu ◽  
Bahir Siraj
Keyword(s):  
Machine Learning ◽  
Software Metrics ◽  
Quality Standard ◽  
Machine Learning Techniques ◽  
Software Systems ◽  
Health Care Insurance ◽  
Software Defect ◽  
Learning Techniques ◽  
Software Product

Software systems are any software product or applications that support business domains such as Manufacturing,Aviation, Health care, insurance and so on.Software quality is a means of measuring how software is designed and how well the software conforms to that design. Some of the variables that we are looking for software quality are Correctness, Product quality, Scalability, Completeness and Absence of bugs, However the quality standard that was used from one organization is different from other for this reason it is better to apply the software metrics to measure the quality of software. Attributes that we gathered from source code through software metrics can be an input for software defect predictor. Software defect are an error that are introduced by software developer and stakeholders. Finally, in this study we discovered the application of machine learning on software defect that we gathered from the previous research works.

Sign in / Sign up

Export Citation Format

Share Document