Mining concise representations of frequent patterns through conjunctive and disjunctive search spaces

Authors:
Tarek Hamrouni
Affiliations:
Tunis El Manar University, Tunisia and Artois University, France
Venue:
ACM SIGKDD Explorations Newsletter
Year:
2009

Citing 3
Cited 0

Frequent closed itemset based algorithms: a thorough structural and analytical survey

ACM SIGKDD Explorations Newsletter
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets

Data & Knowledge Engineering
About the lossless reduction of the minimal generator family of a context

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract