Sciweavers

33 search results - page 2 / 7
» A Scalable Parallel Algorithm for Self-Organizing Maps with ...
Sort
View
ICPP
2000
IEEE
13 years 9 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
ICDM
2008
IEEE
141views Data Mining» more  ICDM 2008»
13 years 11 months ago
Scalable Tensor Decompositions for Multi-aspect Data Mining
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...
Tamara G. Kolda, Jimeng Sun
IPPS
2009
IEEE
13 years 12 months ago
Multi-dimensional characterization of temporal data mining on graphics processors
Through the algorthmic design patterns of data parallelism and task parallelism, the graphics processing unit (GPU) offers the potential to vastly accelerate discovery and innovat...
Jeremy S. Archuleta, Yong Cao, Thomas Scogland, Wu...
EUROPAR
1998
Springer
13 years 9 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 7 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...