Sciweavers

1061 search results - page 2 / 213
» Massive Data Pre-Processing with a Cluster Based Approach
Sort
View
ICPP
2000
IEEE
13 years 10 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary

Publication
197views
12 years 1 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
PAMI
2010
119views more  PAMI 2010»
13 years 3 months ago
Efficient Multilevel Eigensolvers with Applications to Data Analysis Tasks
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
Dan Kushnir, Meirav Galun, Achi Brandt
CIARP
2004
Springer
13 years 11 months ago
Parallel Algorithm for Extended Star Clustering
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of do...
Reynaldo Gil-García, José Manuel Bad...
CIKM
2010
Springer
13 years 4 months ago
Identifying hotspots on the real-time web
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...
Krishna Yeswanth Kamath, James Caverlee