Sciweavers

652 search results - page 33 / 131
» Accelerated EM-based clustering of large data sets
Sort
View
ICDCS
2006
IEEE
14 years 2 months ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
PAMI
2011
13 years 2 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
IASSE
2004
13 years 9 months ago
A Model for Multi-relational Data Mining on Demand Forecasting
Accurate demand forecasting remains difficult and challenging in today's competitive and dynamic business environment, but even a little improvement in demand prediction may ...
Qin Ding, Bhavin Parikh
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 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
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 5 months ago
Efficient Nonnegative Matrix Factorization with Random Projections
The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical...
Fei Wang, Ping Li