Hoshen–Kopelman algorithm: Difference between revisions

Revision as of 15:54, 17 September 2016

Revision as of 20:50, 21 September 2016

Line 1:

{{Multiple issues|

{{Refimprove|date=September 2016}}

{{Orphan|date=September 2016}}}}

{{Machine learning bar}}

The '''Hoshen–Kopelman algorithm''' is simple and efficient [[algorithm]] for labeling [[Cluster analysis|clusters]] on a grid. Where the grid is a regular network of cells,with the cells being either occupied or <strong>unoccupied</strong>. This algorithm is based on well-known [[Disjoint-set data structure|union-finding algorithm]]. The algorithm was originally described in [http://journals.aps.org/prb/abstract/10.1103/PhysRevB.14.3438 Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm] by J. Hoshen and R. Kopelman.<ref>{{cite journal|url=http://link.aps.org/doi/10.1103/PhysRevB.14.3438|title=Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm|first1=J.|last1=Hoshen|first2=R.|last2=Kopelman|date=15 October 1976|publisher=|journal=Phys. Rev. B|volume=14|issue=8|pages=3438–3445|via=APS|doi=10.1103/PhysRevB.14.3438}}</ref>