Cooperative Conceptual Data Reduction, application for Information Retrieval

摘要

This paper presents a cooperative conceptual algorithm for reducing a set of formal contexts by using concept lattice. Starting from binary data represented as tables in the relational database, this algorithm use formal concept analysis to reduce data size to only keep the minimal number of rows without losing knowledge. We develop an algorithm for a cooperative conceptual data reduction that do simultaneously the join and the reduction of a set of formal contexts in order to have a table of reduced size. The proposed algorithm have a better complexity than the algorithm proposed in [10]. Our algorithm can be used for information retrieval in multiple databases. Indeed, the treatment of databases which have an important size needs a considerable storage space and makes the research process sultry. So, we need to minimize the size of databases.