Skip to content
Exit presentation

Programming + AI Capstone

See the board

Before the classifier is written, the answer can be seen. A classifier is a program that gives each kite a word. The register is our list of judged kites. Each carries the word a judge gave it. A picture of the register can show the answer before code runs.

Two register examples on the board, each carrying a word.
Step 1 of 5
  1. Two register examples on the board, each carrying a word.
  2. A new kite, A1, checks in at 3 span, 4 tail.
  3. Measure to R1: gap 1 across, 1 up — squared distance 2.
  4. Measure to R5: gap 4 across, 0 up — squared distance 16. Farther.
  5. R1 is nearest. Its word, steady, is the answer.

The rule

Every kite is one point by its two measurements. The nearest example is the one measuring least. Seeing the nearest one shows the reason for its word.

  • Point — one kite, placed by its span and its tail.
  • Nearest — the example with the smallest squared distance, measured, not guessed.

In the picture above, a circle is a steady example. A triangle is a dancer example. A ring marks the kite being measured. In the lab, a dot marks an example. An o marks today's kite. An x marks the nearest example. The lab also writes each word in text.

Tap a kite from today's list. Find its nearest example.

Loading lab…

The lab measures every squared distance and marks the nearest example.

Jump to lesson

This track

  1. 0 Start here
  2. 1 The plan, in plain words
  3. 2 Collect the day
  4. 3 The distance between two
  5. 4 See the board
  6. 5 Write the classifier
  7. 6 When the nearest is wrong
  8. 7 Assemble and report
  9. 8 Who it gets wrong
  10. 9 The big picture
  11. 10 Track quiz

Other tracks