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

Magic Conditions

Inderpal Singh Mumick, Sheldon J. Finkelstein, et al.

ACM TODS

Conference paper

Discourse segmentation in aid of document summarization

B.K. Boguraev, Mary S. Neff

HICSS 2000

Conference paper

Compression for data archiving and backup revisited

Corneliu Constantinescu

SPIE Optical Engineering + Applications 2009

Paper

Learning and generalization with the information bottleneck

Ohad Shamir, Sivan Sabato, et al.

Theoretical Computer Science

View all publications

Abstract

Related

Magic Conditions

Discourse segmentation in aid of document summarization

Compression for data archiving and backup revisited

Learning and generalization with the information bottleneck