Sciweavers

31 search results - page 1 / 7
» A Unifying Approach to Hard and Probabilistic Clustering
Sort
View
ICCV
2005
IEEE
13 years 10 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 5 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
ICCV
2007
IEEE
14 years 6 months ago
Non-Parametric Probabilistic Image Segmentation
We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is princip...
Marco Andreetto, Lihi Zelnik-Manor, Pietro Perona
ICPR
2010
IEEE
13 years 8 months ago
Probabilistic Clustering Using the Baum-Eagon Inequality
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
Samuel Rota Bulo', Marcello Pelillo
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 5 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher