Efficient clustering on Riemannian manifolds: a kernelised random projection approach

DOI10.1016/J.PATCOG.2015.09.017zbMath1394.68407arXiv1509.05536OpenAlexW1949987985WikidataQ115341820 ScholiaQ115341820MaRDI QIDQ1669725

Arnold Wiliem, Kun Zhao, Azadeh Alavi, Brian C. Lovell

Publication date: 4 September 2018

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05536

zbMATH Keywords

clusteringRiemannian manifoldsrandom projection

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Machine vision and scene understanding (68T45)

Related Items (2)

Data-independent random projections from the feature-map of the homogeneous polynomial kernel of degree two ⋮ Quantization and clustering on Riemannian manifolds with an application to air traffic analysis

Uses Software

• UCF101

Cites Work

• Unnamed Item
• Intrinsic statistics on Riemannian manifolds: Basic tools for geometric measurements
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Riemannian geometry of Grassmann manifolds with a view on algorithmic computation
• A survey of kernel and spectral methods for clustering
• An introduction to manifolds
• An algorithmic theory of learning: Robust concepts and random projection
• A Riemannian framework for tensor computing
• Positive definite matrices and the S-divergence
• Extensions of Lipschitz mappings into a Hilbert space
• Introduction to Information Retrieval
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Expanding the Family of Grassmannian Kernels: An Embedding Perspective
• Riemannian geometry and geometric analysis

This page was built for publication: Efficient clustering on Riemannian manifolds: a kernelised random projection approach