Sciweavers

960 search results - page 64 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
15 years 9 months ago
Scalable Model-based Clustering by Working on Data Summaries
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
Huidong Jin, Man Leung Wong, Kwong-Sak Leung
VLSISP
2011
358views Database» more  VLSISP 2011»
14 years 10 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...
170
Voted
ECCV
2008
Springer
16 years 5 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
PODS
2005
ACM
86views Database» more  PODS 2005»
16 years 4 months ago
Multi-structural databases
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasm...
CIKM
2009
Springer
15 years 8 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...