Deep learning approaches for similarity computation: A survey

P Yang, H Wang, J Yang, Z Qian… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
The requirement for appropriate ways to measure the similarity between data objects is a
common but vital task in various domains, such as data mining, machine learning and so on …

Transferable graph auto-encoders for cross-network node classification

H Wu, L Tian, Y Wu, J Zhang, MK Ng, J Long - Pattern Recognition, 2024 - Elsevier
Node classification is a popular and challenging task in graph neural networks, and existing
approaches are mainly developed for a single network. With the advances in domain …

SSIG: a visually-guided graph edit distance for floor plan similarity

CCJ van Engelenburg, S Khademi… - Proceedings of the …, 2023 - openaccess.thecvf.com
We propose a simple yet effective metric that measures structural similarity between visual
instances of architectural floor plans, without the need for learning. Qualitatively, our …

Ensembles of realistic power distribution networks

R Meyur, A Vullikanti, S Swarup, HS Mortveit… - Proceedings of the …, 2022 - pnas.org
The power grid is going through significant changes with the introduction of renewable
energy sources and the incorporation of smart grid technologies. These rapid advancements …

Structure-and function-aware substitution matrices via learnable graph matching

P Pellizzoni, C Oliver, K Borgwardt - International Conference on …, 2024 - Springer
Substitution matrices, which are crafted to quantify the functional impact of substitutions or
deletions in biomolecules, are central component of remote homology detection, functional …

Identifying repeating patterns in IEC 61499 systems using Feature-Based embeddings

M Unterdechler, AM Gutiérrez… - 2022 IEEE 27th …, 2022 - ieeexplore.ieee.org
Cyber-Physical Production Systems (CPPSs) are highly variable systems of systems
comprised of software and hardware interacting with each other and the environment. The …

Transitivity recovering decompositions: Interpretable and robust fine-grained relationships

A Chaudhuri, M Mancini, Z Akata… - Advances in Neural …, 2023 - proceedings.neurips.cc
Recent advances in fine-grained representation learning leverage local-to-global
(emergent) relationships for achieving state-of-the-art results. The relational representations …

ST-KeyS: Self-supervised transformer for keyword spotting in historical handwritten documents

SK Jemni, S Ammar, MA Souibgui, Y Kessentini… - arxiv preprint arxiv …, 2023 - arxiv.org
Keyword spotting (KWS) in historical documents is an important tool for the initial exploration
of digitized collections. Nowadays, the most efficient KWS methods are relying on machine …

Scalable program clone search through spectral analysis

T Benoit, JY Marion, S Bardin - Proceedings of the 31st ACM Joint …, 2023 - dl.acm.org
We consider the problem of program clone search, ie given a target program and a
repository of known programs (all in executable format), the goal is to find the program in the …

A Wasserstein Graph Distance Based on Distributions of Probabilistic Node Embeddings

M Scholkemper, D Kühn, G Nabbefeld… - ICASSP 2024-2024 …, 2024 - ieeexplore.ieee.org
Distance measures between graphs are important primitives for a variety of learning tasks. In
this work, we describe an unsupervised, optimal transport based approach to define a …