Y. Chi, Y. Yang, and R. R. Muntz. Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, ftp://ftp.cs.ucla.edu/techreport /2003-reports/030043.pdf, UCLA, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
CMTreeMiner: Mining Both Closed and - Maximal Frequent Subtrees Self-citation (Chi Yang Muntz) (Correct)
No context found.
Y. Chi, Y. Yang, and R. R. Muntz. Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, ftp://ftp.cs.ucla.edu/techreport /2003-reports/030043.pdf, UCLA, 2003.
Frequent Subtree Mining - An Overview - Chi, Nijssen, al. (2001) (1 citation) Self-citation (Chi Muntz) (Correct)
No context found.
Chi, Y., Yang, Y., Muntz, R. R.: Mining Frequent Rooted Trees and Free Trees Using Canonical Forms, Knowledge and Information Systems, (To appear).
HybridTreeMiner: An Efficient Algorithm for Mining Frequent.. - Chi, Yang, Muntz (2004) Self-citation (Chi Yang Muntz) (Correct)
No context found.
Y. Chi, Y. Yang, and R. R. Muntz. Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, ftp://ftp.cs.ucla.edu/tech-report/2003.
Frequent Subtree Mining - An Overview - Chi, Nijssen, Muntz, Kok (2005) (1 citation) Self-citation (Chi Muntz) (Correct)
No context found.
Chi, Y., Yang, Y., Muntz, R. R.: Mining Frequent Rooted Trees and Free Trees Using Canonical Forms, Knowledge and Information Systems, (To appear).
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees - Chi, Yang, Xia, Muntz (2004) (1 citation) Self-citation (Chi Yang Muntz) (Correct)
No context found.
Y. Chi, Y. Yang, and R. R. Muntz. Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, ftp://ftp.cs.ucla.edu/techreport /2003-reports/030043.pdf, UCLA, 2003.
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees - Chi, Yang, Xia, Muntz (2003) (1 citation) Self-citation (Chi Yang Muntz) (Correct)
No context found.
Y. Chi, Y. Yang, and R. R. Muntz. Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, ftp://ftp.cs.ucla.edu/techreport /2003-reports/030043.pdf, UCLA, 2003.
HybridTreeMiner: An Efficient Algorithm for Mining Frequent.. - Chi, Yang, Muntz (2004) Self-citation (Chi Yang Muntz) (Correct)
No context found.
Y. Chi, Y. Yang, and R. R. Muntz. Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, ftp://ftp.cs.ucla.edu/tech-report/2003.
Finding Trees From Unordered 0--1 Data - Hannes Heikinheimo Heikki (Correct)
No context found.
Chi, Y., Yang, Y., Muntz, R.R.: Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, UCLA Computer Science Department (2003) ftp://ftp.cs.ucla.edu/tech-report/2003-reports/ 030043.pdf.
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