remove answers

Author: fbkarsdorp

Chapter 10 - Learning without Supervision.ipynb

@@ -1,7 +1,7 @@
 {
  "metadata": {
   "name": "",
-  "signature": "sha256:4a735510c93747b11ebb86855c4f985cce0023c63086b07a69dc1e0d784b3667"
+  "signature": "sha256:d0a528bc10b3bb6717a054cfee3f7306cf4daa84f567a233c234843c5cfe34dd"
  },
  "nbformat": 3,
  "nbformat_minor": 0,
@@ -333,8 +333,6 @@
      "input": [
       "def jaccard_distance(a, b):\n",
       "    # insert your code here\n",
-      "    union_len = len(a.union(b))\n",
-      "    return (union_len - len(a.intersection(b))) / union_len\n",
       "\n",
       "# these tests should return True if your code is correct\n",
       "print(jaccard_distance({'a', 'b', 'c'}, {'b', 'c', 'a'}) == 0.0)\n",
@@ -357,13 +355,6 @@
      "input": [
       "def pairwise_distances(X, distance_fn=jaccard_distance):\n",
       "    # insert your code here\n",
-      "    n = len(X)\n",
-      "    distances = [[0 for i in range(n)] for _ in range(n)]\n",
-      "    for i in range(n):\n",
-      "        for j in range(i):\n",
-      "            distances[i][j] = distance = distance_fn(X[i], X[j])\n",
-      "            distances[j][i] = distance\n",
-      "    return distances\n",
       "\n",
       "# these tests should return True if your code is correct\n",
       "X = [{'a', 'f', 'c'}, {'b', 'd', 'a'}, {'a', 'b', 'c'}, {'f', 'b', 'c'}]\n",
@@ -391,7 +382,6 @@
       "\n",
       "def smallest_distance(dm):\n",
       "    # insert your code here\n",
-      "    return min(combinations(range(len(dm)), 2), key=lambda i: dm[i[0]][i[1]])\n",
       "\n",
       "# these tests should return True if your code is correct\n",
       "distances = [[0, 1, 2, 3, 3, 2],\n",
@@ -540,9 +530,6 @@
       "    \n",
       "    def merge(self, i, j):\n",
       "        # insert your code here\n",
-      "        self._clusters[i] = Cluster(self._n, self._clusters[i], self._clusters[j])\n",
-      "        self._n += 1\n",
-      "        del self._clusters[j]\n",
       "    \n",
       "    def __str__(self):\n",
       "        return '%s' % self._clusters[0]\n",
@@ -659,13 +646,6 @@
      "input": [
       "def single_linkage(dm, i, j):\n",
       "    # insert your code here\n",
-      "    for k in range(len(dm)):\n",
-      "        if k != i and k != j:\n",
-      "            dm[i][k] = distance = min(dm[i][k], dm[j][k])\n",
-      "            dm[k][i] = distance\n",
-      "    dm = [[val for c, val in enumerate(row) if c != j] \n",
-      "               for r, row in enumerate(dm) if r != j]\n",
-      "    return dm\n",
       "\n",
       "# these tests should return True if your code is correct\n",
       "\n",
@@ -699,18 +679,18 @@
      "input": [
       "def cluster(data_points, labels=None, linkage=single_linkage, distance_fn=jaccard_distance):\n",
       "    # initialize a `ClusterTree` with n=len(data_points)\n",
-      "    tree = ClusterTree(len(data_points), labels=labels)\n",
+      "    tree = # insert your code here\n",
       "    # compute the pairwise distances between all data points \n",
       "    # using the provided distance function\n",
-      "    dm = pairwise_distances(data_points, distance_fn=distance_fn) # insert your code here\n",
+      "    dm = # insert your code here\n",
       "    while len(dm) > 1:\n",
       "        # extract the indices of the clusters corresponding to the \n",
       "        # two closest clusters in the distance matrix\n",
-      "        i, j = smallest_distance(dm) # insert your code here\n",
+      "        i, j = # insert your code here\n",
       "        # update the distance matrix using the provided linkage function\n",
-      "        dm = linkage(dm, i, j) # insert your code here\n",
+      "        dm = # insert your code here\n",
       "        # merge the two clusters in the ClusterTree:\n",
-      "        tree.merge(i, j) # insert your code here\n",
+      "        # insert your code here\n",
       "    return tree\n",
       "\n",
       "# these tests should return True if your code is correct\n",
@@ -807,7 +787,6 @@
      "input": [
       "def complete_linkage(dm, i, j):\n",
       "    # insert your code here\n",
-      "    return general_linkage(dm, i, j, max)\n",
       "\n",
       "# these tests should return True if your code is correct\n",
       "\n",
@@ -926,7 +905,6 @@
      "input": [
       "def summed_jaccard_distance(A, B):\n",
       "    # insert your code here\n",
-      "    return sum(jaccard_distance(set(list(a)), set(list(b))) for a, b in zip(A, B))\n",
       "\n",
       "# these tests should return True if your code is correct\n",
       "print(round(summed_jaccard_distance(numerals[0], numerals[4]), 2) == 5.57)\n",
@@ -947,8 +925,7 @@
      "cell_type": "code",
      "collapsed": false,
      "input": [
-      "solution = cluster(numerals, labels=languages, \n",
-      "                   distance_fn=summed_jaccard_distance) # insert your code here\n",
+      "solution = # insert your code here\n",
       "print(solution)"
      ],
      "language": "python",