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

Combining lexical, syntactic, and semantic features with maximum entropy models for extracting relations

Nanda Kambhatla

ACL 2004

Paper

Marketing event optimization

David A. Selby

IBM J. Res. Dev

Paper

Tight bounds for delay-sensitive aggregation

Yvonne Anne Pignolet, Stefan Schmid, et al.

Discrete Mathematics and Theoretical Computer Science

View all publications

Abstract

Related

Magic Conditions

Combining lexical, syntactic, and semantic features with maximum entropy models for extracting relations

Marketing event optimization

Tight bounds for delay-sensitive aggregation