<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Clustering Archives &#8212; MATLAB Number ONE</title>
	<atom:link href="https://matlab1.com/product-tag/clustering/feed/" rel="self" type="application/rss+xml" />
	<link>https://matlab1.com/product-tag/clustering/</link>
	<description>MATLAB Simulink &#124; Tutorial &#124; Code &#124; Project</description>
	<lastBuildDate>Sun, 12 Feb 2023 09:29:53 +0000</lastBuildDate>
	<language>en-GB</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	

<image>
	<url>https://matlab1.com/wp-content/uploads/2018/08/icon1-100x100.png</url>
	<title>Clustering Archives &#8212; MATLAB Number ONE</title>
	<link>https://matlab1.com/product-tag/clustering/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Efficient Graph-Based Image Segmentation</title>
		<link>https://matlab1.com/shop/cpp-code/efficient-graph-based-image-segmentation/</link>
					<comments>https://matlab1.com/shop/cpp-code/efficient-graph-based-image-segmentation/#respond</comments>
		
		<dc:creator><![CDATA[global MATLAB]]></dc:creator>
		<pubDate>Fri, 11 May 2018 03:14:48 +0000</pubDate>
				<guid isPermaLink="false">https://matlab1.com/?post_type=product&#038;p=5227</guid>

					<description><![CDATA[<p>In this paper we have introduced a new method for image segmentation based on pairwise region comparison. We have shown that the notions of a segmentation being too coarse or too fine can be defined in terms of a function which measures the evidence for a boundary between a pair of regions. Our segmentation algorithm makes simple greedy decisions, [&#8230;]</p>
<p>The post <a href="https://matlab1.com/shop/cpp-code/efficient-graph-based-image-segmentation/">Efficient Graph-Based Image Segmentation</a> appeared first on <a href="https://matlab1.com">MATLAB Number ONE</a>.</p>
]]></description>
		
					<wfw:commentRss>https://matlab1.com/shop/cpp-code/efficient-graph-based-image-segmentation/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Tumor Clustering Using Non-negative Matrix Factorization with Gene Selection</title>
		<link>https://matlab1.com/shop/matlab-code/tumor-clustering-using-non-negative-matrix-factorization-with-gene-selection/</link>
					<comments>https://matlab1.com/shop/matlab-code/tumor-clustering-using-non-negative-matrix-factorization-with-gene-selection/#respond</comments>
		
		<dc:creator><![CDATA[global MATLAB]]></dc:creator>
		<pubDate>Mon, 16 Apr 2018 06:48:50 +0000</pubDate>
				<guid isPermaLink="false">https://matlab1.com/?post_type=product&#038;p=5004</guid>

					<description><![CDATA[<p>&#160; In this project, we employed ICA to model the gene expression data for gene selection, and then applied NMF and its extensions, i.e., SNMF and NMFSC to cancer clustering using the selected genes. The proposed method was validated on the leukemia dataset, embryonal tumors dataset from the central nervous system, and the medulloblastoma dataset. It can be found that improved [&#8230;]</p>
<p>The post <a href="https://matlab1.com/shop/matlab-code/tumor-clustering-using-non-negative-matrix-factorization-with-gene-selection/">Tumor Clustering Using Non-negative Matrix Factorization with Gene Selection</a> appeared first on <a href="https://matlab1.com">MATLAB Number ONE</a>.</p>
]]></description>
		
					<wfw:commentRss>https://matlab1.com/shop/matlab-code/tumor-clustering-using-non-negative-matrix-factorization-with-gene-selection/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>JAVA Code of thesis ( Supporting QoS in Wireless Sensor Networks Using Cellular Learning Automata )</title>
		<link>https://matlab1.com/shop/java-code/java-code-thesis-supporting-qos-wireless-sensor-networks-using-cellular-learning-automata/</link>
					<comments>https://matlab1.com/shop/java-code/java-code-thesis-supporting-qos-wireless-sensor-networks-using-cellular-learning-automata/#respond</comments>
		
		<dc:creator><![CDATA[global MATLAB]]></dc:creator>
		<pubDate>Thu, 04 Aug 2016 13:26:04 +0000</pubDate>
				<guid isPermaLink="false">https://matlab1.com/?post_type=product&#038;p=594</guid>

					<description><![CDATA[<p>Abstract Some of the quality of service parameters(QoS) for wireless sensor networks is network coverage, the optimal number of active nodes, lifetime and the amount of consumed energy. In this thesis, three fundamental problems in wireless sensor networks are addressed and with the aim of promoting the QoS parameters, efficient solutions based on cellular learning [&#8230;]</p>
<p>The post <a href="https://matlab1.com/shop/java-code/java-code-thesis-supporting-qos-wireless-sensor-networks-using-cellular-learning-automata/">JAVA Code of thesis ( Supporting QoS in Wireless Sensor Networks Using Cellular Learning Automata )</a> appeared first on <a href="https://matlab1.com">MATLAB Number ONE</a>.</p>
]]></description>
		
					<wfw:commentRss>https://matlab1.com/shop/java-code/java-code-thesis-supporting-qos-wireless-sensor-networks-using-cellular-learning-automata/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
