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?

Conference paper

Using simulation-based stochastic approximation to optimize staffing of systems with skills-based-routing

Zohar Feldman, Avishai Mandelbaum

WSC 2010

Paper

Evolutionary scheduling of dynamic multitasking workloads for big-data analytics in elastic cloud

Fan Zhang, Junwei Cao, et al.

IEEE TETC

Conference paper

Better on wafer performance and mask manufacturability of contacts with no or non-traditional serifs

Donald Samuels, Ian Stobert

SPIE Photomask Technology + EUV Lithography 2007

Paper

Event monitoring and service in a flat world benefits and challenges

Thomas M. Cheng

IT Professional

View all publications

Abstract

Related

Using simulation-based stochastic approximation to optimize staffing of systems with skills-based-routing

Evolutionary scheduling of dynamic multitasking workloads for big-data analytics in elastic cloud

Better on wafer performance and mask manufacturability of contacts with no or non-traditional serifs

Event monitoring and service in a flat world benefits and challenges