Scaling EM (Expectation-Maximization) Clustering to Large Databases (1999)
Paul S. Bradley, Usama M. Fayyad, Cory A. Reina, P. S. Bradley, Usama Fayyad, Cory Reina
Practical statistical clustering algorithms typically center upon an iterative refinement optimization procedure to compute a locally optimal clustering solution that maximizes the fit to data. These...
Mathematical Programming Approaches to Machine Learning and Data Mining (1998)
Machine learning problems of supervised classification, unsupervised clustering and parsimonious approximation are formulated as mathematical programs. The feature selection problem arising in the...
Scaling Clustering Algorithms to Large Databases (1998)
Paul S. Bradley, Bradley Usama Fayyad, Cory A. Reina, P. S. Bradley, Usama Fayyad, Cory Reina
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clustering framework...
Refining Initial Points for K-Means Clustering (1998)
Bradley Microsoft, Paul S. Bradley, P. S. Bradley, Usama M. Fayyad, Usama M. Fayyad
Practical approaches to clustering use an iterative procedure (e.g. K-Means, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive...
Initialization of Iterative Refinement Clustering Algorithms (1998)
Usama M. Fayyad, Cory A. Reina, Paul S. Bradley, Usama Fayyad, Cory Reina, P. S. Bradley
Iterative refinement clustering algorithms (e.g. K-Means, EM) converge to one of numerous local minima. It is known that they are especially sensitive to initial conditions. We present a procedure...
Initialization of iterative refinement clustering algorithms (1998)
Usama M. Fayyad, Cory A. Reina, Paul S. Bradley
Iterative refinement clustering algorithms (e.g. K-Means, EM) converge to one of numerous local minima. It is known that they are especially sensitive to initial conditions. We present a procedure...
Compressed Data Cubes for OLAPAggregate Query Approximation on Continuous Dimensions (1988)
Usama M. Fayyad, Paul S. Bradley, Jayavel Shanmugasundaram Usama, Jayavel Shanmugasundaram, Usama Fayyad, P. S. Bradley
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answered by pre-computing...