✦ LIBER ✦

[Lecture Notes in Computer Science] Principles of Data Mining and Knowledge Discovery Volume 2431 || Answering the Most Correlated N Association Rules Efficiently

✍ Scribed by Elomaa, Tapio; Mannila, Heikki; Toivonen, Hannu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Prin

✍ Elomaa, Tapio; Mannila, Heikki; Toivonen, Hannu 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 280 KB

[Lecture Notes in Computer Science] Prin

✍ De Raedt, Luc; Siebes, Arno 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 226 KB

[Lecture Notes in Computer Science] Prin

✍ Elomaa, Tapio; Mannila, Heikki; Toivonen, Hannu 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 303 KB

[Lecture Notes in Computer Science] Data

✍ Kambayashi, Yahiko; Winiwarter, Werner; Arikawa, Masatoshi 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 142 KB

[Lecture Notes in Computer Science] Prin

✍ Elomaa, Tapio; Mannila, Heikki; Toivonen, Hannu 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 374 KB

[Lecture Notes in Computer Science] Prin

✍ Elomaa, Tapio; Mannila, Heikki; Toivonen, Hannu 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 374 KB