[Dmbu-l] Meeting tomorrow
behzad at bu.edu
Tue Nov 8 20:25:28 EST 2011
Here is a short abstract.
A great portion of datasets that we normally deal with, can be viewed as
0--1 tables. Datasets such as "membership of individuals in a set of
groups", "items shopped by customers", and in general any bipartite graph
can be considered as a 0--1 table. To preserve privacy of users,
data-owners usually report aggregated results on their data, such as row
and column sums (also called marginals) of these tables. Given the
marginals of a 0--1 table, we propose a method to find out the probability
of having a 1 in each cell of the table. To do so, we also discuss
different properties of 0-1 tables with fixed marginals which enables us to
effectively calculate the expected table.
--Don't be fooled by the calendar. There are only as many days in the year
as you make use of. ~Charles Richards
On Tue, Nov 8, 2011 at 7:14 PM, Evimaria Terzi <evimaria at cs.bu.edu> wrote:
> Hi all,
> tomorrow Behzad is going to talk about a polynomial algorithm for finding
> the expected 0--1 table with fixed marginals.
> See you all at 12 (noon) in our regular place -- which I think is MCS148
> "Everything should be made as simple as possible, but no simpler"
> (A. Einstein)
> Dmbu-l mailing list
> Dmbu-l at cs.bu.edu
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Dmbu-l