Řídké obdélníky v objektově-atributových datech.

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F06%3A00002578" target="_blank" >RIV/61989592:15310/06:00002578 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Dense rectangles in object-attribute data.

Popis výsledku v původním jazyce

We study dense rectangles in data tables with binary attributes, i.e. subtables which are ``almost full of 1's''. Dense rectangles represent interesting patterns which an be thought of as particular granules in data tables. Rectangles which are ``full of1's'' appear as natural patterns in several areas and have been widely studied in computer science and data analysis. Our paper presents a study in which we loosen the criterion of a density of a rectangle. Instead of rectangles full of 1's, we are interested in rectangles which may contain a few 0's. This way, one can capture different kinds of patterns in data. These patterns elude methods which extract only rectangles ``full of 1's''. We propose several ways to define density of a rectangle. We concentrate on column-like (and dually, row-like) conditions which say that a rectangle is dense if each of its columns contains at most a given (small) number of 0's. For this case, we develop theo

Název v anglickém jazyce

Dense rectangles in object-attribute data.

Popis výsledku anglicky

We study dense rectangles in data tables with binary attributes, i.e. subtables which are ``almost full of 1's''. Dense rectangles represent interesting patterns which an be thought of as particular granules in data tables. Rectangles which are ``full of1's'' appear as natural patterns in several areas and have been widely studied in computer science and data analysis. Our paper presents a study in which we loosen the criterion of a density of a rectangle. Instead of rectangles full of 1's, we are interested in rectangles which may contain a few 0's. This way, one can capture different kinds of patterns in data. These patterns elude methods which extract only rectangles ``full of 1's''. We propose several ways to define density of a rectangle. We concentrate on column-like (and dually, row-like) conditions which say that a rectangle is dense if each of its columns contains at most a given (small) number of 0's. For this case, we develop theo

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/1ET101370417" target="_blank" >1ET101370417: Hierarchická analýza složitých dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2006

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2006 IEEE International Conference on Granular Computing

ISBN

1-4244-0133-X

ISSN

—

e-ISSN

—

Počet stran výsledku

814

Strana od-do

586-591

Název nakladatele

IEEE Computer Society Press

Místo vydání

New York

Místo konání akce

—

Datum konání akce

—

Typ akce podle státní příslušnosti

—

Kód UT WoS článku

—