Wikipedia:Articles for deletion/One-pass algorithm: Difference between revisions

Revision as of 11:42, 13 April 2021

Latest revision as of 06:31, 21 April 2021

(11 intermediate revisions by 6 users not shown)

Line 1:

<div class="boilerplate afd vfd xfd-closed" style="background-color: #F3F9FF; margin: 2em 0 0 0; padding: 0 10px 0 10px; border: 1px solid #AAAAAA;">

===[[:One-pass algorithm]]===

:''The following discussion is an archived debate of the proposed deletion of the article below. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made on the appropriate discussion page (such as the article's [[Help:Using talk pages|talk page]] or in a [[Wikipedia:Deletion review|deletion review]]). No further edits should be made to this page.''

{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}

<!--Template:Afd top

Note: If you are seeing this page as a result of an attempt to re-nominate an article for deletion, you must manually edit the AfD nomination links to create a new discussion page using the name format of [[Wikipedia:Articles for deletion/PAGENAME (2nd nomination)]]. When you create the new discussion page, please provide a link to this old discussion in your nomination. -->

The result was '''keep'''. There is consensus that the subject is notable. There was also a mild suggestion of a possible merge as a subtopic of [[streaming algorithm]]; it lacked consensus here but could be revisited via a future [[WP:MERGEPROP|merge proposal]]. <small>[[Wikipedia:NACD|(non-admin closure)]]</small> — <span style="font-family:Trebuchet MS;font-size:100%;color:black;background-color:transparent;;">[[User:MarkH21|MarkH_{<small>21</small>}]]^{[[User talk:MarkH21|<span style="background-color:navy; color:white;">talk</span>]]}</span> 06:31, 21 April 2021 (UTC)

===[[:One-pass algorithm]]===

<noinclude>{{AFD help}}</noinclude>

:{{la|One-pass algorithm}} – (<includeonly>[[Wikipedia:Articles for deletion/One-pass algorithm|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2021 April 13#{{anchorencode:One-pass algorithm}}|View log]]</noinclude>)

Line 11 ⟶ 16:

***Yes. This is a very basic topic: a lot of the results via google are essentially just lecture notes and lecture slides. But what do you mean treated in a different way? I think there's enough material in sources, and precedent on Wikipedia, for one-pass algorithm and [[multi-pass algorithm]] to exist. I will look into TAoCP. <span style="font-family:monospace;color:#006400 !important;font-weight:bold;">//[[User:Lollipoplollipoplollipop|Lollipoplollipoplollipop]]::[[User talk:Lollipoplollipoplollipop|talk]]</span> 11:02, 13 April 2021 (UTC)

****Knuth points out that it's a vague concept, and treats both together. Enjoy. Volume 1, of course. [[User:Uncle G|Uncle G]] ([[User talk:Uncle G|talk]]) 11:42, 13 April 2021 (UTC)

*:I added a list of possible sources for the article at [[Talk:One-pass algorithm#Potential citations|Talk:One-pass algorithm]] <span style="font-family:monospace;color:#006400 !important;font-weight:bold;">//[[User:Lollipoplollipoplollipop|Lollipoplollipoplollipop]]::[[User talk:Lollipoplollipoplollipop|talk]]</span> 15:41, 15 April 2021 (UTC)

* '''Speedy keep''', the nominator does not propose a valid [[WP:DEL-REASON]]. The nominator does not say which notability guideline this article fails to meet. [[User:SailingInABathTub|SailingInABathTub]] ([[User talk:SailingInABathTub|talk]]) 10:25, 13 April 2021 (UTC)

*'''Comment''' No valid reason given for speedy keeping. The article only has one listed source. This article as it stands does not pass GNG, although it may well be possible to add enough sourcing to pass that. We should never speedy keep articles that do not as they are written pass GNG.[[User:Johnpacklambert|John Pack Lambert]] ([[User talk:Johnpacklambert|talk]]) 13:45, 14 April 2021 (UTC)

* '''Comment''' IMO the article should be kept and cleaned up. The distinction is important in CS, as a one-pass algorithm by definition can deal with arbitrarily large input with bounded memory. I no longer remember who wrote what, but the definition is clear and useful, and the term itself is clearly in use. To me, the fact that a lot of the references are in things like CS course notes tells me that a Wikipedia page on the topic would be useful, but I don't know where that lands us with Notability standards. The part on cluster representatives seems specific to database algorithms, so I'd be inclined to take it out. I'll see if I can dig up a few references and do a little cleanup [[User:Dmh|--dmh]]

* '''Keep''' I missed the link to [[streaming algorithm]]. With the text on cluster representatives removed, I think this article is about right: The full details, including the mechanics, are covered under [[streaming algorithm]]. This article just calls out that a one-pass algorithm is a particular kind of streaming algorithm, and gives examples of what you can and can't do in one pass. It adds an increment of value over [[streaming algorithm]] but mentions some specifics about one-pass algorithms in particular. The one area of improvement would be the examples. It would be good to call out a case that can be solved in more than one pass but not in one. As to notability, "one-pass" algorithm is definitely a term of art in CS. I think the hits for CS courses attest to this, but I don't think they need to be included in the article as references, since they only support notability and don't particularly add to the understanding beyond what's already in the article. [[User:Dmh|--dmh]]. <!--Template:Undated--><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|undated]] comment added 15:45, 14 April 2021 (UTC)</small> <!--Autosigned by SineBot-->

*'''Keep'''. This is an important subtopic of streaming algorithms. If it were stubbier, or the streaming algorithm article less broad, then a merge rather than deletion might be warranted, but as it is I think it works well enough as a stand-alone article. Googls Scholar has over 10k hits for "one pass" "streaming" and about the same number for "single pass" "streaming" so notability or availability of sourcing should not be an issue. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 20:38, 15 April 2021 (UTC)

*'''Keep'''. The article needs some more work, but I have added some additional references, more are quite readily available (from searching "one-pass algorithm" or "single-pass algorithm") and it seems fine to me as a stub. '''[[User:JPxG|jp]]'''×'''[[User talk:JPxG|g]]''' 23:22, 15 April 2021 (UTC)

*'''Actually, maybe fold into [[streaming algorithm]]'''. I've twice seen material here that's more about particular kinds of streaming algorithm and not about one-pass algorithms in general. First, with the earlier material on cluster representatives, and recently with an assertion that one-pass algorithms work by filtering -- reading input blocks and writing output blocks. Some do, but I don't think any of the original examples do (e.g., finding the sum of a list of numbers). On the other hand, I believe both techniques can just as well be used with multi-pass streaming algorithms. Certainly filtering can -- ask any UNIX pipeline. Rather than having such useful information continually end up in this article, it might be better to make the body of this article a subsection of [[streaming algorithm]] and leave this page as a redirect to that section. That still recognizes that one-pass algorithms are a thing, but keeps the technical details under [[streaming algorithm]] where (I think) they belong [[User:Dmh|Dmh]] ([[User talk:Dmh|talk]]) 00:18, 16 April 2021 (UTC)

**Not all streaming algorithms are one-pass algorithms. Streaming algorithms are a broader topic. In particular, turnstile model streaming algorithms are not one-pass algorithms. So although this is a subtopic of streaming algorithms, it is distinct enough from the broader topic that I think it can stand on its own. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 01:25, 16 April 2021 (UTC)

{{clear}}

:''The above discussion is preserved as an archive of the debate. <b style="color:red">Please do not modify it.</b> Subsequent comments should be made on the appropriate discussion page (such as the article's [[Help:Using talk pages|talk page]] or in a [[Wikipedia:Deletion review|deletion review]]). No further edits should be made to this page.''<!--Template:Afd bottom--></div>