Sciweavers

406 search results - page 3 / 82
» Covering Numbers for Support Vector Machines
Sort
View
ESWA
2006
102views more  ESWA 2006»
13 years 6 months ago
A study of Taiwan's issuer credit rating systems using support vector machines
By providing credit risk information, credit rating systems benefit most participants in financial markets, including issuers, investors, market regulators and intermediaries. In ...
Wun-Hwa Chen, Jen-Ying Shih
ICML
2001
IEEE
14 years 6 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
JMLR
2006
150views more  JMLR 2006»
13 years 6 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...
BMCBI
2005
107views more  BMCBI 2005»
13 years 6 months ago
Protein subcellular localization prediction for Gram-negative bacteria using amino acid subalphabets and a combination of multip
Background: Predicting the subcellular localization of proteins is important for determining the function of proteins. Previous works focused on predicting protein localization in...
Jiren Wang, Wing-Kin Sung, Arun Krishnan, Kuo-Bin ...
JMLR
2002
89views more  JMLR 2002»
13 years 5 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor