Lossy compression approach to subspace clustering

DOI10.1016/j.ins.2017.12.056zbMath1440.68074OpenAlexW2778544885WikidataQ112225896 ScholiaQ112225896MaRDI QIDQ2195417

Jacek Tabor, Łukasz Struski, Przemysław Spurek

Publication date: 8 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.12.056

zbMATH Keywords

entropyminimum description length principlesubspace clusteringprojected clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy ⋮ Efficient mixture model for clustering of sparse high dimensional binary data ⋮ Attributed graph clustering with subspace stochastic block model

Uses Software

• BSDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cross-entropy clustering
• Subspace clustering of high-dimensional data: a predictive approach
• On measures of information and their characterizations
• Estimating the dimension of a model
• Distance metric learning for soft subspace clustering in composite kernel space
• Principal component analysis.
• An Efficient Method for Generating Discrete Random Variables with General Distributions
• 10.1162/153244303322753616

This page was built for publication: Lossy compression approach to subspace clustering