Databases Reference
In-Depth Information
2. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets
of Items in Large Databases,
Proceedings of the 1993 ACM SIGMOD Inter-
national Conference on Management of data (SIGMOD'93)
,ACM,NewYork,
May 1993, 207-216
3. Agrawal, R., Srikant, R.:
Fast Algorithms for Mining Association Rules
, Morgan
Kaufmann, Los Altos, CA, 1998, 580-592
4. Blake,
C.,
Merz,
C.:
UCI
Repository
of
machine
learning
databases,
http://www.ics.uci.edu/
∼
mlearn/MLRepository.html, 1998
5. Ganter, B., Kuznetsov, S.O.: Stepwise Construction of the Dedekind-MacNeille
Completion,
Proceedings of Sixth International Conference on Conceptual Struc-
tures (ICCS'98)
, August 1998, 295-302
6. Ganter, B., Wille, R.:
Formal Concept Analysis: Mathematical Foundations
,
Springer, Berlin Heidelberg New York, 1999
7. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed
Itemsets for Association Rules,
Proceeding of the Seventh International Con-
ference on Database Theory (ICDT'99)
, Springer, Berlin Heidelberg New York,
January 1999, 398-416
8. Peeters, R.: The maximum edge biclique problem is NP-complete,
Discrete
Applied Mathematics
,
131
, 2003, 651-654
9. Pei, J., Han, J., Mao, R.: CLOSET: An E
cient Algorithm for Mining Frequent
Closed Itemsets,
ACM SIGMOD Workshop on Research Issues in Data Mining
and Knowledge Discovery
, May 2000, 21-30
10. Roman, T., Natalie, F., et al.: The COG database: an updated version includes
eukaryotes,
BMC Bioinformatics
,
4
, September 2003
11. Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for
Mining Frequent Closed Itemsets,
Proceedings of the Ninth ACM SIGKDD
International Conference on Knowledge Discovery and Data Mining (KDD'03)
,
ACM, New York, 2003, 236-245
12. Zaki, M.J., Hsiao, C.J.: Charm: an E
cient Algorithm for Closed Itemset Min-
ing,
Proceedings of the Second SIAM International Conference on Data Min-
ing (SDM'04)
, April 2002
