A course in Machine Learning. Daume III, H chapter, 2012.
abstract   bibtex   
So far, you've seen two types of learning models: in decision trees, only a small number of features are used to make decisions; in nearest neighbor algorithms, all features are used equally. Neither of these extremes is always desirable. In some problems, we might want to
@Article{DaumeIII2012,
author = {Daume III, H}, 
title = {A course in Machine Learning}, 
journal = {chapter}, 
volume = {}, 
number = {}, 
pages = {}, 
year = {2012}, 
abstract = {So far, you\'ve seen two types of learning models: in decision trees, only a small number of features are used to make decisions; in nearest neighbor algorithms, all features are used equally. Neither of these extremes is always desirable. In some problems, we might want to}, 
location = {}, 
keywords = {}}

Downloads: 0