Scaling mining algorithms to large databases

Paul Bradley; Johannes Gehrke; Raghu Ramakrishnan; Ramakrishnan Srikant

doi:10.1145/545151.545176

Communications of the ACM

Paper

01 Jan 2002

Scaling mining algorithms to large databases

View publication

Abstract

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

Paper

Serving Deep Learning Models with Deduplication from Relational Databases

Lixi Zhou, Jiaqing Chen, et al.

VLDB

Paper

CODS: Evolving data efficiently and scalably in column oriented databases

Ziyang Liu, Sivaramakrishnan Natarajan, et al.

VLDB

Paper

On sparse evaluation representations

G. Ramalingam

Theoretical Computer Science

Conference paper

A component by component listening test analysis of the IBM trainable speech synthesis system

Robert E. Donovan

INTERSPEECH - Eurospeech 2001

View all publications

Abstract

Related

Serving Deep Learning Models with Deduplication from Relational Databases

CODS: Evolving data efficiently and scalably in column oriented databases

On sparse evaluation representations

A component by component listening test analysis of the IBM trainable speech synthesis system