Sciweavers

1237 search results - page 197 / 248
» Partitions and the Fermi-Dirac Distribution
Sort
View
ICPR
2006
IEEE
16 years 29 days ago
Boosted Markov Chain Monte Carlo Data Association for Multiple Target Detection and Tracking
In this paper, we present a probabilistic framework for automatic detection and tracking of objects. We address the data association problem by formulating the visual tracking as ...
Bo Wu, Gérard G. Medioni, Isaac Cohen, Qian...
ICML
2009
IEEE
16 years 20 days ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
KDD
2006
ACM
120views Data Mining» more  KDD 2006»
16 years 7 days ago
Hierarchical topic segmentation of websites
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
Ravi Kumar, Kunal Punera, Andrew Tomkins
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 7 days ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 7 days ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li