PBSM: An Efficient Top-K Subgraph Matching Algorithm

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International journal of pattern recognition and artificial intelligence

• Publication date

  2017-12-04

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1142/S0218001418500209
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Sentiment Classification Model Using Group Characteristics of Writing Style Features

  2017cited by this paper
• Improved Spectral Clustering Based on Density Combining DNA Genetic Algorithm

  2017cited by this paper
• Reservoir simulation and modeling based on artificial intelligence and data mining (AI&DM)

  2011cited by this paper
• Data and text mining SAGA : a subgraph matching tool for biological graphs

  2007cited by this paper
• An Algorithm for Subgraph Isomorphism

  1976cited by this paper

• MatCo: Computing Match Cover of Subgraph Query over Graph Data

  2025cites this paper
• Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching

  2025cites this paper
• CSM-TopK: Continuous Subgraph Matching with TopK Density Constraints

  2024influential citation
• VeNoM: Approximate Subgraph Matching with Enhanced Neighbourhood Structural Information

  2024cites this paper
• Near-optimal Top-k Pattern Mining

  2022cites this paper
• Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs

  2021influential citation
• VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality

  2021cites this paper
• Approximate Top-k Subgraph Matching Scheme Considering Data Reuse in Large Graph Stream Environments

  2020influential citation
• starring spouse starring child child type type Film ScreenWriter ? x ? y ? z ? a starring spouse starring child child type type

  2018cites this paper
• TrQuery: An Embedding-based Framework for Recommanding SPARQL Queries

  2018cites this paper