Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/717
Title: Tiling Databases
Authors: GEERTS, Floris 
GOETHALS, Bart 
Mielikäinen, Taneli
Issue Date: 2004
Publisher: Springer
Source: DISCOVERY SCIENCE, PROCEEDINGS. p. 278-289
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE
Series/Report no.: 3245
Abstract: In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consisting solely of ones. The interestingness of a tile is measured by the number of ones it consists of, i.e., its area. We present an efficient method for extracting all tiles with area at least a given threshold. A collection of tiles constitutes a tiling. We regard tilings that have a large area and consist of a small number of tiles as appealing summaries of the large database. We analyze the computational complexity of several algorithmic tasks related to finding such tilings. We develop an approximation algorithm for finding tilings which approximates the optimal solution within reasonable factors. We present a preliminary experimental evaluation on real data sets.
Document URI: http://hdl.handle.net/1942/717
ISBN: 3-540-23357-1
ISSN: 0302-9743
DOI: 10.1007/978-3-540-30214-8_22
ISI #: 000224608200022
Category: A1
Type: Journal Contribution
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
tiling.pdf228.69 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

172
checked on Sep 4, 2020

WEB OF SCIENCETM
Citations

127
checked on May 21, 2022

Page view(s)

16
checked on May 26, 2022

Download(s)

50
checked on May 26, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.