Content deleted Content added
m Reverted edits by Cyberbot II (talk) to last version by Talgalili |
m add to WP:Lists |
||
| (9 intermediate revisions by 8 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=List|1=
{{WikiProject
{{WikiProject
{{
{{WikiProject Statistics|importance=low}}
}}
{{Broken anchors|links=
* <nowiki>[[Association rule learning#Zero-attribute rule|Zero-attribute rule]]</nowiki> The anchor (#Zero-attribute rule) is no longer available because it was [[Special:Diff/445101499|deleted by a user]] before. <!-- {"title":"Zero-attribute rule","appear":{"revid":429287314,"parentid":429287023,"timestamp":"2011-05-15T20:32:48Z","replaced_anchors":{"Zero-attribute-rule":"Zero-attribute rule"},"removed_section_titles":["Zero-attribute-rule"],"added_section_titles":["Zero-attribute rule"]},"disappear":{"revid":445101499,"parentid":445101413,"timestamp":"2011-08-16T05:13:21Z","removed_section_titles":["Zero-attribute rule"],"added_section_titles":[]}} -->
}}
__TOC__
== Spam under "Sequence alignment" heading ==
The "website review" link shouldn't be there, but I can't edit semi-protected pages yet. Anyone care to clean it up? [[User:ThomasTC|ThomasTC]] ([[User talk:ThomasTC|talk]]) 09:16, 7 July 2017 (UTC)
== algorithms described in Wikipedia ==
''The following is a list of the algorithms described in Wikipedia.''
Line 126 ⟶ 133:
If no one has any objections, I'd like to add some things to the statistics section. My hesitation stems from whether they, universally, be considered algorithms, in the strictest sense of the word. For example, there are many methods for automated binning, like Freedman–Diaconis rule, and Doane's formula. Should I include these?
[[User:Statethatiamin|Statethatiamin]] ([[User talk:Statethatiamin|talk]]) 15:44, 27 April 2012 (UTC)
== External links modified ==
Hello fellow Wikipedians,
I have just modified one external link on [[List of algorithms]]. Please take a moment to review [https://en.wikipedia.org/w/index.php?diff=prev&oldid=792422995 my edit]. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit [[User:Cyberpower678/FaQs#InternetArchiveBot|this simple FaQ]] for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20131006113018/http://glorfindel.mavrinac.com/~aaron/school/pdf/bay06_surf.pdf to http://glorfindel.mavrinac.com/~aaron/school/pdf/bay06_surf.pdf
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
{{sourcecheck|checked=false|needhelp=}}
Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 12:43, 26 July 2017 (UTC)
== Gale-Shapley algorithm ==
I provide here the evidences - for the sake of expediency - anyone:
findings were "marriage" is shown but sources indic. matching - part. the stable marriage problem is a type of matching problem. The fact: Teslet: p.32: Shapley & Roth won Nobel for Economics - applications of the algorithm indicated cannot be only: marriage.
*mathweb.ucsd.edu/~gptesler/154/slides/154_galeshapley_20-handout.pdf p.32 marriage shown as only one example of four
*www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/01StableMatching.pdf - doesn't even mention marriage
*web.stanford.edu/~ashishg/cs261/win21/notes/l5_note.pdf "We are going to study a classic problem, called the stable marriage problem. This is used in school choice, in resident matching, in network routers, and is one of the most beautiful matching problems." - doesn't exclude "matching" an shows mar. is sub of mat. (group in) mat.
[[User:Onemillionthtree|(𒌋*𓆏)𓆭]] 05:28, 26 April 2025 (UTC)
| |||