{"id":1204,"date":"2020-02-21T20:05:17","date_gmt":"2020-02-21T20:05:17","guid":{"rendered":"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/?page_id=1204"},"modified":"2020-09-24T16:45:40","modified_gmt":"2020-09-24T16:45:40","slug":"inteligenta-artificiala-2019-2020","status":"publish","type":"page","link":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/research\/all-years\/inteligenta-artificiala-2019-2020\/","title":{"rendered":"Inteligenta Artificiala 2019-2020"},"content":{"rendered":"<p><span style=\"color: #ff0000;\"><strong>Anunt: pentru o buna desfasurare a examenului, toti studentii trebuie sa se conecteze la MsTeam pana cel tarziu in 10 iunie 2020.\u00a0<\/strong><\/span><\/p>\n<p><strong>Metodologia de evaluare in sesiunea de examene<\/strong> [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/?page_id=1342\" target=\"_blank\" rel=\"noopener\">link<\/a>]<\/p>\n<p><span style=\"color: #ff0000;\"><strong>Simulare examen Ms Teams<\/strong><\/span> &#8211; in cadrul cursului din 27 mai se va efectua o simulare pe Microsoft Teams<\/p>\n<div><\/div>\n<div>Cateva detalii despre cursul optional MIRPR (din semestrul 5) [<a href=\"https:\/\/youtu.be\/VJj5pHbbbDk\" target=\"_blank\" rel=\"noopener\">video<\/a>]<\/div>\n<div><\/div>\n<div>Pt curs:<\/div>\n<div>&#8211; se vor publica (in\u00a0continuare) slide-urile si exemplele pe aceasta pagina.<\/div>\n<div>&#8211; va fi un video-meeting <a href=\"https:\/\/meet.jit.si\/ai-2020\" target=\"_blank\" rel=\"noopener\">[link<\/a>,\u00a0<a href=\"https:\/\/youtu.be\/eQt6EJr0e3I\" target=\"_blank\" rel=\"noopener\">link<\/a>] unde se vor expune oral\/live materiale, iar studentii\u00a0pot sa adreseze intrebari\u00a0in intervalul orar rezervat cursului<\/div>\n<div><\/div>\n<div>Pt laboratoare:<\/div>\n<div><\/div>\n<div>Incepand cu 16 martie 2020 fiecare student trebuie sa respecte urmatorii pasi in derulararea laboratoarelor:<\/div>\n<div>\n<ol>\n<li>Consemnarea prezentei la laborator &#8211; in cazul laboratoarelor &#8220;remote&#8221;, prezenta inseamna participarea in sesiunea online initiata de cadrul didactic<\/li>\n<li>Se realizeaza tema.<\/li>\n<li>Se creaza un cont de GitHub (<a href=\"http:\/\/www.github.com\">github.com<\/a>) unde se va incarca (intr-un repository) proiectul aferent temei primite la laborator. Contul creat se va folosi pentru toate temele de laborator.<\/li>\n<li>Se accepta invitatia de participare la GitHub-ClassRoom aferenta fiecarei teme de laborator (link existent in tabelul cu planificarea materiei pe saptamani din pagina de cs a cursului) si se conecteaza cu contul de Github si cu userul de acces in reteaua facultatii.<\/li>\n<li>Se prezinta tema cadrului didactic in cadrul sesiunilor live folosind medii de comunicare on-line si, dupa caz si la nevoie,\u00a0se poate folosi editorul Visual Studio Code (<a href=\"https:\/\/code.visualstudio.com\/\">https:\/\/code.visualstudio.com\/<\/a>) cu extensia corespunzatoare limbajului folosit (<a href=\"https:\/\/code.visualstudio.com\/docs\/languages\/overview\">https:\/\/code.visualstudio.com\/docs\/languages\/overview<\/a>) cu optiunea Live Share (<a href=\"https:\/\/code.visualstudio.com\/blogs\/2017\/11\/15\/live-share\">https:\/\/code.visualstudio.com\/blogs\/2017\/11\/15\/live-share<\/a>)<\/li>\n<li>Se incarca codul proiectului in GitHub classroom respectand termenele de predare.\n<ul>\n<li>pentru fiecare tema va exista in gitclassrooom un assignment, respectiv un repo pentru fiecare student<\/li>\n<li>fiecare tema trebuie incarcata in repo-ul aferent astfel:\n<ul>\n<li>pana la finalul laboratorului prevazut ca deadline &#8211; pentru evaluare obisnuita &#8211; sau<\/li>\n<li>pana la finalul urmatorului laborator (dupa cel prevazut ca deadline) &#8211; pentru evaluare cu penalizare de 10% intarziere;<\/li>\n<li>pana la finalul urmatorului urmatorului laborator (dupa cel prevazut ca deadline) &#8211; pentru evaluare cu penalizare de 20% intarziere;<\/li>\n<li>dupa expirarea acestui termen, nu se mai evalueaza temele incarcate<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/li>\n<li>Pentru gestiunea mai usoara a materialelor incarcate, se recomanda folosirea unei aplicatii de versionare (fie facilitatile oferite de VS Code <a href=\"https:\/\/code.visualstudio.com\/docs\/editor\/versioncontrol\" target=\"_blank\" rel=\"noopener\">link<\/a>, fie aplicatii de genul SourceTree <a href=\"https:\/\/www.sourcetreeapp.com\/\" target=\"_blank\" rel=\"noopener\">link<\/a>)<\/li>\n<li>Identificarea unor proiecte similare incarcate de 2 sau mai multi studenti va determina acordarea unui punctaj egal cu 0 (zero) puncte pentru acele teme tuturor studentilor implicati.<\/li>\n<\/ol>\n<div>\n<p><strong>Detalii desfasurare laboratoare (grupe care fac cu Laura):<\/strong> se va urma procedura de mai sus si va fi si o sesiune live pe parcursul celor 2 ore [<a href=\"https:\/\/meet.jit.si\/AI-lab\" target=\"_blank\" rel=\"noopener\">link]<\/a><\/p>\n<ul>\n<li><del>pentru predarea cu penalizare a laboratorului cu tsp-greedy, datele de test se gasesc <a href=\"https:\/\/drive.google.com\/drive\/folders\/1IIfe-BZAhZ4uLVsVbfASWIFc-ttwGwKQ?usp=sharing\" target=\"_blank\" rel=\"noopener\">aici<\/a>, iar fisierele cu rezultate (cf specificatiilor) trebuie incarcate (intr-o arhiva denumita Grupa_NumePrenume- ex 220-1_DiosanLaura.zip)\u00a0<a href=\"https:\/\/drive.google.com\/drive\/folders\/1dw32XBv8c6H963hLhDUmOOJ0IgR59-YM?usp=sharing\" target=\"_blank\" rel=\"noopener\">aici<\/a><\/del><\/li>\n<li><del>pentru predarea cu penalizare dubla a laboratorului cu comunitati-GA se va prezenta tema in cadrul sesiunii live si apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li><del>pentru predarea cu penalziare dubla a laboratorului cu TSP-GA se va prezenta tema in cadrul sesiunii live folosind si datele de <a href=\"https:\/\/drive.google.com\/open?id=1ROHqWbRW14WoBpuP609pdc_3NEuH8BFd\" target=\"_blank\" rel=\"noopener\">aici<\/a>, iar apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li><del>pentru predarea cu penalizare a laboratorului cu TSP-ACO se va prezenta tema in cadrul sesiunii live folosind si datele de <a href=\"https:\/\/drive.google.com\/open?id=1ROHqWbRW14WoBpuP609pdc_3NEuH8BFd\" target=\"_blank\" rel=\"noopener\">aici<\/a>, iar apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li><del>pentru predarea cu penalizare dubla a laboratorului cu metricile de evaluare folosite in ML se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li><del>pentru predarea cu penalizare dubla a laboratorului cu metoda celor mai mici patrate se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li><del>pentru predarea cu penalizare dubla a laboratorului cu Gradient Descrescator se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li><del>pentru predarea cu penalizare dubla a laboratorului cu Logistic Regression se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li><del>pentru predarea cu penalizare dubla a laboratorului cu ANN se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/del><\/li>\n<li>pentru predarea cu penalizare dubla a laboratorului cu kMeans se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/li>\n<li>pentru predarea cu penalizare a laboratorului cu emotii in imagini se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/li>\n<li>pentru predarea laboratorului cu analytics se va prezenta tema in cadrul sesiunii live folosind date proprii, pregatite in prealabil si individual de catre fiecare student, iar\u00a0 apoi se va incarca in git conform precizarilor de mai sus<\/li>\n<\/ul>\n<p><strong>Detalii desfasurare laboratoare (grupe care fac cu Dragos)\u00a0 <a href=\"https:\/\/dobrean.ro\/ai-2020\/\" target=\"_blank\" rel=\"noopener\">aici<\/a><\/strong><\/p>\n<p><strong>Detalii desfasurare laboratoare (grupe care fac cu Sergiu) <a href=\"http:\/\/www.cs.ubbcluj.ro\/~sergiu\/IA\/\" target=\"_blank\" rel=\"noopener\">aici<\/a><\/strong><\/p>\n<\/div>\n<div><\/div>\n<\/div>\n<div>\u00a0<strong>Echipa<\/strong>:\u00a0Laura Diosan,\u00a0Dragos Dobrean, Sergiu Limboi, Gabriel Mircea<\/div>\n<table border=\"3\" width=\"860\">\n<tbody>\n<tr>\n<td width=\"710\"><strong>Evaluare (<span style=\"color: #ff0000;\">toate assertiunile trebuie respectate<\/span>)<\/strong><br \/>\nASSERT (NrPrezenteLab &gt;= 10)<br \/>\nASSERT (NrPuncteUnLaboratorPredat &gt;= LimMinimaLab)<br \/>\n<span style=\"color: #ff0000;\">ASSERT(existaMinim8LaboratoarePredate == True)<\/span><br \/>\nASSERT(nrPunctePeUnLaboratorNepredat == 0)<br \/>\nASSERT(1000 &lt;= nrPuncteExamenScris &lt;= 4000)<\/td>\n<td width=\"120\"><strong>Punctaj <\/strong><br \/>\n&lt;2250<br \/>\n[2250, 3 000]<br \/>\n[3001, 4 500]<br \/>\n[4501, 6 500]<br \/>\n[6501, 8 500]<br \/>\n[8501, 9 000]<br \/>\n&gt;9 000<\/td>\n<td width=\"30\"><strong>Nota<\/strong><br \/>\n<strong>4<\/strong><br \/>\n<strong>5<\/strong><br \/>\n<strong>6<\/strong><br \/>\n<strong>7<\/strong><br \/>\n<strong>8<\/strong><br \/>\n<strong>9<\/strong><br \/>\n<strong>10<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>Reguli<\/strong>\u00a0[<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/rules.pdf\" target=\"_blank\" rel=\"noopener\">link<\/a>]<\/p>\n<p><strong>Situatie punctaje [<\/strong><a href=\"https:\/\/docs.google.com\/spreadsheets\/d\/1avs9zs7SXZJF5DziPOU-X9gNaTE7zEPwiAdJwdeJG14\/edit?usp=sharing\" target=\"_blank\" rel=\"noopener\">link<\/a>]<\/p>\n<p>Git pentru materiale [<a href=\"https:\/\/github.com\/lauradiosan\/AI-2019-2020\" target=\"_blank\" rel=\"noopener\">link<\/a>]<\/p>\n<p>Toate anunturile [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/?page_id=1327\" target=\"_blank\" rel=\"noopener\">link<\/a>]<\/p>\n<p>&nbsp;<\/p>\n<table style=\"height: 1858px;\" border=\"0\" width=\"879\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">Sapt<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Curs<\/span><\/td>\n<td width=\"338\"><span style=\"color: #000000;\">Bibliografie<\/span><\/td>\n<td width=\"100\"><span style=\"color: #000000;\">Lab<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S1<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Organizatorice &#8211; [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs00.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/span><br \/>\n<span style=\"color: #000000;\"> Introducere \u00een IA &#8211; [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs01_intro.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]\u00a0<\/span><br \/>\n<span style=\"color: #000000;\"> Metode de c\u0103utare &#8211; [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs01_search.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>,\u00a0\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/HISTORY -- MT1950.wmv\" target=\"_blank\" rel=\"noopener\">movie<\/a>]<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; metode neinformate si informate, Hill Climbing, Simulated Annealing, Tabu Search<\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele I.1, I.2, II.3, II.4 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele 1 &#8211; 4 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele 2.1 \u2013 2.5 din <a style=\"color: #000000;\" href=\"http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/\">http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/<\/a><\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi simpli [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab01\/lab01.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S2<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Metode de c\u0103utare<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; Algoritmi Evolutivi\u00a0&#8211; [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs02_EAs.pdf\" target=\"_blank\" rel=\"noopener\">pdf,<\/a>\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs02_EAs_suplim.pdf\" target=\"_blank\" rel=\"noopener\">optional<\/a>]<\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 14 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1998<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 7.6 din A. A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul 9 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi euristici [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab02\/lab02.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab02\/TSP.ZIP\" target=\"_blank\" rel=\"noopener\">exDate<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S3<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Metode de c\u0103utare- Algoritmi inspira\u0163i de furnici, algoritmi inspira\u0163i de inteligen\u0163a de grup)\u00a0&#8211; [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs03_PSO_ACO.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/span><\/p>\n<p><span style=\"color: #000000;\">Metode de c\u0103utare adversial\u0103\u00a0&#8211; [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs03_adversial.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<\/span><a href=\"https:\/\/youtu.be\/MavrDxckA3M\" target=\"_blank\" rel=\"noopener\">video<\/a>]<\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 16 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">James Kennedy, Russel Eberhart, Particle Swarm<br \/>\nOptimisation, Proceedings of IEEE International Conference<br \/>\non Neural Networks. IV. pp. 1942\u20131948, 1995<br \/>\n(05_ACO_PSO\/PSO_00.pdf)<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Marco Dorigo, Christian Blum, Ant colony optimization<br \/>\ntheory: A survey, Theoretical Computer Science 344 (2005)<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul II.5 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 6 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi evolutivi [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab03\/lab03.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/Ux3l6ZlP\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S4<\/span><\/td>\n<td width=\"349\"><\/td>\n<td rowspan=\"7\" width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul VI (18) din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 8 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 10, 11, 12, 13, 15 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul V din D. J. C. MacKey, Information Theory, Inferenceand Learning Algorithms, Cambridge University Press, 2003<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul 3 si 4 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi evolutivi (2) [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab04\/lab04.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/g4LMP-KZ\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S5<\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; problematica\u00a0&#8211; [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs04_ML_intro.pdf\" target=\"_blank\" rel=\"noopener\">pdf\u00a0<\/a>\u00a0<a href=\"https:\/\/youtu.be\/tUiCCJwNtLo\" target=\"_blank\" rel=\"noopener\">video<\/a>]<\/span><\/td>\n<td width=\"100\">Algoritmi ACO [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab05\/lab05.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/a9sSR6J9\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S6<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\"> \u00a0Invatare automata supervizata<br \/>\n&#8211; algoritmi (least square, gradient descent, logistic regression)\u00a0\u00a0&#8211;\u00a0 [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs05_ML_GD.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a> \u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=NA_STDv4YgE\" target=\"_blank\" rel=\"noopener\">video<\/a>] &#8211; Dragos Dobrean<\/span><\/td>\n<td width=\"100\">Evaluare ML [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab06\/lab06.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/8-AGMBpa\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S7<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs06-07_ML_ANN_1.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a> <a href=\"https:\/\/youtu.be\/uWuAJj5LhoQ\" target=\"_blank\" rel=\"noopener\">video<\/a>]<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (ANN)<\/span><\/td>\n<td width=\"100\">Metoda celor mai mici patrate [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab07\/lab07.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/7kjI3gOh\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S8<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (ANN &#8211; partea 2 [<a href=\"https:\/\/youtu.be\/hufLQjleNHQ\" target=\"_blank\" rel=\"noopener\">video<\/a>])<\/span><\/td>\n<td width=\"100\">Gradient Descrescator [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab08\/lab08.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/mQvg6ol_\" target=\"_blank\" rel=\"noopener\">git assignment\u00a0<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S9<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (ANN &#8211; partea 3 [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs08_ML_ANN_2.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>, <a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/annKeras.ipynb\">exKeras<\/a>], GP [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs09_ML_GP.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>] [<a href=\"https:\/\/youtu.be\/zcLNJO6Ojek\" target=\"_blank\" rel=\"noopener\">video<\/a>])<\/span><\/td>\n<td width=\"100\">Regresie logisitca [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab09\/lab09.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0 <a href=\"https:\/\/classroom.github.com\/a\/jafTbHJ4\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S10 (6 mai)<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata &#8211;\u00a0 SVM, kNN, Decision Trees [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs10_ML_SVM_kNN_DT.pdf\">pdf<\/a>, <a href=\"https:\/\/youtu.be\/trDM66mopTc\" target=\"_blank\" rel=\"noopener\">video<\/a>]<\/span><\/td>\n<td width=\"100\">ANN\u00a0 [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab10\/lab10.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/VUJzLy63\" target=\"_blank\" rel=\"noopener\">git assignment]<\/a><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S11 (13 mai)<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata nesupervizata [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs11_ML_Unsupervised.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>, <a href=\"https:\/\/www.youtube.com\/watch?v=SXAUvN_kqNQ\" target=\"_blank\" rel=\"noopener\">video<\/a>] &#8211;\u00a0 Sergiu Limboi<\/span><\/td>\n<td width=\"338\"><\/td>\n<td width=\"100\">kMeans\u00a0 [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab11\/lab11.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0 <a href=\"https:\/\/classroom.github.com\/a\/mdGA0zQN\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S12<\/td>\n<td width=\"349\">\u00a0Aplicatii [<a href=\"https:\/\/www.youtube.com\/watch?v=pIVTE-cFI6Y&amp;fbclid=IwAR001Th4iLwzwKEYmR6sIUfd0nK-MONAMXLmQpEVGV72w5w8RUB71GaaYyg\" target=\"_blank\" rel=\"noopener\">video<\/a>] &#8211; Gabriel Mircea<\/td>\n<td width=\"338\"><\/td>\n<td width=\"100\">Emotions\u00a0 [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab12\/lab12.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/uUC-bUTS\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S13<\/td>\n<td width=\"349\">Sisteme inteligente<\/p>\n<p>&#8211; dezvoltare [<span style=\"color: #000000;\"><a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs12_CD.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a><\/span>]<br \/>\n&#8211; sisteme bazate pe reguli \u00een medii certe [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs13_KBS.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small;\">capitolul III din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 4 \u015fi 5 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 2 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 6 \u015fi 7 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">User analytics\u00a0 [<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/labs\/lab13\/lab13.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>\u00a0<a href=\"https:\/\/classroom.github.com\/a\/wDK6cVeg\" target=\"_blank\" rel=\"noopener\">git assignment<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S14 (3 iunie)<\/td>\n<td width=\"349\">Sisteme inteligente<\/p>\n<p>&#8211; sisteme bazate pe reguli \u00een medii incerte [<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2019-2020\/lectures\/curs14_KBS.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small;\">capitolul V din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 3 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 8 \u015fi 9 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\"><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Anunt: pentru o buna desfasurare a examenului, toti studentii trebuie sa se conecteze la MsTeam pana cel tarziu in 10 iunie 2020.\u00a0 Metodologia de evaluare in sesiunea de examene [link] Simulare examen Ms Teams &#8211; in cadrul cursului din 27 mai se va efectua o simulare pe Microsoft Teams Cateva detalii despre cursul optional MIRPR [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":32,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1204"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/comments?post=1204"}],"version-history":[{"count":106,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1204\/revisions"}],"predecessor-version":[{"id":1400,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1204\/revisions\/1400"}],"up":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/32"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/media?parent=1204"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}