-
1
-
-
0001882616
-
Fast algorithms for mining association rules
-
Chile, Santiago
-
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. on Very Large Databases, Chile, Santiago, pp. 487-499 (1994).
-
(1994)
Proc. 20th Int. Conf. on Very Large Databases
, pp. 487-499
-
-
Agrawal, R.1
Srikant, R.2
-
2
-
-
0029212693
-
Mining sequential patterns
-
Taipei, Taiwan
-
Agrawal, R., Srikant, R.: Mining sequential patterns. In: 11th Int. Conf. on Data Engineering (ICDE '95), Taipei, Taiwan, pp. 3-14 (1995).
-
(1995)
11th Int. Conf. on Data Engineering (ICDE '95)
, pp. 3-14
-
-
Agrawal, R.1
Srikant, R.2
-
4
-
-
1642393094
-
Tree growth based episode mining without candidate generation
-
Baumgarten, M., Büchner, A. G., Hughes, J. G.: Tree growth based episode mining without candidate generation. In: Int. Conf. on Artificial Intelligence (IC-AI) 2003, pp. 108-114 (2003).
-
(2003)
Int. Conf. on Artificial Intelligence (IC-AI) 2003
, pp. 108-114
-
-
Baumgarten, M.1
Büchner, A.G.2
Hughes, J.G.3
-
5
-
-
0003578607
-
Finding patterns in biological sequences
-
University of Waterloo
-
Brejová, B., DiMarco, C., Vinař, T., Hidalgo, S. R., Holguin, G., Patten, C.: Finding patterns in biological sequences. Technical report CS-2000-22, University of Waterloo (2000).
-
(2000)
Technical report CS-2000-22
-
-
Brejová, B.1
DiMarco, C.2
Vinař, T.3
Hidalgo, S.R.4
Holguin, G.5
Patten, C.6
-
7
-
-
6744229778
-
Model selection for variable length Markov chains and tuning the context algorithm
-
Bühlmann, P.: Model selection for variable length Markov chains and tuning the context algorithm. Ann. Inst. Stat. Math. 52, 287-315 (2000).
-
(2000)
Ann. Inst. Stat. Math.
, vol.52
, pp. 287-315
-
-
Bühlmann, P.1
-
8
-
-
0039530516
-
Variable length Markov chains
-
Bühlmann, P., Wyner, A. J.: Variable length Markov chains. Ann. Stat. 27, 480-513 (1999).
-
(1999)
Ann. Stat.
, vol.27
, pp. 480-513
-
-
Bühlmann, P.1
Wyner, A.J.2
-
9
-
-
9444269878
-
Discovering unbounded episodes in sequential data
-
Lavrač, N., et al. (eds.)
-
Casas-Garriga, G.: Discovering unbounded episodes in sequential data. In: Lavrač, N., et al. (eds.) PKDD 2003. LNAI, vol. 2838, pp. 83-94 (2003).
-
(2003)
PKDD 2003. LNAI
, vol.2838
, pp. 83-94
-
-
Casas-Garriga, G.1
-
10
-
-
0242456820
-
Pattern discovery in sequences under a Markov assumption
-
Edmonton, Alberta, Canada
-
Chudova, D., Smyth, P.: Pattern discovery in sequences under a Markov assumption. In: Proc. 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, 2002.
-
(2002)
Proc. 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining
-
-
Chudova, D.1
Smyth, P.2
-
11
-
-
84958547219
-
An algorithm for segmenting categorical time series into meaningful episodes
-
Cohen, P. R., Adams, N.: An algorithm for segmenting categorical time series into meaningful episodes. In: IDA01. LNAI, vol. 2189, pp. 197-205 (2001).
-
(2001)
IDA01. LNAI
, vol.2189
, pp. 197-205
-
-
Cohen, P.R.1
Adams, N.2
-
12
-
-
42749094723
-
Data mining and statistical control-a review and some links
-
Lenz and Wilrich (Eds.), Heidelberg: Physica-Verlag
-
Göb, R.: Data mining and statistical control-a review and some links. In: Lenz, Wilrich (eds.) Frontiers in Stat. Qual. Control 8, pp. 285-308. Physica-Verlag, Heidelberg (2006).
-
(2006)
Frontiers in Stat. Qual. Control 8
, pp. 285-308
-
-
Göb, R.1
-
13
-
-
79956319997
-
Markov models for identification of significant episodes
-
Newport Beach, California
-
Gwadera, R., Atallah, M. J., Szpankowski, W.: Markov models for identification of significant episodes. In: Proc. 2005 SIAM Int. Conf. on Data Mining (SDM-05), Newport Beach, California, 2005.
-
(2005)
Proc. 2005 SIAM Int. Conf. on Data Mining (SDM-05)
-
-
Gwadera, R.1
Atallah, M.J.2
Szpankowski, W.3
-
14
-
-
35748947774
-
Efficient mining of frequent episodes from complex sequences
-
Huang, K.-Y., Chang, C.-H.: Efficient mining of frequent episodes from complex sequences. Inf. Syst. 33, 96-114 (2008).
-
(2008)
Inf. Syst.
, vol.33
, pp. 96-114
-
-
Huang, K.-Y.1
Chang, C.-H.2
-
15
-
-
0003113325
-
Finding interesting rules from large sets of discovered association rules
-
3rd edn., Adam (Ed.), New York: ACM Press
-
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A. I.: Finding interesting rules from large sets of discovered association rules. In: Adam, et al. (eds.), 3rd Int. Conf. on Information and Knowledge Management, pp. 401-407. ACM Press, New York (1997).
-
(1997)
Int. Conf. On Information and Knowledge Management
, pp. 401-407
-
-
Klemettinen, M.1
Mannila, H.2
Ronkainen, P.3
Toivonen, H.4
Verkamo, A.I.5
-
16
-
-
28244452013
-
Discovering frequent episodes and learning hidden Markov models: a formal connection
-
Laxman, S., Sastry, P. S.: Discovering frequent episodes and learning hidden Markov models: a formal connection. IEEE Trans. Knowl. Discov. Data Eng. 17(11), 1505-1517 (2005).
-
(2005)
IEEE Trans. Knowl. Discov. Data Eng.
, vol.17
, Issue.11
, pp. 1505-1517
-
-
Laxman, S.1
Sastry, P.S.2
-
17
-
-
33646807766
-
A survey of temporal data mining
-
Laxman, S., Sastry, P. S.: A survey of temporal data mining. Sādhanā 31(2), 173-198 (2006).
-
(2006)
Sādhanā
, vol.31
, Issue.2
, pp. 173-198
-
-
Laxman, S.1
Sastry, P.S.2
-
18
-
-
27144468394
-
Discovery of frequent episodes in event sequences
-
Mannila, H., Toivonen, H., Verkamo, A. I.: Discovery of frequent episodes in event sequences. Data Mining Knowl. Discov. 1, 259-289 (1997).
-
(1997)
Data Mining Knowl. Discov.
, vol.1
, pp. 259-289
-
-
Mannila, H.1
Toivonen, H.2
Verkamo, A.I.3
-
19
-
-
8744299419
-
The interestingness paradox in pattern discovery
-
Padmanabhan, B.: The interestingness paradox in pattern discovery. J. Appl. Stat. 31(8), 1019-1035 (2004).
-
(2004)
J. Appl. Stat.
, vol.31
, Issue.8
, pp. 1019-1035
-
-
Padmanabhan, B.1
-
21
-
-
0020824731
-
A universal data compression system
-
Rissanen, J.: A universal data compression system. IEEE Trans. Inf. Theory 29(5), 656-664 (1983).
-
(1983)
IEEE Trans. Inf. Theory
, vol.29
, Issue.5
, pp. 656-664
-
-
Rissanen, J.1
-
22
-
-
0030282113
-
The power of amnesia: Learning probabilistic automata with variable memory length
-
Ron, D., Singer, Y., Tishby, N.: The power of amnesia: Learning probabilistic automata with variable memory length. Mach. Learn. 25, 117-149 (1996).
-
(1996)
Mach. Learn.
, vol.25
, pp. 117-149
-
-
Ron, D.1
Singer, Y.2
Tishby, N.3
-
23
-
-
0036359667
-
Finding weak motifs in DNA sequences
-
Sze, S.-H., Gelfand, M. S., Pevzner, P. A.: Finding weak motifs in DNA sequences. Pac. Symp. Biocomput. 7, 235-246 (2002).
-
(2002)
Pac. Symp. Biocomput.
, vol.7
, pp. 235-246
-
-
Sze, S.-H.1
Gelfand, M.S.2
Pevzner, P.A.3
-
24
-
-
41549161248
-
Statistical mining of interesting association rules
-
Weiß, C. H.: Statistical mining of interesting association rules. Stat. Comput. 18(2), 185-194 (2008).
-
(2008)
Stat. Comput.
, vol.18
, Issue.2
, pp. 185-194
-
-
Weiß, C.H.1
-
25
-
-
42749090636
-
Discovering patterns in categorical time series using IFS
-
Weiß, C. H., Göb, R.: Discovering patterns in categorical time series using IFS. Comput. Stat. Data Anal. 52(9), 4369-4379 (2008).
-
(2008)
Comput. Stat. Data Anal.
, vol.52
, Issue.9
, pp. 4369-4379
-
-
Weiß, C.H.1
Göb, R.2
-
26
-
-
33847141517
-
Timeweaver: A genetic algorithm for identifying predictive patterns in sequences of events
-
Banzhaf (Ed.), San Francisco: Morgan Kaufmann
-
Weiss, G. M.: Timeweaver: A genetic algorithm for identifying predictive patterns in sequences of events. In: Banzhaf, et al. (eds.) Proc. of the Genetic and Evol. Comp. Conf., pp. 719-725. Morgan Kaufmann, San Francisco (1999).
-
(1999)
Proc. Of the Genetic and Evol. Comp. Conf.
, pp. 719-725
-
-
Weiss, G.M.1
-
27
-
-
1942436335
-
Robustness of the Markov-chain model for cyber-attack detection
-
Ye, N., Zhang, Y., Borror, C. M.: Robustness of the Markov-chain model for cyber-attack detection. IEEE Trans. Reliab. 53(1), 116-123 (2004).
-
(2004)
IEEE Trans. Reliab.
, vol.53
, Issue.1
, pp. 116-123
-
-
Ye, N.1
Zhang, Y.2
Borror, C.M.3
|