Graph embedding code prediction model integrating semantic features
نویسندگان
چکیده
منابع مشابه
Clustering based on random graph model embedding vertex features
Large datasets with interactions between objects are common to numerous scientific fields (i.e. social science, internet, biology. . . ). The interactions naturally define a graph and a common way to explore or summarize such dataset is graph clustering. Most techniques for clustering graph vertices just use the topology of connections ignoring informations in the vertices features. In this pap...
متن کاملGene Function Prediction via Discriminative Graph Embedding
Gene function has been a subject of interest but it is far from fully understood. It is known that some genes have certain functions but it is not clear whether those are all the functions they have. It is a recent trend to use different means to predict gene functions; one of them is to use computational methods on large data sets. Different types of information are used in computational metho...
متن کاملAutomatic Code Generation: Model-Code Semantic Consistency
Automatic translation or code generation of software models to code may help alleviate problems associated with manual coding effort. This paper emphasizes the importance of attaining a high level of assurance that the process of automatically translating model to code is correct. It illustrates modeling experiments performed using Statemate (iLogix) to establish a correspondence between model ...
متن کاملGraph Embedding in the Associative Mesh Model
The Associative Mesh Model is a new parallel computing model whose basic data movements consist of global operations on data distributed on arbitrary connected components of processing nodes. The graph that de nes these connected components is a dynamically de ned subgraph of the physical interconnection graph, that is a 2 dimensional mesh with diagonals. We study in this paper the usefulness o...
متن کاملSemantic Proximity Search on Heterogeneous Graph by Proximity Embedding
Many real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we have to measure the proximity on a heterogeneous graph, whose nodes are various types of objects. Most of the existing methods rely on engineeri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2020
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis190908027y