Yun Chi's Research: Mining Patterns in Structured Data

Mine structured data such as trees and graphs. Apply the mining algorithms to discover useful patterns in social networks. Answer questions such as:

What kind of tree and graph patterns are interesting?
How to quickly find patterns from huge social networks?
How to obtain useful insights from the mined patterns?
How does information propagate in a social network?
How to efficiently unify global features with local (personal) features?
How to extract meaningful communities based on links and contents?

Related publication:

[1]	Yun Chi, Haixun Wang, Philip S. Yu, and Richard R. Muntz. Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowl. Inf. Syst., 10(3):265-294, 2006. [ bib \| .pdf ]

[2]	Yun Chi. Mining databases of labeled trees using canonical forms. PhD thesis, University of California at Los Angeles, Los Angeles, CA, USA, 2005. Adviser-Muntz,, Richard R. [ bib \| .pdf ]

[3]	Yun Chi, Richard R. Muntz, Siegfried Nijssen, and Joost N. Kok. Frequent subtree mining - an overview. Fundam. Inf., 66(1-2):161-198, 2005. [ bib \| .pdf ]

[4]	Yun Chi, Yi Xia, Yirong Yang, and 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. [ bib \| .pdf ]

[5]	Yun Chi, Yirong Yang, and Richard R. Muntz. Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst., 8(2):203-234, 2005. [ bib \| .pdf ]

[6]	Yun Chi, Haixun Wang, Philip S. Yu, and Richard R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In ICDM '04: Proceedings of the Fourth IEEE International Conference on Data Mining, pages 59-66, Washington, DC, USA, 2004. IEEE Computer Society. [ bib \| .pdf ]

[7]

Yun Chi, Yirong Yang, and Richard R. Muntz. Hybridtreeminer: An efficient algorithm for mining frequent rooted trees and free trees using canonical form. In SSDBM'04: Proceedings of the 16th International Conference on and Statistical Database Management, pages 11-20, Santorini Island, Greece, 2004. IEEE Computer Society. [ bib | .pdf ]

[8]	Yun Chi, Yirong Yang, Yi Xia, and Richard R. Muntz. Cmtreeminer: Mining both closed and maximal frequent subtrees. In PAKDD'04: Proceedings of the 8th Pacific-Asia in Knowledge Discovery and Data Mining, pages 63-73, Sydney, Australia, 2004. Springer. [ bib \| .pdf ]

[9]	Yi Xia, Yirong Yang, and Yun Chi. Mining association rules with non-uniform privacy concerns. In DMKD '04: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, pages 27-34, New York, NY, USA, 2004. ACM. [ bib \| .pdf ]

[10]	Yun Chi, Yirong Yang, and Richard R. Muntz. Indexing and mining free trees. In ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining, page 509, Washington, DC, USA, 2003. IEEE Computer Society. [ bib \| .pdf ]

Last updated: Wed Dec 02 16:32:29 PST 2009