<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Minimum_redundancy_feature_selection</id>
	<title>Minimum redundancy feature selection - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Minimum_redundancy_feature_selection"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Minimum_redundancy_feature_selection&amp;action=history"/>
	<updated>2026-05-15T16:23:47Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Minimum_redundancy_feature_selection&amp;diff=3942315&amp;oldid=prev</id>
		<title>imported&gt;Sohryu Asuka Langley Not Shikinami: interwiki</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Minimum_redundancy_feature_selection&amp;diff=3942315&amp;oldid=prev"/>
		<updated>2025-05-01T11:35:55Z</updated>

		<summary type="html">&lt;p&gt;interwiki&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Minimum redundancy feature selection&amp;#039;&amp;#039;&amp;#039; is an [[algorithm]] frequently used in a method to accurately identify characteristics of [[gene]]s and [[phenotype]]s and narrow down their relevance and is usually described in its pairing with relevant feature selection as &amp;#039;&amp;#039;Minimum Redundancy Maximum Relevance&amp;#039;&amp;#039; (mRMR). This method was first proposed in 2003 by Hanchuan Peng and Chris Ding,&amp;lt;ref&amp;gt;Chris Ding and Hanchuan Peng,  &amp;quot;[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.62.6875&amp;amp;rep=rep1&amp;amp;type=pdf Minimum Redundancy Feature Selection from Microarray Gene Expression Data]&amp;quot;.  2nd IEEE Computer Society Bioinformatics Conference (CSB 2003), 11–14 August 2003, Stanford, CA, USA. Pages 523–529.&amp;lt;/ref&amp;gt; followed by a theoretical formulation based on mutual information, along with the first definition of multivariate mutual information, published in IEEE Trans. Pattern Analysis and Machine Intelligence in 2005. &amp;lt;ref&amp;gt;Peng, H.C., Long, F., and Ding, C., &amp;quot;[https://www.computer.org/csdl/trans/tp/2005/08/i1226-abs.html Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy],&amp;quot; IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, No. 8, pp.&amp;amp;nbsp;1226–1238, 2005.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;[[Feature selection]]&amp;#039;&amp;#039;, one of the basic problems in [[pattern recognition]] and [[machine learning]], identifies subsets of data that are relevant to the parameters used and is normally called &amp;#039;&amp;#039;[[Maximum Relevance]]&amp;#039;&amp;#039;. These subsets often contain material which is relevant but redundant and mRMR attempts to address this problem by removing those redundant subsets. mRMR has a variety of applications in many areas such as [[cancer diagnosis]] and [[speech recognition]].&lt;br /&gt;
&lt;br /&gt;
Features can be selected in many different ways. One scheme is to select features that [[correlate]] strongest to the [[classification]] variable. This has been called maximum-relevance selection. Many [[heuristic algorithm]]s can be used, such as the sequential forward, backward, or floating selections.&lt;br /&gt;
&lt;br /&gt;
On the other hand, features can be selected to be mutually far away from each other while still having &amp;quot;high&amp;quot; correlation to the classification variable. This scheme, termed as &amp;#039;&amp;#039;Minimum Redundancy Maximum Relevance&amp;#039;&amp;#039; (mRMR) selection has been found to be more powerful than the maximum relevance selection.&lt;br /&gt;
&lt;br /&gt;
As a special case, the &amp;quot;correlation&amp;quot; can be replaced by the [[statistical dependency]] between variables. [[Mutual information]] can be used to quantify the dependency. In this case, it is shown that mRMR is an approximation to maximizing the dependency between the [[joint distribution]] of the selected features and the classification variable.&lt;br /&gt;
&lt;br /&gt;
Studies have tried different measures for redundancy and relevance measures. A recent study compared several measures within the context of biomedical images.&amp;lt;ref&amp;gt;Auffarth, B., Lopez, M., Cerquides, J. (2010). Comparison of redundancy and relevance measures for feature selection in tissue classification of CT images. Advances in Data Mining. Applications and Theoretical Aspects. p. 248--262. Springer. http://www.csc.kth.se/~auffarth/publications/redrel.pdf&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* Peng, H.C., Long, F., and Ding, C., &amp;quot;[https://www.computer.org/csdl/trans/tp/2005/08/i1226-abs.html Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy],&amp;quot; IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, No. 8, pp.&amp;amp;nbsp;1226–1238, 2005.&lt;br /&gt;
* Chris Ding and Hanchuan Peng,  &amp;quot;[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.62.6875&amp;amp;rep=rep1&amp;amp;type=pdf Minimum Redundancy Feature Selection from Microarray Gene Expression Data]&amp;quot;.  2nd IEEE Computer Society Bioinformatics Conference (CSB 2003), 11–14 August 2003, Stanford, CA, USA. Pages 523–529.&lt;br /&gt;
*[http://home.penglab.com/proj/mRMR/ Penglab mRMR]&lt;br /&gt;
&lt;br /&gt;
[[Category:Machine learning algorithms]]&lt;/div&gt;</summary>
		<author><name>imported&gt;Sohryu Asuka Langley Not Shikinami</name></author>
	</entry>
</feed>