Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A recursive method for the investigation of the linear separability of two sets

From MaRDI portal
Publication:1055203
Jump to:navigation, search

DOI10.1016/0031-3203(83)90065-1zbMath0521.68094OpenAlexW2161913044WikidataQ59305981 ScholiaQ59305981MaRDI QIDQ1055203

Adam Jozwik

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0031-3203(83)90065-1


zbMATH Keywords

pattern recognitionlearning algorithmrecursive methodlinear separabilitymultivariate data


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)


Related Items (2)

A Comparative Analysis of the Performance of Alternative Discriminant Procedures: An application to bankruptcy prediction ⋮ A theorem on strict separability of convex polyhedra and its applications in optimization




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: A recursive method for the investigation of the linear separability of two sets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1055203&oldid=13066601"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki