On the public citation graph

A Probabilistic Approach to Spectral Graph Matching

0 signed · 174 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/11744047_40openalex-snapshot
Discovering Texture Regularity as a Higher-Order Correspondence Problem
inferredcites →https://doi.org/10.1007/978-3-540-88688-4_44openalex-snapshot
Feature Correspondence Via Graph Matching: Models and Global Optimization
inferredcites →https://doi.org/10.1007/bf02289573openalex-snapshot
On a Theorem Stated by Eckart and Young
inferredcites →https://doi.org/10.1016/j.patcog.2005.05.013openalex-snapshot
Correspondence matching using kernel principal components analysis and label consistency constraints
inferredcites →https://doi.org/10.1016/s0031-3203(98)80010-1openalex-snapshot
New algorithms for 2D and 3D point matching
inferredcites →https://doi.org/10.1023/b:visi.0000029664.99615.94openalex-snapshot
Distinctive Image Features from Scale-Invariant Keypoints
inferredcites →https://doi.org/10.1098/rspb.1991.0045openalex-snapshot
An algorithm for associating the features of two images
inferredcites →https://doi.org/10.1109/34.491619openalex-snapshot
A graduated assignment algorithm for graph matching
inferredcites →https://doi.org/10.1109/34.730557openalex-snapshot
Graph matching with a dual-step EM algorithm
inferredcites →https://doi.org/10.1109/34.954602openalex-snapshot
Structural graph matching using the EM algorithm and singular value decomposition
inferredcites →https://doi.org/10.1109/34.993558openalex-snapshot
Shape matching and object recognition using shape contexts
inferredcites →https://doi.org/10.1109/72.548165openalex-snapshot
A Lagrangian relaxation network for graph matching.
inferredcites →https://doi.org/10.1109/cvpr.2005.320openalex-snapshot
Shape Matching and Object Recognition Using Low Distortion Correspondences
inferredcites →https://doi.org/10.1109/cvpr.2008.4587500openalex-snapshot
Probabilistic graph and hypergraph matching
inferredcites →https://doi.org/10.1109/cvpr.2009.5206619openalex-snapshot
A tensor-based algorithm for high-order graph matching
inferredcites →https://doi.org/10.1109/iccv.2005.20openalex-snapshot
A spectral technique for correspondence problems using pairwise constraints
inferredcites →https://doi.org/10.1109/iccv.2005.8openalex-snapshot
A graph cut algorithm for generalized image deconvolution
inferredcites →https://doi.org/10.1109/tip.2010.2040448openalex-snapshot
Improving Shape Retrieval by Spectral Matching and Meta Similarity
inferredcites →https://doi.org/10.1109/tpami.1983.4767390openalex-snapshot
On the Foundations of Relaxation Labeling Processes
inferredcites →https://doi.org/10.1109/tpami.2004.60openalex-snapshot
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
inferredcites →https://doi.org/10.1109/tpami.2004.95openalex-snapshot
A POCS-based graph matching algorithm
inferredcites →https://doi.org/10.1109/tpami.2009.121openalex-snapshot
Spectral Symmetry Analysis
inferredcites →https://doi.org/10.1109/tpami.2009.28openalex-snapshot
Learning Graph Matching
inferredcites →https://doi.org/10.1109/tpami.2010.51openalex-snapshot
Efficient High Order Matching
inferredcites →https://doi.org/10.1137/0105003openalex-snapshot
Algorithms for the Assignment and Transportation Problems
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1145/1015706.1015720openalex-snapshot
"GrabCut"
inferredcites →https://doi.org/10.1145/1186562.1015720openalex-snapshot
"GrabCut"
inferredcites →https://doi.org/10.1145/3596711.3596774openalex-snapshot
GrabCut: Interactive Foreground Extraction Using Iterated Graph Cuts
inferredcites →https://doi.org/10.1162/08997660360581958openalex-snapshot
The Concave-Convex Procedure
inferredcites →https://doi.org/10.1162/089976699300016313openalex-snapshot
Convergence Properties of the Softassign Quadratic Assignment Algorithm
inferredcites →https://doi.org/10.2140/pjm.1967.21.343openalex-snapshot
Concerning nonnegative matrices and doubly stochastic matrices
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.52202/085713openalex-snapshot
Advances in Neural Information Processing Systems 19
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0044openalex-snapshot
Balanced Graph Matching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4826330openalex-extracted
Uncertainty-Aware Efficient Subgraph Isomorphism Using Graph Topology
inferred← citeshttps://doi.org/10.1002/nla.2264openalex-snapshot
An efficient algorithm for bounded spectral matching with affine constraint
inferred← citeshttps://doi.org/10.1007/978-3-030-01261-8_9openalex-snapshot
Incremental Multi-graph Matching via Diversity and Randomness Based Graph Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-01270-0_38openalex-snapshot
Adaptively Transforming Graph Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-02698-1_9openalex-snapshot
A Continuous Method for Graph Matching Based on Continuation
inferred← citeshttps://doi.org/10.1007/978-3-030-42128-1_2openalex-snapshot
Unsupervised Learning of Graph and Hypergraph Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-58607-2_15openalex-snapshot
Layered Neighborhood Expansion for Incremental Multiple Graph Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-20050-2_22openalex-snapshot
Self-supervised Learning of Visual Graph Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-46454-1_16openalex-snapshot
Ego2Top: Matching Viewers in Egocentric and Top-View Videos
inferred← citeshttps://doi.org/10.1007/978-3-319-46475-6_32openalex-snapshot
Branching Path Following for Graph Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-35236-2_27openalex-snapshot
A Message Passing Graph Match Algorithm Based on a Generative Graphical Model
inferred← citeshttps://doi.org/10.1007/s00138-017-0847-1openalex-snapshot
Multiple path exploration for graph matching
inferred← citeshttps://doi.org/10.1007/s10898-017-0583-0openalex-snapshot
A quadratic penalty method for hypergraph matching
inferred← citeshttps://doi.org/10.1007/s10898-024-01401-4openalex-snapshot
Tighter bound estimation for efficient biquadratic optimization over unit spheres
inferred← citeshttps://doi.org/10.1007/s11042-022-12503-0openalex-snapshot
Keypoint matching using salient regions and GMM in images with weak textures and repetitive patterns
inferred← citeshttps://doi.org/10.1007/s11263-014-0707-7openalex-snapshot
Graph Matching by Simplified Convex-Concave Relaxation Procedure
inferred← citeshttps://doi.org/10.1007/s11263-019-01185-1openalex-snapshot
Efficient Feature Matching via Nonnegative Orthogonal Relaxation
inferred← citeshttps://doi.org/10.1007/s11263-020-01359-2openalex-snapshot
Image Matching from Handcrafted to Deep Features: A Survey
inferred← citeshttps://doi.org/10.1007/s11263-024-02040-8openalex-snapshot
Ensemble Quadratic Assignment Network for Graph Matching
inferred← citeshttps://doi.org/10.1007/s11263-024-02291-5openalex-snapshot
Feature Matching via Graph Clustering with Local Affine Consensus
inferred← citeshttps://doi.org/10.1007/s41109-022-00464-0openalex-snapshot
Multiplex graph matching matched filters
inferred← citeshttps://doi.org/10.1016/j.cam.2024.116189openalex-snapshot
Lightning graph matching
inferred← citeshttps://doi.org/10.1016/j.inffus.2021.02.012openalex-snapshot
A review of multimodal image matching: Methods and applications
inferred← citeshttps://doi.org/10.1016/j.ins.2022.01.005openalex-snapshot
A Self-paced Learning based Transfer Model for Hypergraph Matching
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2017.04.015openalex-snapshot
Poor textural image tie point matching via graph theory
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2020.07.012openalex-snapshot
GESAC: Robust graph enhanced sample consensus for point cloud registration
inferred← citeshttps://doi.org/10.1016/j.jvcir.2018.10.012openalex-snapshot
A novel hypergraph matching algorithm based on tensor refining
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103648openalex-snapshot
RETRACTED: Design and research on automatic recognition system of sports dance movement based on computer vision and parallel computing
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103668openalex-snapshot
RETRACTED: Design and development of mobile internet control system for embedded fitness training cycling device
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.05.069openalex-snapshot
Singular value decomposition based minutiae matching method for finger vein recognition
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.12.096openalex-snapshot
Probabilistic hypergraph matching based on affinity tensor updating
inferred← citeshttps://doi.org/10.1016/j.neucom.2021.08.002openalex-snapshot
Graph matching based point correspondence with alternating direction method of multipliers
inferred← citeshttps://doi.org/10.1016/j.patcog.2016.06.022openalex-snapshot
Symmetry-aware graph matching
inferred← citeshttps://doi.org/10.1016/j.patcog.2016.12.006openalex-snapshot
Point correspondence by a new third order graph matching algorithm
inferred← citeshttps://doi.org/10.1016/j.patcog.2018.09.014openalex-snapshot
Seeded graph matching
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.06.008openalex-snapshot
A unified formulation of a class of graph matching techniques
inferred← citeshttps://doi.org/10.1016/j.patcog.2020.107418openalex-snapshot
Fast matching via ergodic markov chain for super-large graphs
inferred← citeshttps://doi.org/10.1016/j.patcog.2021.108228openalex-snapshot
Graph matching based on fast normalized cut and multiplicative update mapping
inferred← citeshttps://doi.org/10.1016/j.patcog.2022.109059openalex-snapshot
Joint Graph Learning and Matching for Semantic Feature Correspondence
inferred← citeshttps://doi.org/10.1016/j.patcog.2025.112044openalex-snapshot
Uncertainty-aware efficient subgraph isomorphism using graph topology
inferred← citeshttps://doi.org/10.1016/j.patcog.2026.113329openalex-snapshot
CSGO: Constrained-softassign gradient optimization for large graph matching
inferred← citeshttps://doi.org/10.1016/j.patcog.2026.113879openalex-snapshot
Affinity maximization learning for unsupervised deep visual graph matching
inferred← citeshttps://doi.org/10.1016/j.patrec.2014.12.011openalex-snapshot
Outlier robust point correspondence based on GNCCP
inferred← citeshttps://doi.org/10.1016/j.patrec.2018.07.005openalex-snapshot
Subgraph learning for graph matching
inferred← citeshttps://doi.org/10.1016/j.patrec.2020.12.012openalex-snapshot
Supervised learning for parameterized Koopmans–Beckmann’s graph matching
inferred← citeshttps://doi.org/10.1017/s0263574719000699openalex-snapshot
Graph-Based Registration and Blending for Undersea Image Stitching
inferred← citeshttps://doi.org/10.1038/s41598-017-04893-1openalex-snapshot
Motor dysfunction and touch-slang in user interface data
inferred← citeshttps://doi.org/10.1049/iet-ipr.2017.0168openalex-snapshot
Graph‐based spatial–spectral feature learning for hyperspectral image classification
inferred← citeshttps://doi.org/10.1109/3dv53792.2021.00129openalex-snapshot
Convex Joint Graph Matching and Clustering via Semidefinite Relaxations
inferred← citeshttps://doi.org/10.1109/access.2019.2895809openalex-snapshot
Hypergraph Matching With an Entropy Barrier Function
inferred← citeshttps://doi.org/10.1109/allerton.2015.7446983openalex-snapshot
When can two unlabeled networks be aligned under partial overlap?
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9377884openalex-snapshot
Fault-tolerant Subgraph Matching on Aligned Networks
inferred← citeshttps://doi.org/10.1109/cvpr.2014.296openalex-snapshot
Stable and Informative Spectral Signatures for Graph Matching
inferred← citeshttps://doi.org/10.1109/cvpr.2017.66openalex-snapshot
Binary Constraint Preserving Graph Matching
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00261openalex-snapshot
Distributable Consistent Multi-object Matching
inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00310openalex-snapshot
Zero-Assignment Constraint for Graph Matching With Outliers
inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00759openalex-snapshot
Learning Combinatorial Solver for Graph Matching
inferred← citeshttps://doi.org/10.1109/cvpr52733.2024.01670openalex-snapshot
Adaptive Softassign via Hadamard-Equipped Sinkhorn
inferred← citeshttps://doi.org/10.1109/cybermatics_2018.2018.00116openalex-snapshot
Hypergraph Matching via a Nonmonotone Newton Method
inferred← citeshttps://doi.org/10.1109/icc.2017.7996911openalex-snapshot
PDGM: Percolation-based directed graph matching in social networks
inferred← citeshttps://doi.org/10.1109/iccv.2013.207openalex-snapshot
Joint Optimization for Consistent Multiple Graph Matching
inferred← citeshttps://doi.org/10.1109/iccv.2015.31openalex-snapshot
A Matrix Decomposition Perspective to Multiple Graph Matching
inferred← citeshttps://doi.org/10.1109/icicse52190.2021.9404132openalex-snapshot
Probabilistic Graph Matching with Multiplicative Updating Algorithm for Correspondence between Remote Sensing Images
inferred← citeshttps://doi.org/10.1109/icip.2019.8803306openalex-snapshot
Multi-Resolution Spectral Graph Matching
inferred← citeshttps://doi.org/10.1109/icivc.2018.8492896openalex-snapshot
Generalizing Integer Projected Graph Matching Algorithm for Outlier Problem
inferred← citeshttps://doi.org/10.1109/icma.2015.7237619openalex-snapshot
Introducing authority and hubness into graph matching
inferred← citeshttps://doi.org/10.1109/icme.2015.7177409openalex-snapshot
Refining graph matching using inherent structure information
inferred← citeshttps://doi.org/10.1109/icmlc.2013.6890391openalex-snapshot
An efficient searching algorithm based on local shape complementarity of hydrogen bonds and relaxation labeling for protein-ligand docking
inferred← citeshttps://doi.org/10.1109/icnc.2011.6022320openalex-snapshot
Graph matching based a probabilistic spectral method
inferred← citeshttps://doi.org/10.1109/isbi.2015.7164169openalex-snapshot
Automatic anatomical shape correspondence and alignment using mesh features
inferred← citeshttps://doi.org/10.1109/smc.2015.376openalex-snapshot
Local Topology Preserved Tensor Models for Graph Matching
inferred← citeshttps://doi.org/10.1109/tbdata.2018.2889120openalex-snapshot
Scalable Triangle Discovery Algorithm for Large Scale-Free Network with Limited Internal Memory
inferred← citeshttps://doi.org/10.1109/tcds.2022.3188333openalex-snapshot
A Novel Biologically Inspired Structural Model for Feature Correspondence
inferred← citeshttps://doi.org/10.1109/tcsvt.2014.2339591openalex-snapshot
BB-Homography: Joint Binary Features and Bipartite Graph Matching for Homography Estimation
inferred← citeshttps://doi.org/10.1109/tcsvt.2020.3023781openalex-snapshot
Dual Calibration Mechanism Based L2, p-Norm for Graph Matching
inferred← citeshttps://doi.org/10.1109/tcsvt.2024.3457575openalex-snapshot
Contrastive Learning Network for Unsupervised Graph Matching
inferred← citeshttps://doi.org/10.1109/tcyb.2017.2697968openalex-snapshot
Adaptive Graph Matching
inferred← citeshttps://doi.org/10.1109/tcyb.2019.2936176openalex-snapshot
Elastic Net Constraint-Based Tensor Model for High-Order Graph Matching
inferred← citeshttps://doi.org/10.1109/tfuzz.2016.2586962openalex-snapshot
Graph Matching Using Hierarchical Fuzzy Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/tip.2014.2312286openalex-snapshot
A Probabilistic Graph-Based Framework for Plug-and-Play Multi-Cue Visual Tracking
inferred← citeshttps://doi.org/10.1109/tip.2014.2364919openalex-snapshot
Robust Deformable and Occluded Object Tracking With Dynamic Graph
inferred← citeshttps://doi.org/10.1109/tip.2014.2387386openalex-snapshot
Consistency-Driven Alternating Optimization for Multigraph Matching: A Unified Approach
inferred← citeshttps://doi.org/10.1109/tip.2016.2590832openalex-snapshot
Image Segmentation via Probabilistic Graph Matching
inferred← citeshttps://doi.org/10.1109/tip.2018.2849885openalex-snapshot
Context-Dependent Random Walk Graph Kernels and Tree Pattern Graph Matching Kernels With Applications to Action Recognition
inferred← citeshttps://doi.org/10.1109/tip.2019.2959722openalex-snapshot
A Grassmannian Graph Approach to Affine Invariant Feature Matching
inferred← citeshttps://doi.org/10.1109/tip.2020.2996092openalex-snapshot
Progressive Feature Matching: Incremental Graph Construction and Optimization
inferred← citeshttps://doi.org/10.1109/tkde.2019.2933837openalex-snapshot
GM-PLL: Graph Matching Based Partial Label Learning
inferred← citeshttps://doi.org/10.1109/tkde.2022.3221084openalex-snapshot
Random Deep Graph Matching
inferred← citeshttps://doi.org/10.1109/tkde.2025.3578989openalex-snapshot
Deep Probabilistic Graph Matching
inferred← citeshttps://doi.org/10.1109/tmm.2019.2951466openalex-snapshot
Feature Matching with Intra-Group Sparse Model
inferred← citeshttps://doi.org/10.1109/tnnls.2017.2712794openalex-snapshot
An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs
inferred← citeshttps://doi.org/10.1109/tnse.2021.3056329openalex-snapshot
Subgraph Matching on Multiplex Networks
inferred← citeshttps://doi.org/10.1109/tpami.2010.51openalex-snapshot
Efficient High Order Matching
inferred← citeshttps://doi.org/10.1109/tpami.2013.223openalex-snapshot
GNCCP—Graduated NonConvexityand Concavity Procedure
inferred← citeshttps://doi.org/10.1109/tpami.2015.2477832openalex-snapshot
Multi-Graph Matching via Affinity Optimization with Graduated Consistency Regularization
inferred← citeshttps://doi.org/10.1109/tpami.2015.2501802openalex-snapshot
Factorized Graph Matching
inferred← citeshttps://doi.org/10.1109/tpami.2017.2767591openalex-snapshot
Graph Matching with Adaptive and Branching Path Following
inferred← citeshttps://doi.org/10.1109/tpami.2018.2832121openalex-snapshot
Egocentric Meets Top-View
inferred← citeshttps://doi.org/10.1109/tpami.2019.2903483openalex-snapshot
A Continuation Method for Graph Matching Based Feature Correspondence
inferred← citeshttps://doi.org/10.1109/tpami.2019.2914651openalex-snapshot
Matched Filters for Noisy Induced Subgraph Detection
inferred← citeshttps://doi.org/10.1109/tpami.2019.2919308openalex-snapshot
A Functional Representation for Graph Matching
inferred← citeshttps://doi.org/10.1109/tpami.2021.3078053openalex-snapshot
Neural Graph Matching Network: Learning Lawler’s Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching
inferred← citeshttps://doi.org/10.1109/tsmc.2017.2693029openalex-snapshot
Incorporating Discrete Constraints Into Random Walk-Based Graph Matching
inferred← citeshttps://doi.org/10.1109/wacv.2016.7477730openalex-snapshot
Graph matching with low-rank regularization
inferred← citeshttps://doi.org/10.1109/wcica.2014.7052744openalex-snapshot
A probabilistic spectral graph matching algorithm for robust correspondence between lunar surface images
inferred← citeshttps://doi.org/10.1109/wcica.2016.7578355openalex-snapshot
A graph matching based key point correspondence method for lunar surface images
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2012.03034.xopenalex-snapshot
Automatically Rigging Multi‐component Characters
inferred← citeshttps://doi.org/10.1117/12.2302812openalex-snapshot
Multi scales based sparse matrix spectral clustering image segmentation
inferred← citeshttps://doi.org/10.1145/2517967openalex-snapshot
Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry
inferred← citeshttps://doi.org/10.1145/2911996.2912035openalex-snapshot
A Short Survey of Recent Advances in Graph Matching
inferred← citeshttps://doi.org/10.1145/3127876openalex-snapshot
De-anonymizing Clustered Social Networks by Percolation Graph Matching
inferred← citeshttps://doi.org/10.1145/3394486.3403053openalex-snapshot
Partial Multi-Label Learning via Probabilistic Graph Matching Mechanism
inferred← citeshttps://doi.org/10.1145/3653804.3656267openalex-snapshot
Hypergraph Matching for 3D Point Set
inferred← citeshttps://doi.org/10.1145/3763103openalex-snapshot
Heap-Snapshot Matching and Ordering using CAHPs: A Context-Augmented Heap-Path Representation for Exact and Partial Path Matching using Prefix Trees
inferred← citeshttps://doi.org/10.1155/2022/9261537openalex-snapshot
Survey of Graph Neural Networks and Applications
inferred← citeshttps://doi.org/10.1177/1729881417738100openalex-snapshot
Underwater image matching by incorporating structural constraints
inferred← citeshttps://doi.org/10.1186/s12859-016-1395-9openalex-snapshot
PROPER: global protein interaction network alignment through percolation matching
inferred← citeshttps://doi.org/10.14778/2794367.2794371openalex-snapshot
Growing a graph matching from a handful of seeds
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10457openalex-snapshot
Path Following with Adaptive Path Estimation for Graph Matching
inferred← citeshttps://doi.org/10.1609/aaai.v35i11.17179openalex-snapshot
Proxy Graph Matching with Proximal Matching Networks
inferred← citeshttps://doi.org/10.1609/aaai.v36i3.20220openalex-snapshot
Joint Deep Multi-Graph Matching and 3D Geometry Learning from Inhomogeneous 2D Image Collections
inferred← citeshttps://doi.org/10.22059/jac.2021.81628openalex-snapshot
On the Minimum of True Matches in Exact Graph Matching with Simulated Annealing
inferred← citeshttps://doi.org/10.2312/3dor/3dor12/059-062openalex-snapshot
Spectral Analysis Driven Sparse Matching of 3D Shapes
inferred← citeshttps://doi.org/10.24963/ijcai.2021/134openalex-snapshot
Adaptive Edge Attention for Graph Matching with Outliers
inferred← citeshttps://doi.org/10.3233/sw-233469openalex-snapshot
Searching for explanations of black-box classifiers in the space of semantic queries
inferred← citeshttps://doi.org/10.3390/app13116680openalex-snapshot
An Interpretable Fake News Detection Method Based on Commonsense Knowledge Graph
inferred← citeshttps://doi.org/10.3390/math10203806openalex-snapshot
Tensor Affinity Learning for Hyperorder Graph Matching
inferred← citeshttps://doi.org/10.3390/s19051191openalex-snapshot
A Review of Point Set Registration: From Pairwise Registration to Groupwise Registration
inferred← citeshttps://doi.org/10.3390/s20133712openalex-snapshot
Detecting Matching Blunders of Multi-Source Remote Sensing Images via Graph Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6388openalex-snapshot
GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure
inferred← citeshttps://doi.org/10.48550/arxiv.1411.0763openalex-snapshot
A Weighted Common Subgraph Matching Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1607.06986openalex-snapshot
Ego2Top: Matching Viewers in Egocentric and Top-view Videos
inferred← citeshttps://doi.org/10.48550/arxiv.1811.01056openalex-snapshot
SPECTRE: Seedless Network Alignment via Spectral Centralities
inferred← citeshttps://doi.org/10.48550/arxiv.1903.12527openalex-snapshot
An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing
inferred← citeshttps://doi.org/10.48550/arxiv.2001.09621openalex-snapshot
Deep Graph Matching Consensus
inferred← citeshttps://doi.org/10.48550/arxiv.2012.08950openalex-snapshot
Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching
inferred← citeshttps://doi.org/10.70675/41aa9998z81c1z43e6za7edz0d1c22c2877fopenalex-snapshot
Development of normative and pathological model of cortical folding by machine learning on graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.