-
2
-
-
0001371923
-
Fast discovery of association rules
-
AAAI
-
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in knowledge discovery and data mining, pages 307-328. AAAI, 1996.
-
(1996)
Advances in knowledge discovery and data mining
, pp. 307-328
-
-
Agrawal, R.1
Mannila, H.2
Srikant, R.3
Toivonen, H.4
Verkamo, A.I.5
-
3
-
-
0006155366
-
Mining frequent patterns with counting inference
-
66-75
-
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explor. Newsl., 2(2):66-75, 2000.
-
(2000)
SIGKDD Explor. Newsl
, vol.2
, Issue.2
-
-
Bastide, Y.1
Taouil, R.2
Pasquier, N.3
Stumme, G.4
Lakhal, L.5
-
4
-
-
0032091573
-
Efficiently mining long patterns from databases
-
ACM Press
-
R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. of SIGMOD '98, pages 85-93. ACM Press, 1998.
-
(1998)
Proc. of SIGMOD '98
, pp. 85-93
-
-
Bayardo, R.J.1
-
6
-
-
0038505857
-
On maximal frequent and minimal infrequent sets in binary matrices
-
E. Boros, V. Gurvich, L. Khachiyan, and K. Makino. On maximal frequent and minimal infrequent sets in binary matrices. Annals of Mathematics and Artificial Intelligence, 39:211-221, 2003.
-
(2003)
Annals of Mathematics and Artificial Intelligence
, vol.39
, pp. 211-221
-
-
Boros, E.1
Gurvich, V.2
Khachiyan, L.3
Makino, K.4
-
8
-
-
78149351437
-
Efficiently Mining Maximal Frequent Itemsets
-
Washington, DC, USA, IEEE Computer Society
-
K. Gouda and M. J. Zaki. Efficiently Mining Maximal Frequent Itemsets. In Proc. of ICDM '01, pages 163-170, Washington, DC, USA, 2001. IEEE Computer Society.
-
(2001)
Proc. of ICDM '01
, pp. 163-170
-
-
Gouda, K.1
Zaki, M.J.2
-
9
-
-
26944443663
-
Finding Sporadic Rules Using Apriori-Inverse
-
Proc. of PAKDD '05, Hanoi, Vietnam, of, Springer, May
-
Y. Koh and N. Rountree. Finding Sporadic Rules Using Apriori-Inverse. In Proc. of PAKDD '05, Hanoi, Vietnam, volume 3518 of LNCS, pages 97-106. Springer, May 2005.
-
(2005)
LNCS
, vol.3518
, pp. 97-106
-
-
Koh, Y.1
Rountree, N.2
-
10
-
-
0038122164
-
Concise Representation of Frequent Patterns Based on Disjunction-Free Generators
-
Washington, DC, USA, IEEE Computer Society
-
M. Kryszkiewicz. Concise Representation of Frequent Patterns Based on Disjunction-Free Generators. In Proc. of ICDM '01, pages 305-312, Washington, DC, USA, 2001. IEEE Computer Society.
-
(2001)
Proc. of ICDM '01
, pp. 305-312
-
-
Kryszkiewicz, M.1
-
11
-
-
0001267179
-
Mining association rules with multiple minimum supports
-
New York, NY, USA, ACM Press
-
B. Liu, W. Hsu, and Y. Ma. Mining association rules with multiple minimum supports. In Proc. of SIGKDD '99, pages 337-341, New York, NY, USA, 1999. ACM Press.
-
(1999)
Proc. of SIGKDD '99
, pp. 337-341
-
-
Liu, B.1
Hsu, W.2
Ma, Y.3
-
12
-
-
84947729564
-
Efficient Search of Reliable Exceptions
-
London, UK, Springer-Verlag
-
H. Liu, H. Lu, L. Feng, and F. Hussain. Efficient Search of Reliable Exceptions. In Proc. of PAKDD '99, pages 194-203, London, UK, 1999. Springer-Verlag.
-
(1999)
Proc. of PAKDD '99
, pp. 194-203
-
-
Liu, H.1
Lu, H.2
Feng, L.3
Hussain, F.4
-
13
-
-
21944442464
-
Levelwise Search and Borders of Theories in Knowledge Discovery
-
September
-
H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(3):241-258, September 1997.
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, Issue.3
, pp. 241-258
-
-
Mannila, H.1
Toivonen, H.2
-
14
-
-
84911977993
-
Discovering frequent closed itemsets for association rules
-
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. LNCS, 1540:398-416, 1999.
-
(1999)
LNCS
, vol.1540
, pp. 398-416
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
15
-
-
0031979092
-
Objectives, Design and Recruitment of a Familial and Longitudinal Cohort for Studying Gene-Environment Interactions in the Field of Cardiovascular Risk: The Stanislas Cohort
-
Jan
-
G. Siest et al. Objectives, Design and Recruitment of a Familial and Longitudinal Cohort for Studying Gene-Environment Interactions in the Field of Cardiovascular Risk: The Stanislas Cohort. Clinical Chemistry and Laboratory Medicine (CCLM), 36(1):35-42, Jan 1998.
-
(1998)
Clinical Chemistry and Laboratory Medicine (CCLM)
, vol.36
, Issue.1
, pp. 35-42
-
-
Siest, G.1
-
17
-
-
41549134483
-
Symbolic Data Mining Methods with the Coron Platform (Méthodes symboliques de fouille de données avec la plate-forme Coron)
-
Univ. Henri Poincaré Nancy, France, Nov
-
L. Szathmary. Symbolic Data Mining Methods with the Coron Platform (Méthodes symboliques de fouille de données avec la plate-forme Coron). PhD in Computer Sciences, Univ. Henri Poincaré Nancy 1, France, Nov 2006.
-
(2006)
PhD in Computer Sciences
, pp. 1
-
-
Szathmary, L.1
-
18
-
-
47349100228
-
Vers l'extraction de motifs rares
-
Lille, France, in French
-
L. Szathmary, S. Maumus, P. Petronin, Y. Toussaint, and A. Napoli. Vers l'extraction de motifs rares. In Proc. of Extraction et gestion des connaissances (EGC '06), Lille, France, pages 499-510, 2006. (in French)
-
(2006)
Proc. of Extraction et gestion des connaissances (EGC '06)
, pp. 499-510
-
-
Szathmary, L.1
Maumus, S.2
Petronin, P.3
Toussaint, Y.4
Napoli, A.5
-
20
-
-
20844458491
-
Mining with rarity: A unifying framework
-
7-19
-
G. Weiss. Mining with rarity: a unifying framework. SIGKDD Explor. Newsl., 6(1):7-19, 2004.
-
(2004)
SIGKDD Explor. Newsl
, vol.6
, Issue.1
-
-
Weiss, G.1
-
21
-
-
0038148379
-
Mining association rules on significant rare data using relative support
-
H. Yun, D. Ha, B. Hwang, and K. Ryu. Mining association rules on significant rare data using relative support. Journal of Systems and Software, 67(3):181-191, 2003.
-
(2003)
Journal of Systems and Software
, vol.67
, Issue.3
, pp. 181-191
-
-
Yun, H.1
Ha, D.2
Hwang, B.3
Ryu, K.4
|