Wikipedia:Articles for deletion/One-pass algorithm: Difference between revisions
Content deleted Content added
Line 19:
* '''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">— 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, and it seems fine to me as a stub. '''[[User:JPxG|jp]]'''×'''[[User talk:JPxG|g]]''' 23:22, 15 April 2021 (UTC)
| |||