Sciweavers

604 search results - page 82 / 121
» Regularization and feature selection for networked features
Sort
View
137
Voted
IJCNN
2006
IEEE
15 years 10 months ago
Adaptation of Artificial Neural Networks Avoiding Catastrophic Forgetting
— In connectionist learning, one relevant problem is “catastrophic forgetting” that may occur when a network, trained with a large set of patterns, has to learn new input pat...
Dario Albesano, Roberto Gemello, Pietro Laface, Fr...
130
Voted
VIS
2005
IEEE
165views Visualization» more  VIS 2005»
16 years 5 months ago
High Dynamic Range Volume Visualization
High resolution volumes require high precision compositing to preserve detailed structures. This is even more desirable for volumes with high dynamic range values. After the high ...
Baoquan Chen, David H. Porter, Minh X. Nguyen, Xia...
133
Voted
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
15 years 10 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
163
Voted
JMLR
2008
169views more  JMLR 2008»
15 years 3 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
BMCBI
2011
14 years 7 months ago
Dissecting protein loops with a statistical scalpel suggests a functional implication of some structural motifs
Background: One of the strategies for protein function annotation is to search particular structural motifs that are known to be shared by proteins with a given function. Results:...
Leslie Regad, Juliette Martin, Anne-Claude Camprou...