Distributed algorithm for computing formal concepts using map-reduce framework.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F09%3A00010311" target="_blank" >RIV/61989592:15310/09:00010311 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Distributed algorithm for computing formal concepts using map-reduce framework.

Original language description

Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorithms for computing particular patterns represented by maximal rectangles inbinary matrices were proposed but their major drawback is their computational complexity limiting their application on relatively small datasets. In this paper we introduce a scalable distributed algorithm for computing maximal rectangles that uses themap-reduce approach to data processing.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

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

Name of the periodical

Lecture Notes in Artificial Intelligence

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

37

Issue of the periodical within the volume

5772

Country of publishing house

DE - GERMANY

Number of pages

12

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—