Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis

References

• Aboud, Nour, Gabriela Arévalo, Olivier Bendavid, Jean-R\’{e}my Falleri, Nicolas Haderer, Marianne Huchard, Chouki Tibermacine, Christelle Urtado, and Sylvain Vauttier. Forthcoming. “Building Hierarchical Typed Component Directories using Formal Concept Analysis". Journal of Object Technologies.
   Google Scholar
• Adaricheva, Kira V., James B. Nation, and Robert Rand. 2011. “Ordered Direct Implicational Basis of a Finite Closure System.” CoRR abs/1110.5805. http://arxiv.org/abs/1110.5805.
   Google Scholar
• Agrawal,, Rakesh, Tomasz Imieliński, and Arun Swami. 1993. “Mining Association Rules between Sets of Items in Large Databases.” SIGMOD Rec 22 (2): 207–216. http://doi.acm.org/10.1145/170036.170072.
   Google Scholar
• Al-Msie’deen, Ra’Fat, Abdelhak Djamel Seriai, Marianne Huchard, Christelle Urtado, and Sylvain Vauttier. 2013. “Mining Features from the Object-oriented Source Code of Software Variants by Combining Lexical and Structural Similarity.” In IRI, 586–593. San Francisco, CA: IEEE.
   Google Scholar
• Arévalo, Gabriela, Jean-R\’{e}my Falleri, Marianne Huchard, and Cl\’{e}mentine Nebut. 2006. “Building Abstractions in Class Models: Formal Concept Analysis in a Model-driven Approach.” In MoDELS 2006, 513–527. Genova.
   Google Scholar
• Azmeh, Zeina, Maha Driss, Fady Hamoui, Marianne Huchard, Naouel Moha, and Chouki Tibermacine. 2011. “Selection of Composable Web Services Driven by User Requirements.” In ICWS 2011, 395–402. Washington, DC.
   Google Scholar
• Azmeh, Zeina, Marianne Huchard, Amedeo Napoli, Mohamed Rouane-Hac\‘{e}ne, and Petko Valtchev. 2011. “Querying Relational Concept Lattices.” In CLA’11, 377–392. Nancy.
   Google Scholar
• Baader, Franz, and Felix Distel. 2008. “A Finite Basis for the Set of ℒ-implications Holding in a Finite Model.” In Formal Concept Analysis, 6th International Conference ICFCA, Vol. 4933 of LNCS, 46–61. Montréal, QC.
   Google Scholar
• Bendaoud, Rokia, Amedeo Napoli, and Yannick Toussaint. 2008. “Formal Concept Analysis: A Unified Framework for Building and Refining Ontologies.” In Vol. 5268 of LNCS, 156–171 Acitrezza.
   Google Scholar
• Berry, Anne, Marianne Huchard, Amedeo Napoli, and Alain Sigayret. 2012. “Hermes: An Efficient Algorithm for Building Galois Sub-hierarchies.” In CLA 2012, 21–32. Malaga.
   Google Scholar
• Bertaux, A., F. Le Ber, A. Braud, and M. Tr\’{e}moli\‘{e}res. 2009. “Identifying Ecological Traits: A Concrete FCA-based Approach.” In ICFCA 2009, Vol. 5548 of LNAI, 224–236. Darmstadt: Springer-Verlag.
   Google Scholar
• Bertet, Karell, Stéphanie Guillas, and Jean Marc Ogier. 2007. “Extensions of Bordat’s Algorithm for Attributes.” In Proceedings of the Fifth International Conference on Concept Lattices and Their Applications, CLA 2007, Montpellier, October 24--26. http://ceur-ws.org/Vol-331/Bertet.pdf.
   Google Scholar
• Bertet, K., and B. Monjardet. 2010. “The Multiple Facets of the Canonical Direct Unit Implicational Basis.” Theoretical Computer Science 411 (22--24): 2155–2166. http://www.sciencedirect.com/science/article/pii/S0304397510000034.
   Google Scholar
• Clark, Peter, and Robin Boswell. 1991. “Rule Induction with CN2: Some Recent Improvements.” In EWSL, 151–163. Porto.
   Google Scholar
• Dao, Michel, Marianne Huchard, Mohamed Rouane-Hacène, Cyril Roume, and Petko Valtchev. 2004. “Improving Generalization Level in UML Models Iterative Cross Generalization in Practice.” In Proceedings of Conceptual Structures at Work: 12th International Conference on Conceptual Structures, ICCS 2004, 346–360. Huntsville, AL, July 19--23. doi:10.1007/978-3-540-27769-9.
   Google Scholar
