k plane clustering algorithm based on L1 norm

DOI10.16356/J.1005-2615.2019.05.014MaRDI QIDQ3306705zbMATH OpenFDO

Authors Hongxin Yang, Xubing Yang, Zhenyu Kou, Qiaolin Ye, Fuquan Zhang, Dengping Xu

Publication date 12 August 2020

zbMATH Keywords

linear programmingconvex problem\(L1\) normplane clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Linear programming (90C05)

Recommendations

• Center-based \(l_1\)-clustering method
• \(k\)-plane clustering
• An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
• L\({}_ 1\)-norm based fuzzy clustering
• A clustering method based on the \(L_ 1\)-norm

Cited in

(2)

• \(k\)-plane clustering
• Center-based \(l_1\)-clustering method

This page was built for publication: \(k\) plane clustering algorithm based on \(L1\) norm

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