<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>Academic Commons Community: Department of Statistics</title>
    <link>http://app.cul.columbia.edu:8080/ac/handle/10022/AC:P:29741</link>
    <description />
    <textInput>
      <title>The Community's search engine</title>
      <description>Search the Channel</description>
      <name>search</name>
      <link>http://app.cul.columbia.edu:8080/ac/simple-search</link>
    </textInput>
    <item>
      <title>Priors on the Variance in Sparse Bayesian Learning; the demi-Bayesian Lasso</title>
      <link>http://app.cul.columbia.edu:8080/ac/handle/10022/AC:P:29744</link>
      <description>Title: Priors on the Variance in Sparse Bayesian Learning; the demi-Bayesian Lasso
&lt;br/&gt;
&lt;br/&gt;Author(s): Madigan, David
&lt;br/&gt;
&lt;br/&gt;Abstract: We explore the use of proper priors for variance parameters of certain sparse Bayesian regression models. This leads to a connection between sparse Bayesian learning (SBL) models (Tipping, 2001) and the recently proposed Bayesian Lasso (Park and Casella, 2008). We outline simple modifications of existing algorithms to solve this new variant which essentially uses type-II maximum likelihood to fit the Bayesian Lasso model. We also propose an Elastic-net (Zou and Hastie, 2005) heuristic to help with modeling correlated inputs. Experimental results show the proposals to compare favorably to both the Lasso and traditional and more recent sparse Bayesian algorithms.</description>
      <pubDate>Mon, 29 Oct 2007 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Tree-Based Integration of One-versus-Some (OVS) Classifiers for Multiclass Classification</title>
      <link>http://app.cul.columbia.edu:8080/ac/handle/10022/AC:P:29743</link>
      <description>Title: Tree-Based Integration of One-versus-Some (OVS) Classifiers for Multiclass Classification
&lt;br/&gt;
&lt;br/&gt;Author(s): Ding, Yuejing; Zheng, Tian
&lt;br/&gt;
&lt;br/&gt;Abstract: Motivated by applications such as gene expression analysis, binary classification has achieved notable success. (e.g., cancer samples versus normal samples) When comes to multiclass classification, the extension is not straightforward. There has been two main directions on such extensions: 1) via a sequence of nested binary classifiers in a classification tree or 2) via classifier ensembles that integrate votes from all one-versus-all (OVA) classifiers or all all-pairs (AP) classifiers. In this article, we present a new way to combine both strategies in a multiclass classification.
&lt;br/&gt;
&lt;br/&gt;Description: This technical report was included in the Joint Statistical Meeting 2006 proceedings.</description>
      <pubDate>Sat, 29 Oct 2005 22:58:59 GMT</pubDate>
    </item>
  </channel>
</rss>

