Sciweavers

83 search results - page 6 / 17
» Scalable Clustering Algorithms with Balancing Constraints
Sort
View
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 8 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
TKDE
2012
245views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
CCGRID
2010
IEEE
13 years 5 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...
PDCAT
2004
Springer
14 years 1 months ago
Parallel Computing Platform for the Agent-Based Modeling of Multicellular Biological Systems
Abstract. Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers, such as Beowulf-style clusters. We de...
Toh Da-Jun, Francis Tang, Travis Lee, Deepak Sarda...
ICPR
2008
IEEE
14 years 2 months ago
Kernel Bisecting k-means clustering for SVM training sample reduction
This paper presents a new algorithm named Kernel Bisecting k-means and Sample Removal (KBK-SR) as a sampling preprocessing for SVM training to improve the scalability. The novel c...
Xiao-Zhang Liu, Guo-Can Feng