Sciweavers

SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 6 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
SDM
2003
SIAM
121views Data Mining» more  SDM 2003»
13 years 6 months ago
Dynamic Classification of Online Customers
Dimitris Bertsimas, Adam J. Mersereau, Nitin R. Pa...
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
13 years 6 months ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 6 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar