A time- and memory-efficient frequent itemset discovering algorithm for association rule mining

Renata Iváncsy, István Vajk. A time- and memory-efficient frequent itemset discovering algorithm for association rule mining. IJCAT, 27(4):270-280, 2006. [doi]

@article{IvancsyV06,
  title = {A time- and memory-efficient frequent itemset discovering algorithm for association rule mining},
  author = {Renata Iváncsy and István Vajk},
  year = {2006},
  doi = {10.1504/IJCAT.2006.011998},
  url = {http://dx.doi.org/10.1504/IJCAT.2006.011998},
  tags = {rule-based, rules},
  researchr = {https://researchr.org/publication/IvancsyV06},
  cites = {0},
  citedby = {0},
  journal = {IJCAT},
  volume = {27},
  number = {4},
  pages = {270-280},
}