R. Agrawal, T. Imielinski, and A. N. Swami, Mining association rules between sets of items in large databases, SIG- MOD Conference, pp.207-216, 1993.

R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, VLDB, pp.487-499, 1994.

R. Agrawal and R. Srikant, Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering, pp.3-14, 1995.
DOI : 10.1109/ICDE.1995.380415

C. Berge and . Hypergraphs, Combinatorics of Finite Sets. North- Holland, 1973.

M. L. Fredman and L. Khachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms, Journal of Algorithms, vol.21, issue.3, pp.618-628, 1996.
DOI : 10.1006/jagm.1996.0062

D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen et al., Discovering all most specific sentences, ACM Transactions on Database Systems, vol.28, issue.2, pp.140-174, 2003.
DOI : 10.1145/777943.777945
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1494

D. J. Kavvadias and E. C. Stavropoulos, Evaluation of an Algorithm for the Transversal Hypergraph Problem, In Algorithm Engineering, pp.72-84, 1999.
DOI : 10.1007/3-540-48318-7_8

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.241-258, 1997.
DOI : 10.1023/A:1009796218281

H. Mannila, H. Toivonen, and A. I. Verkamo, Efficient algorithms for discovering association rules, KDD Workshop, pp.181-192, 1994.