uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tabular: a schema-driven probabilistic programming language
Show others and affiliations
2014 (English)In: Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York: ACM Press, 2014, 321-334 p.Conference paper, Published paper (Refereed)
Abstract [en]

We propose a new kind of probabilistic programming language for machine learning. We write programs simply by annotating existing relational schemas with probabilistic model expressions. We describe a detailed design of our language, Tabular, complete with formal semantics and type system. A rich series of examples illustrates the expressiveness of Tabular. We report an implementation, and show evidence of the succinctness of our notation relative to current best practice. Finally, we describe and verify a transformation of Tabular schemas so as to predict missing values in a concrete database. The ability to query for missing values provides a uniform interface to a wide variety of tasks, including classification, clustering, recommendation, and ranking.

Place, publisher, year, edition, pages
New York: ACM Press, 2014. 321-334 p.
Series
ACM SIGPLAN NOTICES, ISSN 0362-1340 ; 49:1
Keyword [en]
Bayesian reasoning; machine learning; model-learner pattern; probabilistic programming; relational data
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-220064DOI: 10.1145/2535838.2535850ISI: 000331120500028ISBN: 9781450325448 (print)OAI: oai:DiVA.org:uu-220064DiVA: diva2:703977
Conference
POPL 2014, January 22–24, San Diego, CA
Funder
Swedish Research Council, 2013-4853
Available from: 2014-03-10 Created: 2014-03-10 Last updated: 2016-06-29Bibliographically approved

Open Access in DiVA

fulltext(682 kB)39 downloads
File information
File name FULLTEXT02.pdfFile size 682 kBChecksum SHA-512
c09bf3f8302cf39beeeb543772f0e55d5b3be260d10482cc308e0cfcda49e729428bd2086e4a06221932fa37535faf05d8dfba4b7b005cb27e81c27da76b0ced
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Borgström, Johannes

Search in DiVA

By author/editor
Borgström, Johannes
By organisation
Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 39 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 428 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf