|
|
| Line 1: |
Line 1: |
| In [[computational learning theory]], '''sample exclusion dimensions''' arise in the study of exact [[concept learning]] with queries.<ref>{{cite book|title=Algorithmic Learning Theory: 12th International Conference, ALT 2001, Washington, DC, USA, November 2001, Proceedings|editor=N. Abe, R. Khardon, T. Zeugmann|author=D. Angluin|chapter=Queries Revisited|year=2001|publisher=Springer|url=http://books.google.com/books?hl=en&lr=&id=V77xyPlA41UC&oi=fnd&pg=PA12&dq=%22Sample+exclusion+dimension%22+-Wikipedia&ots=czZEqBZJgT&sig=In-6bsswOuRMJFSBld3fNSSLacU#PPA26,M1| pages=26–28|isbn=3-540-42875-5}}</ref>
| | Hi there, I am Sophia. I've always loved residing in Kentucky but now I'm considering other choices. The favorite hobby for him and his children is to perform lacross and he would by no means give it up. Invoicing is what I do.<br><br>My weblog - psychics online ([http://myfusionprofits.com/groups/find-out-about-self-improvement-tips-here/ http://myfusionprofits.com/]) |
| | |
| In [[algorithmic learning theory]], a '''concept''' over a domain ''X'' is a [[Boolean function]] over ''X''. Here we only consider finite domains. A '''partial approximation''' ''S'' of a concept ''c'' is a Boolean function over <math>Y\subseteq X</math> such that ''c'' is an extension to ''S''.
| |
| | |
| Let ''C'' be a class of concepts and ''c'' be a concept (not necessarily in ''C''). Then a '''specifying set''' for c w.r.t. ''C'', denoted by ''S'' is a partial approximation ''S'' of ''c'' such that ''C'' contains at most one extension to ''S''. If we have observed a specifying set for some concept w.r.t. ''C'', then we have enough information to verify a concept in ''C'' with at most one more mind change.
| |
|
| |
| The '''exclusion dimension''', denoted by ''XD''(''C''), of a concept class is the maximum of the size of the minimum specifying set of ''c''<nowiki>'</nowiki> with respect to ''C'', where ''c''<nowiki>'</nowiki> is a concept not in ''C''.
| |
| | |
| == References ==
| |
| {{reflist}}
| |
| | |
| [[Category:Computational learning theory]]
| |
| | |
| {{math-stub}}
| |
Latest revision as of 18:27, 6 December 2014
Hi there, I am Sophia. I've always loved residing in Kentucky but now I'm considering other choices. The favorite hobby for him and his children is to perform lacross and he would by no means give it up. Invoicing is what I do.
My weblog - psychics online (http://myfusionprofits.com/)