Local case-control sampling: Difference between revisions

Revision as of 19:47, 12 August 2015

Revision as of 17:30, 22 December 2015

Line 1:

In [[machine learning]], '''local case-control sampling''' <ref name="LCC">{{cite journal|last1=Fithian|first1=William|last2=Hastie|first2=Trevor|title=Local case-control sampling: Efficient subsampling in imbalanced data sets|journal=The Annals of Statistics|date=2014|volume=42|issue=5|pages=1693–1724|ref=http://arxiv.org/abs/1306.3706|doi=10.1214/14-aos1220}}</ref> is an [[algorithm]] used to reduce the complexity of training a [[logistic regression]] classifier. The algorithm reduces the training complexity by selecting a small subsample of the original dataset for training. It assumes the availability of a (unreliable) pilot estimation of the parameters. It then performs a single pass over the entire dataset using the pilot estimation to identify the most "surprising" samples. In practice, the pilot may come from prior knowledge or training using a subsample of the dataset. The algorithm is most effective when the underlying dataset is imbalanced. It exploits the structures of conditional imbalanced datasets more efficiently than alternative methods, such as [[Logistic regression#Case-control sampling|case control sampling]] and weighted case control sampling.

== Imbalanced datasets ==

Line 35:

| issue=5

| pages=1693–1724

| ref=http://arxiv.org/abs/1306.3706| doi=10.1214/14-aos1220}}</ref>

}}