Sciweavers

1971 search results - page 199 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
162
Voted
DAWAK
2003
Springer
15 years 12 months ago
Fighting Redundancy in SQL
Abstract. Many SQL queries with aggregated subqueries exhibit redundancy (overlap in FROM and WHERE clauses). We propose a method, called the for-loop, to optimize such queries by ...
Antonio Badia, Dev Anand
DAGSTUHL
2009
15 years 7 months ago
Learning Highly Structured Manifolds: Harnessing the Power of SOMs
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
Erzsébet Merényi, Kadim Tasdemir, Li...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
WSOM
2009
Springer
16 years 1 months ago
Analytic Comparison of Self-Organising Maps
Abstract. SOMs have proven to be a very powerful tool for data analysis. However, comparing multiple SOMs trained on the same data set using different parameters or initialisation...
Rudolf Mayer, Robert Neumayer, Doris Baum, Andreas...
HAIS
2011
Springer
14 years 10 months ago
Clustering Ensemble for Spam Filtering
One of the main problems that modern e-mail systems face is the management of the high degree of spam or junk mail they recieve. Those systems are expected to be able to distinguis...
Santiago Porras, Bruno Baruque, Belén Vaque...