2002-treeminer

Summary

Mohammed J. Zaki, Efficiently Mining Frequent Trees in a Forest. In 8th ACM SIGKDD International Conference Knowledge Discovery and Data Mining. Jul 2002. (PDF) #2002-treeminerBib

Bibtex entry

@INPROCEEDINGS { 2002-treeminer,    AUTHOR = { Mohammed J. Zaki },    TITLE = { Efficiently Mining Frequent Trees in a Forest },    BOOKTITLE = { 8th ACM SIGKDD International Conference Knowledge Discovery and Data Mining },    ANNOTE = { Errata: Theorem 1, case I a) should be as follows: If P != {} add (y,j) and (y,n_i) to [Px], where n_i (=n_j) is the depth first number for node (x,i). (Note that n_i is easy to compute. It is simply the number of nodes in prefix P, i.e., length of P, not counting -1s). Also, in example 4, the second last line should be: ...adding elements (4,0) and (4,2) to the class... },    MONTH = { Jul },    YEAR = { 2002 },    PDF = { SIGKDD02-tree.pdf },    KEYWORD = { Conference,TreeMining },}

Page last modified on April 18, 2017, at 02:56 PM