paper-with-me

홈 › Papers

Clustering Tree-structured Data on Manifold

2015-07-20 · Na Lu, Hongyu Miao

Tree-structured data usually contain both topological and geometrical information, and are necessarily considered on manifold instead of Euclidean space for appropriate data parameterization and analysis. In this study, we propose a novel tree-structured data parameterization, called Topology-Attribute matrix (T-A matrix), so the data clustering task can be conducted on matrix manifold. We incorporate the structure constraints embedded in data into the negative matrix factorization method to determine meta-trees from the T-A matrix, and the signature vector of each single tree can then be extracted by meta-tree decomposition. The meta-tree space turns out to be a cone space, in which we explore the distance metric and implement the clustering algorithm based on the concepts like Fr\'echet mean. Finally, the T-A matrix based clustering (TAMBAC) framework is evaluated and compared using both simulated data and real retinal images to illustrate its efficiency and accuracy.

📄 PDF Abstract BibTeX arXiv:1507.05532

Code (0)

등록된 구현이 없습니다.

Tasks

AttributeClusteringTree Decomposition

Similar Papers 제목 키워드 기반

MASC: Boosting Autoregressive Image Generation with a Manifold-Aligned Semantic Clustering

2025-10-05 · Lixuan He, Shikang Zheng, Linfeng Zhang arxiv

Autoregressive (AR) models have shown great promise in image generation, yet they face a fundamental inefficiency stemming from their core component: a vast, unstructured vocabulary of visual tokens. This conventional ap…

Semantic SimilarityImage Generation

A Convex Formulation for Spectral Shrunk Clustering

2014-11-23 · Xiaojun Chang, Feiping Nie, Zhigang Ma, Yi Yang 외

Spectral clustering is a fundamental technique in the field of data mining and information processing. Most existing spectral clustering algorithms integrate dimensionality reduction into the clustering process assisted …

ClusteringDimensionality Reduction

Composing Tree Graphical Models with Persistent Homology Features for Clustering Mixed-Type Data

2017-08-01 · ICML 2017 8 · Xiuyan Ni, Novi Quadrianto, Yusu Wang, Chao Chen

Clustering data with both continuous and discrete attributes is a challenging task. Existing methods lack a principled probabilistic formulation. In this paper, we propose a clustering method based on a tree-structu…

Clustering

Cluster Trees on Manifolds

2013-07-24 · NeurIPS 2013 12 · Sivaraman Balakrishnan, Srivatsan Narayanan, Alessandro Rinaldo, Aarti Singh 외

In this paper we investigate the problem of estimating the cluster tree for a density $f$ supported on or near a smooth $d$-dimensional manifold $M$ isometrically embedded in $\mathbb{R}^D$. We analyze a modified version…

Clustering

KlusTree: Clustering Answer Trees from Keyword Search on Graphs

2017-05-27 · Mohanty Madhulika, Ramanath Maya

Graph structured data on the web is now massive as well as diverse, ranging from social networks, web graphs to knowledge-bases. Effectively querying this graph structured data is non-trivial and has led to research in a…

ClusteringNatural Language Queries