Abstract
Analysis of polyadic data (for example n-ary relations) becomes a popular task nowadays. While several data mining techniques exist for dyadic contexts, their extensions to triadic case are not obvious. In this work, we study development of ideas of Formal Concept Analysis for processing three-dimensional data, namely OAC-triclustering (from Object, Attribute, Condition). We consider several similar methods, study relations between their outputs and organize them in an ordered structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lehmann, F., Wille, R.: A triadic approach to formal concept analysis. In: Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory, ICCS 1995, Santa Cruz, California, USA, 14–18 August 1995, pp. 32–43 (1995)
Jäschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: TRIAS - an algorithm for mining iceberg tri-lattices. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), Hong Kong, China, pp. 907–911 (2006)
Ignatov, D.I., Kuznetsov, S.O., Magizov, R.A., Zhukov, L.E.: From triconcepts to triclusters. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds.) RSFDGrC 2011. LNCS (LNAI), vol. 6743, pp. 257–264. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21881-1_41
Cerf, L., Besson, J., Robardet, C., Boulicaut, J.: Closed patterns meet n-ary relations. TKDD 3(1), 3:1–3:36 (2009)
Jelassi, M.N., Yahia, S.B., Nguifo, E.M.: Towards more targeted recommendations in folksonomies. Soc. Netw. Anal. Min. 5(1), 68:1–68:18 (2015)
Ignatov, D.I., Gnatyshak, D.V., Kuznetsov, S.O., Mirkin, B.G.: Triadic formal concept analysis and triclustering: searching for optimal patterns. Mach. Learn. 101(1–3), 271–302 (2015)
Cerf, L., Besson, J., Nguyen, K., Boulicaut, J.: Closed and noise-tolerant patterns in n-ary relations. Data Min. Knowl. Discov. 26(3), 574–619 (2013)
Gnatyshak, D., Ignatov, D.I., Kuznetsov, S.O.: From triadic FCA to triclustering: experimental comparison of some triclustering algorithms. In: Proceedings of the Tenth International Conference on Concept Lattices and Their Applications, La Rochelle, France, pp. 249–260 (2013)
Ignatov, D.I., Kuznetsov, S.O., Poelmans, J.: Concept-based biclustering for internet advertisement. In: 12th IEEE International Conference on Data Mining Workshops, ICDM Workshops, Brussels, Belgium, 10 December 2012, pp. 123–130 (2012)
Acknowledgments
We would like to thank our colleagues, B. Ganter, S. Kuznetsov, B. Mirkin, R. Missaoui, L. Cerf, J.-F. Boulicaut, A. Napoli, M. Kaytoue and S. Ben Yahia for their piece of advice and useful prior communication. The paper was prepared within the framework of the Basic Research Program at HSE and supported within the framework of a subsidy by the Russian Academic Excellence Project “5–100”. The second co-author was partially supported by Russian Foundation for Basic Research. This work was also partially supported by the French LabEx project IMobS3.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Egurnov, D., Ignatov, D.I., Mephu Nguifo, E. (2017). On Containment of Triclusters Collections Generated by Quantified Box Operators. In: Kryszkiewicz, M., Appice, A., Ślęzak, D., Rybinski, H., Skowron, A., Raś, Z. (eds) Foundations of Intelligent Systems. ISMIS 2017. Lecture Notes in Computer Science(), vol 10352. Springer, Cham. https://doi.org/10.1007/978-3-319-60438-1_56
Download citation
DOI: https://doi.org/10.1007/978-3-319-60438-1_56
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60437-4
Online ISBN: 978-3-319-60438-1
eBook Packages: Computer ScienceComputer Science (R0)