Skip to content
This repository was archived by the owner on Mar 8, 2021. It is now read-only.

Commit a80069e

Browse files
committed
correct the path of the images
1 parent 7981b50 commit a80069e

File tree

2 files changed

+5
-5
lines changed

2 files changed

+5
-5
lines changed

answerbook/Chapter 10 - Learning without Supervision.ipynb

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
{
22
"metadata": {
33
"name": "",
4-
"signature": "sha256:caf39a94b435791ab9dd1d40c5df8860ec234626e7807676f49efbe17774d245"
4+
"signature": "sha256:9c31d4909f7a04f8442b78603fe80db9775dbb99884012c0b4bf1550b28c3296"
55
},
66
"nbformat": 3,
77
"nbformat_minor": 0,
@@ -34,7 +34,7 @@
3434
"cell_type": "markdown",
3535
"metadata": {},
3636
"source": [
37-
"<img src=\"images/cluster.png\" alt=\"cluster\" style=\"width: 280px;\" align=\"right\"/>\n",
37+
"<img src=\"../images/cluster.png\" alt=\"cluster\" style=\"width: 280px;\" align=\"right\"/>\n",
3838
"In the previous chapter we have developed a system that on the basis of examples attempts to learn a function to classify new, unseen examples. Not always do we have the luxury of a labeled data set. In fact, most of the time only unlabeled data is available. In unsupervized machine learning, or learning without supervision, we attempt the create systems that detect patterns in our data, such as groupings or clusters. Given a collection of texts, we could for example try to measure the pairwise distances between all texts and given these distances construct a grouping of the texts. Another example of unsupervized learning is the popular method of *Topic Modeling* in which we attempt to find clusters of semantically coherent words that together form a topic. \n",
3939
"\n",
4040
"In this chapter we will introduce you to some of the techniques to cluster you data without supervision. As is the case with supervized learning, there are many different approaches to clustering. We will discuss one of the most popular ones: hierachical agglomerative clustering. We will develop a general hierarchical cluster module and implement a number of different cluster procedures. "

answerbook/Chapter 8 - PDF Search App.ipynb

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
{
22
"metadata": {
33
"name": "",
4-
"signature": "sha256:dcdba69db234cd8913545a98286261afa03d1e21d84c5cab59303976d9d231a8"
4+
"signature": "sha256:3c716f8ad6cb53c8c995702858536e09aa15e809dd714d867121fd43a04d38ee"
55
},
66
"nbformat": 3,
77
"nbformat_minor": 0,
@@ -36,11 +36,11 @@
3636
"source": [
3737
"Our Information Retrieval system of the previous chapter is simple and also quite efficient, but it lacks many features of a full-blown search engine. One particular downside of the system is that it stores the index in RAM memory. This means that either we have to keep it there or we have to rebuild the index each time we would like to search through a particular collection. We could try to improve our system, but there are some excellent Python packages for Information Retrieval and search engines, we could use. In this section we will explore one of them, called [Whoosh](http://whoosh.readthedocs.org/en/latest/), a search engine and retrieval system written in pure Python. \n",
3838
"\n",
39-
"![whoosh](files/images/whoosh_logo.png)\n",
39+
"![whoosh](../files/images/whoosh_logo.png)\n",
4040
"\n",
4141
"Ever since science-journal giant Elsevier bought the once so promising bibliography management software [Mendeley](http://www.mendeley.com/), I have looked for alternative ways to manage my research PDF collection. For me, one of the most important features of a PDF management tool is to be able to do full text search in the PDFs for the content I am interested in. Uptill today I have not found a tool that fulfills all my needs, so we are going to build one ourselves. We will develop a full-blown search using Whoosh. We'll build a web interface on top of [Flask](http://flask.pocoo.org/) to query our search engine in a user-friendly way. Just to tease you a bit: this is what our search engine will look like:\n",
4242
"\n",
43-
"![pydf](files/images/pydf.png)\n",
43+
"![pydf](../files/images/pydf.png)\n",
4444
"\n",
4545
"This chapter is the first in a series of more practical chapters, in which we will build actual applications ready for use by end-users. You won't be learning many new programming techniques in this chapter, but we will introduce you to a large number of modules and packages that are available either in the standard library of Python or as third-party packages. The most important take-home message is that if you think about implementing a piece of software, the first thing you should do, is check whether someone else hasn't done it before you. Chances are good that someone has, and she or he probably has done a better job. \n",
4646
"\n",

0 commit comments

Comments
 (0)