<--- Back to Details
First PageDocument Content
Computational statistics / Statistics / Mathematics / K-means clustering / Hierarchical clustering / Cluster analysis / Image segmentation / K-means++ / Greedy algorithm / K-medians clustering / Data stream clustering / Determining the number of clusters in a data set
Date: 2015-03-04 17:02:48
Computational statistics
Statistics
Mathematics
K-means clustering
Hierarchical clustering
Cluster analysis
Image segmentation
K-means++
Greedy algorithm
K-medians clustering
Data stream clustering
Determining the number of clusters in a data set

Decision-theoretic Clustering of Strategies

Add to Reading List

Source URL: poker.cs.ualberta.ca

Download Document from Source Website

File Size: 421,37 KB

Share Document on Facebook

Similar Documents

Greedy algorithm for large scale Nonnegative matrix/tensor decomposition ✦

DocID: 1tDWz - View Document

The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗

DocID: 1sdbY - View Document

Wireless networking / Computing / Wireless ad hoc network / Network architecture / Routing / Algorithm / Maximum-Residual Multicast Protocol / Greedy Perimeter Stateless Routing in Wireless Networks

Prof. Dr. Roger Wattenhofer phone +fax +Diploma/Master’s Thesis “Comparison of Ad Hoc Routing Algorithms”

DocID: 1rmcF - View Document

Artificial intelligence / Mathematics / Numerical analysis / Neuropsychology / Problem solving / Greedy algorithm / Means-ends analysis / Heuristic / Decomposition method / Andor tree

Advances in Cognitive SystemsSubmitted; publishedVariations on a Theory of Problem Solving Pat Langley

DocID: 1r7U5 - View Document

Mathematics / Game theory / Algorithm / Mathematical logic / Theoretical computer science / Greedy algorithm / Mechanism design / Nash equilibrium

Mechanism Design by Creditability? Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich, Switzerland Abstract. This paper attends to the pro

DocID: 1qYO3 - View Document