Results 11 to 20 of about 333,836 (279)
A Similarity Search Using Molecular Topological Graphs [PDF]
BioMed Research International, 2009 A molecular similarity measure has been developed using molecular topological graphs and atomic partial charges. Two kinds of topological graphs were used. One is the ordinary adjacency matrix and the other is a matrix which represents the minimum path length between two atoms of the molecule.
Fukunishi, Yoshifumi, Nakamura, Haruki
openaire +2 more sources
Metric Indexing for Graph Similarity Search [PDF]
, 2021 Finding the graphs that are most similar to a query graph in a large database is a common task with various applications. A widely-used similarity measure is the graph edit distance, which provides an intuitive notion of similarity and naturally supports graphs with vertex and edge attributes.
Franka Bause +3 more
openaire +3 more sources
Artificial Intelligence Chemistry, 2023 The proposed work uses centrality measures based heuristic method to improve the efficiency of the solution for the similarity search problem in molecular chemical graphs by effectively identifying central candidate or representative candidate nodes ...
Nirmala Parisutham
doaj +1 more source
Graph PCA Hashing for Similarity Search [PDF]
IEEE Transactions on Multimedia, 2017 This paper proposes a new hashing framework to conduct similarity search via the following steps: first, employing linear clustering methods to obtain a set of representative data points and a set of landmarks of the big dataset; second, using the landmarks to generate a probability representation for each data point.
Zhu, Xiaofeng +5 more
openaire +2 more sources
Fast Top-K Graph Similarity Search Via Representative Matrices
IEEE Access, 2018 Graph similarity search is a crucial problem in many applications, such as cheminformatics, data mining, and pattern recognition. Top-k graph similarity search aims to find the most similar k graphs to a query graph in graph databases.
Zhigang Sun, Hongwei Huo, Xiaoyang Chen
doaj +1 more source
Reactive Tabu Search for Measuring Graph Similarity [PDF]
, 2005 Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure ...
Sorlin, Sébastien, Solnon, Christine
openaire +2 more sources
A Framework Similarity Estimation of Unweighted Undirected Graphs
Современные информационные технологии и IT-образование, 2022 It is well known that the problem of algorithms for estimating the similarity of graphs rests on the complexity of their computation. Most proposed algorithms for estimating graph similarity are based on Ullman’s algorithm.
Valentin Sysoev
doaj +1 more source
Top-k Densest Subgraphs Search in Temporal Graphs [PDF]
Jisuanji kexue, 2021 The dense subgraph search problem is one of the most important graph analysis problems.It is widely used in many fields,such as the social user correlation analysis in social networks,the community discovery in the Web,etc.However,the current research ...
MU Cong-cong, WANG Yi-shu, YUAN Ye, QIAO Bai-you, MA Yu-liang
doaj +1 more source
Scaling Active Search using Linear Similarity Functions [PDF]
, 2017 Active Search has become an increasingly useful tool in information retrieval problems where the goal is to discover as many target elements as possible using only limited label queries.
Dubrawski, Artur +3 more
core +1 more source
Binary code similarity analysis based on naming function and common vector space
Scientific Reports, 2023 Binary code similarity analysis is widely used in the field of vulnerability search where source code may not be available to detect whether two binary functions are similar or not.
Bing Xia +5 more
doaj +1 more source