Sciweavers

60 search results - page 8 / 12
» Robust Clustering based on Winner-Population Markov Chain
Sort
View
ICDM
2003
IEEE
112views Data Mining» more  ICDM 2003»
15 years 11 months ago
Privacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
Srujana Merugu, Joydeep Ghosh
DSN
2005
IEEE
15 years 11 months ago
A Wavefront Parallelisation of CTMC Solution Using MTBDDs
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equ...
Yi Zhang, David Parker, Marta Z. Kwiatkowska
ICIP
2009
IEEE
15 years 3 months ago
Selecting representative and distinctive descriptors for efficient landmark recognition
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
Sheng Gao, Joo-Hwee Lim
ISI
2008
Springer
15 years 6 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh
IPPS
2006
IEEE
15 years 12 months ago
Predicting failures of computer systems: a case study for a telecommunication system
The goal of online failure prediction is to forecast imminent failures while the system is running. This paper compares Similar Events Prediction (SEP) with two other well-known t...
Felix Salfner, M. Schieschke, Miroslaw Malek