Old Web
English
Sign In
Acemap
>
Paper
>
SAT‐based and CP‐based declarative approaches for Top‐Rank‐ K closed frequent itemset mining
SAT‐based and CP‐based declarative approaches for Top‐Rank‐ K closed frequent itemset mining
2021
Saed Abed
Areej A. Abdelaal
Mohammad Alshayeji
Imtiaz Ahmad
Keywords:
Theoretical computer science
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
24
References
3
Citations
NaN
KQI
[]