Sciweavers

5046 search results - page 349 / 1010
» Non-redundant data clustering
Sort
View
IPPS
2000
IEEE
15 years 11 months ago
Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architec...
Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennet...
CANDC
2006
ACM
15 years 6 months ago
Identification of functional modules in a PPI network by clique percolation clustering
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
Shi-Hua Zhang, Xue-Mei Ning, Xiang-Sun Zhang
PRL
2007
150views more  PRL 2007»
15 years 6 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
BMCBI
2005
161views more  BMCBI 2005»
15 years 6 months ago
Non-linear mapping for exploratory data analysis in functional genomics
Background: Several supervised and unsupervised learning tools are available to classify functional genomics data. However, relatively less attention has been given to exploratory...
Francisco Azuaje, Haiying Wang, Alban Chesneau
WWW
2010
ACM
16 years 1 months ago
Mind the data skew: distributed inferencing by speeddating in elastic regions
Semantic Web data exhibits very skewed frequency distributions among terms. Efficient large-scale distributed reasoning methods should maintain load-balance in the face of such hi...
Spyros Kotoulas, Eyal Oren, Frank van Harmelen