Sciweavers

5046 search results - page 60 / 1010
» Non-redundant data clustering
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 3 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
HAIS
2011
Springer
14 years 9 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...
SSPR
1998
Springer
15 years 10 months ago
Distribution Free Decomposition of Multivariate Data
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
Dorin Comaniciu, Peter Meer
DASFAA
2008
IEEE
118views Database» more  DASFAA 2008»
16 years 20 days ago
RAIN: Always on Data Warehousing
Abstract. The Redundant Arrays of Inexpensive DWS Nodes (RAIN) technique is a node-level data replication approach that introduces failover capabilities to DWS (Data Warehouse Stri...
Jorge Vieira, Marco Vieira, Marco Costa, Henrique ...
SCCC
2005
IEEE
15 years 11 months ago
A geometric framework to visualize fuzzy-clustered data
— Fuzzy clustering methods have been widely used in many applications. These methods, including fuzzy k-means and Expectation Maximization, allow an object to be assigned to mult...
Yuanquan Zhang, Luis Rueda