93 search results - page 9 / 19 » Fast and Efficient Total Exchange on Two Clusters |
104
click to vote
CIDM
2007
IEEE
15 years 1 months ago
2007
IEEE
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
AAAI
2010
14 years 11 months ago
2010
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a genetic algorithm (GA) for Kmeans clustering. Instead of the widely applied stringof-group-numbers encoding, we encode the prototypes of the clusters into th...
76
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...