A Tree-Matching Algorithm Based on Node Splitting and Merging
From MaRDI portal
Publication:3309098
DOI10.1109/TPAMI.1984.4767511zbMath0528.68069OpenAlexW3148589692WikidataQ52695875 ScholiaQ52695875MaRDI QIDQ3309098
No author found.
Publication date: 1984
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tpami.1984.4767511
pattern recognitiondistancepattern matchingdivide-and-conquertree matchingnode splittingnode mergingpattern correlation
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)
Related Items
Constrained tree editing, Using position extrema points to capture shape in on-line handwritten signature verification, Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading, Algorithms for approximate graph matching, A survey on tree edit distance and related problems