Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage

Show simple item record

contributor.author Jaoua, Ali en_US
contributor.author Duwairi, Rehab en_US
contributor.author Elloumi, Samir en_US
contributor.author Ben Yahia, Sadok en_US
date.accessioned 2009-12-23T11:22:46Z en_US
date.available 2009-12-23T11:22:46Z en_US
date.issued 2009-01-01 en_US
identifier.citation Jaoua, A., Duwairi, R., Elloumi, S., & Yahia, S. (2009). Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage. In R. Berghammer, A. Jaoua, & B. Möller (Eds.), Relations and Kleene Algebra in Computer Science SE - 14 (Vol. 5827, pp. 199–210) en_US
identifier.uri http://www.springerlink.com/content/7514q2n077t57376/ en_US
identifier.uri http://hdl.handle.net/10576/10418 en_US
description.abstract Association rules extraction from a binary relation as well as reasoning and information retrieval are generally based on the initial representation of the binary relation as an adjacency matrix. This presents some inconvenience in terms of space memory and knowledge organization. A coverage of a binary relation by a minimal number of non enlargeable rectangles generally reduces memory space consumption without any loss of information. It also has the advantage of organizing objects and attributes contained in the binary relation into a conceptual representation. In this paper, we propose new algorithms to extract association rules (i.e. data mining), conclusions from initial attributes (i.e. reasoning), as well as retrieving the total objects satisfying some initial attributes, by using only the minimal coverage. Finally we propose an incremental approximate algorithm to update a binary relation organized as a set of non enlargeable rectangles. Two main operations are mostly used during the organization process: First, separation of existing rectangles when we delete some pairs. Second, join of rectangles when common properties are discovered, after addition or removal of elements from a binary context. The objective is the minimization of the number of rectangles and the maximization of their structure. The article also raises the problems of equational modeling of the minimization criteria, as well as incrementally providing equations to maintain them. en_US
language.iso en en_US
publisher Springer Berlin / Heidelberg en_US
relation.ispartof Relations and Kleene Algebra in Computer Science, 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and 6th International Conference on Applications of Kleene Algebra, AKA 2009, Doha, Qatar, November 1-5, 2009. Proceedings en
subject Formal Concept Analysis en_US
subject Minimal representation en_US
subject Galois Connection en_US
title Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage en_US
type Book Chapter en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record