Efficient Top-k Graph Similarity Search With GED Constraints
It is essential to identify similarity between graphs for various tasks in data mining, machine learning and pattern recognition. Graph edit distance (GED) is the most popular graph similarity measure thanks to its flexibility and versatility. In this paper, we study the problem of top-<inline-fo...
Main Author: | Jongik Kim |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9843962/ |
Similar Items
-
Hermite-Hadamard Type Inequalities via Exponentially (p, h)-Convex Functions
by: N. Mehreen, et al.
Published: (2020-01-01) -
A Certain Class of <italic>t</italic>-Intuitionistic Fuzzy Subgroups
by: Muhammad Gulzar, et al.
Published: (2020-01-01) -
A Multi-Finger GHz Frequency Doubler Based on Amorphous Indium Gallium Zinc Oxide Thin Film Transistors
by: Utpal Kalita, et al.
Published: (2023-01-01) -
Antimagicness of <inline-formula> <tex-math notation="LaTeX">$mC_n$ </tex-math></inline-formula>-Path and Its Disjoint Union
by: Yi Hu, et al.
Published: (2019-01-01) -
Event-Triggered <italic>L</italic><sub>2</sub>–<italic>L</italic><sub>∞</sub> Filtering for Network-Based Neutral Systems With Time-Varying Delays via T-S Fuzzy Approach
by: R. Vadivel, et al.
Published: (2021-01-01)