Sciweavers

779 search results - page 51 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
CVPR
2009
IEEE
16 years 11 months ago
Robust Multi-Class Transductive Learning with Graphs
Graph-based methods form a main category of semisupervised learning, offering flexibility and easy implementation in many applications. However, the performance of these methods...
Wei Liu (Columbia University), Shih-fu Chang (Colu...
CAIP
2005
Springer
133views Image Analysis» more  CAIP 2005»
15 years 10 months ago
Finding the Number of Clusters for Nonparametric Segmentation
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
Nikolaos Nasios, Adrian G. Bors
ICASSP
2011
IEEE
14 years 8 months ago
A Bernoulli-Gaussian model for gene factor analysis
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
Cecile Bazot, Nicolas Dobigeon, Jean-Yves Tournere...
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 4 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...
SSDBM
2005
IEEE
159views Database» more  SSDBM 2005»
15 years 10 months ago
Clustering Moving Objects via Medoid Clusterings
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
Hans-Peter Kriegel, Martin Pfeifle