Sciweavers

4886 search results - page 587 / 978
» Approximate Data Exchange
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr
ICML
2004
IEEE
16 years 7 months ago
A multiplicative up-propagation algorithm
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 7 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 7 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
DCC
2010
IEEE
16 years 1 months ago
Lossless Compression Based on the Sequence Memoizer
In this work we describe a sequence compression method based on combining a Bayesian nonparametric sequence model with entropy encoding. The model, a hierarchy of Pitman-Yor proce...
Jan Gasthaus, Frank Wood, Yee Whye Teh