Scalable computation of the extensional and intensional stability of formal concepts

References

• Ayouni, S., S. Ben Yahia, and A. Laurent. 2011. “Extracting Compact and Information Lossless Sets of Fuzzy Association Rules.” Fuzzy Sets and Systems 183 (1): 1–25. doi: 10.1016/j.fss.2011.06.019
   Web of Science ®Google Scholar
• Babin, M. A., and S. O. Kuznetsov. 2012. “Approximating concept stability.” Proceedings of the 11th International Conference on Formal Concept Analysis, (ICFCA), 7–15.
   Google Scholar
• Barbut, M., and B. Monjardet. 1970. Ordre et classification. Algèbre et Combinatoire. Hachette, Tome II.
   Google Scholar
• Bastide, Y., R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. 2000. “Mining Frequent Patterns with Counting Inference.” ACM SIGKDD Explorations Newsletter 2 (2): 66–75. doi: 10.1145/380995.381017
   Google Scholar
• Buzmakov, A., S. O. Kuznetsov, and A. Napoli. 2014. “Scalable Estimates of Concept Stability.” Proceedings of the 12th International Conference on Formal Concept Analysis, (ICFCA), 157–172.
   Google Scholar
• Buzmakov, A., S. O. Kuznetsov, and A. Napoli. 2017. “Efficient Mining of Subsample-Stable Graph Patterns.” Proceedings of the IEEE International Conference on Data Mining, ICDM, 757–762.
   Google Scholar
• Carpineto, C., and G. Romano. 2004. Concept Data Analysis: Theory and Applications. Hoboken, NJ: John Wiley & Sons, Chichester, England.
   Google Scholar
• Ganter, B., and R. Wille. 1999. Formal Concept Analysis. Heidelberg: Springer.
   Google Scholar
• Gmati, H., A. Mouakher, A. Gonzalez, and D. Camacho. 2019. “A New Algorithm for Communities Detection in Social Networks with Node Attributes.” Journal of Ambient Intelligence and Humanized Computing. accepted to appear.
   Google Scholar
• Hamrouni, T., S. Ben Yahia, and E. M. Nguifo. 2008. “Succinct Minimal Generators: Theoretical Foundations and Applications.” International Journal of Foundations of Computer Science 19 (2): 271–296. doi: 10.1142/S0129054108005681
   Web of Science ®Google Scholar
• Hamrouni, T., S. Ben Yahia, and E. M. Nguifo. 2013. “Looking for a Structural Characterization of the Sparseness Measure of (frequent closed) Itemset Contexts.” Information Sciences (222): 343–361. doi: 10.1016/j.ins.2012.08.005
   Web of Science ®Google Scholar
• Hébert, C., A. Bretto, and B. Crémilleux. 2007. “A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation.” Fundamenta Informaticae 80 (4): 415–433.
   Web of Science ®Google Scholar
• Houari, A., A. Wassim, and S. Ben Yahia. 2018a. “Nbf: An FCA-based Algorithm to Identify Negative Correlation Biclusters of DNA Microarray Data.” Proceedings of the 32nd International Conference on Advanced Information Networking and Applications (AINA), 1003–1010.
   Google Scholar
• Houari, A., A. Wassim, and S. Ben Yahia. 2018b. “A New FCA-based Method for Identifying Biclusters in Gene Expression Data.” International Journal of Machine Learning and Cybernetics 9 (11): 1879–1893. doi: 10.1007/s13042-018-0794-9
   Web of Science ®Google Scholar
• Jay, N., F. Kohler, and A. Napoli. 2008. “Analysis of social communities with iceberg and stability-based concept lattices.” Proceedings of 6th International Conference, (ICFCA). Montreal, Canada, 258–272.
   Google Scholar
• Kuznetsov, S. O. 1990. “Stability as an Estimate of the Degree of Substantiation of Hypotheses Derived on the Basis of Operational Similarity.” Nauch. Tekh. Inf. Ser. 2 (Automatic Documentation and Mathematical Linguistics) 12 (6): 21–29.
   Google Scholar
• Kuznetsov, S. O. 2001. “On Computing the Size of a Lattice and Related Decision Problems.” Order 18 (4): 313–321. doi: 10.1023/A:1013970520933
   Web of Science ®Google Scholar
• Kuznetsov, S. O. 2007. “On Stability of a Formal Concept.” Annals of Mathematics and Artificial Intelligence 49 (1–4): 101–115. doi: 10.1007/s10472-007-9053-6
   Web of Science ®Google Scholar
• Kuznetsov, S. O., and T. P. Makhalova. 2018. “On Interestingness Measures of Formal Concepts.” Information Sciences 442–443: 202–219. doi: 10.1016/j.ins.2018.02.032
   Web of Science ®Google Scholar
• Kuznetsov, S. O., S. A. Obiedkov, and C. Roth. 2007. “Reducing the Representation Complexity of Lattice-based Taxonomies.” Proceedings of the International Conference on Conceptual Structures (ICCS 2007). Vol. 4604 of Lecture Notes in Computer Science. Springer, 241–254.
   Google Scholar
• Mouakher, A., and S. Ben Yahia. 2016. “Qualitycover: Efficient Binary Relation Coverage Guided by Induced Knowledge Quality.” Information Sciences 355–356: 58–73. https://doi.org/10.1016/j.ins.2016.03.009.
   Web of Science ®Google Scholar
• Mouakher, A., and S. Ben Yahia. 2019. “On the Efficient Stability Computation for the Selection of Interesting Formal Concepts.” Information Sciences 472: 15–34. doi: 10.1016/j.ins.2018.08.056
   Web of Science ®Google Scholar
• Murakami, K., and T. Uno. 2014. “Efficient Algorithms for Dualizing Large-Scale Hypergraphs.” Discrete Applied Mathematics 170: 83–94. doi: 10.1016/j.dam.2014.01.012
   Web of Science ®Google Scholar
• Pasquier, N., Y. Bastide, R. Taouil, and L. Lakhal. 1999. “Efficient Mining of Association Rules using Closed Itemset Lattices.” Information Systems 24 (1): 25–46. doi: 10.1016/S0306-4379(99)00003-4
   Web of Science ®Google Scholar
• Roth, C., S. A. Obiedkov, and D. G. Kourie. 2006. “Towards Concise Representation for Taxonomies of Epistemic Communities.” Proceedings of the 4th International Conference on Concept Lattices and Their Applications (CLA), Hammamet, Tunisia. 240–255.
   Google Scholar
• Roth, C., S. A. Obiedkov, and D. G. Kourie. 2008. “On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis.” International Journal of Foundations of Computer Science 19 (2): 383–404. doi: 10.1142/S0129054108005735
   Web of Science ®Google Scholar
• Zhi, H.-L. 2014. “On the Calculation of Formal Concept Stability.” Journal of Applied Mathematics 2014: 1–6. doi: 10.1155/2014/917639
   Web of Science ®Google Scholar