8 citations found. Retrieving documents...
Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz. CMTreeMiner: Mining both closed and maximal frequent subtrees. Technical Report CSD-TR No. 030053, ftp://ftp.cs.ucla.edu/tech-report/2003-reports/030053.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 Xia Muntz)   (Correct)

No context found.

Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz. CMTreeMiner: Mining both closed and maximal frequent subtrees. Technical Report CSD-TR No. 030053, ftp://ftp.cs.ucla.edu/tech-report/2003-reports/030053.pdf, UCLA, 2003.


Accepted for publication in Knowledge and Information Systems - Canonical Forms For   Self-citation (Chi Yang Muntz)   (Correct)

No context found.

Chi, Y., Yang, Y., Xia, Y. and Muntz, R. R. (2004), CMTreeMiner: Mining both closed and maximal frequent subtrees, in `The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04)'.


Frequent Subtree Mining - An Overview - Chi, Nijssen, al. (2001)   (1 citation)  Self-citation (Chi Muntz)   (Correct)

No context found.

Chi, Y., Yang, Y., Xia, Y., Muntz, R. R.: CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees, The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), May 2004.


Frequent Subtree Mining - An Overview - Chi, Nijssen, Muntz, Kok (2005)   (1 citation)  Self-citation (Chi Muntz)   (Correct)

No context found.

Chi, Y., Yang, Y., Xia, Y., Muntz, R. R.: CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees, The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), May 2004.


Mining Closed and Maximal Frequent Subtrees from Databases .. - Chi, Xia, Yang, Muntz   Self-citation (Chi Yang Xia Muntz)   (Correct)

No context found.

Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz. CMTreeMiner: Mining both closed and maximal frequent subtrees. In The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), May 2004.


CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees - Chi, Yang, Xia, Muntz (2004)   (1 citation)  Self-citation (Chi Yang Xia Muntz)   (Correct)

No context found.

Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz. CMTreeMiner: Mining both closed and maximal frequent subtrees. Technical Report CSD-TR No. 030053, ftp://ftp.cs.ucla.edu/tech-report/2003-reports/030053.pdf, UCLA, 2003.


Mining Closed and Maximal Frequent Subtrees from Databases .. - Chi, Xia, Yang, Muntz (2004)   Self-citation (Chi Yang Xia Muntz)   (Correct)

No context found.

Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz. CMTreeMiner: Mining both closed and maximal frequent subtrees. In The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), May 2004.


Efficiently Mining Frequent Embedded Unordered Trees - Zaki (2005)   (Correct)

No context found.

Chi, Y., Yang, Y., Xia, Y., Muntz, R. R.: CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees, 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 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