-
1
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
ACM Press, New York, NY, USA
-
R. Agrawal, T. Imielienski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. Proc. Conf. on Management, of Data, 207-216. ACM Press, New York, NY, USA 1993
-
(1993)
Proc. Conf. on Management, of Data
, pp. 207-216
-
-
Agrawal, R.1
Imielienski, T.2
Swami, A.3
-
2
-
-
2442483205
-
Mining molecular fragments: Finding relevant substructures of molecules
-
(Maebashi, Japan). IEEE Press, Piscataway, NJ, USA
-
C. Borgelt and M.R. Berthold. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. Proc. IEEE Int. Conf. on Data Mining (ICDM 2002, Maebashi, Japan), 51-58. IEEE Press, Piscataway, NJ, USA 2002
-
(2002)
Proc. IEEE Int. Conf. on Data Mining ICDM 2002
, pp. 51-58
-
-
Borgelt, C.1
Berthold, M.R.2
-
3
-
-
21144433491
-
Large scale mining of molecular fragments with wildcards
-
Springer-Verlag, Heidelberg, Germany
-
H. Hofer, C. Borgelt, and M.R. Berthold. Large Scale Mining of Molecular Fragments with Wildcards, Proc. 5th Int. Symposium on Intelligent. Data Analysis (IDA 2003, Berlin, Germany), 376-385. Springer-Verlag, Heidelberg, Germany 2003
-
(2003)
Proc. 5th Int. Symposium on Intelligent. Data Analysis (IDA 2003, Berlin, Germany)
, pp. 376-385
-
-
Hofer, H.1
Borgelt, C.2
Berthold, M.R.3
-
4
-
-
0035789622
-
Molecular feature mining in HIV data
-
(San Francisco, CA). ACM Press, New York, NY, USA
-
S. Kramer, L. de Raedt, and C. Helma. Molecular Feature Mining in HIV Data. Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2001, San Francisco, CA), 136-143. ACM Press, New York, NY, USA 2001
-
(2001)
Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining KDD 2001
, pp. 136-143
-
-
Kramer, S.1
De Raedt, L.2
Helma, C.3
-
5
-
-
12244292385
-
An efficient algorithm for discovering frequent subgraphs
-
Dept. of Computer Science/Army HPC Research Center, University of Minnesota, Minneapolis, USA
-
M. Kuramochi and G. Karypis. An Efficient Algorithm for Discovering Frequent Subgraphs. Technical Report TR 02-026, Dept. of Computer Science/Army HPC Research Center, University of Minnesota, Minneapolis, USA 2002
-
(2002)
Technical Report
, vol.TR 02-026
-
-
Kuramochi, M.1
Karypis, G.2
-
6
-
-
26944458693
-
Mining fragments with fuzzy chains in molecular databases
-
University of Pisa, Pisa, Italy
-
T. Meinl, C. Borgelt, and M.R. Berthold. Mining Fragments with Fuzzy Chains in Molecular Databases. Proc. 2nd Int. Workshop on Mining Graphs, Trees and Sequences (MGTS 2004, Pisa, Italy), 49-60. University of Pisa, Pisa, Italy 2004
-
(2004)
Proc. 2nd Int. Workshop on Mining Graphs, Trees and Sequences (MGTS 2004, Pisa, Italy)
, pp. 49-60
-
-
Meinl, T.1
Borgelt, C.2
Berthold, M.R.3
-
7
-
-
0024578841
-
New soluble formazan assay for HIV-1 cytopathic effects: Application to high flux screening of synthetic and natural products for AIDS antiviral activity
-
Oxford University Press, Oxford, United Kingdom
-
O. Weislow, R. Kiser, D. Fine, J. Bader, R. Shoemaker, and M. Boyd. New Soluble Formazan Assay for HIV-1 Cytopathic Effects: Application to High Flux Screening of Synthetic and Natural Products for AIDS Antiviral Activity. Journal of the National Cancer Institute, 81:577-586. Oxford University Press, Oxford, United Kingdom 1989
-
(1989)
Journal of the National Cancer Institute
, vol.81
, pp. 577-586
-
-
Weislow, O.1
Kiser, R.2
Fine, D.3
Bader, J.4
Shoemaker, R.5
Boyd, M.6
-
8
-
-
85138646379
-
New algorithms for fast discovery of association rules
-
AAAI Press, Menlo Park, CA, USA
-
M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New Algorithms for Fast Discovery of Association Rules. Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD'97), 283-296. AAAI Press, Menlo Park, CA, USA 1997
-
(1997)
Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD'97)
, pp. 283-296
-
-
Zaki, M.1
Parthasarathy, S.2
Ogihara, M.3
Li, W.4
-
9
-
-
33646002585
-
-
http://dtp.nci.nih.gov/docs/cancer/cancer.data.html
-
-
-
|