Sciweavers

45 search results - page 2 / 9
» A Scalable Parallel Subspace Clustering Algorithm for Massiv...
Sort
View
DATAMINE
1999
140views more  DATAMINE 1999»
13 years 4 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
ESANN
2008
13 years 6 months ago
Parallelizing single patch pass clustering
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
Nikolai Alex, Barbara Hammer
SEMWEB
2009
Springer
13 years 11 months ago
Parallel Materialization of the Finite RDFS Closure for Hundreds of Millions of Triples
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
Jesse Weaver, James A. Hendler
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 2 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
CIKM
2009
Springer
13 years 9 months ago
Query processing of massive trajectory data based on mapreduce
With the development of positioning technologies and the boosting deployment of inexpensive location-aware sensors, large volumes of trajectory data have emerged. However, efficie...
Qiang Ma, Bin Yang 0002, Weining Qian, Aoying Zhou