Sciweavers

2228 search results - page 66 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
152
Voted
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 6 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
180
Voted
AUSDM
2006
Springer
124views Data Mining» more  AUSDM 2006»
15 years 9 months ago
Analyzing Harmonic Monitoring Data Using Data Mining
Harmonic monitoring has become an important tool for harmonic management in distribution systems. A comprehensive harmonic monitoring program has been designed and implemented on ...
Ali Asheibi, David Stirling, Danny Soetanto
157
Voted
SRDS
2008
IEEE
16 years 15 days ago
Probabilistic Failure Detection for Efficient Distributed Storage Maintenance
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
Jing Tian, Zhi Yang, Wei Chen, Ben Y. Zhao, Yafei ...
ICDM
2009
IEEE
188views Data Mining» more  ICDM 2009»
15 years 3 months ago
Binomial Matrix Factorization for Discrete Collaborative Filtering
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
Jinlong Wu
ICASSP
2011
IEEE
14 years 9 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus