✦ LIBER ✦

Constructing projection frequent pattern tree for efficient mining

✍ Scribed by Xiang Jian-wen; He Yan-xiang; Kokichi Futatsugi; Kong Wei-qiang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

CanTree: a canonical-order tree for incr

✍ Carson Kai-Sang Leung; Quamrul I. Khan; Zhan Li; Tariqul Hoque 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 579 KB

Efficient Mining of Frequent Closed XML

✍ Jian-Hua Feng; Qian Qian; Jian-Yong Wang; Li-Zhu Zhou 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 547 KB

Research on algorithm for mining negativ

✍ Zhu Yu-quan; Yang He-blao; Song Yu-qing; Xie Cong-hua 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 424 KB

An efficient hybrid algorithm for mining

✍ Zhang Li-qiang; Liu Da-xin 📂 Article 📅 2004 🏛 Wuhan University 🌐 English ⚖ 355 KB

Efficient breadth-first mining of freque

✍ Francesco Bonchi; Fosca Giannotti; Alessio Mazzanti; Dino Pedreschi 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 987 KB

A data mining proxy approach for efficie

✍ Jeffrey Xu Yu; Zhiheng Li; Guimei Liu 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 823 KB