#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2011

2017

- This year (3)
- Last 5 years (13)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Batya Kenig, Avigdor Gal
- Inf. Syst.
- 2013

Entity resolution is the process of discovering groups of tuples that correspond to the same real-world entity. Blocking algorithms separate tuples into blocks that are likely to contain matching pairs. Tuning is a major challenge in the blocking process and in particular, high expertise is needed in contemporary blocking algorithms to construct a blocking… (More)

- Batya Kenig, Tamir Tassa
- Data Mining and Knowledge Discovery
- 2011

k-Anonymity is a privacy preserving method for limiting disclosure of private information in data mining. The process of anonymizing a database table typically involves generalizing table entries and, consequently, it incurs loss of relevant information. This motivates the search for anonymization algorithms that achieve the required level of anonymization… (More)

- Batya Kenig, Avigdor Gal
- SUM
- 2015

We present and evaluate the power of a new framework for weighted model counting and inference in graphical models, based on exploiting the topology of the junction tree representing the formula. The proposed approach uses the junction tree topology in order to craft a reduced set of partial assignments that are guaranteed to decompose the formula. We show… (More)

- Batya Kenig, Avigdor Gal, Ofer Strichman
- SUM
- 2013

We study the problem of query evaluation over tupleindependent probabilistic databases. We define a new characterization of lineage expressions called disjoint branch acyclic, and show this class to be computed in P-time. Specifically, this work extends the class of lineage expressions for which evaluation can be performed in PTIME. We achieve this… (More)

This work extends the class of lineage expressions of queries over tuple independent probabilistic databases for which evaluation can be performed in PTIME. We define a new characterization of lineage expressions, called γ-acyclic, and present a method to compute the probability of such expressions in PTIME. The method is based on the junction tree message… (More)

- Batya Kenig, Avigdor Gal
- 2011

Entity resolution is the process of discovering groups of tuples that correspond to the same real world entity. In order to avoid the prohibitively expensive comparison of all pairs of tuples, blocking algorithms separate the tuples into blocks which are highly likely to contain matching pairs. Tuning is a major challenge in the blocking process. In… (More)

- Nofar Carmeli, Batya Kenig, Benny Kimelfeld
- PODS
- 2017

We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where ``proper'' means that the tree decomposition cannot be improved by removing or splitting a bag. The algorithm can… (More)

- Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich
- PODS
- 2017

We propose a novel framework wherein probabilistic preferences can be naturally represented and analyzed in a probabilistic relational database. The framework augments the relational schema with a special type of a relation symbol---a preference symbol. A deterministic instance of this symbol holds a collection of binary relations. Abstractly, the… (More)

- Batya Kenig, Avigdor Gal
- 2015

We present a new measure, CNF-tree-width (CNFtw), for bounding the complexity of weighted model counting and related #P-hard problems. CNF-tw dominates known measures such as the dtree width and the treewidth of the CNF primal and incidence graphs. We present a novel approach that utilizes the junction-tree structure in order to decompose the formula. We… (More)

- Nofar Carmeli, Batya Kenig, Benny Kimelfeld
- AMW
- 2016

Many intractable computational problems on graphs admit tractable algorithms when applied to trees or forests. Tree decomposition extracts a tree structure from a graph by grouping nodes into bags, where each bag corresponds to a single node in of the tree. The corresponding operation on hypergraphs is that of a generalized hypertree decomposition [10],… (More)