Efficient approximation of labeling problems with applications to immune repertoire analysis

Yusuf Osmanlioglu, Santiago Ontanon, Uri Hershberg, Ali Shokoufandeh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Labeling problems are finding increasing applications to optimization problems. They usually get realized into linear or quadratic optimization problems, which are inefficient for large graphs. In this paper we propose an efficient primal-dual solution, MLPD, for a family of labeling problems. We apply this algorithm to the analysis of immune repertoires, and compare it against our baseline approach based on refinement operators. We provide a comparative evaluation both in terms of accuracy and computational efficiency with respect to the baseline model, as well as to quadratic optimization.

Original languageAmerican English
Title of host publication2016 23rd International Conference on Pattern Recognition, ICPR 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2410-2415
Number of pages6
ISBN (Electronic)9781509048472
DOIs
StatePublished - 1 Jan 2016
Externally publishedYes
Event23rd International Conference on Pattern Recognition, ICPR 2016 - Cancun, Mexico
Duration: 4 Dec 20168 Dec 2016

Publication series

NameProceedings - International Conference on Pattern Recognition
Volume0

Conference

Conference23rd International Conference on Pattern Recognition, ICPR 2016
Country/TerritoryMexico
CityCancun
Period4/12/168/12/16

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this