Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Ugly_duckling_theorem> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples per page.
- Ugly_duckling_theorem abstract "The Ugly Duckling theorem is an argument asserting that classification is impossible without some sort of bias. It is named for Hans Christian Andersen's story \"The Ugly Duckling.\" It gets its name because it shows that, all things being equal, an ugly duckling is just as similar to a swan as two swans are to each other, although it is only a theorem in a very informal sense. It was proposed by Satosi Watanabe in 1969.".
- Ugly_duckling_theorem wikiPageID "5077439".
- Ugly_duckling_theorem wikiPageLength "9046".
- Ugly_duckling_theorem wikiPageOutDegree "20".
- Ugly_duckling_theorem wikiPageRevisionID "681594263".
- Ugly_duckling_theorem wikiPageWikiLink Argument.
- Ugly_duckling_theorem wikiPageWikiLink Bias.
- Ugly_duckling_theorem wikiPageWikiLink Bias_(statistics).
- Ugly_duckling_theorem wikiPageWikiLink Binary_number.
- Ugly_duckling_theorem wikiPageWikiLink Bit_array.
- Ugly_duckling_theorem wikiPageWikiLink Category:Arguments.
- Ugly_duckling_theorem wikiPageWikiLink Category:Machine_learning.
- Ugly_duckling_theorem wikiPageWikiLink Category:Ontology.
- Ugly_duckling_theorem wikiPageWikiLink Category:Theorems.
- Ugly_duckling_theorem wikiPageWikiLink Ceteris_paribus.
- Ugly_duckling_theorem wikiPageWikiLink Hamming_distance.
- Ugly_duckling_theorem wikiPageWikiLink Hans_Christian_Andersen.
- Ugly_duckling_theorem wikiPageWikiLink No_free_lunch_in_search_and_optimization.
- Ugly_duckling_theorem wikiPageWikiLink No_free_lunch_theorem.
- Ugly_duckling_theorem wikiPageWikiLink Power_set.
- Ugly_duckling_theorem wikiPageWikiLink Propositional_function.
- Ugly_duckling_theorem wikiPageWikiLink Satosi_Watanabe.
- Ugly_duckling_theorem wikiPageWikiLink Swan.
- Ugly_duckling_theorem wikiPageWikiLink The_Ugly_Duckling.
- Ugly_duckling_theorem wikiPageWikiLink Theorem.
- Ugly_duckling_theorem wikiPageWikiLinkText "Ugly duckling theorem".
- Ugly_duckling_theorem wikiPageUsesTemplate Template:Citation_needed.
- Ugly_duckling_theorem wikiPageUsesTemplate Template:Quote.
- Ugly_duckling_theorem wikiPageUsesTemplate Template:Refimprove.
- Ugly_duckling_theorem wikiPageUsesTemplate Template:The_Ugly_Duckling.
- Ugly_duckling_theorem subject Category:Arguments.
- Ugly_duckling_theorem subject Category:Machine_learning.
- Ugly_duckling_theorem subject Category:Ontology.
- Ugly_duckling_theorem subject Category:Theorems.
- Ugly_duckling_theorem hypernym Argument.
- Ugly_duckling_theorem type Argument.
- Ugly_duckling_theorem type Concept.
- Ugly_duckling_theorem type Statement.
- Ugly_duckling_theorem type Theorem.
- Ugly_duckling_theorem type Statement.
- Ugly_duckling_theorem comment "The Ugly Duckling theorem is an argument asserting that classification is impossible without some sort of bias. It is named for Hans Christian Andersen's story \"The Ugly Duckling.\" It gets its name because it shows that, all things being equal, an ugly duckling is just as similar to a swan as two swans are to each other, although it is only a theorem in a very informal sense. It was proposed by Satosi Watanabe in 1969.".
- Ugly_duckling_theorem label "Ugly duckling theorem".
- Ugly_duckling_theorem sameAs Q2473965.
- Ugly_duckling_theorem sameAs Ugly-Duckling-Theorem.
- Ugly_duckling_theorem sameAs Teorema_del_brutto_anatroccolo.
- Ugly_duckling_theorem sameAs m.0d1p57.
- Ugly_duckling_theorem sameAs Teorema_e_rosës_së_shëmtuar.
- Ugly_duckling_theorem sameAs Q2473965.
- Ugly_duckling_theorem wasDerivedFrom Ugly_duckling_theorem?oldid=681594263.
- Ugly_duckling_theorem isPrimaryTopicOf Ugly_duckling_theorem.