<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.2" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: KNIME - Part V: Parameter optimization of machine learning/statistical methods</title>
	<link>http://voyagememoirs.com/pharmine/2008/03/23/knime-part-v-parameter-optimization-of-machine-learningstatistical-methods/</link>
	<description>Data mining in Pharmacy</description>
	<pubDate>Sun, 20 May 2012 13:49:28 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.2</generator>
		<item>
		<title>By: free website audit report</title>
		<link>http://voyagememoirs.com/pharmine/2008/03/23/knime-part-v-parameter-optimization-of-machine-learningstatistical-methods/#comment-7568</link>
		<dc:creator>free website audit report</dc:creator>
		<pubDate>Thu, 22 Dec 2011 11:40:47 +0000</pubDate>
		<guid>http://voyagememoirs.com/pharmine/2008/03/23/knime-part-v-parameter-optimization-of-machine-learningstatistical-methods/#comment-7568</guid>
		<description>&lt;strong&gt;free website audit report&lt;/strong&gt;

[...]KNIME - Part V: Parameter optimization of machine learning/statistical methods &#124; pharmine[...]</description>
		<content:encoded><![CDATA[<p><strong>free website audit report</strong></p>
<p>[&#8230;]KNIME - Part V: Parameter optimization of machine learning/statistical methods | pharmine[&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://voyagememoirs.com/pharmine/2008/03/23/knime-part-v-parameter-optimization-of-machine-learningstatistical-methods/#comment-2175</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Sun, 02 Jan 2011 15:10:36 +0000</pubDate>
		<guid>http://voyagememoirs.com/pharmine/2008/03/23/knime-part-v-parameter-optimization-of-machine-learningstatistical-methods/#comment-2175</guid>
		<description>hi!
for a k means clustering you can run a brute force thing collecting the errors by execute the kmeans in a loop. each time the loop is run k gets k+1. then watch the errors on a plot. the ellbow will give you a good k for k-means. I programmed a node which detects this elbow automatically.</description>
		<content:encoded><![CDATA[<p>hi!<br />
for a k means clustering you can run a brute force thing collecting the errors by execute the kmeans in a loop. each time the loop is run k gets k+1. then watch the errors on a plot. the ellbow will give you a good k for k-means. I programmed a node which detects this elbow automatically.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alexwebmaster</title>
		<link>http://voyagememoirs.com/pharmine/2008/03/23/knime-part-v-parameter-optimization-of-machine-learningstatistical-methods/#comment-604</link>
		<dc:creator>Alexwebmaster</dc:creator>
		<pubDate>Tue, 03 Mar 2009 11:31:54 +0000</pubDate>
		<guid>http://voyagememoirs.com/pharmine/2008/03/23/knime-part-v-parameter-optimization-of-machine-learningstatistical-methods/#comment-604</guid>
		<description>Hello webmaster 
I would like to share with you a link to your site 
write me here preonrelt@mail.ru</description>
		<content:encoded><![CDATA[<p>Hello webmaster<br />
I would like to share with you a link to your site<br />
write me here <a href="mailto:preonrelt@mail.ru">preonrelt@mail.ru</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

