Sciweavers

994 search results - page 69 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
TNN
2008
182views more  TNN 2008»
15 years 18 days ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
IPPS
1998
IEEE
15 years 5 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
16 years 1 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
113
Voted
CDC
2009
IEEE
159views Control Systems» more  CDC 2009»
15 years 5 months ago
A distributed machine learning framework
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
Tansu Alpcan, Christian Bauckhage
TNN
2010
176views Management» more  TNN 2010»
14 years 7 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao