"Using Graph Edit Distance for Noisy Subgraph Matching of Semantic Property ..."

Christopher L. Ebsch et al. (2020)

> Home

Details and statistics

DOI: 10.1109/BIGDATA50022.2020.9378349

access: closed

type: Conference or Workshop Paper

metadata version: 2022-08-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/bigdataconf/EbschCHDC20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bigdataconf/EbschCHDC20
Christopher L. Ebsch, Joseph A. Cottam, Natalie C. Heller, Rahul D. Deshmukh, George Chin:
Using Graph Edit Distance for Noisy Subgraph Matching of Semantic Property Graphs. IEEE BigData 2020: 2520-2525

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.