Sciweavers

45 search results - page 6 / 9
» Formulating distance functions via the kernel trick
Sort
View
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
14 years 7 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
ICML
2005
IEEE
16 years 5 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
NIPS
2004
15 years 5 months ago
Mass Meta-analysis in Talairach Space
We provide a method for mass meta-analysis in a neuroinformatics database containing stereotaxic Talairach coordinates from neuroimaging experiments. Database labels are used to g...
Finn Årup Nielsen
NIPS
2008
15 years 5 months ago
An Extended Level Method for Efficient Multiple Kernel Learning
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
Zenglin Xu, Rong Jin, Irwin King, Michael R. Lyu
INFORMS
1998
100views more  INFORMS 1998»
15 years 4 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...