Using difunctional relations in information organization

An algorithm for information organization based on rectangular decomposition of a binary relation is introduced. Rectangular decomposition allows a classification of databases presented as a binary relation. This problem, being NP-Complete problem, has been the subject of several previous works. How...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 2000, Vol.125 (1), p.153-166
Main Authors: Khchérif, Raoudha, Gammoudi, Mohamed Mohsen, Jaoua, Ali
Format: Article
Language:English
Subjects:
Difunctional relation
Isolated point
Minimal coverage
Rectangle
Rectangular decomposition
Riguet difunctional
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An algorithm for information organization based on rectangular decomposition of a binary relation is introduced. Rectangular decomposition allows a classification of databases presented as a binary relation. This problem, being NP-Complete problem, has been the subject of several previous works. However, we found out necessary the proposition of an approximate polynomial algorithm and to give an improvement to the latest methods. Hence, this work represents a rectangular decomposition approach based on Riguet difunctional relation. The computing of this difunctional results in a set of isolated points allowing us to determine the minimal set of rectangles covering given binary relation.
ISSN:0020-0255
1872-6291
DOI:10.1016/S0020-0255(99)00150-4