Abstract
Experimental data is often given as bit vectors, with vectors corresponding to observations, and coordinates to attributes, with a bit being true if the corresponding attribute was observed. Observations are usually grouped, e.g. into positive and negative samples. Among the essential tasks on such data, we have compression, the construction of classifiers for assigning new data, and information extraction.
Our system, MCP, approaches these tasks by propositional logic. For each group of observations, MCP constructs a (usually small) conjunctive formula that is true for the observations of the group, and false for the others. Depending on the settings, the formula consists of Horn, dual-Horn, bijunctive or general clauses. To reduce its size, only relevant subsets of the attributes are considered. The formula is a (lossy) representation of the original data and generalizes the observations, as it is usually satisfied by more bit vectors than just the observations. It thus may serve as a classifier for new data. Moreover, (dual-)Horn clauses, when read as if-then rules, make dependencies between attributes explicit. They can be regarded as an explanation for classification decisions.
Partially developed within the ACCA Project.
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
References
Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of Horn clauses. Mach. Learn. 9(2–3), 147–164 (1992)
Baker, K.A., Pixley, A.F.: Polynomial interpolation and the Chinese remainder theorem for algebraic systems. Mathematische Zeitschrift 143(2), 165–174 (1975)
Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: post’s lattice with applications to complexity theory. SIGACT News 34(4), 38–52 (2003)
Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: constraint satisfaction problems. SIGACT News 35(1), 22–35 (2004)
Boros, E., Crama, Y., Hammer, P.L., Ibaraki, T., Kogan, A., Makino, K.: Logical analysis of data: classification with justification. Ann. Oper. Res. 188(1), 33–61 (2011)
Butenhof, D.R.: Programming with POSIX threads. Addison-Wesley, Boston (1997)
Chambon, A., Boureau, T., Lardeux, F., Saubion, F.: Logical characterization of groups of data: a comparative study. Appl. Intell. 48(8), 2284–2303 (2017). https://doi.org/10.1007/s10489-017-1080-3
Chambon, A., Lardeux, F., Saubion, F., Boureau, T.: Computing sets of patterns for logical analysis of data. Technical Report, Université d’Angers (2017)
Crama, Y., Hammer, P.L.: Boolean Functions - Theory, Algorithms, and Applications, Encyclopedia of Mathematics and its Applications, vol. 142. Cambridge University Press, Cambridge (2011)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H, Freeman and Co (1979)
Gil, A., Hermann, M., Salzer, G., Zanuttini, B.: Efficient algorithms for constraint description problems over finite totally ordered domains. SIAM J. Comput. 38(3), 922–945 (2008)
Hájek, P., Holena, M., Rauch, J.: The GUHA method and its meaning for data mining. J. Comput. Syst. Sci. 76(1), 34–48 (2010)
Hébrard, J.J., Zanuttini, B.: An efficient algorithm for horn description. Inf. Proc. Lett. 88(4), 177–182 (2003)
Hájek, P., Havránek, T.: Mechanizing Hypothesis Formation. Springer, Berlin (1978) https://doi.org/10.1007/978-3-642-66943-9
Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.: MPI: The Complete Reference. MIT Press, Cambridge (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Hermann, M., Salzer, G. (2021). MCP: Capturing Big Data by Satisfiability (Tool Description). In: Li, CM., Manyà, F. (eds) Theory and Applications of Satisfiability Testing – SAT 2021. SAT 2021. Lecture Notes in Computer Science(), vol 12831. Springer, Cham. https://doi.org/10.1007/978-3-030-80223-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-80223-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-80222-6
Online ISBN: 978-3-030-80223-3
eBook Packages: Computer ScienceComputer Science (R0)