Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/12089
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tian, Y | - |
dc.contributor.author | Qi, Z | - |
dc.contributor.author | Ju, X | - |
dc.contributor.author | Shi, Y | - |
dc.contributor.author | Liu, X | - |
dc.date.accessioned | 2016-02-11T13:42:39Z | - |
dc.date.available | 2014-01-01 | - |
dc.date.available | 2016-02-11T13:42:39Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | IEEE Transactions on Cybernetics, 44, (7): pp.1067 - 1079, (2014) | en_US |
dc.identifier.issn | 2168-2267 | - |
dc.identifier.uri | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6588589 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/12089 | - |
dc.description.abstract | We propose a novel nonparallel classifier, called nonparallel support vector machine (NPSVM), for binary classification. Our NPSVM that is fully different from the existing nonparallel classifiers, such as the generalized eigenvalue proximal support vector machine (GEPSVM) and the twin support vector machine (TWSVM), has several incomparable advantages: 1) two primal problems are constructed implementing the structural risk minimization principle; 2) the dual problems of these two primal problems have the same advantages as that of the standard SVMs, so that the kernel trick can be applied directly, while existing TWSVMs have to construct another two primal problems for nonlinear cases based on the approximate kernel-generated surfaces, furthermore, their nonlinear problems cannot degenerate to the linear case even the linear kernel is used; 3) the dual problems have the same elegant formulation with that of standard SVMs and can certainly be solved efficiently by sequential minimization optimization algorithm, while existing GEPSVM or TWSVMs are not suitable for large scale problems; 4) it has the inherent sparseness as standard SVMs; 5) existing TWSVMs are only the special cases of the NPSVM when the parameters of which are appropriately chosen. Experimental results on lots of datasets show the effectiveness of our method in both sparseness and classification accuracy, and therefore, confirm the above conclusion further. In some sense, our NPSVM is a new starting point of nonparallel classifiers. | en_US |
dc.format.extent | 1067 - 1079 | - |
dc.publisher | IEEE | en_US |
dc.subject | Classification | en_US |
dc.subject | Nonparallel support vector machines (NPSVM) | en_US |
dc.subject | Sparseness | en_US |
dc.subject | Structural risk minimization principle | en_US |
dc.title | Nonparallel support vector machines for pattern classification | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1109/TCYB.2013.2279167 | - |
dc.relation.isPartOf | IEEE Transactions on Cybernetics | - |
pubs.issue | 7 | - |
pubs.publication-status | Published | - |
pubs.publication-status | Published | - |
pubs.publication-status | Published | - |
pubs.volume | 44 | - |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 467.04 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.