The geometry of linear separability in data sets

DOI10.1016/J.LAA.2005.08.014MaRDI QIDQ2497241zbMATH OpenOpenAlexFDO

Authors Adi Ben-Israel, Yuri Levin

Publication date 4 August 2006

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2005.08.014

zbMATH Keywords

classificationcluster analysislinear discriminant analysisseparability of datasetsTikhonov regularization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• A linear separability criterion for sets of Euclidean space
• Investigating the Geometry of a p-Dimensional Data Set
• Geometry of Data
• The geometric field of linearity of linear sets
• Separating sets in interpolation and geometry
• scientific article; zbMATH DE number 1984357
• scientific article; zbMATH DE number 1200176

Cites work

• A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
• An estimation algorithm using distance clustering of data.
• scientific article; zbMATH DE number 3673370 (Why is no real title available?)
• scientific article; zbMATH DE number 47593 (Why is no real title available?)
• scientific article; zbMATH DE number 706377 (Why is no real title available?)

Cited in

(4)

• Monotonicity of Linear Separability Under Translation
• A linear separability criterion for sets of Euclidean space
• scientific article; zbMATH DE number 1934577 (Why is no real title available?)
• scientific article; zbMATH DE number 1928680 (Why is no real title available?)

Describes a project that uses

Uses Software

• UCI

This page was built for publication: The geometry of linear separability in data sets

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