Databases Reference
In-Depth Information
References
1. http://www.cs.rpi.edu/ zaki/software/
2. UCI repository of machine learning databases, http://www.ics.uci.edu/
∼
mlearn/mlrepository.html
3. R. Agrawal and R. Srikant. Fast algorithm for mining association rules. In
VLDB'94
, pages 487-499, 1994
4. R. Agrawal and R. Srikant. Mining sequential patterns. In
IEEE ICDE'95
,
pages 3-14, 1995
5. R. Agrawal and R. Srikant. Mining sequential patterns: Generalizations and
performance improvements. In
EDBT 1996
, pages 3-17
6. H. Ahonen-Myka. Discovery of frequent word sequences in text. In
ESF Ex-
ploratory Workshop on Pattern Detection and Discovery 2002
7. E. Baralis and S. Chiusano. Essential classification rule sets. In
ACM Trans-
actions on Database Systems (TODS), vol. 29, no. 4, December 2004
, pages
635-674
8. E. Baralis and P. Garza. A lazy approach to pruning classification rules. In
IEEE ICDM'02
, pages 35-42, 2002
9. Y. Bastide, R. Taouil, N. Pasquier, and L. Lakhal. Discovering frequent closed
itemsets for association rules. In
ICDT'99
, pages 398-416, 1999
10. R.J. Bayardo. E
ciently mining long patterns from databases. In
ACM SIG-
MOD'98
, pages 85-93, 1998
11. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule min-
ing. In
ACM KDD'98
, pages 80-86, 1998
12. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: A condensed repre-
sentation of boolean data for the approximation of frequency queries.
In Data
Mining and Knowledge Discovery journal
, vol. 7, pages 5-22, 2003
13. A. Bykowski and C. Rigotti. A condensed representation to find frequent pat-
terns. In
APODS 2001
14. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets.
In the
6th European Conference on Principles and Practice of Knowledge Discovery in
Databases (PKDD'02), pp. 74-85, Springer
, Berlin Heidelberg New York, 2002
15. B. Cremilleux and J.-F. Boulicaut. Simplest rules characterizing classes gener-
ated by delta-free sets. In
Proceedings of the 22 Annual International Conference
Knowledge Based Systems and Applied Artificial Intelligence (ES'02)
, pages 33-
46, Springer, Berlin Heidelberg New York, December 2002
16. M. Garofalakis, R. Rastogi, and K. Shim. Spirit: Sequential pattern mining with
regular expression constraints. In
VLDB 1999
, pages 223-234
17. M.J. Zaki. Sequence mining in categorical domains: Incorporating constraints.
In
CIKM 2004
, pages 442-429
18. M. Leleu, C. Rigotti, J.-F. Boulicaut, and G. Euvrard. Constraint-based mining
of sequential pattern over datasets with consecutive repetitions. In
PKDD 1997
,
pages 303-314
19. W. Li, J. Han, and J. Pei. CMAR: Accurate and e
cient classification based on
multiple class-association rules. In
IEEE ICDM'01
, pages 369-376, 2001
20. H. Mannila, H. Toivonen, and I. Verkamo. Discovery of frequent episodes in
event sequence. In
DMKD 1997
, pages 259-289
21. S. Orlando, R. Perego, and C. Silvestri. A new algorithm for gap constrained
sequence mining. In
ACM SAC 2004