This HTML5 document contains 29 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/
n16http://giwebb.com/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n12https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n14http://
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/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Pattern_search
dbo:wikiPageWikiLink
dbr:K-optimal_pattern_discovery
Subject Item
dbr:Numbers_(season_4)
dbo:wikiPageWikiLink
dbr:K-optimal_pattern_discovery
Subject Item
dbr:K-optimal_pattern_discovery
rdf:type
dbo:TopicalConcept
rdfs:label
K-optimal pattern discovery
rdfs:comment
K-optimal pattern discovery is a data mining technique that provides an alternative to the frequent pattern discovery approach that underlies most association rule learning techniques. Frequent pattern discovery techniques find all patterns for which there are sufficiently frequent examples in the sample data. In contrast, k-optimal pattern discovery techniques find the k patterns that optimize a user-specified measure of interest. The parameter k is also specified by the user. Examples of k-optimal pattern discovery techniques include:
dcterms:subject
dbc:Data_mining
dbo:wikiPageID
5149355
dbo:wikiPageRevisionID
1017940203
dbo:wikiPageWikiLink
dbr:Data dbr:Correlation dbr:Association_rule_learning dbr:Ontology_(computer_science) dbc:Data_mining dbr:Data_mining dbr:Frequent_pattern_discovery
dbo:wikiPageExternalLink
n14:www.vikamine.org n16:
owl:sameAs
freebase:m.0d516v n12:4pAmp wikidata:Q6322855
dbp:wikiPageUsesTemplate
dbt:Cite_web dbt:Sfnref
dbo:abstract
K-optimal pattern discovery is a data mining technique that provides an alternative to the frequent pattern discovery approach that underlies most association rule learning techniques. Frequent pattern discovery techniques find all patterns for which there are sufficiently frequent examples in the sample data. In contrast, k-optimal pattern discovery techniques find the k patterns that optimize a user-specified measure of interest. The parameter k is also specified by the user. Examples of k-optimal pattern discovery techniques include: * k-optimal classification rule discovery. * k-optimal subgroup discovery. * finding k most interesting patterns using sequential sampling. * mining top.k frequent closed patterns without minimum support. * k-optimal rule discovery. In contrast to k-optimal rule discovery and frequent pattern mining techniques, subgroup discovery focuses on mining interesting patterns with respect to a specified target property of interest. This includes, for example, binary, nominal, or numeric attributes, but also more complex target concepts such as correlations between several variables. Background knowledge like constraints and ontological relations can often be successfully applied for focusing and improving the discovery results.
gold:hypernym
dbr:Technique
prov:wasDerivedFrom
wikipedia-en:K-optimal_pattern_discovery?oldid=1017940203&ns=0
dbo:wikiPageLength
3470
foaf:isPrimaryTopicOf
wikipedia-en:K-optimal_pattern_discovery
Subject Item
dbr:Association_rule_learning
dbo:wikiPageWikiLink
dbr:K-optimal_pattern_discovery
Subject Item
wikipedia-en:K-optimal_pattern_discovery
foaf:primaryTopic
dbr:K-optimal_pattern_discovery