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?

Invited paper

Software Services Engineering Manifesto – A Cross-Cutting Declaration

Workshop paper

Privacy-preserving record linkage using local sensitive hash and private set intersection

Conference paper

Delivering Document Conversion as a Cloud Service with High Throughput and Responsiveness

Conference paper

FETA: Towards Specializing Foundational Models for Expert Task Applications

View all publications

Abstract

Related

Software Services Engineering Manifesto – A Cross-Cutting Declaration

Privacy-preserving record linkage using local sensitive hash and private set intersection

Delivering Document Conversion as a Cloud Service with High Throughput and Responsiveness

FETA: Towards Specializing Foundational Models for Expert Task Applications