1769 search results - page 54 / 354 » Prediction on Spike Data Using Kernel Algorithms |
78
Voted
NIPS
2007
14 years 11 months ago
2007
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
77
Voted
INCDM
2007
Springer
15 years 3 months ago
2007
Springer
For difficult prediction problems, practitioners often segment the data into relatively homogenous groups and then build a model for each group. This two-step procedure usually res...
73
Voted
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
AIIA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Improving accuracy in Information Retrieval tasks via semantic information is a complex problem characterized by three main aspects: the document representation model, th...
109
Voted
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...