2826 search results - page 132 / 566 » Maximal Vector Computation in Large Data Sets |
138
click to vote
IJCNN
2008
IEEE
15 years 10 months ago
2008
IEEE
— We propose a feature selection criterion based on kernel discriminant analysis (KDA) for an -class problem, which finds eigenvectors on which the projected class data are loca...
137
click to vote
JUCS
2008
15 years 4 months ago
2008
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
166
click to vote
CAINE
2009
15 years 2 months ago
2009
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
138
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Detecting outliers in a large set of data objects is a major data mining task aiming at finding different mechanisms responsible for different groups of objects in a data set. All...
120
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...