<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ko">
	<id>https://wiki.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98</id>
	<title>알고리즘 - 편집 역사</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98"/>
	<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98&amp;action=history"/>
	<updated>2026-04-04T18:28:11Z</updated>
	<subtitle>이 문서의 편집 역사</subtitle>
	<generator>MediaWiki 1.35.0</generator>
	<entry>
		<id>https://wiki.mathnt.net/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98&amp;diff=51482&amp;oldid=prev</id>
		<title>2021년 2월 17일 (수) 08:40에 Pythagoras0님의 편집</title>
		<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98&amp;diff=51482&amp;oldid=prev"/>
		<updated>2021-02-17T08:40:20Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;ko&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← 이전 판&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;2021년 2월 17일 (수) 08:40 판&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l110&quot; &gt;110번째 줄:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;110번째 줄:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== 메타데이터 ==&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==메타데이터==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===위키데이터===&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===위키데이터===&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;* ID :  [https://www.wikidata.org/wiki/Q8366 Q8366]&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;* ID :  [https://www.wikidata.org/wiki/Q8366 Q8366]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;===Spacy 패턴 목록===&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;algorithm&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LOWER&amp;#039;: &amp;#039;mathematical&amp;#039;}, {&amp;#039;LEMMA&amp;#039;: &amp;#039;algorithm&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;algorithms&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Pythagoras0</name></author>
	</entry>
	<entry>
		<id>https://wiki.mathnt.net/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98&amp;diff=47281&amp;oldid=prev</id>
		<title>Pythagoras0: /* 메타데이터 */ 새 문단</title>
		<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98&amp;diff=47281&amp;oldid=prev"/>
		<updated>2020-12-26T12:48:01Z</updated>

		<summary type="html">&lt;p&gt;&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;메타데이터: &lt;/span&gt; 새 문단&lt;/span&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;ko&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← 이전 판&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;2020년 12월 26일 (토) 12:48 판&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l109&quot; &gt;109번째 줄:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;109번째 줄:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===소스===&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===소스===&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;== 메타데이터 ==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;===위키데이터===&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* ID :  [https://www.wikidata.org/wiki/Q8366 Q8366]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Pythagoras0</name></author>
	</entry>
	<entry>
		<id>https://wiki.mathnt.net/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98&amp;diff=45992&amp;oldid=prev</id>
		<title>Pythagoras0: /* 노트 */ 새 문단</title>
		<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98&amp;diff=45992&amp;oldid=prev"/>
		<updated>2020-12-17T03:49:11Z</updated>

		<summary type="html">&lt;p&gt;&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;노트: &lt;/span&gt; 새 문단&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;새 문서&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== 노트 ==&lt;br /&gt;
&lt;br /&gt;
* But it reveals something else about the importance and the opacity of the algorithm that drives the identification of Trends.&amp;lt;ref name=&amp;quot;ref_c5f2&amp;quot;&amp;gt;[https://limn.it/articles/can-an-algorithm-be-wrong/ Limn Can an Algorithm be Wrong?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* These providers offer complex algorithms to manage, curate, and organize these massive networks.&amp;lt;ref name=&amp;quot;ref_c5f2&amp;quot; /&amp;gt;&lt;br /&gt;
* But there is a tension between what we understand these algorithms to be, what we need them to be, and what they in fact are.&amp;lt;ref name=&amp;quot;ref_c5f2&amp;quot; /&amp;gt;&lt;br /&gt;
* We do not have a sufficient vocabulary for assessing the intervention of these algorithms.&amp;lt;ref name=&amp;quot;ref_c5f2&amp;quot; /&amp;gt;&lt;br /&gt;
* In psychology, one of these problem-solving approaches is known as an algorithm.&amp;lt;ref name=&amp;quot;ref_6343&amp;quot;&amp;gt;[https://www.verywellmind.com/what-is-an-algorithm-2794807 The Algorithm Problem Solving Approach in Psychology]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* An algorithm is often expressed in the form of a graph, where a square represents each step.&amp;lt;ref name=&amp;quot;ref_6343&amp;quot; /&amp;gt;&lt;br /&gt;
* The upside of using an algorithm to solve a problem or make a decision is that yields the best possible answer every time.&amp;lt;ref name=&amp;quot;ref_6343&amp;quot; /&amp;gt;&lt;br /&gt;
* The downside of using an algorithm to solve the problem is that this process tends to be very time-consuming.&amp;lt;ref name=&amp;quot;ref_6343&amp;quot; /&amp;gt;&lt;br /&gt;
* There is no algorithm that has all of these properties, and so the choice of sorting algorithm depends on the application.&amp;lt;ref name=&amp;quot;ref_6228&amp;quot;&amp;gt;[https://www.toptal.com/developers/sorting-algorithms Sorting Algorithms Animations]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* It also lets people tell the algorithm directly what’s important—or not so important, or downright irritating—to them.&amp;lt;ref name=&amp;quot;ref_ba02&amp;quot;&amp;gt;[https://blog.hootsuite.com/facebook-algorithm/ How the Facebook Algorithm Works in 2020 and How to Work With It]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Facebook used all these answers to update the algorithm with the patterns they extrapolated.&amp;lt;ref name=&amp;quot;ref_ba02&amp;quot; /&amp;gt;&lt;br /&gt;
* According to Facebook, one of the algorithm’s key ranking signals is whether a user has previously engaged with your Page.&amp;lt;ref name=&amp;quot;ref_ba02&amp;quot; /&amp;gt;&lt;br /&gt;
* Recency is another ranking signal that matters as the algorithm selects which posts to show people.&amp;lt;ref name=&amp;quot;ref_ba02&amp;quot; /&amp;gt;&lt;br /&gt;
* Not all procedures can be called an algorithm.&amp;lt;ref name=&amp;quot;ref_1f36&amp;quot;&amp;gt;[https://www.tutorialspoint.com/data_structures_algorithms/algorithms_basics.htm Algorithms Basics]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* There are no well-defined standards for writing algorithms.&amp;lt;ref name=&amp;quot;ref_1f36&amp;quot; /&amp;gt;&lt;br /&gt;
* We write algorithms in a step-by-step manner, but it is not always the case.&amp;lt;ref name=&amp;quot;ref_1f36&amp;quot; /&amp;gt;&lt;br /&gt;
* In design and analysis of algorithms, usually the second method is used to describe an algorithm.&amp;lt;ref name=&amp;quot;ref_1f36&amp;quot; /&amp;gt;&lt;br /&gt;
* Chapter 1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and making predictions.&amp;lt;ref name=&amp;quot;ref_394a&amp;quot;&amp;gt;[https://algs4.cs.princeton.edu/ Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* ‘When algorithms start to create new algorithms, it gets farther and farther from human agency,’ says Ellen Ullman.&amp;lt;ref name=&amp;quot;ref_43ca&amp;quot;&amp;gt;[https://www.theguardian.com/technology/2018/aug/29/coding-algorithms-frankenalgos-program-danger Franken-algorithms: the deadly consequences of unpredictable code]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Few subjects are more constantly or fervidly discussed right now than algorithms.&amp;lt;ref name=&amp;quot;ref_43ca&amp;quot; /&amp;gt;&lt;br /&gt;
* At root, an algorithm is a small, simple thing; a rule used to automate the treatment of a piece of data.&amp;lt;ref name=&amp;quot;ref_43ca&amp;quot; /&amp;gt;&lt;br /&gt;
* We no longer accept the sales pitch for this type of algorithm so meekly.&amp;lt;ref name=&amp;quot;ref_43ca&amp;quot; /&amp;gt;&lt;br /&gt;
* Word History: Because of its popularity over the last century, one might figure algorithm for a new coinage.&amp;lt;ref name=&amp;quot;ref_82f7&amp;quot;&amp;gt;[https://www.thefreedictionary.com/algorithm algorithm]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* The use of algorithms in policing is one example of their increasing influence on our lives.&amp;lt;ref name=&amp;quot;ref_bff8&amp;quot;&amp;gt;[https://en.wiktionary.org/wiki/algorithm Wiktionary]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* In the popular imagination, recommendation algorithms have come to dominate our idea of what an algorithm is.&amp;lt;ref name=&amp;quot;ref_87dc&amp;quot;&amp;gt;[https://mashable.com/article/what-is-an-algorithm/ What is an algorithm, anyway?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* “With computers, the algorithm can get vastly more complex,” Domingos said.&amp;lt;ref name=&amp;quot;ref_87dc&amp;quot; /&amp;gt;&lt;br /&gt;
* “Addition is an algorithm that&amp;#039;s defined in a few lines of text.&amp;lt;ref name=&amp;quot;ref_87dc&amp;quot; /&amp;gt;&lt;br /&gt;
* A turning point for modern algorithms came when Larry Page and Sergei Brin wrote the Google PageRank algorithm .&amp;lt;ref name=&amp;quot;ref_87dc&amp;quot; /&amp;gt;&lt;br /&gt;
* The next section provides five examples of algorithms to explain the causes and sources of their biases.&amp;lt;ref name=&amp;quot;ref_09e5&amp;quot;&amp;gt;[https://www.brookings.edu/research/algorithmic-bias-detection-and-mitigation-best-practices-and-policies-to-reduce-consumer-harms/ Algorithmic bias detection and mitigation: Best practices and policies to reduce consumer harms]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* They also illustrate how these outcomes emerge, and in some cases, without malicious intent by the creators or operators of the algorithm.&amp;lt;ref name=&amp;quot;ref_09e5&amp;quot; /&amp;gt;&lt;br /&gt;
* Roundtable participants focused especially on bias stemming from flaws in the data used to train the algorithms.&amp;lt;ref name=&amp;quot;ref_09e5&amp;quot; /&amp;gt;&lt;br /&gt;
* Conversely, algorithms with too much data, or an over-representation, can skew the decision toward a particular result.&amp;lt;ref name=&amp;quot;ref_09e5&amp;quot; /&amp;gt;&lt;br /&gt;
* An algorithm is a precise step-by-step series of rules that leads to a product or to the solution to a problem.&amp;lt;ref name=&amp;quot;ref_d0ca&amp;quot;&amp;gt;[https://www.sciencenewsforstudents.org/article/explainer-what-is-an-algorithm Explainer: What is an algorithm?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Some steps in an algorithm depend on what happened or was learned in earlier steps.&amp;lt;ref name=&amp;quot;ref_d0ca&amp;quot; /&amp;gt;&lt;br /&gt;
* Computers use algorithms, too.&amp;lt;ref name=&amp;quot;ref_d0ca&amp;quot; /&amp;gt;&lt;br /&gt;
* Mathematicians and computer scientists designed the algorithms that Google uses.&amp;lt;ref name=&amp;quot;ref_d0ca&amp;quot; /&amp;gt;&lt;br /&gt;
* Many companies assume that customers are wary of their algorithms — and they go to great lengths to hide or humanize them.&amp;lt;ref name=&amp;quot;ref_b674&amp;quot;&amp;gt;[https://hbr.org/2018/10/do-people-trust-algorithms-more-than-companies-realize Do People Trust Algorithms More Than Companies Realize?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* But is it good practice for companies to mask their algorithms in this way?&amp;lt;ref name=&amp;quot;ref_b674&amp;quot; /&amp;gt;&lt;br /&gt;
* They’re hiring data scientists, mining employee and customer data for insights, and creating algorithms to optimize their recommendations.&amp;lt;ref name=&amp;quot;ref_b674&amp;quot; /&amp;gt;&lt;br /&gt;
* It seems that the more companies expect users to engage with their product or service, the more they anthropomorphize their algorithms.&amp;lt;ref name=&amp;quot;ref_b674&amp;quot; /&amp;gt;&lt;br /&gt;
* &amp;quot; &amp;quot; The algorithm is the basic technique used to get the job done.&amp;lt;ref name=&amp;quot;ref_0f3e&amp;quot;&amp;gt;[https://computer.howstuffworks.com/what-is-a-computer-algorithm.htm What is a computer algorithm?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* The algorithm is the basic technique used to get the job done.&amp;lt;ref name=&amp;quot;ref_0f3e&amp;quot; /&amp;gt;&lt;br /&gt;
* All four of these algorithms accomplish exactly the same goal, but each algorithm does it in completely different way.&amp;lt;ref name=&amp;quot;ref_0f3e&amp;quot; /&amp;gt;&lt;br /&gt;
* In computer programming, there are often many different ways -- algorithms -- to accomplish any given task.&amp;lt;ref name=&amp;quot;ref_0f3e&amp;quot; /&amp;gt;&lt;br /&gt;
* They are managed not by people but by an algorithm that communicates with them via their smartphones.&amp;lt;ref name=&amp;quot;ref_115a&amp;quot;&amp;gt;[https://www.ft.com/content/88fdc58e-754f-11e6-b60a-de4532d5ea35 When your boss is an algorithm]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* The algorithm will not tell him the delivery address until he has picked up the food from Carluccio’s.&amp;lt;ref name=&amp;quot;ref_115a&amp;quot; /&amp;gt;&lt;br /&gt;
* The algorithm compares each courier’s performance to its own estimate of how fast they should have been.&amp;lt;ref name=&amp;quot;ref_115a&amp;quot; /&amp;gt;&lt;br /&gt;
* once they log on to the app, they only have 10-20 seconds to respond to “trip requests” routed to them by the algorithm.&amp;lt;ref name=&amp;quot;ref_115a&amp;quot; /&amp;gt;&lt;br /&gt;
* Each step in the algorithm should be clear and unambiguous.&amp;lt;ref name=&amp;quot;ref_e1cc&amp;quot;&amp;gt;[https://www.programiz.com/dsa/algorithm What is an Algorithm?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* An algorithm shouldn&amp;#039;t include computer code.&amp;lt;ref name=&amp;quot;ref_e1cc&amp;quot; /&amp;gt;&lt;br /&gt;
* Advanced algorithms for getting such standards while eliminating sensors are cornerstone.&amp;lt;ref name=&amp;quot;ref_e9e9&amp;quot;&amp;gt;[https://www.mdpi.com/journal/algorithms Algorithms]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Here, a new nonlinear hybridization algorithm, which is based on neural networks, to estimate the gravity vector is presented.&amp;lt;ref name=&amp;quot;ref_e9e9&amp;quot; /&amp;gt;&lt;br /&gt;
* An algorithm is a specific procedure for solving a well-defined computational problem.&amp;lt;ref name=&amp;quot;ref_e7f6&amp;quot;&amp;gt;[https://www.britannica.com/science/algorithm Algorithm | mathematics]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* An algorithm is set of instructions for solving a problem or accomplishing a task.&amp;lt;ref name=&amp;quot;ref_0eec&amp;quot;&amp;gt;[https://www.investopedia.com/terms/a/algorithm.asp Algorithm Definition]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* One common example of an algorithm is a recipe, which consists of specific instructions for preparing a dish/meal.&amp;lt;ref name=&amp;quot;ref_0eec&amp;quot; /&amp;gt;&lt;br /&gt;
* Computer algorithms make life easier by trimming the time it takes to manually do things.&amp;lt;ref name=&amp;quot;ref_0eec&amp;quot; /&amp;gt;&lt;br /&gt;
* In the world of automation, algorithms allow workers to be more proficient and focused.&amp;lt;ref name=&amp;quot;ref_0eec&amp;quot; /&amp;gt;&lt;br /&gt;
* The internet runs on algorithms and all online searching is accomplished through them.&amp;lt;ref name=&amp;quot;ref_8b99&amp;quot;&amp;gt;[https://www.pewresearch.org/internet/2017/02/08/code-dependent-pros-and-cons-of-the-algorithm-age/ Experts on the Pros and Cons of Algorithms]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Email knows where to go thanks to algorithms.&amp;lt;ref name=&amp;quot;ref_8b99&amp;quot; /&amp;gt;&lt;br /&gt;
* Online dating and book-recommendation and travel websites would not function without algorithms.&amp;lt;ref name=&amp;quot;ref_8b99&amp;quot; /&amp;gt;&lt;br /&gt;
* GPS mapping systems get people from point A to point B via algorithms.&amp;lt;ref name=&amp;quot;ref_8b99&amp;quot; /&amp;gt;&lt;br /&gt;
* To get a feel for the concept of algorithms, think about getting dressed in the morning.&amp;lt;ref name=&amp;quot;ref_fef4&amp;quot;&amp;gt;[https://theconversation.com/what-is-an-algorithm-how-computers-know-what-to-do-with-data-146665 What is an algorithm? How computers know what to do with data]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Next comes the heart of an algorithm – computation.&amp;lt;ref name=&amp;quot;ref_fef4&amp;quot; /&amp;gt;&lt;br /&gt;
* Finally, the last step of an algorithm is output – expressing the answer.&amp;lt;ref name=&amp;quot;ref_fef4&amp;quot; /&amp;gt;&lt;br /&gt;
* It allows computers to string algorithms together in complex fashions to produce more algorithms.&amp;lt;ref name=&amp;quot;ref_fef4&amp;quot; /&amp;gt;&lt;br /&gt;
* Think about an algorithm for getting dressed in the morning.&amp;lt;ref name=&amp;quot;ref_413c&amp;quot;&amp;gt;[https://www.bbc.co.uk/bitesize/topics/z3tbwmn/articles/z3whpv4 What is an algorithm?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* When you write an algorithm the order of the instructions is very important.&amp;lt;ref name=&amp;quot;ref_413c&amp;quot; /&amp;gt;&lt;br /&gt;
* In computer science, an algorithm is a set of steps for a computer program to accomplish a task.&amp;lt;ref name=&amp;quot;ref_f187&amp;quot;&amp;gt;[https://www.khanacademy.org/computing/computer-science/algorithms/intro-to-algorithms/v/what-are-algorithms What is an algorithm and why should you care? (video)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* And finding good algorithms and knowing when to apply them will allow you to write interesting and important programs.&amp;lt;ref name=&amp;quot;ref_f187&amp;quot; /&amp;gt;&lt;br /&gt;
* They use an optimization and a scheduling algorithm.&amp;lt;ref name=&amp;quot;ref_f187&amp;quot; /&amp;gt;&lt;br /&gt;
* Those algorithms are more complex than our everyday algorithms like making a grilled cheese sandwich.&amp;lt;ref name=&amp;quot;ref_f187&amp;quot; /&amp;gt;&lt;br /&gt;
* … sometimes you solve a problem by coming up with an algorithm of some kind.&amp;lt;ref name=&amp;quot;ref_8fc0&amp;quot;&amp;gt;[https://www.merriam-webster.com/dictionary/algorithm Definition of Algorithm by Merriam-Webster]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* In essence, algorithms are simply a series of instructions that are followed, step by step, to do something useful or solve a problem.&amp;lt;ref name=&amp;quot;ref_64a3&amp;quot;&amp;gt;[https://www.thinkautomation.com/eli5/what-is-an-algorithm-an-in-a-nutshell-explanation/ What is an algorithm? An ‘in a nutshell’ explanation]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* In computing, algorithms provide computers with a successive guide to completing actions.&amp;lt;ref name=&amp;quot;ref_64a3&amp;quot; /&amp;gt;&lt;br /&gt;
* Computer algorithms work via input and output.&amp;lt;ref name=&amp;quot;ref_64a3&amp;quot; /&amp;gt;&lt;br /&gt;
* You can easily visualise algorithms as a flowchart.&amp;lt;ref name=&amp;quot;ref_64a3&amp;quot; /&amp;gt;&lt;br /&gt;
* Our control data must be set to check if our algorithm predicts CPC correctly.&amp;lt;ref name=&amp;quot;ref_950a&amp;quot;&amp;gt;[https://www.klipfolio.com/blog/algorithm-in-six-steps How to build an algorithm in 6 steps]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* It’s important to note that keeping your algorithm working with constant tweaks and maintenance is crucial.&amp;lt;ref name=&amp;quot;ref_950a&amp;quot; /&amp;gt;&lt;br /&gt;
* There will always be context that has an impact on the outcome of the algorithm that was not taken into account in the model.&amp;lt;ref name=&amp;quot;ref_950a&amp;quot; /&amp;gt;&lt;br /&gt;
* Bringing your algorithm to a place that is robust and permanent is easier said than done.&amp;lt;ref name=&amp;quot;ref_950a&amp;quot; /&amp;gt;&lt;br /&gt;
* An algorithm is a set of instructions designed to perform a specific task.&amp;lt;ref name=&amp;quot;ref_72af&amp;quot;&amp;gt;[https://techterms.com/definition/algorithm Algorithm Definition]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* In computer programming, algorithms are often created as functions.&amp;lt;ref name=&amp;quot;ref_72af&amp;quot; /&amp;gt;&lt;br /&gt;
* An image editing program may contain algorithms designed to process image data.&amp;lt;ref name=&amp;quot;ref_72af&amp;quot; /&amp;gt;&lt;br /&gt;
* Therefore, programmers usually seek to create the most efficient algorithms possible.&amp;lt;ref name=&amp;quot;ref_72af&amp;quot; /&amp;gt;&lt;br /&gt;
* A recipe is a good example of an algorithm because it says what must be done, step by step.&amp;lt;ref name=&amp;quot;ref_eb01&amp;quot;&amp;gt;[https://simple.wikipedia.org/wiki/Algorithm Simple English Wikipedia, the free encyclopedia]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Informally, an algorithm can be called a &amp;quot;list of steps&amp;quot;.&amp;lt;ref name=&amp;quot;ref_eb01&amp;quot; /&amp;gt;&lt;br /&gt;
* In computing, an algorithm is a precise list of operations that could be done by a Turing machine.&amp;lt;ref name=&amp;quot;ref_eb01&amp;quot; /&amp;gt;&lt;br /&gt;
* The thing that measures the difficulty of an algorithm is called complexity.&amp;lt;ref name=&amp;quot;ref_eb01&amp;quot; /&amp;gt;&lt;br /&gt;
* That’s really all that algorithms are mathematical instructions.&amp;lt;ref name=&amp;quot;ref_a325&amp;quot;&amp;gt;[https://www.wired.com/insights/2014/09/artificial-intelligence-algorithms-2/ Artificial Intelligence: How Algorithms Make Systems Smart]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Whether you are aware of it or not, algorithms are becoming a ubiquitous part of our lives.&amp;lt;ref name=&amp;quot;ref_a325&amp;quot; /&amp;gt;&lt;br /&gt;
* Klint Finley reports, “Today’s internet is ruled by algorithms.&amp;lt;ref name=&amp;quot;ref_a325&amp;quot; /&amp;gt;&lt;br /&gt;
* Clearly, however, people with both good and bad intentions have used algorithms.&amp;lt;ref name=&amp;quot;ref_a325&amp;quot; /&amp;gt;&lt;br /&gt;
* A computer program can be viewed as an elaborate algorithm.&amp;lt;ref name=&amp;quot;ref_8a5c&amp;quot;&amp;gt;[https://whatis.techtarget.com/definition/algorithm Definition from WhatIs.com]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* An encryption algorithm transforms data according to specified actions to protect it.&amp;lt;ref name=&amp;quot;ref_8a5c&amp;quot; /&amp;gt;&lt;br /&gt;
* This algorithm used the one-dimensional central section of the filter.&amp;lt;ref name=&amp;quot;ref_9ef9&amp;quot;&amp;gt;[https://dictionary.cambridge.org/dictionary/english/algorithm meaning in the Cambridge English Dictionary]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* So, permitted deceleration of the mobile robot is restricted by the proposed algorithm.&amp;lt;ref name=&amp;quot;ref_9ef9&amp;quot; /&amp;gt;&lt;br /&gt;
* The upshot of this is that adaptation to nonstationarity does not require qualitative changes in a learning algorithm.&amp;lt;ref name=&amp;quot;ref_9ef9&amp;quot; /&amp;gt;&lt;br /&gt;
* However, the error is quick to decrease and enter the range of error of the other algorithms.&amp;lt;ref name=&amp;quot;ref_9ef9&amp;quot; /&amp;gt;&lt;br /&gt;
* But here’s the absolute simplest definition: An algorithm is a set of guidelines that describe how to perform a task.&amp;lt;ref name=&amp;quot;ref_e4ce&amp;quot;&amp;gt;[https://slate.com/technology/2016/02/whats-the-deal-with-algorithms.html What is an algorithm? An explainer.]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* As Domingos goes on to explain, algorithms are reducible to three logical operations: AND, OR, and NOT.&amp;lt;ref name=&amp;quot;ref_e4ce&amp;quot; /&amp;gt;&lt;br /&gt;
* It’s this that frightens some people, since it makes algorithms sound like they’re alive, possibly even sentient.&amp;lt;ref name=&amp;quot;ref_e4ce&amp;quot; /&amp;gt;&lt;br /&gt;
* In fact, the most promising—and most troubling!—property of some algorithms may be their ability to decide what we see and how we see it.&amp;lt;ref name=&amp;quot;ref_e4ce&amp;quot; /&amp;gt;&lt;br /&gt;
* The concept of algorithm has existed since antiquity.&amp;lt;ref name=&amp;quot;ref_f213&amp;quot;&amp;gt;[https://en.wikipedia.org/wiki/Algorithm Algorithm]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Thus, an algorithm can be considered to be any sequence of operations that can be simulated by a Turing-complete system.&amp;lt;ref name=&amp;quot;ref_f213&amp;quot; /&amp;gt;&lt;br /&gt;
* The informal definitions of algorithms generally require that the algorithm always terminates.&amp;lt;ref name=&amp;quot;ref_f213&amp;quot; /&amp;gt;&lt;br /&gt;
* Stored data are regarded as part of the internal state of the entity performing the algorithm.&amp;lt;ref name=&amp;quot;ref_f213&amp;quot; /&amp;gt;&lt;br /&gt;
===소스===&lt;br /&gt;
 &amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Pythagoras0</name></author>
	</entry>
</feed>