Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance

DOI10.1007/S10479-019-03505-7MaRDI QIDQ2158649zbMATH OpenOpenAlexWikidataFDO

Authors Derya Dinler, Mustafa Kemal Tural, 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

zbMATH Keywords

clusteringcentroidgraph edit distancek-meansbrain artery datatree-structured data objectsvertex/edge overlap

Mathematics Subject Classification ID

Statistics (62-XX) Multivariate analysis (62Hxx) Artificial intelligence (68Txx)

Recommendations

• Graph-Based Data Clustering with Overlaps
• Graph-based data clustering with overlaps
• Vertex-based and edge-based centroids of graphs
• scientific article; zbMATH DE number 3970751
• On the influence of node centralities on graph edit distance for graph classification
• A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
• Graph Clustering and Minimum Cut Trees
• Central clustering of attributed graphs

Cites work

• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A constrained edit distance between unordered labeled trees
• A distance measure between attributed relational graphs for pattern recognition
• A principal component analysis for trees
• A study of graph spectra for comparing graphs and trees
• Managing and mining graph data
• Overview of object oriented data analysis
• Tree-oriented analysis of brain artery structure

Cited in

(1)

• Orthogonal nonnegative matrix factorization problems for clustering: a new formulation and a competitive algorithm

This page was built for publication: Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158649)