Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

EmbAssi: embedding assignment costs for similarity search in large graph databases

From MaRDI portal
Publication:2097444
Jump to:navigation, search

DOI10.1007/s10618-022-00850-3OpenAlexW3215543515WikidataQ114859250 ScholiaQ114859250MaRDI QIDQ2097444

Erich Schubert, Franka Bause, Nils M. Kriege

Publication date: 14 November 2022

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.07761


zbMATH Keywords

indexgraph edit distancesimilarity search


Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)



Uses Software

  • ChEMBL
  • ELKI
  • TUDataset


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Local outlier detection reconsidered: a generalized view on locality with applications to spatial, video, and network outlier detection
  • Algorithms for the Assignment and Transportation Problems
  • Approximation of Graph Edit Distance in Quadratic Time




This page was built for publication: EmbAssi: embedding assignment costs for similarity search in large graph databases

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2097444&oldid=14585222"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 21:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki