✦ LIBER ✦

[Lecture Notes in Computer Science] Discovery Science Volume 4755 || An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining

✍ Scribed by Corruble, Vincent; Takeda, Masayuki; Suzuki, Einoshin

Book ID: 125515295
Publisher: Springer Berlin Heidelberg
Year: 2007
Tongue: German
Weight: 367 KB
Edition: 2007
Category: Article
ISBN: 3540754873
DOI: 10.1007/978-3-540-75488-6_21

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Disc

[Lecture Notes in Computer Science] Discovery Science Volume 4755 || Mining Subtrees with Frequent Occurrence of Similar Subtrees

✍ Corruble, Vincent; Takeda, Masayuki; Suzuki, Einoshin 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 267 KB

[Lecture Notes in Computer Science] Cont

[Lecture Notes in Computer Science] Content Computing Volume 3309 || A New FP-Tree Algorithm for Mining Frequent Itemsets

✍ Chi, Chi-Hung; Lam, Kwok-Yan 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 343 KB

[Lecture Notes in Computer Science] Web

[Lecture Notes in Computer Science] Web Technologies and Applications Volume 8709 || Efficient Frequent Itemset Mining from Dense Data Streams

✍ Chen, Lei; Jia, Yan; Sellis, Timos; Liu, Guanfeng 📂 Article 📅 2014 🏛 Springer International Publishing 🌐 English ⚖ 215 KB

This book constitutes the refereed proceedings of the 16th Asia-Pacific Conference APWeb 2014 held in Changsha, China, in September 2014. The 34 full papers and 23 short papers presented were carefully reviewed and selected from 134 submissions. The papers address research, development and advanced

[Lecture Notes in Computer Science] Disc

[Lecture Notes in Computer Science] Discovery Science Volume 3245 || An Efficient Rules Induction Algorithm for Rough Set Classification

✍ Suzuki, Einoshin; Arikawa, Setsuo 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 366 KB

This Book Constitutes The Refereed Proceedings Of The 7th International Conference On Discovery Science, Ds 2004, Held In Padova, Italy In October 2004. The 20 Revised Long Papers And The 19 Revised Regular Papers Presented Were Carefully Reviewed And Selected From 80 Submissions. The Papers Are Org

[Lecture Notes in Computer Science] Shar

[Lecture Notes in Computer Science] Sharing Data, Information and Knowledge Volume 5071 || Efficient Mining of Frequent Itemsets from Data Streams

✍ Gray, Alex; Jeffery, Keith; Shao, Jianhua 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 233 KB

[Lecture Notes in Computer Science] Adva

[Lecture Notes in Computer Science] Advances in Knowledge Discovery and Data Mining Volume 4426 || BRIM: An Efficient Boundary Points Detecting Algorithm

✍ Zhou, Zhi-Hua; Li, Hang; Yang, Qiang 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 299 KB

This book constitutes the refereed proceedings of the 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2007, held in Nanjing, China, May 2007. It covers new ideas, original research results and practical development experiences from all KDD-related areas including data mini