Wikipedia:Articles for deletion/Self-organising heuristic

The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.

The result was merge‎ to Self-organizing list. Extraordinary Writ (talk) 01:49, 3 January 2024 (UTC)[reply]

Self-organising heuristic[edit]

[Hide this box] New to Articles for deletion (AfD)? Read these primers!

(Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)

Delete Vague category, lack of sources, could possibly be merged? Tooncool64 (talk) 06:40, 20 December 2023 (UTC)[reply]
Note: This discussion has been included in the list of Computing-related deletion discussions. Deltaspace⁴² (talk • contribs) 08:00, 20 December 2023 (UTC)[reply]
Merge to Self-organizing list. Seems logical: A self-organizing list is a list that reorders its elements based on some self-organizing heuristic.... We can create a section for self-organizing heuristics there. Deltaspace⁴² (talk • contribs) 08:04, 20 December 2023 (UTC)[reply]
Redirect to self-organizing list per Deltaspace. There's not really anything to merge, but this does seem like a logical subtopic from what I can find in academic results on Google. HappyWith (talk) 21:13, 20 December 2023 (UTC)[reply]
The right topic name is self-organizing data structure, and it encompasses more than lists, which are a sub-topic of this rather than the other way around. For example:
Splay trees […] are a so-called self-organizing data structure. In self-organizing data structures and item x is moved closer to the entry point of the data structure whenever it is accessed. […]
— Luisa, Bozzano G. (1990). Algorithms and Complexity. Handbook of Theoretical Computer Science. Vol. 1. Elsevier. p. 321. ISBN 9780444880710.
Ironically, much of this article is correct and directly sourcable to that very page of Luisa 1990, which goes on to talk about move-to-front and transposition just like this article does. This randomly picked paper by an expert in computer science covers the same ground, too. This could actually be a stub for the parent topic, with a simple application of the move tool and some effort put in to source it. The only thing really wrong here is bad writing not showing the ample sources on this topic, that no-one has fixed since 2006, and the oddball use of "heuristic" instead of "data structure" in the title. Uncle G (talk) 01:06, 21 December 2023 (UTC)[reply]
I don't understand this topic, but I'm finding sources.
- Gonnet, Gaston H.; Munro, J. Ian; Suwanda, Hendra (August 1981). "Exegesis of Self-Organizing Linear Search". Society for Industrial and Applied Mathematics Journal on Computing. 10 (3): 613–637. doi:10.1137/0210046.
- Frederickson, Greg N. (May 1984). "Self-Organizing Heuristics for Implicit Data Structures". Society for Industrial and Applied Mathematics Journal on Computing. 13 (2): 277–291. doi:10.1137/0213020.
- Lai, Tony W.; Wood, Derick. "A relationship between self-organizing lists and binary search trees". In Frank Dehne; Frantisek Fiala; Waldemar W. Koczkodaj (eds.). Advances in Computing and Information - ICCI '91. International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991. Proceedings. Lecture Notes in Computer Science, vol. 497. pp. 111–116. doi:10.1007/3-540-54029-6_159. ISBN 978-3-540-47359-6.
- Hinrichs, Christian; Sonnenschein, Michael; Lehnhoff, Sebastian. "Evaluation of a Self-Organizing Heuristic for Interdependent Distributed Search Spaces". In Joachim Filipe; Ana Fred (eds.). Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART 2013). Barcelona, Spain, 15–18 February 2013. Vol. 1. pp. 25–34. doi:10.5220/0004227000250034. ISBN 978-989-8565-38-9.

I only checked two publishers, and didn't look for any related concepts or follow citations in either direction. Seems like the topic is probably notable, unsure on any specifics like article title. Folly Mox (talk) 21:54, 23 December 2023 (UTC)[reply]

Redirect to self-organizing list, this may be a topic of some research, but it doesn't need its own article. ForksForks (talk) 01:28, 27 December 2023 (UTC)[reply]

Relisted to generate a more thorough discussion and clearer consensus.
Relisting comment: Relisting as there are a variety of opinions here.
Please add new comments below this notice. Thanks, Liz ^{Read! Talk!} 06:17, 27 December 2023 (UTC)[reply]

Merge to self-organizing list. The concept of a self organising heuristic can by definition only be applied to lists, as other data structures either use lists internally to record information (eg. graphs), or use an access method that could not improve lookup time by generic heuristic algorithms (eg. lookup table). Sources have been found and can be added and used to expand the merge target, and sources mentioned can be used to cite the stub to be merged. Darcyisverycute (talk) 10:46, 27 December 2023 (UTC)[reply]
Merge to self-organizing list, came to add sources but this is a much better option. Dr vulpes (Talk) 21:01, 28 December 2023 (UTC)[reply]
Merge to self-organizing list, seems like they'd both benefit. FergusArgyll (talk) 12:37, 29 December 2023 (UTC)[reply]
Merge per above. Toadette ^{(Merry Christmas, and a happy new year)} 18:16, 30 December 2023 (UTC)[reply]
Merge per above, two articles on extremely close topics (the data structure vs the algorithms it uses), better to merge them in one article and add sources there. ChaotıċEnby(t · c) 10:52, 2 January 2024 (UTC)[reply]

The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.