|
Title
|
|
|
|
A tight upper bound on the number of candidate patterns
|
|
|
Author
|
|
|
|
|
|
|
Language
|
|
|
|
English
|
|
|
Source (book)
|
|
|
|
Proceedings of the IEEE International Conference on Data Mining
|
|
|
Publication
|
|
|
|
s.l.
:
IEEE Computer Society Press
,
2001
|
|
|
DOI
|
|
|
|
10.1109/ICDM.2001.989513
|
|
|
Volume/pages
|
|
|
|
p. 155-162
|
|
|
ISI
|
|
|
|
000173158200020
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|