scholarly journals Graph Extraction of Batik Image Using Region Adjacency Graph Representation

2021 ◽  
Vol 1077 (1) ◽  
pp. 012006
Author(s):  
Akmal ◽  
R Munir ◽  
J Santoso
Author(s):  
Duncan Paterson ◽  
Johnathan Corney

This paper presents a novel algorithm “Twig Match” for feature based shape retrieval systems. The algorithm exploits recent advances in computational methods for subgraph isomorphism, in order to enable databases containing many thousands of components to be searched in less than a second. A face adjacency graph representation is created from a B-Rep model, allowing model comparison to be treated as a labelled subgraph isomorphism problem. This paper describes an experimental implementation which allows interactive specification of a target “feature”. By selectively including geometric filters, on faces and relations between neighbouring faces, the algorithm can ensure that matching topology is not incorrectly identified as matching geometry, while also offering users the ability to improve the precision of both query and results. Experimental results show that Twig Match accurately retrieves matching and similar sub-parts from collections at speeds suitable for interactive applications.


1985 ◽  
Vol 19 (3) ◽  
pp. 131-139 ◽  
Author(s):  
Silvia Ansaldi ◽  
Leila De Floriani ◽  
Bianca Falcidieno

2022 ◽  
Vol 12 (4) ◽  
pp. 807-812
Author(s):  
Yan Li ◽  
Yu-Ren Zhang ◽  
Ping Zhang ◽  
Dong-Xu Li ◽  
Tian-Long Xiao

It is a critical impact on the processing of biological cells to protein–protein interactions (PPIs) in nature. Traditional PPIs predictive biological experiments consume a lot of human and material costs and time. Therefore, there is a great need to use computational methods to forecast PPIs. Most of the existing calculation methods are based on the sequence characteristics or internal structural characteristics of proteins, and most of them have the singleness of features. Therefore, we propose a novel method to predict PPIs base on multiple information fusion through graph representation learning. Specifically, firstly, the known protein sequences are calculated, and the properties of each protein are obtained by k-mer. Then, the known protein relationship pairs were constructed into an adjacency graph, and the graph representation learning method–graph convolution network was used to fuse the attributes of each protein with the graph structure information to obtain the features containing a variety of information. Finally, we put the multi-information features into the random forest classifier species for prediction and classification. Experimental results indicate that our method has high accuracy and AUC of 78.83% and 86.10%, respectively. In conclusion, our method has an excellent application prospect for predicting unknown PPIs.


2020 ◽  
Author(s):  
Artur Schweidtmann ◽  
Jan Rittig ◽  
Andrea König ◽  
Martin Grohe ◽  
Alexander Mitsos ◽  
...  

<div>Prediction of combustion-related properties of (oxygenated) hydrocarbons is an important and challenging task for which quantitative structure-property relationship (QSPR) models are frequently employed. Recently, a machine learning method, graph neural networks (GNNs), has shown promising results for the prediction of structure-property relationships. GNNs utilize a graph representation of molecules, where atoms correspond to nodes and bonds to edges containing information about the molecular structure. More specifically, GNNs learn physico-chemical properties as a function of the molecular graph in a supervised learning setup using a backpropagation algorithm. This end-to-end learning approach eliminates the need for selection of molecular descriptors or structural groups, as it learns optimal fingerprints through graph convolutions and maps the fingerprints to the physico-chemical properties by deep learning. We develop GNN models for predicting three fuel ignition quality indicators, i.e., the derived cetane number (DCN), the research octane number (RON), and the motor octane number (MON), of oxygenated and non-oxygenated hydrocarbons. In light of limited experimental data in the order of hundreds, we propose a combination of multi-task learning, transfer learning, and ensemble learning. The results show competitive performance of the proposed GNN approach compared to state-of-the-art QSPR models making it a promising field for future research. The prediction tool is available via a web front-end at www.avt.rwth-aachen.de/gnn.</div>


Author(s):  
Palash Goyal ◽  
Sachin Raja ◽  
Di Huang ◽  
Sujit Rokka Chhetri ◽  
Arquimedes Canedo ◽  
...  

2021 ◽  
Vol 54 (2) ◽  
pp. 1-36
Author(s):  
Fan Zhou ◽  
Xovee Xu ◽  
Goce Trajcevski ◽  
Kunpeng Zhang

The deluge of digital information in our daily life—from user-generated content, such as microblogs and scientific papers, to online business, such as viral marketing and advertising—offers unprecedented opportunities to explore and exploit the trajectories and structures of the evolution of information cascades. Abundant research efforts, both academic and industrial, have aimed to reach a better understanding of the mechanisms driving the spread of information and quantifying the outcome of information diffusion. This article presents a comprehensive review and categorization of information popularity prediction methods, from feature engineering and stochastic processes , through graph representation , to deep learning-based approaches . Specifically, we first formally define different types of information cascades and summarize the perspectives of existing studies. We then present a taxonomy that categorizes existing works into the aforementioned three main groups as well as the main subclasses in each group, and we systematically review cutting-edge research work. Finally, we summarize the pros and cons of existing research efforts and outline the open challenges and opportunities in this field.


Sign in / Sign up

Export Citation Format

Share Document