Sciweavers

135 search results - page 12 / 27
» A Classification Tree Based on Discriminant Functions
Sort
View
BMCBI
2010
151views more  BMCBI 2010»
14 years 9 months ago
Classification of G-protein coupled receptors based on support vector machine with maximum relevance minimum redundancy and gene
Background: Because a priori knowledge about function of G protein-coupled receptors (GPCRs) can provide useful information to pharmaceutical research, the determination of their ...
Zhanchao Li, Xuan Zhou, Zong Dai, Xiaoyong Zou
CVPR
2006
IEEE
15 years 11 months ago
Learning Semantic Patterns with Discriminant Localized Binary Projections
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
Shuicheng Yan, Tianqiang Yuan, Xiaoou Tang
COST
2009
Springer
176views Multimedia» more  COST 2009»
15 years 2 months ago
Pathological Voice Analysis and Classification Based on Empirical Mode Decomposition
Empirical mode decomposition (EMD) is an algorithm for signal analysis recently introduced by Huang. It is a completely datadriven non-linear method for the decomposition of a sign...
Gastón Schlotthauer, María Eugenia T...
BMCBI
2008
114views more  BMCBI 2008»
14 years 9 months ago
Combining classifiers for improved classification of proteins from sequence or structure
Background: Predicting a protein's structural or functional class from its amino acid sequence or structure is a fundamental problem in computational biology. Recently, there...
Iain Melvin, Jason Weston, Christina S. Leslie, Wi...
CC
2010
Springer
282views System Software» more  CC 2010»
14 years 8 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks