Jump to content

Wikipedia:Articles for deletion/Cooperative-based graph clustering

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Shawn à Montréal (talk | contribs) at 01:50, 7 January 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Cooperative-based graph clustering (edit | talk | history | protect | delete | links | watch | logs | views) – (View log · Stats)
(Find sources: Google (books · news · scholar · free images · WP refs· FENS · JSTOR · TWL)

Fails notability - an obscure (single-researcher) subtopic of clustering. The article is based on single reference (A. Ibrahim, Derek Rayside, R. Kashef (2014). "Cooperative Based Software Clustering on Dependency Graphs". IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), Toronto, Canada.) with 0 citations on Google Scholar. Some of the other references are outright incorrect. The Bürger reference does not appear to mention Cooperative-based graph based clustering at all, for example. Which is not surprising, because these sources predate the Ibrahim publication... HelpUsStopSpam (talk) 20:29, 5 January 2016 (UTC)[reply]

Note: This debate has been included in the list of Computing-related deletion discussions. Shawn in Montreal (talk) 01:50, 7 January 2016 (UTC)[reply]