1628 search results - page 89 / 326 » Partitioning Sets with Genetic Algorithms |
117
click to vote
PAKDD
2010
ACM
15 years 1 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
MCS
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
EUROPAR
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
STOC
2001
ACM
15 years 11 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
180
click to vote
ICDE
2007
IEEE
16 years 18 days ago
2007
IEEE
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...