Talk:OPTICS algorithm
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Pseudocode
[edit]The pseudocode in the article contains sentence "output p to the ordered list". Does the ordered list means a cluster? — Preceding unsigned comment added by 158.193.100.8 (talk) 18:49, 7 November 2018 (UTC)
Reference to broken DOI
[edit]A reference was recently added to this article using the Cite DOI template. The citation bot tried to expand the citation, but could not access the specified DOI. Please check that the DOI doi:10.1007/b72280 has been correctly entered. If the DOI is correct, it is possible that it has not yet been entered into the CrossRef database. Please complete the reference by hand here. The script that left this message was unable to track down the user who added the citation; it may be prudent to alert them to this message. Thanks, Citation bot 2 (talk) 11:36, 4 May 2010 (UTC)
- Done: DOI given by Springer was for the whole book, not just the chapter. Manual "cite book" now. --Chire2 (talk) 11:47, 4 May 2010 (UTC)
Is there anybody who could understand the essence of the algorithm with help of the explanation given in this article?
[edit]37.110.18.166 (talk) 17:48, 10 March 2014 (UTC)
Is the algorithm correct?
[edit]At no point in the algorithm is the property core-distance actually set to a non-undefined value. [1] suggests that this should happen when the seed-points are marked as processed. (i.e. after "mark q as processed") — Preceding unsigned comment added by Completely unique username (talk • contribs) 16:20, 5 February 2016 (UTC)
- The function core-distance(q, eps, Minpts) can return UNDEFINED. It is not given in pseudo-code. Chire (talk) 12:35, 8 February 2016 (UTC)