Table summarization with the help of domain lattices

Authors:
K. Selçuk Candan;Huiping Cao;Yan Qi;Maria Luisa Sapino
Affiliations:
Arizona State University, TEMPE, AZ, USA;Arizona State University, TEMPE, AZ, USA;Arizona State University, TEMPE, AZ, USA;Univ. di Torino, Torino, Italy
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 4
Cited 0

Transforming data to satisfy privacy constraints

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Top-Down Specialization for Information and Privacy Preservation

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Approximate algorithms for K-anonymity

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Supporting OLAP operations over imperfectly integrated taxonomies

Proceedings of the 2008 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Table summarization is necessary in various scenarios where it is hard to display a large table. It can benefit from knowledge about acceptable value clustering alternatives. In this paper, we formulate the problem of table summarization with the help of domain knowledge lattices. We provide the outline of a fuzzy mechanism to express alternative clustering strategies. We further sketch a novel ranked set cover based evaluation mechanism (RSC) to tackle with the inherent complexity.