Sciweavers

679 search results - page 27 / 136
» Scaling Clustering Algorithms to Large Databases
Sort
View
JDCTA
2010
152views more  JDCTA 2010»
13 years 3 months ago
Spatial Clustering Algorithm Based on Hierarchical-Partition Tree
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Zhongzhi Li, Xuegang Wang
ICAC
2005
IEEE
14 years 2 months ago
Feedback-based Scheduling for Back-end Databases in Shared Dynamic Content Server Clusters
This paper introduces a self-configuring architecture for scaling the database tier of dynamic content web servers. We use a unified approach to load and fault management based ...
Gokul Soundararajan, Kaloian Manassiev, Jin Chen, ...
ADC
2006
Springer
120views Database» more  ADC 2006»
14 years 2 months ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
CVPR
1998
IEEE
14 years 10 months ago
Image Indexing and Retrieval Based on Human Perceptual Color Clustering
We propose a new image retrieval method based on human perceptual clustering of color images. This color clustering produces for each image a small set of representative colors wh...
Yihong Gong, Guido Proietti, Christos Faloutsos
JASIS
2007
122views more  JASIS 2007»
13 years 8 months ago
Exploiting parallelism to support scalable hierarchical clustering
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
Rebecca Cathey, Eric C. Jensen, Steven M. Beitzel,...