25041 search results - page 183 / 5009 » Algorithms for Clustering Data |
SADM
2008
13 years 9 months ago
2008
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
CIC
2003
13 years 11 months ago
2003
Using off-the-shelf commodity workstations to build a cluster for parallel computing has become a common practice. In studying or designing a cluster of workstations one should ha...
QSIC
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper proposes a stochastic voting for testing a large number of Web Services (WS) under group testing. In the future, a large number of WS will be available and they need to...
BMCBI
2008
13 years 9 months ago
2008
Background: Non-homology based methods such as phylogenetic profiles are effective for predicting functional relationships between proteins with no considerable sequence or struct...
SYNASC
2006
IEEE
14 years 3 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...