Sciweavers

29 search results - page 6 / 6
» Improving Parallel Ordering of Sparse Matrices Using Genetic...
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
ICPP
1995
IEEE
13 years 9 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
FTTCS
2006
132views more  FTTCS 2006»
13 years 6 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
EPIA
2009
Springer
13 years 10 months ago
Item-Based and User-Based Incremental Collaborative Filtering for Web Recommendations
Abstract. In this paper we propose an incremental item-based collaborative filtering algorithm. It works with binary ratings (sometimes also called implicit ratings), as it is typi...
Catarina Miranda, Alípio Mário Jorge