Sciweavers

78 search results - page 11 / 16
» A Pitfall in Determining the Optimal Feature Subset Size
Sort
View
TMI
2010
206views more  TMI 2010»
13 years 2 months ago
Random Subspace Ensembles for fMRI Classification
Classification of brain images obtained through functional magnetic resonance imaging (fMRI) poses a serious challenge to pattern recognition and machine learning due to the extrem...
Ludmila I. Kuncheva, Juan José Rodrí...
BMCBI
2010
151views more  BMCBI 2010»
13 years 7 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
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 18 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
PAMI
1998
127views more  PAMI 1998»
13 years 7 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
APGV
2008
ACM
145views Visualization» more  APGV 2008»
13 years 9 months ago
On optimal resampling of view and illumination dependent textures
The use of illumination and view dependent textural information is one way to capture the realistic appearance of genuine materials. One example of such data is the bidirectional ...
Jirí Filip, Mike J. Chantler, Michal Haindl