Sciweavers

1390 search results - page 101 / 278
» Self-Sizing of Clustered Databases
Sort
View
IDEAS
2006
IEEE
218views Database» more  IDEAS 2006»
14 years 3 months ago
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudh...
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
14 years 2 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
ISCIS
2005
Springer
14 years 2 months ago
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
Margarida Mamede
ICDE
2002
IEEE
146views Database» more  ICDE 2002»
14 years 10 months ago
Streaming-Data Algorithms for High-Quality Clustering
Streaming data analysis has recently attracted attention in numerous applications including telephone records, web documents and clickstreams. For such analysis, single-pass algor...
Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani,...
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 3 months ago
ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
In order to establish consolidated standards in novel data mining areas, newly proposed algorithms need to be evaluated thoroughly. Many publications compare a new proposition – ...
Elke Achtert, Hans-Peter Kriegel, Arthur Zimek