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

QSpace/Manakin Repository

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

Show simple item record


dc.contributor.author Jaoua, Ali
dc.contributor.author Duwairi, Rehab
dc.contributor.author Elloumi, Samir
dc.contributor.author Ben Yahia, Sadok
dc.date.accessioned 2009-12-23T11:22:46Z
dc.date.available 2009-12-23T11:22:46Z
dc.date.issued 2009-01-01
dc.identifier.citation Volume 5827/2009 en_US
dc.identifier.uri http://www.springerlink.com/content/7514q2n077t57376/
dc.identifier.uri http://hdl.handle.net/10576/10418
dc.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
dc.language.iso en en_US
dc.publisher Springer Berlin / Heidelberg en_US
dc.subject Formal Concept Analysis en_US
dc.subject Minimal representation en_US
dc.subject Galois Connection en_US
dc.title Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage en_US
dc.type Article en_US

Files in this item

Files Size Format View Description
Data Mining.pdf 66.57Kb PDF View/Open Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage

This item appears in the following Collection(s)

Show simple item record

Search QSpace


Advanced Search

Browse

My Account