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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n12http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n9https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n6http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:KHOPCA_clustering_algorithm
Subject Item
dbr:KHOPCA
dbo:wikiPageWikiLink
dbr:KHOPCA_clustering_algorithm
dbo:wikiPageRedirects
dbr:KHOPCA_clustering_algorithm
Subject Item
dbr:KHOPCA_Clustering_Algorithm
dbo:wikiPageWikiLink
dbr:KHOPCA_clustering_algorithm
dbo:wikiPageRedirects
dbr:KHOPCA_clustering_algorithm
Subject Item
dbr:KHOPCA_clustering_algorithm
rdfs:label
KHOPCA clustering algorithm
rdfs:comment
KHOPCA is an adaptive clustering algorithm originally developed for dynamic networks. KHOPCA (-hop clustering algorithm) provides a fully distributed and localized approach to group elements such as nodes in a network according to their distance from each other. KHOPCA operates proactively through a simple set of rules that defines clusters, which are optimal with respect to the applied distance function. Besides applications in ad hoc and wireless sensor networks, KHOPCA can be used in localization and navigation problems, networked swarming, and real-time data clustering and analysis.
foaf:depiction
n6:KHOPCA_rule_3_a.png n6:KHOPCA_1D_example_1.png n6:KHOPCA_2D_k3a.jpg n6:KHOPCA_3D_example_1.png n6:KHOPCA_rule_4_a.png n6:KHOPCA_3D_example_2.png n6:KHOPCA_rule_1.png n6:KHOPCA_rule_2_a.png
dct:subject
dbc:Graph_algorithms
dbo:wikiPageID
50959785
dbo:wikiPageRevisionID
1106328528
dbo:wikiPageWikiLink
dbr:Swarm_intelligence dbc:Graph_algorithms dbr:Distributed_computing dbr:Wireless_sensor_network dbr:Clustering_algorithm n12:KHOPCA_1D_example_1.png n12:KHOPCA_2D_k3a.jpg n12:KHOPCA_3D_example_1.png dbr:Cluster_analysis n12:KHOPCA_3D_example_2.png n12:KHOPCA_rule_1.png n12:KHOPCA_rule_2_a.png n12:KHOPCA_rule_3_a.png n12:KHOPCA_rule_4_a.png
owl:sameAs
n9:2PQKz wikidata:Q25345162 yago-res:KHOPCA_clustering_algorithm
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:thumbnail
n6:KHOPCA_3D_example_1.png?width=300
dbo:abstract
KHOPCA is an adaptive clustering algorithm originally developed for dynamic networks. KHOPCA (-hop clustering algorithm) provides a fully distributed and localized approach to group elements such as nodes in a network according to their distance from each other. KHOPCA operates proactively through a simple set of rules that defines clusters, which are optimal with respect to the applied distance function. KHOPCA's clustering process explicitly supports joining and leaving of nodes, which makes KHOPCA suitable for highly dynamic networks. However, it has been demonstrated that KHOPCA also performs in static networks. Besides applications in ad hoc and wireless sensor networks, KHOPCA can be used in localization and navigation problems, networked swarming, and real-time data clustering and analysis.
prov:wasDerivedFrom
wikipedia-en:KHOPCA_clustering_algorithm?oldid=1106328528&ns=0
dbo:wikiPageLength
7664
foaf:isPrimaryTopicOf
wikipedia-en:KHOPCA_clustering_algorithm
Subject Item
wikipedia-en:KHOPCA_clustering_algorithm
foaf:primaryTopic
dbr:KHOPCA_clustering_algorithm