Skip to content
master
Switch branches/tags
Code
This branch is up to date with master.
Contribute

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 
 
 
 
 
 
 

L2P

Many real-world prediction tasks have outcome (a.k.a., target) variables that have characteristic heavy-tail distributions. Examples include copies of books sold, auction prices of art pieces, and sales of movies in the box office. Accurate predictions for the "big and rare" instances (e.g., the best-sellers, the box-office hits, etc) is a hard task. Most existing approaches heavily under-predict such instances because they cannot deal effectively with heavy-tailed distributions. We introduce Learning to Place (L2P), which exploits the pairwise relationships between instances to learn from a proportionally higher number of rare instances. L2P consists of two phases. In Phase 1, L2P learns a pairwise preference classifier: is instance A > instance B?. In Phase 2, L2P learns to place an instance from the output of Phase 1. Based on its placement, the instance is then assigned a value for its outcome variable. Our experiments, on real-world and synthetic datasets, show that our L2P approach outperforms competing approaches and provides explainable outcomes.

About

The Learning to Place algorithm designed by Xindi Wang, Onur Varol and Tina Eliassi Rad

Resources

License

Releases

No releases published

Packages

No packages published

Languages