A new PAC bound for intersection-closed concept classes (Q2384136): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10994-006-8638-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1963910319
@@ Property / OpenAlex ID: W1963910319 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning nested differences in the presence of malicious noise
+Normal rank
@@ Property / cites work @@
+On-line learning with malicious noise and the closure algorithm
+Normal rank
@@ Property / cites work @@
+Approximating hyper-rectangles: Learning and pseudorandom sets
+Normal rank
@@ Property / cites work @@
+Learnability and the Vapnik-Chervonenkis dimension
+Normal rank
@@ Property / cites work @@
+A general lower bound on the number of examples needed for learning
+Normal rank
@@ Property / cites work @@
+Predicting \(\{ 0,1\}\)-functions on randomly drawn points
+Normal rank
@@ Property / cites work @@
+Q4013525
@@ Property / cites work: Q4013525 / rank @@
+Normal rank
@@ Property / cites work @@
+On the density of families of sets
@@ Property / cites work: On the density of families of sets / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2384136