This HTML5 document contains 32 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/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:K-means_clustering
dbo:wikiPageWikiLink
dbr:K_q-flats
Subject Item
dbr:K_q-flats
rdf:type
yago:Information105816287 yago:PsychologicalFeature100023100 yago:WikicatDataClusteringAlgorithms yago:Cognition100023271 yago:Datum105816622 yago:Abstraction100002137
rdfs:label
K q-flats
rdfs:comment
In data mining and machine learning, -flats algorithm is an iterative method which aims to partition observations into clusters where each cluster is close to a -flat, where is a given integer. It is a generalization of the -means algorithm. In -means algorithm,clusters are formed in the way that each cluster is close to one point, which is a -flat. -flats algorithm gives better clustering result than -means algorithmfor some data set.
dcterms:subject
dbc:Cluster_analysis_algorithms
dbo:wikiPageID
34025491
dbo:wikiPageRevisionID
1119683590
dbo:wikiPageWikiLink
dbr:Partition_of_a_set dbr:K-means_clustering dbc:Cluster_analysis_algorithms dbr:Machine_learning dbr:Flat_(geometry) dbr:Data_mining dbr:Classification_in_machine_learning dbr:Gaussian_clouds dbr:Hyperplane
owl:sameAs
wikidata:Q6343029 n15:4pGpc yago-res:K_q-flats freebase:m.0hr409t
dbp:wikiPageUsesTemplate
dbt:Technical
dbo:abstract
In data mining and machine learning, -flats algorithm is an iterative method which aims to partition observations into clusters where each cluster is close to a -flat, where is a given integer. It is a generalization of the -means algorithm. In -means algorithm,clusters are formed in the way that each cluster is close to one point, which is a -flat. -flats algorithm gives better clustering result than -means algorithmfor some data set.
prov:wasDerivedFrom
wikipedia-en:K_q-flats?oldid=1119683590&ns=0
dbo:wikiPageLength
12214
foaf:isPrimaryTopicOf
wikipedia-en:K_q-flats
Subject Item
dbr:Outline_of_machine_learning
dbo:wikiPageWikiLink
dbr:K_q-flats
Subject Item
wikipedia-en:K_q-flats
foaf:primaryTopic
dbr:K_q-flats