Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
From MaRDI portal
Publication:2158649
DOI10.1007/s10479-019-03505-7OpenAlexW2997438138WikidataQ114691246 ScholiaQ114691246MaRDI QIDQ2158649
Mustafa Kemal Tural, Derya Dinler, Nur Evin Ozdemirel
Publication date: 26 July 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03505-7
clusteringk-meansgraph edit distancecentroidbrain artery datatree-structured data objectsvertex/edge overlap
Cites Work
- Unnamed Item
- A study of graph spectra for comparing graphs and trees
- A principal component analysis for trees
- A constrained edit distance between unordered labeled trees
- Managing and mining graph data
- Tree-oriented analysis of brain artery structure
- Overview of object oriented data analysis
- A distance measure between attributed relational graphs for pattern recognition
This page was built for publication: Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance