๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

ExpressionBlast: mining large, unstructured expression databases

โœ Scribed by Zinman, Guy E; Naiman, Shoshana; Kanfi, Yariv; Cohen, Haim; Bar-Joseph, Ziv

Book ID
121254138
Publisher
Nature Publishing Group
Year
2013
Tongue
English
Weight
184 KB
Volume
10
Category
Article
ISSN
1552-4450

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scaling mining algorithms to large datab
Scaling mining algorithms to large databases
โœ Bradley, Paul; Gehrke, Johannes; Ramakrishnan, Raghu; Srikant, Ramakrishnan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 112 KB
Scaling mining algorithms to large datab
Scaling mining algorithms to large databases
โœ Bradley, Paul; Gehrke, Johannes; Ramakrishnan, Raghu; Srikant, Ramakrishnan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 112 KB

Which insights about data structure make it possible to analyze the very large databases collected by Internet, business, scientific, and government applications?

Incremental mining of sequential pattern
Incremental mining of sequential patterns in large databases
โœ Florent Masseglia; Pascal Poncelet; Maguelonne Teisseire ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 568 KB

In this paper, we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the