Abstract
To solve machine learning problems, we have developed a method to identify closed sets of common features of objects (patterns) of the training sample. The novelty of the method lies in the fact that it is implemented within the concept of constraint programming and uses a new type of table constraints—compressed tables of the \(D \)-type—for internal representation and processing of the training sample. Search reduction is achieved by applying the proposed method of branching the search tree and using partial order relations on sets of objects (features) to prune unpromising branches. The method has a computational complexity estimate that for some types of input data is better than the estimates obtained for the studied prototypes.
This is a preview of subscription content, log in via an institution to check access.
REFERENCES
Bessiere, C., De Raedt, L., Kotthoff, L., et al., Data Mining and Constraint Programming—Foundations of a Cross-Disciplinary Approach. Vol. 10101 of Lecture Notes in Computer Science, New York: Springer, 2016.
Gan, W., Lin, J., Fournier-Viger, P., et al., A survey of utility-oriented pattern mining, IEEE Trans. Knowl. Data Eng., 2021, vol. 33, no. 4, pp. 1306–1327.
Boudane, A., Jabbour, S., Sais, L., et al., Enumerating Non-Redundant Association Rules Using Satisfiability, New York: Springer, 2017.
Finn, V.K., Anshakov, O.M., and Vinogradov, D.V., Mnogoznachnye logiki i ikh primeneniya. Tom 2: Logiki v sistemakh iskusstvennogo intellekta (Multivalued Logics and Applications. Vol. 2: Logic in Artificial Intelligence Systems), Moscow: URSS, 2020.
Ganter, B. and Wille, R., Formal Concept Analysis: Mathematical Foundations, New York–Dordrecht–Heidelberg: Springer, 1999.
Kuznetsov, S.O., Machine Learning on the Basis of Formal Concept Analysis, Autom. Remote Control, 2001, vol. 62, no. 62, pp. 1543–1564.
Wolff, K., Temporal concept analysis with SIENA, in Suppl. Proc. ICFCA, Conf. Workshops (Frankfurt, Germany), Heidelberg: Springer, 2019.
Lazaar, N., Lebbah, Y., Loudni, S., et al., A Global Constraint for Closed Frequent Pattern Mining. CP, New York: Springer, 2016.
Kuznetsov, S.O. and Obiedkov, S.A., Comparing performance of algorithms for generating concept lattices, J. Exp. Theor. Artif. Intell., 2002, vol. 14, pp. 189–216.
Mackworth, A., Consistency in networks of relations, Artif. Intell., 1977, no. 8(1), pp. 99–118.
Maier, D., The Theory of Relational Databases, Rockville, MD: Comput. Sci. Press, 1983.
Zuenko, A., Representation and processing of qualitative constraints using a new type of smart tables, 4th Int. Conf. Comput. Sci. Appl. Eng. (CSAE’20) (2020), pp. 1–7.
Yap, R. and Wang, W., Generalized arc consistency algorithms for table constraints: A summary of algorithmic ideas, AAAI 2020 , 2020, pp. 13590–13597.
Ingmar, L. and Schulte, C., Making compact-table compact, CP 2018. Lect. Notes Comput. Sci., 2018, vol. 11008, pp. 210–218.
Mairy, J., Deville, Y., and Lecoutre, C., The smart table constraint. Integration of AI and OR techniques in constraint programming, CPAIOR 2015. Lect. Notes Comput. Sci., 2015, vol. 9075, pp. 271–287.
Zuenko, A., Local search in solution of constraint satisfaction problems represented by non-numerical matrices, 2nd Int. Conf. Comput. Sci. Appl. Eng. (CSAE’18) (2018), pp. 1–5.
Funding
This work was financially supported by the Russian Foundation for Basic Research, project no. 20-07-00708-a.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by V. Potapchouck
Rights and permissions
About this article
Cite this article
Zuenko, A.A. A Machine Learning Method to Reveal Closed Sets of Common Features of Objects Using Constraint Programming. Autom Remote Control 83, 1995–2005 (2022). https://doi.org/10.1134/S00051179220120116
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S00051179220120116