![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Yun Chi Yun Chi, Philip S. Yu , Haixun Wang , Richard R. Muntz : Loadstar: A Load Shedding Scheme for Classifying Data Streams. SDM 2005 Yun Chi, Haixun Wang , Philip S. Yu : Loadstar: Load Shedding in Data Stream Mining. VLDB 2005 : 1303-1305 Yun Chi, Richard R. Muntz , Siegfried Nijssen , Joost N. Kok : Frequent Subtree Mining - An Overview. Fundam. Inform. 66 (1-2): 161-198 (2005) Yun 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) Yun 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) Yun 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) Yi Xia , Yirong Yang , Yun Chi: Mining association rules with non-uniform privacy concerns. DMKD 2004 : 27-34 Yun Chi, Haixun Wang , Philip S. Yu , Richard R. Muntz : Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. ICDM 2004 : 59-66 Yun Chi, Yirong Yang , Yi Xia , Richard R. Muntz : CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. PAKDD 2004 : 63-73 Yun 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 Yun Chi, Yirong Yang , Richard R. Muntz : Indexing and Mining Free Trees. ICDM 2003 : 509-512 1 [ 9 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 11 ] 3 [ 9 ] 4 [ 4 ] [ 10 ] [ 11 ] 5 [ 3 ] [ 5 ] [ 7 ] [ 8 ] 6 [ 1 ] [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] 7 [ 4 ] [ 10 ] [ 11 ] ![]() ©2006 Association for Computing Machinery |