• Doledec, S., D. Chessel, C. J. F. ter Braak, and S. Champely. 1996. “Matching Species Traits to Environmental Variables: A New Three-table Ordination Method.” Environmental and Ecological Statistics 3: 143–166.
   Web of Science ®Google Scholar
• Dolques, Xavier, Marianne Huchard, Clémentine Nebut, and Philippe Reitz. 2012. “Fixing Generalization Defects in UML Use Case Diagrams.” Fundamenta Informaticae 115 (4): 327–356.
   Web of Science ®Google Scholar
• Dolques, Xavier, Florence Le Ber, and Marianne Huchard. 2013. “AOC-posets: A Scalable Alternative to Concept Lattices for Relational Concept Analysis.” In CLA 2013: 10th International Conference on Concept Lattices and Their Applications, 129–140. La Rochelle, October. http://ceur-ws.org/Vol-1062/.
   Google Scholar
• Dolques, Xavier, Florence Le Ber, Marianne Huchard, and Clémentine Nebut. Forthcoming. Relational Concept Analysis for Relational Data Exploration,
   Google Scholar
• Dolques, Xavier, Kartick Chandra Mondal, Agnès Braud, Florence Le Ber, and Marianne Huchard. 2014. “RCA as a Data Transforming Method: A Comparison with Propositionalisation." In ICFCA 2014: International Conference on Formal Concept Analysis, Vol. 8478 of LNCS, 112–127. Cluj-Napoca. June
   Google Scholar
• Ferré, Sébastien, Olivier Ridoux, and Benjamin Sigonneau. 2005. “Arbitrary Relations in Formal Concept Analysis and Logical Information Systems.” In ICCS’05, Vol. 3596 of LNCS, 166–180. Springer.
   Google Scholar
• Ganter, B., and R. Wille. 1999. Formal Concept Analysis: Mathematical Foundations. Berlin: Springer Verlag.
   Google Scholar
• Godin, R., and H. Mili. 1993. “Building and Maintaining Analysis-level Class Hierarchies using Galois Lattices.” In OOPSLA’93, Vol. 28, 394--410. Washington, DC.
   Google Scholar
• Godin, R., H. Mili, G. W. Mineau, R. Missaoui, A. Arfi, and T.-T. Chau. 1998. “Design of Class Hierarchies based on Concept (Galois) Lattices.” Theory and Application of Object Systems 4 (2): 117–134.
   Google Scholar
• Grac, C., F.Le Ber, A. Braud, and M. Trémolières. 2011. “Programme de recherche-développement Indices -- Rapport scienfique final. Contrat pluriannuel 1463 de l’Agence de l’Eau Rhin-Meuse.” In LHYGES -- LSIIT -- ONEMA -- CEMAGREF.
   Google Scholar
• Hitzler, P. 2004. “Default Reasoning over Domains and Concept Hierarchies.” In Proceedings of KI 2004, Vol. 3238 of LNCS, 351–365. Ulm: Springer Verlag.
   Google Scholar
• Huchard, M., H. Dicky, and H. Leblanc. 2000. “Galois Lattice as a Framework to Specify Algorithms Building Class Hierarchies.” Theoretical Informatics and Applications 34: 521–548.
   Web of Science ®Google Scholar
• Huchard, Marianne, Mohamed Rouane-Hacène, Cyril Roume, and Petko Valtchev. 2007. “Relational Concept Discovery in Structured Datasets.” Annals of Mathematics and Artificial Intelligence 49 (1–4): 39–76.
   Web of Science ®Google Scholar
• K\"{o}tters, Jens. 2013. “Concept Lattices of a Relational Structure.” In 20th International Conference on Conceptual Structures, ICCS 2013, Vol. 7735 of LNCS, 301–310. Mumbai.
   Google Scholar
• Krmelova, Markta, and Martin Trnecka. 2013. “Boolean Factor Analysis of Multi-relational Data.” In 10th International Conference on Concept Lattices and Their Applications, CLA 2013, 187–198. La Rochelle: CEUR Workshop Proceedings 1062.
   Google Scholar
• Krmelova, Markta, and Martin Trnecka. 2014. “An Algorithm for the Multi-relational Boolean Factor Analysis Based on Essential Elements.” In Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, CLA 2014, 107–118. Kosice: CEUR Workshop Proceedings 1252.
   Google Scholar
• Lachiche, Nicolas. 2010. “Propositionalization.” In Encyclopedia of Machine Learning, edited by Claude Sammut and Geoffrey I. Webb, 812–817. Berlin: Springer.
   Google Scholar
• Moha, Naouel, Mohamed Rouane-Hacène, Petko Valtchev, and Yann-Gaël Guéhéneuc. 2008. “Refactorings of Design Defects Using Relational Concept Analysis.” In ICFCA, Vol. 2008, 289–304. Montreal, QC.
   Google Scholar
