Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage
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.
KeywordsFormal Concept Analysis Minimal representation Galois Connection
Unable to display preview. Download preview PDF.
- 1.Winter, M.: Decomposing relations into orderings. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol. 3051. Springer, Heidelberg (2004)Google Scholar
- 4.Belohlavek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. Journal of Computer and System Sciences (to appear, 2009)Google Scholar
- 5.Kcherif, R., Gammoudi, M., Jaoua, A.: Using difunctional relations in information organization. Information Science, 153–166 (2000)Google Scholar
- 6.Jaoua, A., Elloumi, S.: Galois connection, formal concepts and galois lattice in real relations: Application in a real classifier. The Journal of Systems and Software, 149–163 (2002)Google Scholar
- 7.Riguet, J.: Relations binaires, fermetures et correspondances de Galois. Bulletin de la société mathématique de France, 114–155 (1944)Google Scholar
- 8.Riguet, J.: Deductibility and exactness. In: Proceedings of the Second International Seminar on Relational Methods in Computer Sciences, PARATY, Brazil (1995)Google Scholar
- 9.Schmidt, G.: About fringes. Private correspondance with Pr. A. Jaoua (2009)Google Scholar
- 10.Schmidt, G., Stroehlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientits. Springer, Heidelberg (1993)Google Scholar
- 11.Carpineto, C., Romano, G.: Exploiting the Potential of Concept Lattices for Information Retrieval with CREDO. Journal of Universal Computing, 985–1013 (2004)Google Scholar
- 12.Godin, R., Gecsei, J., Pichet, C.: Design of browsing interface for information retrieval. In: Proceedings of the International Conference SIGIR 1989, pp. 32–39 (1989)Google Scholar
- 13.Hasnah, A., Jaoua, A., Jaam, J.: Computer Aided Intelligent Recognition Techniques and Applications, Conceptual Data Classification: Application for Knowledge Extraction. Wiley, Chichester (2005)Google Scholar
- 14.Belkhiter, N., Bourhfir, C., Gammoudi, M., Jaoua, A., Thanh, N.L., Reguig, M.: Décomposition rectangulaire optimale d’une relation binaire: Application aux bases de données documentaires. Information Systems and Operational Research Journal, 33–54 (1994)Google Scholar