Sciweavers

110 search results - page 9 / 22
» Finding Generalized Projected Clusters In High Dimensional S...
Sort
View
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 7 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
ICPR
2008
IEEE
14 years 11 months ago
Feature selection focused within error clusters
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
Henry S. Baird, Sui-Yu Wang
JMLR
2010
179views more  JMLR 2010»
13 years 5 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
MICCAI
2005
Springer
14 years 11 months ago
Support Vector Clustering for Brain Activation Detection
In this paper, we propose a new approach to detect activated time series in functional MRI using support vector clustering (SVC). We extract Fourier coefficients as the features of...
Defeng Wang, Lin Shi, Daniel S. Yeung, Pheng-Ann H...
ICDM
2008
IEEE
155views Data Mining» more  ICDM 2008»
14 years 4 months ago
Organic Pie Charts
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
Fabian Mörchen