Tree-structured Data Clustering

2018-11-04
Tree-structured Data ClusteringWe consider a clustering problem in which data objects are rooted trees withunweighted or weighted edges and propose a k-means based algorithm whichrepeats assignment and update steps until convergence. The assignment steputilizes Vertex Edge Overlap to assign each data object to the most similarcentroid. In the update step, each centroid is updated by considering the dataobjects assigned to it. For the unweighted edges case, we propose a NonlinearInteger Programming (NIP) formulation to find the centroid of a given cluster andsolve the formulation to optimality with a heuristic. When edges are weighted,we also provide an NIP formulation for which we have a heuristic notguaranteeing optimality.
Citation Formats
D. Dinler, M. K. Tural, and N. E. Özdemirel, “Tree-structured Data Clustering,” 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/86531.