Machine Learning
Polynomial-Time Decomposition Algorithms for Support Vector Machines
Machine Learning
SVM-KM: Speeding SVMs Learning with a priori Cluster Selection and k-Means
SBRN '00 Proceedings of the VI Brazilian Symposium on Neural Networks (SBRN'00)
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Increasing classification efficiency with multiple mirror classifiers
Expert Systems with Applications: An International Journal
Developing a semantic-enable information retrieval mechanism
Expert Systems with Applications: An International Journal
The data complexity index to construct an efficient cross-validation method
Decision Support Systems
Hi-index | 12.05 |
Support vector machines (SVM) are widely applied to various classification problems. However, most SVM need lengthy computation time when faced with a large and complicated dataset. This research develops a clustering algorithm for efficient learning. The method mainly categorizes data into clusters, and finds critical data in clusters as a substitute for the original data to reduce the computational complexity. The computational experiments presented in this paper show that the clustering algorithm significantly advances SVM learning efficiency.