SwePub - search: id:"swepub:oai:DiVA.org:uu-456...

Enumeration	Reference	Cover	Find
1.	Aslani, Mohammad, et al. (author) Efficient and decision boundary aware instance selection for support vector machines 2021 In: Information Sciences. - : Elsevier. - 0020-0255 .- 1872-6291. ; 577, s. 579-598 Journal article (peer-reviewed)abstract Support vector machines (SVMs) are powerful classifiers that have high computational complexity in the training phase, which can limit their applicability to large datasets. An effective approach to address this limitation is to select a small subset of the most representative training samples such that desirable results can be obtained. In this study, a novel instance selection method called border point extraction based on locality-sensitive hashing (BPLSH) is designed. BPLSH preserves instances that are near the decision boundaries and eliminates nonessential ones. The performance of BPLSH is benchmarked against four approaches on different classification problems. The experimental results indicate that BPLSH outperforms the other methods in terms of classification accuracy, preservation rate, and execution time. The source code of BPLSH can be found in https://github.com/mohaslani/BPLSH.

Aslani, Mohammad, et al. (author)
Efficient and decision boundary aware instance selection for support vector machines
2021
In: Information Sciences. - : Elsevier. - 0020-0255 .- 1872-6291. ; 577, s. 579-598
Journal article (peer-reviewed)abstract
- Support vector machines (SVMs) are powerful classifiers that have high computational complexity in the training phase, which can limit their applicability to large datasets. An effective approach to address this limitation is to select a small subset of the most representative training samples such that desirable results can be obtained. In this study, a novel instance selection method called border point extraction based on locality-sensitive hashing (BPLSH) is designed. BPLSH preserves instances that are near the decision boundaries and eliminates nonessential ones. The performance of BPLSH is benchmarked against four approaches on different classification problems. The experimental results indicate that BPLSH outperforms the other methods in terms of classification accuracy, preservation rate, and execution time. The source code of BPLSH can be found in https://github.com/mohaslani/BPLSH.

Träfflista för sökning "id:"swepub:oai:DiVA.org:uu-456295" "