<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
  <title>CompClust - Choose Algorithm</title>
  <link rel="stylesheet" href="/compclust_css" type="text/css"
	  tal:attributes="href compclust_css" />
</head>
<body>
<span id="compclustMenu" tal:replace="structure menu"/>
<div id="compclustBody">
<h1><a href="#instructions">Select a clustering algorithm</a></h1>
<div tal:condition="subalgorithm_names">
<p tal:content="subalgorithm_names">
</p>
</div>
<p>
<table class="clustering" width="60%">
  <thead >
    <tr>
      <td>Clustering Algorithms</td>
    </tr>
  </thead>
  <tbody>
  <tr tal:repeat="algorithm simple_algorithms">
    <td>
      <a href="" tal:attributes="href algorithm/href" tal:content="algorithm/name">
        dataset name
      </a>
    </td>
    <!-- td tal:content="algorithm/composable"></td -->
  </tr>
  </tbody>
</table>
</p>
<hr/>
<p>Composable algorithms make it possible to perform parameter sweeps over regular clustering algorithms. When you choose a composable algorithm, you'll return to this page, so you can build a complex chain of composable algorithms that is finalized by simple algorithm. Once you finalize it with a simple algorithm, you will then be presented with a page allowing you to set all the parameters for these algorithms.
</p>
<p>
<table>
  <thead >
    <tr>
      <td>Composable Clustering Algorithms</td>
    </tr>
  </thead>
  <tbody>
  <tr tal:repeat="algorithm composable_algorithms">
    <td>
      <a href="" tal:attributes="href algorithm/href" tal:content="algorithm/name">
      dataset name
      </a>
    </td>
  </tr>
  </tbody>
</table>
</p>
<hr/>
<h1><a name="instructions">Instructions</a></h1>
<p>
Here you can start to create a clustering algorithm
run. You can go directly to a non-composable algorithm if you want to
run a clustering algorithm with a known set of specific paramters.
</p>
<p>
The composable algorithms are used to do various types of parameter
sweeps over a non-composable clustering algorithm. For instance
MultiRun or MCCV can search over a set of values for k, and will
attempt to select the one the that produces the most likely model.
</p>
</div>
</body>
</html>
