Update paper

*.lnk

.archive

paper/media/

paper/paper.jats

paper/paper.pdf

 No newline at end of file

#!/bin/bash

docker run --rm     --volume $PWD/paper:/data     --user $(id -u):$(id -g)     --env JOURNAL=joss     openjournals/inara && xdg-open paper/paper.pdf

 No newline at end of file

@inproceedings{SchausAG17,

author    = {Pierre Schaus and

John Oscar Raoul Aoga and

Tias Guns},

title     = {CoverSize: {A} Global Constraint for Frequency-Based Itemset Mining},

booktitle = {Proceedings of the 23rd {CP} 2017},

pages     = {529--546},

year      = {2017},

timestamp = {Tue, 14 May 2019 10:00:45 +0200},

}

@inproceedings{BelaidBL19,

  title = {Constraint {Programming} for {Association} {Rules}},

  booktitle = {Proceedings of the 2019 {SIAM} {International} {Conference} on {Data} {Mining} ({SDM})},

  author = {Belaid, Mohamed-Bachir and Bessiere, Christian and Lazaar, Nadjib},

  year = {2019},

  pages = {127--135},

}

@inproceedings{Belaid2BL19,

  author    = {M. Belaid and  C. Bessiere and N. Lazaar},

  title     = {Constraint Programming for Mining Borders of Frequent Itemsets},

  booktitle = {Proceedings of {IJCAI} 2019},

  pages     = {1064--1070},

  year      = {2019}

}

@article{guns2011itemset,

  title={Itemset mining: A constraint programming perspective},

  author={Guns, Tias and Nijssen, Siegfried and De Raedt, Luc},

  journal={Artificial Intelligence},

  volume={175},

  number={12},

  pages={1951--1983},

  year={2011},

  publisher={Elsevier}

}

@inproceedings{ijcai2022p0261,

  title     = {Threshold-free Pattern Mining Meets Multi-Objective Optimization: Application to Association Rules},

  author    = {Vernerey, Charles and Loudni, Samir and Aribi, Noureddine and Lebbah, Yahia},

  booktitle = {Proceedings of the Thirty-First International Joint Conference on

               Artificial Intelligence, {IJCAI-22}},

  publisher = {International Joint Conferences on Artificial Intelligence Organization},

  editor    = {Lud De Raedt},

  pages     = {1880--1886},

  year      = {2022},

  month     = {7},

  note      = {Main Track},

  doi       = {10.24963/ijcai.2022/261},

  url       = {https://doi.org/10.24963/ijcai.2022/261},

}

@article{prud2022choco,

  title={Choco-solver: A Java library for constraint programming},

  author={Prud'homme, Charles and Fages, Jean-Guillaume},

  journal={Journal of Open Source Software},

  volume={7},

  number={78},

  pages={4708},

  year={2022}

}

@inproceedings{HienLALLOZ20,

  author    = {A. Hien and

  S. Loudni and

  N. Aribi and

  Y. Lebbah and

  M. Laghzaoui and

  A. Ouali and

  A. Zimmermann},

  title     = {A Relaxation-Based Approach for Mining Diverse Closed Patterns},

  booktitle = {Proceedings of {ECML} {PKDD} 2020},

  series    = {Lecture Notes in Computer Science},

  volume    = {12457},

  pages     = {36--54},

  publisher = {Springer},

  year      = {2020}

}

 No newline at end of file

![Summary of constraints implemented with Choco-mining \label{fig:app}](app.drawio.png)

We propose a new CP library called Choco-Mining that is based on Choco-solver [@prud2022choco]. The architecture of the library is illustrated in \autoref{fig:app} Multiple constraints for Itemset Mining are implemented in Choco-Mining:

- CoverSize[@SchausAG17]: Given a frequency variable $f$, ensures that $f = freq(x)$.

- CoverClosure[@SchausAG17]: Ensures that $x$ is closed w.r.t. the frequency.

- AdequateClosure[@ijcai2022p0261]: Given a set of measures $M$, ensures that $x$ is closed w.r.t. $M$.

- FrequentSubs[@Belaid2BL19]: Given a frequency threshold $s$, ensures that $\forall y \subset x : freq(y) \le s$.

- InfrequentSupers[@Belaid2BL19]: Given a frequency threshold $s$, ensures that $\forall y \supset x : freq(y) < s$.

- Generator[@BelaidBL19]: Ensures that $x$ is a generator.

- ClosedDiversity[@HienLALLOZ20]: Given a history of itemsets $\mathcal{H}$, a diversity threshold $j_{max}$ and a minimum frequency threshold $s$, ensures that $x$ is a diverse pattern.  

# Acknowledgements