<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: K-means clustering in Java code found!</title>
	<atom:link href="http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/</link>
	<description>Random thoughts, problems and solutions</description>
	<lastBuildDate>Mon, 06 Feb 2012 10:12:49 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Patrick van Kouteren</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2103</link>
		<dc:creator>Patrick van Kouteren</dc:creator>
		<pubDate>Mon, 06 Feb 2012 10:12:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2103</guid>
		<description>Hi Akash, this is pretty straightforward. At some point in the image histogram you put the &#039;splitting point&#039;. Pixelvalues on the one side will become white and on the other side will become black. This is called thresholding. This is also implemented in the ISPE code which is available on my downloads page.

Cheers,

Patrick</description>
		<content:encoded><![CDATA[<p>Hi Akash, this is pretty straightforward. At some point in the image histogram you put the &#8216;splitting point&#8217;. Pixelvalues on the one side will become white and on the other side will become black. This is called thresholding. This is also implemented in the ISPE code which is available on my downloads page.</p>
<p>Cheers,</p>
<p>Patrick</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Akash</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2100</link>
		<dc:creator>Akash</dc:creator>
		<pubDate>Thu, 02 Feb 2012 07:13:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2100</guid>
		<description>I want to convert grayescale image into binary image ..so can u suggest any solution..!</description>
		<content:encoded><![CDATA[<p>I want to convert grayescale image into binary image ..so can u suggest any solution..!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick van Kouteren</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2099</link>
		<dc:creator>Patrick van Kouteren</dc:creator>
		<pubDate>Tue, 31 Jan 2012 14:22:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2099</guid>
		<description>Hi Harry,

Just saw that you&#039;d posted a reply a while ago, my bad!
Regarding the syslog file: it&#039;s a CSV. Which columns does it have?

K-means clustering would in your case just mean that you need to extract a the messages from the CSV file and classify them in two groups. Based on those two groups the real-time detection algorithm would decide whether a detection occurs based on the message.

And how would you do this real-time? Would you capture the incoming package and check for particular words?</description>
		<content:encoded><![CDATA[<p>Hi Harry,</p>
<p>Just saw that you&#8217;d posted a reply a while ago, my bad!<br />
Regarding the syslog file: it&#8217;s a CSV. Which columns does it have?</p>
<p>K-means clustering would in your case just mean that you need to extract a the messages from the CSV file and classify them in two groups. Based on those two groups the real-time detection algorithm would decide whether a detection occurs based on the message.</p>
<p>And how would you do this real-time? Would you capture the incoming package and check for particular words?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick van Kouteren</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2097</link>
		<dc:creator>Patrick van Kouteren</dc:creator>
		<pubDate>Tue, 31 Jan 2012 07:16:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2097</guid>
		<description>Hi Nicky,

I don&#039;t know if I still have the images, but they were just 8-bit greyscale images. Any such type image would do.
The rest of the source code can be found on the downloads page. It&#039;s in the &#039;Ispe development source code&#039; zipfile.

Cheers,

Patrick</description>
		<content:encoded><![CDATA[<p>Hi Nicky,</p>
<p>I don&#8217;t know if I still have the images, but they were just 8-bit greyscale images. Any such type image would do.<br />
The rest of the source code can be found on the downloads page. It&#8217;s in the &#8216;Ispe development source code&#8217; zipfile.</p>
<p>Cheers,</p>
<p>Patrick</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nicky</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2096</link>
		<dc:creator>nicky</dc:creator>
		<pubDate>Mon, 30 Jan 2012 23:28:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2096</guid>
		<description>hi Patrick,
If you don&#039;t mind, could you also provide the images example and main class for testing?

thanks anyway for the code :)</description>
		<content:encoded><![CDATA[<p>hi Patrick,<br />
If you don&#8217;t mind, could you also provide the images example and main class for testing?</p>
<p>thanks anyway for the code <img src='http://www.vankouteren.eu/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Harry potter</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2081</link>
		<dc:creator>Harry potter</dc:creator>
		<pubDate>Tue, 10 Jan 2012 12:02:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2081</guid>
		<description>Based on the criticality of the message we want to raise an alarm.(i.e).,  we need to analyze all the logs and say whether any intrusion has occurred or not?</description>
		<content:encoded><![CDATA[<p>Based on the criticality of the message we want to raise an alarm.(i.e).,  we need to analyze all the logs and say whether any intrusion has occurred or not?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick van Kouteren</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2080</link>
		<dc:creator>Patrick van Kouteren</dc:creator>
		<pubDate>Tue, 10 Jan 2012 07:47:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2080</guid>
		<description>Hmm.. that&#039;s a good one. Clustering is mostly done on a group of data. What exactly do you want to establish with intrusion detection? Would you like to review every request and directly alarm in case of an intrusion? What does the intrusion detection flow look like?</description>
		<content:encoded><![CDATA[<p>Hmm.. that&#8217;s a good one. Clustering is mostly done on a group of data. What exactly do you want to establish with intrusion detection? Would you like to review every request and directly alarm in case of an intrusion? What does the intrusion detection flow look like?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Harry potter</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2079</link>
		<dc:creator>Harry potter</dc:creator>
		<pubDate>Mon, 09 Jan 2012 09:52:22 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2079</guid>
		<description>Which algorithm will best suit this intrusion detection sir ? Currently I want to cluster into 2 groups based on simple keyword matching as I said above. How can the code be modified for real time network packets rather than log files?Can you give some useful links sir?</description>
		<content:encoded><![CDATA[<p>Which algorithm will best suit this intrusion detection sir ? Currently I want to cluster into 2 groups based on simple keyword matching as I said above. How can the code be modified for real time network packets rather than log files?Can you give some useful links sir?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick van Kouteren</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2078</link>
		<dc:creator>Patrick van Kouteren</dc:creator>
		<pubDate>Mon, 09 Jan 2012 07:23:14 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2078</guid>
		<description>Hi Harry potter (wow! THE Harry? ;-))

Your problem is quite an easy one at first sight, and I don&#039;t know whether K-Means clustering is the best option for this. K-Means clustering clusters data in an iterative fashion. If you have a predefined set of words which are characteristic for network intrusion, you&#039;re basically counting / separating.
Can you explain what your method would look like? How would you do network intrusion detection step by step?

Cheers,

Patrick</description>
		<content:encoded><![CDATA[<p>Hi Harry potter (wow! THE Harry? <img src='http://www.vankouteren.eu/blog/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> )</p>
<p>Your problem is quite an easy one at first sight, and I don&#8217;t know whether K-Means clustering is the best option for this. K-Means clustering clusters data in an iterative fashion. If you have a predefined set of words which are characteristic for network intrusion, you&#8217;re basically counting / separating.<br />
Can you explain what your method would look like? How would you do network intrusion detection step by step?</p>
<p>Cheers,</p>
<p>Patrick</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick van Kouteren</title>
		<link>http://www.vankouteren.eu/blog/2009/09/k-means-clustering-in-java-code-found/#comment-2077</link>
		<dc:creator>Patrick van Kouteren</dc:creator>
		<pubDate>Mon, 09 Jan 2012 07:18:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.vankouteren.eu/blog/?p=144#comment-2077</guid>
		<description>Hi darsha,

First things first: you&#039;ve got to think on which attributes you are going to cluster. As diseases may have many attributes, think of a good one which can really separate the diseases (clusters).
The problem is actually not on the code. The theory is the most important part here.

Cheers,

Patrick</description>
		<content:encoded><![CDATA[<p>Hi darsha,</p>
<p>First things first: you&#8217;ve got to think on which attributes you are going to cluster. As diseases may have many attributes, think of a good one which can really separate the diseases (clusters).<br />
The problem is actually not on the code. The theory is the most important part here.</p>
<p>Cheers,</p>
<p>Patrick</p>
]]></content:encoded>
	</item>
</channel>
</rss>

