Sciweavers

679 search results - page 38 / 136
» Scaling Clustering Algorithms to Large Databases
Sort
View
JUCS
2002
131views more  JUCS 2002»
13 years 8 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 9 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 2 months ago
Outlier Detection for Fine-grained Load Balancing in Database Clusters
Recent industry trends towards reducing the costs of ownership in large data centers emphasize the need for database system techniques for both automatic performance tuning and ef...
Jin Chen, Gokul Soundararajan, Madalin Mihailescu,...
IPPS
2009
IEEE
14 years 3 months ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 8 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...