dblp.uni-trier.dewww.uni-trier.de

Yirong Yang (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYun Chi, Yi Xia, Yirong Yang, Richard R. Muntz: Correction to "Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees". IEEE Trans. Knowl. Data Eng. 17(12): 1737 (2005)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYun Chi, Yi Xia, Yirong Yang, Richard R. Muntz: Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees. IEEE Trans. Knowl. Data Eng. 17(2): 190-202 (2005)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYun Chi, Yirong Yang, Richard R. Muntz: Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst. 8(2): 203-234 (2005)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYi Xia, Yirong Yang, Yun Chi: Mining association rules with non-uniform privacy concerns. DMKD 2004: 27-34
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYun Chi, Yirong Yang, Yi Xia, Richard R. Muntz: CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. PAKDD 2004: 63-73
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYun Chi, Yirong Yang, Richard R. Muntz: HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Form. SSDBM 2004: 11-20
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYun Chi, Yirong Yang, Richard R. Muntz: Indexing and Mining Free Trees. ICDM 2003: 509-512

Selection of 7 from 8 records - Yirong Yang has 4 coauthors

Copyright © 2009-12-30 by Michael Ley (ley@uni-trier.de)