Abstract
Information resources in today’s cyber communities over the World Wide Web are increasingly growing in size with an ever increasing pace of change. As information demand increases, more knowledge management and retrieval applications need to exhibit a degree of resilience towards information change, and must be able to handle incremental changes in a reasonable time. In this paper we are defining a new system that utilizes new conceptual methods using the notion of pseudo maximal rectangles (i.e. the union of all non enlargeable rectangles containing a pair (a,b) of a binary relation) for managing incremental information organization and structuring in a dynamic environment. The research work in hand focuses on managing changes in an information store relevant to a specific domain of knowledge attempted through addition and deletion of information. The incremental methods developed in this work should support scalability in change-prone information stores and be capable of producing updates to end users in an efficient time. The paper will also discuss some algorithmic aspects and evaluation results concerning the new methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carpineto, C., Romano, G.: A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning 24, 95–122 (1996)
Garey, R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman and Company (1979)
Godin, R.: L’utilisation de Treillis pour l’Accès aux Systèmes d’Information. PhD thesis, University of Montreal (1986)
Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on galois (concept) lattices. Computational Intelligence 11, 246–267 (1995)
Hunt, E., Martin, J., Stone, P.: Experiments in Induction. Academic Press (1966)
Jaoua, A.: Pseudo-conceptual text and web structuring. In: Proceedings of The Third Conceptual Structures Tool Interoperability Workshop (CS-TIW2008). CEUR Workshop Proceedings, vol. 352, pp. 22–32 (2008)
Jaoua, A., Duwairi, R., Elloumi, S., Yahia, S.B.: Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage. In: Berghammer, R., Jaoua, A.M., Möller, B. (eds.) RelMiCS/AKA 2009. LNCS, vol. 5827, pp. 199–210. Springer, Heidelberg (2009)
Khcherif, R., Gammoudi, M., Jaoua, A.: Using difunctional relations in information organization. Inf. Sci. Appl. 125(1-4), 153–166 (2000)
Li, K., Du, Y., Xiang, D., Chen, H., Liao, Z.: A Method for Building Concept Lattice Based on Matrix Operation. In: Huang, D.-S., Heutte, L., Loog, M. (eds.) ICIC 2007. LNCS (LNAI), vol. 4682, pp. 350–359. Springer, Heidelberg (2007)
Meghini, C., Spyratos, N.: Computing Intensions of Digital Library Collections. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 66–81. Springer, Heidelberg (2007)
Neapolitan, R., Naimipour, K.: Foundations of Algorithms using JAVA Pseudocode. Jones and Barlett (2004)
Reinke, R., Michalski, R.: Incremental learning of concept descriptions: A method and experimental results. In: Hayes, J.E., Michie, D., Richards, J. (eds.) Machine Intelligence, vol. 11, pp. 263–288. Oxford University Press, Inc., New York (1988)
Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards constructing Galois (concept) lattices. Discrete Math. 256(3), 801–829 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ismail, S., Jaoua, A. (2012). Incremental Pseudo Rectangular Organization of Information Relative to a Domain. In: Kahl, W., Griffin, T.G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2012. Lecture Notes in Computer Science, vol 7560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33314-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-33314-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33313-2
Online ISBN: 978-3-642-33314-9
eBook Packages: Computer ScienceComputer Science (R0)