• Muggleton, S., and L. de Raedt. 1994. “Inductive Logic Programming: Theory and Methods.” The Journal of Logic Programming 19 (20): 629–679.
   Google Scholar
• Osswald, Rainer, and Wiebke Petersen. 2002. “Induction of Classifications from Linguistic Data.” In Proceedings of ECAI’02 Workshop, Lyon, France, July.
   Google Scholar
• Osswald, Rainer, and Wiebke Petersen. 2003. "A Logical Approach to Data-driven Classification". In Proceedings of the 26th Annual German Conference on Advances in Artificial Intelligence, KI 2003, Vol. 2821 of LNCS, 267–281. Hamburg: Springer.
   Google Scholar
• Petersen, W. 2001. "A Set-theoretical Approach for the Induction of Inheritance Hierarchies.” In ENTCS, Vol. 51, July. Helsinki: Elsevier.
   Google Scholar
• Prediger, Susanne, and Rudolf Wille. 1999. “The Lattice of Concept Graphs of a Relationally Scaled Context.” In ICCS’99, 401–414. Blacksburg, VA: Springer.
   Google Scholar
• Quinlan, J. R.. 1986. “Induction of Decision Trees.” Machine Learning: 81–106.
   Google Scholar
• Rouane-Hacène, Mohamed, Marianne Huchard, Amedeo Napoli, and Petko Valtchev. 2013a. “Relational Concept Analysis: Mining Concept Lattices From Multi-relational Data.” Annals of Mathematics and Artificial Intelligence 67 (1): 81–108.
   Web of Science ®Google Scholar
• Rouane-Hacène, Mohamed, Marianne Huchard, Amedeo Napoli, and Petko Valtchev. 2013b. “Soundness and Completeness of Relational Concept Analysis.” In ICFCA, Vol. 7880 of Lecture Notes in Computer Science, edited by Peggy Cellier, Felix Distel, and Bernhard Ganter, 228–243. Dresden: Springer.
   Google Scholar
• Rouane-Hacène, Mohamed, Petko Valtchev, and Roger Nkambou. 2011. “Supporting Ontology Design through Large-Scale FCA-Based Ontology Restructuring.” In ICCS 2011: 257–269. Derby.
   Google Scholar
• Ryssel, Uwe, Joern Ploennigs, and Klaus Kabitzsch. 2011. “Extraction of Feature Models from Formal Contexts.” In SPLC Workshops, edited by Ina Schaefer, Isabel John, and Klaus Schmid. 4. Munich: ACM.
   Google Scholar
• Saada, Hajer, Xavier Dolques, Marianne Huchard, Clémentine Nebut, and Houari A. Sahraoui. 2012. “Generation of Operational Transformation Rules from Examples of Model Transformations.” In MoDELS 2012: 546–561. Innsbruck.
   Google Scholar
• Shi, Lian, Yannick Toussaint, Amedeo Napoli, and Alexandre Blansché. 2011. “Mining for Reengineering: An Application to Semantic Wikis Using Formal and Relational Concept Analysis.” In ESWC’11, edited by Grigoris Antoniou, Marko Grobelnik, Elena Simperl, Bijan Parsia, Dimitris Plexousakis, Pieter De Leenheer, and Jeff Pan Heraklion, Vol. 6644 of LNCS, 421–435. Crete: Springer.
   Google Scholar
• Stumme, Gerd, Rafik Taouil, Yves Bastide, Nicolas Pasquier, and Lotfi Lakhal. 2002. “Computing Iceberg Concept Lattices with TITANIC.” Data and Knowledge Engineering 42 (2): 189–222. doi:10.1016/S0169-023X(02)00057-5.
   Web of Science ®Google Scholar
• van der Merwe, Dean, Sergei A. Obiedkov, and Derrick G. Kourie. 2004. “AddIntent: A New Incremental Algorithm for Constructing Concept Lattices.” In ICFCA, Vol. 2961, Lecture Notes in Computer Science, edited by Peter W. Eklund, 372–385. Sydney: Springer.
   Google Scholar
• Wille, Rudolf. 1997. “Conceptual Graphs and Formal Concept Analysis.” In 5th International Conference on Conceptual Structures, ICCS’97, Vol. 1257 of LNCS, 290–303. Seattle, WA.
   Google Scholar
• Wolff, Karl Erich. 2009. “Relational Scaling in Relational Semantic Systems.” In 17th International Conference on Conceptual Structures, ICCS 2009, Vol. 5662 of LNCS, 307–320. Moscow.
   Google Scholar