Show simple item record

AuthorJAOUA, ALI
AuthorSALAH, MOHAMED
AuthorYAHIA, SADOK BEN
AuthorAL-JA'AM, JIHAD M.
Available date2024-03-20T01:55:08Z
Publication Date2012
Publication NameNew Mathematics and Natural Computation
ResourceScopus
ISSN17930057
URIhttp://dx.doi.org/10.1142/S1793005712500093
URIhttp://hdl.handle.net/10576/53264
AbstractExtracting knowledge from huge data in a reasonable time is still a challenging problem. Most real data (structured or not) can be mapped to an equivalent binary context, with or without using a scaling method, as for extracting associations between words in a text, or in machine learning systems. In this paper, our objective is to find a minimal coverage of a relation R with formal concepts. The problem is known to be NP-complete. 1 In this paper, we exploit a particular difunctional relation embedded in any binary relation R, the fringe of R, to find an approximate conceptual coverage of R. We use formal properties of fringes to find better algorithms calculating the minimal rectangular coverage of binary relation. Here, a formal context is considered as a binary relation. By exploiting some background on relational algebra in the present work, we merge some results of Belohlavek and Vichodyl, 2 using formal concept analysis with previous results obtained by Kcherif et al. 3 using relational algebra. We finally propose decomposition algorithms based on the relational formalization and fringe relations.
Languageen
PublisherWorld Scientific Publishing Co. Pte Ltd
SubjectFringe relations
knowledge extraction
minimal coverage
non enlargeable rectangles
TitleUsing fringes for minimal conceptual decomposition of binary contexts
TypeArticle
Pagination385-394
Issue Number3
Volume Number8
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record