✦ LIBER ✦

Nearly exact mining of frequent trees in large networks

✍ Scribed by Ashraf M. Kibriya, Jan Ramon

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Mach

✍ Flach, Peter A.; De Bie, Tijl; Cristianini, Nello 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 313 KB

Mining frequent tree-like patterns in la

✍ Tzung-Shi Chen; Shih-Chun Hsu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A scalable method for identifying freque

✍ Avinash Ramu, Tamer Kahveci, J Gordon Burleigh 📂 Article 📅 2012 🏛 BioMed Central 🌐 English ⚖ 303 KB

[Lecture Notes in Computer Science] Adva

✍ Pei, Jian; Tseng, Vincent S.; Cao, Longbing; Motoda, Hiroshi; Xu, Guandong 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 304 KB

Exact boundary observability of unsteady

✍ Qilong Gu; Tatsien Li 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

Visual mining of moving flock patterns i

✍ Turdukulov, Ulanbek; Calderon Romero, Andres Oswaldo; Huisman, Otto; Retsios, Va 📂 Article 📅 2014 🏛 Taylor and Francis Group 🌐 English ⚖ 441 KB