CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

Max–min separability

by: Adil M. Bagirov
Optimization Methods and Software, Vol. 20, No. 2-3. (1 April 2005), pp. 277-296, doi:10.1080/10556780512331318263  Key: citeulike:4299408

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

We consider the problem of discriminating two finite point sets in the n?dimensional space by a finite number of hyperplanes generating a piecewise linear function. If the intersection of these sets is empty, then they can be strictly separated by a max?min of linear functions. An error function is introduced. This function is nonconvex piecewise linear. We discuss an algorithm for its minimization. The results of numerical experiments using some real?world datasets are presented, which show the effectiveness of the proposed approach.


kwoodsend's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.