Sciweavers

2228 search results - page 111 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
213
Voted
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 10 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
CCGRID
2003
IEEE
16 years 1 days ago
Leveraging Non-Uniform Resources for Parallel Query Processing
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...
Tobias Mayr, Philippe Bonnet, Johannes Gehrke, Pra...
TDSC
2010
218views more  TDSC 2010»
15 years 5 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
TKDE
1998
111views more  TKDE 1998»
15 years 6 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
NIPS
2001
15 years 8 months ago
Model Based Population Tracking and Automatic Detection of Distribution Changes
Probabilistic mixture models are used for a broad range of data analysis tasks such as clustering, classification, predictive modeling, etc. Due to their inherent probabilistic na...
Igor V. Cadez, Paul S. Bradley