All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Dense rectangles in object-attribute data.

The result's identifiers

  • Result code in 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>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Dense rectangles in object-attribute data.

  • Original language description

    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

  • Czech name

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

  • Czech description

    Prezentace výsledků studia řídkých obdélníků v objektově-atributových datech.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BD - Information theory

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/1ET101370417" target="_blank" >1ET101370417: Hierarchical analysis of complex data</a><br>

  • Continuities

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

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

    2006 IEEE International Conference on Granular Computing

  • ISBN

    1-4244-0133-X

  • ISSN

  • e-ISSN

  • Number of pages

    814

  • Pages from-to

    586-591

  • 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