Sciweavers

2040 search results - page 359 / 408
» Approximate Expectation Maximization
Sort
View
121
Voted
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 1 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
119
Voted
MOBIHOC
2009
ACM
16 years 1 months ago
Fault tolerant target tracking in sensor networks
In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally...
Min Ding, Xiuzhen Cheng
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 1 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 1 months ago
A framework for classification and segmentation of massive audio data streams
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...
Charu C. Aggarwal
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
16 years 1 months ago
A cross-collection mixture model for comparative text mining
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
ChengXiang Zhai, Atulya Velivelli, Bei Yu