| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 770 2 |
| Ultima descărcare din IBN: 2017-04-29 14:22 |
| Căutarea după subiecte similare conform CZU |
| 519.6:[004.85+004.89] (1) |
| Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
| Inteligență artificială (303) |
 SM ISO690:2012BARR, Olof. A Deterministic and Polynomial Modified Perceptron Algorithm. In: Computer Science Journal of Moldova, 2005, nr. 3(39), pp. 254-267. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Computer Science Journal of Moldova | ||||||
| Numărul 3(39) / 2005 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.6:[004.85+004.89] | ||||||
| Pag. 254-267 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We construct a modifed perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn3 log n log(1=½)), where m is the number of examples, n the number of dimensions and ½ is approximately the size of the margin. We also construct a non-deterministic modified perceptron algorithm running in time O(mn2 log n log(1=½)). |
||||||
|
|
|
|
