Replacing full rectangles by dense rectangles: concept lattices and attribute implications.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F06%3A00002581" target="_blank" >RIV/61989592:15310/06:00002581 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Replacing full rectangles by dense rectangles: concept lattices and attribute implications.
Original language description
Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace "full rectangles'' by "dense rectangles''. This way, we go from exact to approximate. We develop issues directly related to maximal dense rectangles: closure-like structures, concept lattices, attribute implications, a computationally tractable description of non-redundant bases of implications, and an algorithm for their computation. We present illustrative examples and results of experiments.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
The 2006 IEEE International Conference Information Reuse and Integration
ISBN
0-7803-9788-6
ISSN
—
e-ISSN
—
Number of pages
1500
Pages from-to
—
Publisher name
IEEE Computer Society Press
Place of publication
New York
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—