R uckert, U., Kramer, S.: Frequent Free Tree Discovery in Graph Data, Special Track on Data Mining, ACM Symposium on Applied Computing (SAC'04), 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generalized Version Space Trees - Rückert, Kramer Self-citation (Uckert Kramer) (Correct)
No context found.
Ulrich R uckert and Stefan Kramer. Frequent free tree discovery in graph data, submitted. http://home.in.tum.de/#rueckert/freetreeminer.pdf, 2003.
Frequent Subtree Mining - An Overview - Chi, Nijssen, al. (2001) (1 citation) (Correct)
No context found.
R uckert, U., Kramer, S.: Frequent Free Tree Discovery in Graph Data, Special Track on Data Mining, ACM Symposium on Applied Computing (SAC'04), 2004.
Frequent Subtree Mining - An Overview - Chi, Nijssen, Muntz, Kok (2005) (1 citation) (Correct)
No context found.
R uckert, U., Kramer, S.: Frequent Free Tree Discovery in Graph Data, Special Track on Data Mining, ACM Symposium on Applied Computing (SAC'04), 2004.
Mining Closed and Maximal Frequent Subtrees from Databases .. - Chi, Xia, Yang, Muntz (Correct)
No context found.
U. R uckert and S. Kramer. Frequent free tree discovery in graph data. In Special Track on Data Mining, ACM Symposium on Applied Computing (SAC'04), 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC