This HTML5 document contains 55 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n11https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n12https://www.ocf.berkeley.edu/~fricke/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-zhhttp://zh.dbpedia.org/resource/
dbpedia-frhttp://fr.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Hoshen-Kopelman_algorithm
dbo:wikiPageWikiLink
dbr:Hoshen–Kopelman_algorithm
dbo:wikiPageRedirects
dbr:Hoshen–Kopelman_algorithm
Subject Item
dbr:Connected-component_labeling
dbo:wikiPageWikiLink
dbr:Hoshen–Kopelman_algorithm
Subject Item
dbr:Hoshen–Kopelman_algorithm
rdfs:label
霍森－科佩尔曼算法 Algorithme de Hoshen-Kopelman Hoshen–Kopelman algorithm
rdfs:comment
The Hoshen–Kopelman algorithm is a simple and efficient algorithm for labeling clusters on a grid, where the grid is a regular network of cells, with the cells being either occupied or unoccupied. This algorithm is based on a well-known union-finding algorithm. The algorithm was originally described by Joseph Hoshen and Raoul Kopelman in their 1976 paper "Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm". L'algorithme de Hoshen-Kopelman est un algorithme de partitionnement (clustering) des cases d'un réseau, autrement dit, il permet de dénombrer les amas d'un type d'objet dans un réseau fini. Il est utilisé pour étudier la percolation. 霍森–科佩尔曼算法基于联合-查找算法，用于标记占据-非占据网格团簇。 此算法最早由霍森和科佩尔曼在1976年的文章《Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm》中提出。
dcterms:subject
dbc:Cluster_analysis_algorithms
dbo:wikiPageID
51522490
dbo:wikiPageRevisionID
1119775343
dbo:wikiPageWikiLink
dbr:Equivalence_class dbr:Electrical_resistivity_and_conductivity dbr:Artificial_neural_network dbr:Raster_scan dbr:Pixel_connectivity dbr:Probability dbr:Raoul_Kopelman dbr:Transitive_relation dbr:K-means_clustering dbr:Union-find_algorithm dbr:Disjoint-set_data_structure dbr:Pseudocode dbr:Algorithm dbr:Connectivity_(graph_theory) dbr:Connected-component_labeling dbr:Lattice_graph dbr:Statistics dbr:Fuzzy_clustering dbc:Cluster_analysis_algorithms dbr:Cluster_analysis dbr:Expectation–maximization_algorithm dbr:Percolation_theory
dbo:wikiPageExternalLink
n12:
owl:sameAs
dbpedia-zh:霍森－科佩尔曼算法 dbpedia-fr:Algorithme_de_Hoshen-Kopelman n11:2dt9f wikidata:Q2835787 dbpedia-fa:الگوریتم_هوشن–کوپلمن
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description dbt:Center dbt:Machine_learning_bar
dbo:abstract
The Hoshen–Kopelman algorithm is a simple and efficient algorithm for labeling clusters on a grid, where the grid is a regular network of cells, with the cells being either occupied or unoccupied. This algorithm is based on a well-known union-finding algorithm. The algorithm was originally described by Joseph Hoshen and Raoul Kopelman in their 1976 paper "Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm". L'algorithme de Hoshen-Kopelman est un algorithme de partitionnement (clustering) des cases d'un réseau, autrement dit, il permet de dénombrer les amas d'un type d'objet dans un réseau fini. Il est utilisé pour étudier la percolation. 霍森–科佩尔曼算法基于联合-查找算法，用于标记占据-非占据网格团簇。 此算法最早由霍森和科佩尔曼在1976年的文章《Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm》中提出。
prov:wasDerivedFrom
wikipedia-en:Hoshen–Kopelman_algorithm?oldid=1119775343&ns=0
dbo:wikiPageLength
12299
foaf:isPrimaryTopicOf
wikipedia-en:Hoshen–Kopelman_algorithm
Subject Item
dbr:Hoshen-Kopelman_Algorithm
dbo:wikiPageWikiLink
dbr:Hoshen–Kopelman_algorithm
dbo:wikiPageRedirects
dbr:Hoshen–Kopelman_algorithm
Subject Item
dbr:Raoul_Kopelman
dbo:wikiPageWikiLink
dbr:Hoshen–Kopelman_algorithm
Subject Item
dbr:Outline_of_machine_learning
dbo:wikiPageWikiLink
dbr:Hoshen–Kopelman_algorithm
Subject Item
wikipedia-en:Hoshen–Kopelman_algorithm
foaf:primaryTopic
dbr:Hoshen–Kopelman_algorithm