<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
		<id>http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Genetic_Programming_for_Combining_Classifiers</id>
		<title>Genetic Programming for Combining Classifiers - Versionsgeschichte</title>
		<link rel="self" type="application/atom+xml" href="http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Genetic_Programming_for_Combining_Classifiers"/>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Genetic_Programming_for_Combining_Classifiers&amp;action=history"/>
		<updated>2026-05-09T03:51:21Z</updated>
		<subtitle>Versionsgeschichte dieser Seite in de_evolutionary_art_org</subtitle>
		<generator>MediaWiki 1.27.4</generator>

	<entry>
		<id>http://de.evo-art.org/index.php?title=Genetic_Programming_for_Combining_Classifiers&amp;diff=1820&amp;oldid=prev</id>
		<title>Gbachelier: Die Seite wurde neu angelegt: „  == Reference == W. B. Langdon and B. F. Buxton: Genetic Programming for Combining Classifiers. Proceedings of the Genetic and Evolutionary Computation Confer…“</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Genetic_Programming_for_Combining_Classifiers&amp;diff=1820&amp;oldid=prev"/>
				<updated>2014-11-28T12:48:12Z</updated>
		
		<summary type="html">&lt;p&gt;Die Seite wurde neu angelegt: „  == Reference == W. B. Langdon and B. F. Buxton: Genetic Programming for Combining Classifiers. Proceedings of the Genetic and Evolutionary Computation Confer…“&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Neue Seite&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
&lt;br /&gt;
== Reference ==&lt;br /&gt;
W. B. Langdon and B. F. Buxton: Genetic Programming for Combining Classifiers. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pp. 66-73, Morgan Kaufmann, 7-11 July 2001. &lt;br /&gt;
&lt;br /&gt;
== DOI ==&lt;br /&gt;
&lt;br /&gt;
== Abstract ==&lt;br /&gt;
Genetic programming (GP) can automat-&lt;br /&gt;
ically fuse given classifiers to produce a&lt;br /&gt;
combined classifier whose Receiver Operat-&lt;br /&gt;
ing Characteristics (ROC) are better than&lt;br /&gt;
[Scott et al., 1998b]’s “Maximum Realisable&lt;br /&gt;
Receiver Operating Characteristics” (MR-&lt;br /&gt;
ROC). I.e. better than their convex hull.&lt;br /&gt;
This is demonstrated on artificial, medical&lt;br /&gt;
and satellite image processing bench marks.&lt;br /&gt;
&lt;br /&gt;
== Extended Abstract ==&lt;br /&gt;
&lt;br /&gt;
== Bibtex == &lt;br /&gt;
&lt;br /&gt;
== Used References ==&lt;br /&gt;
[Freund and Schapire, 1996] Y. Freund and R. E.&lt;br /&gt;
Schapire. Experiments with a new boosting algo-&lt;br /&gt;
rithm. In Machine Learning: Proc. 13th Interna-&lt;br /&gt;
tional Conference, pp 148–156. Morgan Kaufmann.&lt;br /&gt;
&lt;br /&gt;
[Jacobs et al., 1991] R. A. Jacobs, M. I. Jordon, S. J.&lt;br /&gt;
Nowlan, and G. E. Hinton. Adaptive mixtures of&lt;br /&gt;
local experts. Neural Computation, 3:79–87, 1991.&lt;br /&gt;
&lt;br /&gt;
Kohavi and Sommerfield, 1996] R. Kohavi and D.&lt;br /&gt;
Sommerfield. MLC++: Machine learning library&lt;br /&gt;
in C++. Technical report, http://www.sgi.com/Technology/mlc/util/util.ps.&lt;br /&gt;
&lt;br /&gt;
[Langdon and Buxton, 2001] Evolving receiver oper-&lt;br /&gt;
ating characteristics for data fusion. In J. F. Miller &lt;br /&gt;
et al., eds., EuroGP’2001, LNCS 2038, pp 87–96,&lt;br /&gt;
Springer-Verlag.&lt;br /&gt;
&lt;br /&gt;
[Langdon, 1998] W. B. Langdon. Data Structures and&lt;br /&gt;
Genetic Programming. Kluwer.&lt;br /&gt;
&lt;br /&gt;
[Langdon, 2000] W. B. Langdon. Size fair and homol-&lt;br /&gt;
ogous tree genetic programming crossovers. Genetic&lt;br /&gt;
Programming &amp;amp; Evolvable Machines, 1(1/2):95–119.&lt;br /&gt;
&lt;br /&gt;
[Mitchell, 1997] T. M. Mitchell. Machine Learning.&lt;br /&gt;
McGraw-Hill, 1997.&lt;br /&gt;
&lt;br /&gt;
[Ripley, 1996] B. D. Ripley. Pattern Recognition and&lt;br /&gt;
Neural Networks. Cambridge University Press.&lt;br /&gt;
&lt;br /&gt;
[Scott et al., 1998a] M. J. J. Scott, M. Niranjan, and&lt;br /&gt;
R. W. Prager. Parcel: feature subset selection in&lt;br /&gt;
variable cost domains. Technical Report CUED/F-&lt;br /&gt;
INFENG/TR.323, Cambridge University, UK.&lt;br /&gt;
&lt;br /&gt;
[Scott et al., 1998b] Realisable classifiers: Improving&lt;br /&gt;
operating performance on variable cost problems.&lt;br /&gt;
In P. H. Lewis and M. S. Nixon, eds., Ninth British&lt;br /&gt;
Machine Vision Conference, pages 304–315,&lt;br /&gt;
&lt;br /&gt;
[Soule, 1999] T. Soule. Voting teams: A cooperative&lt;br /&gt;
approach to non-typical problems using genetic pro-&lt;br /&gt;
gramming. In W. Banzhaf et al., eds., GECCO,&lt;br /&gt;
pages 916–922. Morgan Kaufmann.&lt;br /&gt;
&lt;br /&gt;
[Swets et al., 2000] J. A. Swets, R. M. Dawes, and J.&lt;br /&gt;
Monahan. Better decisions through science. Scien-&lt;br /&gt;
tific American, pages 70–75, October.&lt;br /&gt;
&lt;br /&gt;
[Yusoff et al., 1998] Combining multiple experts for&lt;br /&gt;
classifying shot changes in video sequences. In IEEE&lt;br /&gt;
Int. Conf. on Multimedia Computing and Systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Links ==&lt;br /&gt;
=== Full Text === &lt;br /&gt;
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL_gecco2001_roc.pdf&lt;br /&gt;
&lt;br /&gt;
[[intern file]]&lt;br /&gt;
&lt;br /&gt;
=== Sonstige Links ===&lt;/div&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	</feed>