Sciweavers

2826 search results - page 314 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
IJCNN
2006
IEEE
16 years 21 days 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...
CSDA
2004
124views more  CSDA 2004»
15 years 6 months ago
Fast and robust discriminant analysis
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
Mia Hubert, Katrien van Driessen
CIS
2005
Springer
16 years 7 days ago
An Improved EMASK Algorithm for Privacy-Preserving Frequent Pattern Mining
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...
Congfu Xu, Jinlong Wang, Hongwei Dan, Yunhe Pan
IJAIT
2002
122views more  IJAIT 2002»
15 years 6 months ago
Comparing Keyword Extraction Techniques for WEBSOM Text Archives
The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative fre...
Arnulfo P. Azcarraga, Teddy N. Yap Jr., Tat-Seng C...
ICCV
2001
IEEE
16 years 8 months ago
Separating Appearance from Deformation
By representing images and image prototypes by linear subspaces spanned by "tangent vectors" (derivatives of an image with respect to translation, rotation, etc.), impre...
Nebojsa Jojic, Patrice Simard, Brendan J. Frey, Da...