Sciweavers

12836 search results - page 298 / 2568
» Generalization Methods in Bioinformatics
Sort
View
ML
2002
ACM
128views Machine Learning» more  ML 2002»
15 years 4 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
PAMI
1998
127views more  PAMI 1998»
15 years 4 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
139
Voted
JMLR
2010
151views more  JMLR 2010»
14 years 11 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
CORR
2011
Springer
213views Education» more  CORR 2011»
14 years 8 months ago
Symbolic computation of weighted Moore-Penrose inverse using partitioning method
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
Milan B. Tasic, Predrag S. Stanimirovic, Marko D. ...
ICASSP
2011
IEEE
14 years 8 months ago
Subspace pursuit method for kernel-log-linear models
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
Yotaro Kubo, Simon Wiesler, Ralf Schlüter, He...