<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/'><id>tag:blogger.com,1999:blog-7751293754523140922.post8941628531599355335..comments</id><updated>2009-11-28T20:27:41.760-08:00</updated><title type='text'>Comments on Stanford InfoBlog: Why Uncertainty in Data is Great (Posted by Anish ...</title><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://infoblog.stanford.edu/feeds/8941628531599355335/comments/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/7751293754523140922/8941628531599355335/comments/default'/><link rel='alternate' type='text/html' href='http://infoblog.stanford.edu/2008/07/why-uncertainty-in-data-is-great-posted.html'/><author><name>Paul Heymann</name><uri>http://www.blogger.com/profile/08835143972957022099</uri><email>noreply@blogger.com</email></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>3</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-7751293754523140922.post-4753557109808108052</id><published>2008-12-09T23:58:00.000-08:00</published><updated>2008-12-09T23:58:00.000-08:00</updated><title type='text'>A very nice illustration on the significance of ma...</title><content type='html'>A very nice illustration on the significance of managing uncertain data; I have worked in the past in this area on evaluating threshold based preference queries on uncertain data; but we modeled uncertain data as ranges; For example instead of saying, I have a confidence of 80% on value X, I would say, the value is somewhere in the range [a,b] where this range could again follow an arbitrary distribution'; In the case of sensor networks, it mostly would follow a Gaussian distribution. There has been some other related work in the same lines by some DB groups in Purdue, Hong Kong University, Toronto too.</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/7751293754523140922/8941628531599355335/comments/default/4753557109808108052'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/7751293754523140922/8941628531599355335/comments/default/4753557109808108052'/><link rel='alternate' type='text/html' href='http://infoblog.stanford.edu/2008/07/why-uncertainty-in-data-is-great-posted.html?showComment=1228895880000#c4753557109808108052' title=''/><author><name>Prasad</name><uri>http://www.blogger.com/profile/00265974880027100216</uri><email>noreply@blogger.com</email></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://infoblog.stanford.edu/2008/07/why-uncertainty-in-data-is-great-posted.html' ref='tag:blogger.com,1999:blog-7751293754523140922.post-8941628531599355335' source='http://www.blogger.com/feeds/7751293754523140922/posts/default/8941628531599355335' type='text/html'/></entry><entry><id>tag:blogger.com,1999:blog-7751293754523140922.post-4344810125627498101</id><published>2008-08-01T13:44:00.000-07:00</published><updated>2008-08-01T13:44:00.000-07:00</updated><title type='text'>You are absolutely that propagating probabilities ...</title><content type='html'>You are absolutely that propagating probabilities have been considered in AI (as well as in other fields), and we are aware of this past work. However, note that the uncertain data management we (and other DB groups around the globe) are doing is different in several respects. First, we consider more general kinds of uncertainty, which also includes non-probabilistic but uncertain data, and probably at a larger scale. Second, the kinds of queries that need to be answered in a relational setting (all of SQL) goes beyond Bayesian inference. And for these queries, we need to consider new kinds of indexes and statistics, etc. &lt;BR/&gt;&lt;BR/&gt;That said, I would like to point out that within the DB community itself there has been past work that uses AI-ish techniques for managing relation uncertain data (See this &lt;A HREF="http://www.cs.umd.edu/~sen/pubs/icde07/icde07_final.pdf" REL="nofollow"&gt;ICDE 2007&lt;/A&gt; and &lt;A HREF="http://www.cs.berkeley.edu/~daisyw/vldb08a.pdf" REL="nofollow"&gt;VLDB 2008&lt;/A&gt; paper).&lt;BR/&gt;&lt;BR/&gt;Finally, note that uncertainty is only one component of the Trio project I referred to. Data lineage constitutes the other key component in Trio. We've been looking at how lineage can play a crucial role in improving the efficiency and usability in uncertain data. (Our ICDE 2008 paper shows how lineage can help in confidence computation, and &lt;A HREF="http://dbpubs.stanford.edu/pub/2008-5" REL="nofollow"&gt;this paper&lt;/A&gt; shows that lineage can greatly simplify data modifications and versioning.)&lt;BR/&gt;&lt;BR/&gt;As for your note on my Toucan example on how to "reconcile" independent sources of uncertain data, thanks for pointing me to this past work! Along with other members of the Trio project, I've been doing some work on building a theoretical framework that allows us to combine such uncertain information. Our work is based on and extends the theory of data integration, which  fundamentally relies on the notion of containment. We believe the approach we are taking is more principled. Unfortunately I can't point you to our results yet, as we haven't published them.&lt;BR/&gt;&lt;BR/&gt;Thanks a lot for your comments and for pointing me to your past and current work!</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/7751293754523140922/8941628531599355335/comments/default/4344810125627498101'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/7751293754523140922/8941628531599355335/comments/default/4344810125627498101'/><link rel='alternate' type='text/html' href='http://infoblog.stanford.edu/2008/07/why-uncertainty-in-data-is-great-posted.html?showComment=1217623440000#c4344810125627498101' title=''/><author><name>Anish Das Sarma</name><uri>http://www.blogger.com/profile/06464098403241790130</uri><email>noreply@blogger.com</email><gd:extendedProperty xmlns:gd='http://schemas.google.com/g/2005' name='OpenSocialUserId' value='05997645285499462790'/></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://infoblog.stanford.edu/2008/07/why-uncertainty-in-data-is-great-posted.html' ref='tag:blogger.com,1999:blog-7751293754523140922.post-8941628531599355335' source='http://www.blogger.com/feeds/7751293754523140922/posts/default/8941628531599355335' type='text/html'/></entry><entry><id>tag:blogger.com,1999:blog-7751293754523140922.post-4648712291142530789</id><published>2008-07-29T15:30:00.000-07:00</published><updated>2008-07-29T15:30:00.000-07:00</updated><title type='text'>Propagating uncertainty is a cornerstone of Bayesi...</title><content type='html'>Propagating uncertainty is a cornerstone of Bayesian statistics, which provides a general framework for uncertainty integration.  Some of your colleagues in CS at Stanford are using it for a general model of natural language processing that propagates uncertainty through a linguistic processing pipeline (see &lt;A HREF="http://nlp.stanford.edu/pubs/pipeline-emnlp-06.pdf" REL="nofollow"&gt;this paper&lt;/A&gt;).&lt;BR/&gt;&lt;BR/&gt;Back in the 1980s, I used to do logic programming and knowledge representation for computational linguistics, with a theoretical focus on uncertainty propagation (though it was disjunctive or inheritance-based uncertainty).  &lt;BR/&gt;&lt;BR/&gt;Fast forward to the 2000s, and I'm currently working on an NIH grant, the foundation of which is high recall techniques for linking textual mentions of genes, mutations, diseases and other biological entities to databases (see this &lt;A HREF="http://lingpipe.files.wordpress.com/2008/04/alias-i-biocreativeii.pdf" REL="nofollow"&gt;tech report&lt;/A&gt;, &lt;A HREF="http://lingpipe-blog.com/2006/10/21/biocreative-encore-high-precision-and-high-recall-entity-extraction/" REL="nofollow"&gt;blog entry&lt;/A&gt; or &lt;A HREF="http://alias-i.com/lingpipe/demos/tutorial/ne/read-me.html" REL="nofollow"&gt;tutorial&lt;/A&gt;).  You just can't get high recall with state of the art data cleaning in 2008, at least in the domains we care about.&lt;BR/&gt;&lt;BR/&gt;A related issue I'm working on now is a hierarchical Bayesian model of  determining true annotations from multiple annotators (like your Toucan example).  I discuss the general problems with the current way of measuring agreement for producing gold standard data in my last two blog entries, &lt;A HREF="http://lingpipe-blog.com/2008/07/22/good-kappas-not-enough/" REL="nofollow"&gt;Good Kappa's Not Enough&lt;/A&gt; and &lt;A HREF="http://lingpipe-blog.com/2008/07/28/good-kappas-not-necessary-either/" REL="nofollow"&gt;Good Kappa's Not Necessary, Either&lt;/A&gt;.&lt;BR/&gt;&lt;BR/&gt;Finally, it's not just unclean data that needs to be reasoned with, but also missing data, which presents a different set of problems.  For that, you might consider &lt;A HREF="http://www.stat.psu.edu/~jls/mifaq.html" REL="nofollow"&gt;multiple imputation&lt;/A&gt;.</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/7751293754523140922/8941628531599355335/comments/default/4648712291142530789'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/7751293754523140922/8941628531599355335/comments/default/4648712291142530789'/><link rel='alternate' type='text/html' href='http://infoblog.stanford.edu/2008/07/why-uncertainty-in-data-is-great-posted.html?showComment=1217370600000#c4648712291142530789' title=''/><author><name>Bob Carpenter</name><uri>http://lingpipe-blog.com/</uri><email>noreply@blogger.com</email></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://infoblog.stanford.edu/2008/07/why-uncertainty-in-data-is-great-posted.html' ref='tag:blogger.com,1999:blog-7751293754523140922.post-8941628531599355335' source='http://www.blogger.com/feeds/7751293754523140922/posts/default/8941628531599355335' type='text/html'/></entry></feed>