<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Wed, 20 Aug 2008 22:17:28 BST</pubDate>


	<title>CiteULike: sona sensitivity-analysis</title>
	<description>CiteULike: sona sensitivity-analysis</description>


	<link>http://www.citeulike.org/user/sona/tag/sensitivity-analysis</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/sona/article/2646542"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/sona/article/2626199"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/sona/article/2646542">
    <title>Bagging neural network sensitivity analysis for feature reduction for in-silico drug design</title>
    <link>http://www.citeulike.org/user/sona/article/2646542</link>
    <description>&lt;i&gt;International Joint Conference on Neural Networks (IJCNN), Vol. 4 (2001), pp. 2478-2482 vol.4.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper illustrates a new approach to sensitivity analysis for feature selection using multiple ensemble neural networks in a bootstrapping mode with bagging. This methodology is applied to in-silico drug design with QSAR (quantitative structural activity relationship), which is notoriously challenging for machine learning because typically there are on the order of 300-1000 dependent features, often for as few as 50-100 data points. For an HIV dataset with 160 wavelets descriptors, the number of relevant features was reduced to 35, and the resulting predictive neural network model gave better results than with the full feature set</description>
    <dc:title>Bagging neural network sensitivity analysis for feature reduction for in-silico drug design</dc:title>

    <dc:creator>MJ Embrechts</dc:creator>
    <dc:creator>F Arciniegas</dc:creator>
    <dc:creator>M Ozdemir</dc:creator>
    <dc:creator>CM Breneman</dc:creator>
    <dc:creator>K Bennett</dc:creator>
    <dc:creator>L Lockwood</dc:creator>
    <dc:identifier>doi:10.1109/IJCNN.2001.938756</dc:identifier>
    <dc:source>International Joint Conference on Neural Networks (IJCNN), Vol. 4 (2001), pp. 2478-2482 vol.4.</dc:source>
    <dc:date>2008-04-09T17:00:11-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:publicationName>International Joint Conference on Neural Networks (IJCNN)</prism:publicationName>
    <prism:volume>4</prism:volume>
    <prism:startingPage>2478</prism:startingPage>
    <prism:endingPage>2482 vol.4</prism:endingPage>
    <prism:category>dimensionality-reduction</prism:category>
    <prism:category>embedded-feature-selection</prism:category>
    <prism:category>feature-selection</prism:category>
    <prism:category>neural-networks</prism:category>
    <prism:category>sensitivity-analysis</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/sona/article/2626199">
    <title>A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis</title>
    <link>http://www.citeulike.org/user/sona/article/2626199</link>
    <description>&lt;i&gt;Journal of Machine Learning Research, Vol. 7 (July 2006), pp. 1159-1182.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers. First, random values are assigned to the outputs of the first layer; later, these initial values are updated based on sensitivity formulas, which use the weights in each of the layers; the process is repeated until convergence. Since these weights are learnt solving a linear system of equations, there is an important saving in computational time. The method also gives the local sensitivities of the least square errors with respect to input and output data, with no extra computational cost, because the necessary information becomes available without extra calculations. This method, called the Sensitivity-Based Linear Learning Method, can also be used to provide an initial set of weights, which significantly improves the behavior of other learning algorithms. The theoretical basis for the method is given and its performance is illustrated by its application to several examples in which it is compared with several learning algorithms and well known data sets. The results have shown a learning speed generally faster than other existing methods. In addition, it can be used as an initialization tool for other well known methods with significant improvements.</description>
    <dc:title>A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis</dc:title>

    <dc:creator>Enrique Castillo</dc:creator>
    <dc:creator>Bertha Guijarro-Berdiñas</dc:creator>
    <dc:creator>Oscar Fontenla-Romero</dc:creator>
    <dc:creator>Amparo Alonso-Betanzos</dc:creator>
    <dc:source>Journal of Machine Learning Research, Vol. 7 (July 2006), pp. 1159-1182.</dc:source>
    <dc:date>2008-04-03T14:18:05-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Journal of Machine Learning Research</prism:publicationName>
    <prism:volume>7</prism:volume>
    <prism:startingPage>1159</prism:startingPage>
    <prism:endingPage>1182</prism:endingPage>
    <prism:category>fast-learning</prism:category>
    <prism:category>learning-algorithms</prism:category>
    <prism:category>neural-networks</prism:category>
    <prism:category>sensitivity-analysis</prism:category>
    <prism:category>supervised</prism:category>
</item>



</rdf:RDF>

