The Top-K Frequent Closed Itemset Mining Using Top-K SAT Problem

Jabbour et al. "The Top-K Frequent Closed Itemset Mining Using Top-K SAT Problem." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013. doi:10.1007/978-3-642-40994-3_26

[Jabbour et al. "The Top-K Frequent Closed Itemset Mining Using Top-K SAT Problem." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.](https://mlanthology.org/ecmlpkdd/2013/jabbour2013ecmlpkdd-topk/) doi:10.1007/978-3-642-40994-3_26

@inproceedings{jabbour2013ecmlpkdd-topk,
  title     = {{The Top-K Frequent Closed Itemset Mining Using Top-K SAT Problem}},
  author    = {Jabbour, Saïd and Sais, Lakhdar and Salhi, Yakoub},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2013},
  pages     = {403-418},
  doi       = {10.1007/978-3-642-40994-3_26},
  url       = {https://mlanthology.org/ecmlpkdd/2013/jabbour2013ecmlpkdd-topk/}
}