Sciweavers

4124 search results - page 334 / 825
» Improved Algorithms for Data Migration
Sort
View
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
16 years 5 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
192
Voted
CSIE
2009
IEEE
15 years 9 months ago
K-Means on Commodity GPUs with CUDA
K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, whi...
Hong-tao Bai, Li-li He, Dan-tong Ouyang, Zhan-shan...
ICCV
2009
IEEE
15 years 2 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
ICDE
1999
IEEE
139views Database» more  ICDE 1999»
16 years 6 months ago
Clustering Large Datasets in Arbitrary Metric Spaces
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehr...
AIRS
2004
Springer
15 years 10 months ago
Document Clustering Using Linear Partitioning Hyperplanes and Reallocation
This paper presents a novel algorithm for document clustering based on a combinatorial framework of the Principal Direction Divisive Partitioning (PDDP) algorithm [1] and a simpli...
Canasai Kruengkrai, Virach Sornlertlamvanich, Hito...