<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Automatic_generation_control</id>
	<title>Automatic generation control - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Automatic_generation_control"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Automatic_generation_control&amp;action=history"/>
	<updated>2026-04-10T15:46:49Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Automatic_generation_control&amp;diff=27139&amp;oldid=prev</id>
		<title>en&gt;ChrisGualtieri: Remove stub template(s). Page is start class or higher. Also check for and do General Fixes + Checkwiki fixes using AWB</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Automatic_generation_control&amp;diff=27139&amp;oldid=prev"/>
		<updated>2013-12-27T04:26:46Z</updated>

		<summary type="html">&lt;p&gt;Remove stub template(s). Page is start class or higher. Also check for and do General Fixes + Checkwiki fixes using &lt;a href=&quot;/index.php?title=Testwiki:AWB&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Testwiki:AWB (page does not exist)&quot;&gt;AWB&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Geometry-stub}}&lt;br /&gt;
The &amp;#039;&amp;#039;&amp;#039;Canberra distance&amp;#039;&amp;#039;&amp;#039; is a numerical measure of the distance between pairs of points in a [[vector space]], introduced in 1966&amp;lt;ref&amp;gt;{{cite journal|last1=Lance|first1=G. N.|last2=Williams|first2=W. T.|author2-link=W. T. Williams|title=Computer programs for hierarchical polythetic classification (&amp;quot;similarity analysis&amp;quot;).|journal=Computer Journal|year=1966|volume=9|issue=1|pages=60–64|accessdate=18 October 2011|doi=10.1093/comjnl/9.1.60}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
and refined in 1967&amp;lt;ref name=Lance&amp;gt;{{cite journal|last1=Lance|first1=G. N.|last2=Williams|first2=W. T.|author2-link=W. T. Williams|title=Mixed-data classificatory programs I.) Agglomerative Systems|journal=Australian Computer Journal|year=1967|pages=15–20|accessdate=18 October 2011}}&amp;lt;/ref&amp;gt; by G. N. Lance and [[W. T. Williams]]. It is a weighted version of [[Manhattan distance|&amp;#039;&amp;#039;L&amp;#039;&amp;#039;₁ (Manhattan) distance]].&amp;lt;ref name=&amp;quot;jurman&amp;quot;&amp;gt;Jurman G, Riccadonna S, Visintainer R, Furlanello C: Canberra Distance on Ranked Lists. In Proceedings, Advances in Ranking – NIPS 09 Workshop Edited by Agrawal S, Burges C, Crammer K. 2009, 22–27.&amp;lt;/ref&amp;gt;&lt;br /&gt;
The Canberra distance has been used as a metric for comparing [[ranked list]]s&amp;lt;ref name=&amp;quot;jurman&amp;quot;/&amp;gt; and for [[intrusion detection]] in [[computer security]].&amp;lt;ref&amp;gt;Syed Masum Emran and Nong Ye (2002). Robustness of chi-square and Canberra distance metrics for computer intrusion detection. &amp;#039;&amp;#039;[[Quality and Reliability Engineering International]]&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;18&amp;#039;&amp;#039;&amp;#039;:19–28.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
The Canberra distance &amp;#039;&amp;#039;d&amp;#039;&amp;#039; between vectors &amp;#039;&amp;#039;&amp;#039;p&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;q&amp;#039;&amp;#039;&amp;#039; in an &amp;#039;&amp;#039;n&amp;#039;&amp;#039;-dimensional [[real number|real]] [[vector space]] is given as follows:&lt;br /&gt;
:&amp;lt;math&amp;gt;d(\mathbf{p}, \mathbf{q}) = \sum_{i=1}^n \frac{|p_i-q_i|}{|p_i|+|q_i|},&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
:&amp;lt;math&amp;gt;\mathbf{p}=(p_1,p_2,\dots,p_n)\text{ and }\mathbf{q}=(q_1,q_2,\dots,q_n)\,&amp;lt;/math&amp;gt; &lt;br /&gt;
are [[Euclidean vector|vector]]s. &lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Normed vector space]]&lt;br /&gt;
*[[Metric (mathematics)|Metric]]&lt;br /&gt;
*[[Manhattan distance]]&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
==References ==&lt;br /&gt;
* {{cite web|last=Schulz|first=Jan|title=Canberra distance|url=http://www.code10.info/index.php?option=com_content&amp;amp;view=article&amp;amp;id=49:article_canberra-distance&amp;amp;catid=38:cat_coding_algorithms_data-similarity&amp;amp;Itemid=57|work=Code 10|accessdate=18 October 2011}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- I decided to put this in the References section...&lt;br /&gt;
==External links==&lt;br /&gt;
*[http://www.code10.info/index.php?option=com_content&amp;amp;view=article&amp;amp;id=49:article_canberra-distance&amp;amp;catid=38:cat_coding_algorithms_data-similarity&amp;amp;Itemid=57 Canberra distance], by Jan Schulz&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Digital geometry]]&lt;br /&gt;
[[Category:Metric geometry]]&lt;br /&gt;
[[Category:Norms (mathematics)]]&lt;/div&gt;</summary>
		<author><name>en&gt;ChrisGualtieri</name></author>
	</entry>
</feed>