Tuesday, February 12, 2008

Nerds

Tonight one of my friends said that she's the biggest nerd that she knows. As a rebuttal, I'd like to present the first few lines of a paper that I turned in for a class yesterday:
Decision trees are simple models for multi-class classification problems. A decision tree classifies a vector of mixed discrete and/or continuous features by examining the most discriminative feature at each step, narrowing down the classification possibilities until only one remains.

Decision trees can be inferred from labeled data using supervised machine learning. Trees can optionally be pruned to correct for overfitting and thus improve their ability to generalize to unseen data.
So there. :)

5 comments:

arkangel said...

Crap... what does that mean if I understood most of that? Crap...

Bruce said...

You should probably get some help.

Barney Lund said...

Nerd. :) But in a good way.

Alex said...

So if I understood all of it, I should definitely seek help?

Cindy said...

Wow, what a nerd.

I wish I were a nerd. Then maybe I'd have an internship with Apple.