Author of the publication

CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees.

, , , and . PAKDD, volume 3056 of Lecture Notes in Computer Science, page 63-73. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Indexing and Mining Free Trees., , and . ICDM, page 509-512. IEEE Computer Society, (2003)Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees., , , and . IEEE Trans. Knowl. Data Eng., 17 (2): 190-202 (2005)Mining association rules with non-uniform privacy concerns., , and . DMKD, page 27-34. ACM, (2004)Extremal graphs with maximum monochromatic connectivity., , and . Discret. Math., 343 (9): 111968 (2020)Correction to "Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees"., , , and . IEEE Trans. Knowl. Data Eng., 17 (12): 1737 (2005)Deep Space Probing for Point Cloud Analysis., , , , , , , , and . ICPR, page 10235-10242. IEEE, (2020)Manganese-enhanced MRI reveals changes within brain anxiety and aversion circuitry in rats with chronic neuropathic pain- and anxiety-like behaviors., , , , , , and . NeuroImage, (2020)CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees., , , and . PAKDD, volume 3056 of Lecture Notes in Computer Science, page 63-73. Springer, (2004)Canonical forms for labelled trees and their applications in frequent subtree mining., , and . Knowl. Inf. Syst., 8 (2): 203-234 (2005)An Internet-based Control Engineering Laboratory for Undergraduate and Graduate Education., , , and . CASE, page 546-550. IEEE, (2006)