Advertisement

A Partitioning Based Heuristic for a Variant of the Simple Pattern Minimality Problem

  • Maurizio Boccia
  • Adriano Masone
  • Antonio Sforza
  • Claudio SterleEmail author
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 217)

Abstract

Logical Analysis of Data deals with the classification of huge data set by boolean formulas and their synthetic representation by ternary string, referred to as patterns. In this context, the simple pattern minimality problem (SPMP) arises. It consists in determining the minimum number of patterns “explaining” an initial data set of binary strings. This problem is equivalent to the minimum disjunctive normal form problem and, hence, it has been widely tackled by set covering based heuristic approaches. In this work, we describe and tackle a particular variant of the SPMP coming from an application arising in the car industry production field. The main difference with respect to SPMP tackled in literature resides in the fact that the determined patterns must be partitions and not covers of the initial binary string data set. The problem is solved by an effective and fast heuristic, tested on several large size instances coming from a real application.

Keywords

Simple pattern minimality Minimum disjunctive form Optimal diversity management 

References

  1. 1.
    Avella, P., Boccia, M., Di Martino, C., Oliviero, G., Sforza, A., Vasilev, I.: A decomposition approach for a very large scale optimal diversity management problem. 4OR: Q. J. Oper. Res. 3(1), 23–37 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Briant, O., Naddef, D.: The optimal diversity management problem. Oper. Res. 52(4), 515–526 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, San Francisco (1979)Google Scholar
  4. 4.
    Hammer, P.L.: Partially defined boolean functions and cause-effect relationships. In: Lecture at the International Conference on Multi-attrubute Decision Making Via OR-Based Expert Systems. University of Passau, Passau, Germany (1986)Google Scholar
  5. 5.
    Lancia, G., Serafini P.: A set-covering approach with column generation for parsimony haplotyping. JOC: J. Comput. 21(1), 151–166 (2009)Google Scholar
  6. 6.
    Lancia, G., Serafini P.: The complexity of some pattern problems in the logical analysis of large genomic data sets. Sets. In: Ortuño, F., Rojas, I. (eds.), Bioinformatics and Biomedical Engineering. IWBBIO 2016. Lecture Notes in Computer Science, vol. 9656. Springer, ChamGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Maurizio Boccia
    • 1
  • Adriano Masone
    • 2
  • Antonio Sforza
    • 2
  • Claudio Sterle
    • 2
    Email author
  1. 1.Department of EngineeringUniversity of SannioBeneventoItaly
  2. 2.Department of Electrical Engineering and Information TechnologyUniversity “Federico II” of NaplesNaplesItaly

Personalised recommendations