Yun Chi's Software

In my student life, I have developed some software to support my research. All codes were implemented in MS VC++ 6.0 and successfully compiled under Redhat Linux 6.0 using g++ 2.96. Please feel free to use the software for academic purposes.

Disclaimer: The software on this page is provided on an as is basis for research purposes. There is no additional support offered, nor are the author(s) or their institutions liable under any circumstances.

• MomentFP: a system for mining and maintaining closed frequent itemsets over data streams [MomentFP.tar.gz]
  Citation information:

  [1]	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 ]

  [2]	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 ]

• FreeTreeMiner: an a priori algorithm for mining frequent free trees [FreeTreeMiner.tgz]
  Citation information:

  [1]	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 ]

• RootedTreeMiner: an algorithm for mining frequent rooted unordered trees [RootedTreeMiner.tgz]
  Citation information:

  [1]	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 ]

• HybridTreeMiner Free: an algorithm for mining frequent free trees [HybridTreeMiner_Free.tgz]
  Citation information:

  [1]

  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 ]

• HybridTreeMiner Rooted: an algorithm for mining frequent rooted unordered trees [HybridTreeMiner_Rooted.tgz]
  Citation information:

  [1]

  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 ]

• CMTreeMiner Unordered: an algorithm for mining closed and maximal frequent rooted unordered trees [CMUnorderedTreeMiner.tgz]
  Citation information:

  [1]	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 ]

  [2]	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 ]

• CMTreeMiner Ordered: an algorithm for mining closed and maximal frequent rooted ordered trees [CMOrderedTreeMiner.tgz]
  Citation information:

  [1]	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 ]

  [2]	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 ]

Last updated: Wed Dec 02 16:54:50 PST 2009