Sciweavers

2878 search results - page 403 / 576
» Learning the Common Structure of Data
Sort
View
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
PAKDD
2009
ACM
186views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
Su Yan, Hai Wang, Dongwon Lee, C. Lee Giles
ICANN
2001
Springer
15 years 11 months ago
Independent Variable Group Analysis
Humans tend to group together related properties in order to understand complex phenomena. When modeling large problems with limited representational resources, it is important to...
Krista Lagus, Esa Alhoniemi, Harri Valpola
ICWE
2009
Springer
16 years 29 days ago
Tagging-Aware Portlets
A corporate portal supports a community of users on cohesively managing a shared set of resources. Such management should also include social tagging, i.e. the practice of collabor...
Oscar Díaz, Sandy Pérez, Crist&oacut...
PODC
2005
ACM
15 years 12 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins