Sciweavers

396 search results - page 35 / 80
» Probabilistic Cluster Unfoldings
Sort
View
NIPS
2007
15 years 5 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
AAAI
2008
15 years 6 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
FOSSACS
2005
Springer
15 years 9 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
DATE
2010
IEEE
154views Hardware» more  DATE 2010»
15 years 9 months ago
ERSA: Error Resilient System Architecture for probabilistic applications
There is a growing concern about the increasing vulnerability of future computing systems to errors in the underlying hardware. Traditional redundancy techniques are expensive for...
Larkhoon Leem, Hyungmin Cho, Jason Bau, Quinn A. J...
KDD
2009
ACM
232views Data Mining» more  KDD 2009»
15 years 8 months ago
Probabilistic latent semantic user segmentation for behavioral targeted advertising
Behavioral Targeting (BT), which aims to deliver the most appropriate advertisements to the most appropriate users, is attracting much attention in online advertising market. A ke...
Xiaohui Wu, Jun Yan, Ning Liu, Shuicheng Yan, Ying...