<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Probabilistic Search for Structured Data via Probabilistic Programming and Nonparametric Bayes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1704.01087/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1704.01087/feed.xml" rel="self" type="application/rss+xml" /><item><title>Probabilistic Search for Structured Data via Probabilistic Programming and Nonparametric Bayes — mentioned by jj12345</title><link>https://news.ycombinator.com/item?id=16628093</link><guid isPermaLink="false">urn:hackerpapers:mention:1704.01087:16628093</guid><pubDate>Tue, 20 Mar 2018 12:54:42 GMT</pubDate><description>&lt;p&gt;To the first point, the paper mentions that &amp;quot;the covariance is calculated after applying the Gaussian Copula to that table&amp;quot;. The experiments seem to conclude that, for their datasets, the 2D projections seem to work alright. I think that the surprising conclusion is that this works so well for any dataset at all. Just thinking out loud here: The typical case where a low dimensional representation would fail you is if you had dependencies (e.g. bimodal relations) that weren&amp;#x27;t represented by a datatype or foreign key. Recall that the simulation of data still occurs within each table, so the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1704.01087/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
