{"id":1551,"date":"2023-02-25T17:30:30","date_gmt":"2023-02-25T17:30:30","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/?page_id=1551"},"modified":"2023-09-29T15:36:59","modified_gmt":"2023-09-29T15:36:59","slug":"inteligenta-artificiala-2022-2023","status":"publish","type":"page","link":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/research\/all-years\/inteligenta-artificiala-2022-2023\/","title":{"rendered":"Inteligenta Artificiala 2022-2023"},"content":{"rendered":"\n<p>Salut&#8230;daca ati ajuns aici, mai faceti inca un pas si dati join pe MsTeams la grupul cu codul kf489nz. Multumesc!<\/p>\n\n\n\n<p>Vom folosi platforma MsTeams pentru activitatea din acest semestru la disciplina AI.&nbsp;&nbsp;Daca, din motive tehnice, MsTeams nu functioneaza, ne vom auzi si vedea pe zoom (link-ul spre meeting va fi aici).<\/p>\n\n\n\n<p>&#8230;. sa incepem &#8220;sa ne dam cu bicicleta&#8221;&nbsp;&#x1f6b2;<\/p>\n\n\n\n<p>Cerinte:<\/p>\n\n\n\n<ul>\n<li>inscrierea in grupul MsTeams (vezi mai sus)<\/li>\n\n\n\n<li>consultarea materialelor specifice &#8211; detalii [<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\" target=\"_blank\" rel=\"noreferrer noopener\">aici<\/a>]<\/li>\n\n\n\n<li>participarea activa la cursuri si laboratoare\n<ul>\n<li>participare activa la laborator = intrare in meeting-ul online AND rezolvare quiz AND discutii despre munca realizata<\/li>\n\n\n\n<li>prezenta la laborator = rezolvarea unui quiz pe tematica laboratorului<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>realizarea si prezentarea proiectului (aplicatie si documentatie)<\/li>\n<\/ul>\n\n\n\n<p>Nota:<\/p>\n\n\n\n<ul>\n<li>nu este permisa inregistrarea activitatilor didactice.&nbsp;Conform LEN 2011, inregistrarea prin orice procedee a activitatii didactice poate fi facuta numai cu acordul profesorului.<\/li>\n<\/ul>\n\n\n\n<p>Echipa:<\/p>\n\n\n\n<ul>\n<li>noi (Laura Diosan, Alexandra Todericiu, Gabi Mircea, Bogdan Mursa, Alexandru Pirvu, Rares Iova)<\/li>\n\n\n\n<li>voi, studentii<\/li>\n<\/ul>\n\n\n\n<p>Evaluare:<\/p>\n\n\n\n<ul>\n<li>pe baza punctelor acumulate la curs, laborator, proiect si examenul din sesiune<\/li>\n<\/ul>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Evaluare (toate assertiunile trebuie respectate)<\/strong><br>ASSERT (NrPrezenteLab &gt;= 10)<br>ASSERT (NrPuncteUnLaboratorPredat &gt;= LimMinimaLab)<br>ASSERT (existaMinim8LaboratoarePredate == True)<br>ASSERT (nrPunctePeUnLaboratorNepredat == 0)<br>ASSERT (600 &lt;= nrPuncteExamenScris &lt;= 2000)<\/td><td><strong>Punctaj<\/strong><br>&lt;2500<br>[2 500, 3 000]<br>[3 001, 4 500]<br>[4 501, 6 000]<br>[6 001, 7 000]<br>[7 001, 7 500]<br>&gt;7 500<\/td><td><strong>Nota<\/strong><br><strong>4<\/strong><br><strong>5<\/strong><br><strong>6<\/strong><br><strong>7<\/strong><br><strong>8<\/strong><br><strong>9<\/strong><br><strong>10<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Reguli<\/strong>&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/rules.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a>]<\/p>\n\n\n\n<p><strong>Situatie punctaje [<\/strong><a href=\"https:\/\/ubbcluj-my.sharepoint.com\/:x:\/g\/personal\/laura_diosan_ubbcluj_ro\/EdlAxYQLC0ZGgHrkyzPfmQIBJ6r1_ZyTK5-w-oFMRKaJMg?e=359dJ5\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a>]<\/p>\n\n\n\n<p>Fiecare student trebuie sa respecte urmatorii pasi in derulararea laboratoarelor:<\/p>\n\n\n\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 si efectuarea activitatii specifice (probleme de implementat pe loc, quiz-uri, etc)<\/li>\n\n\n\n<li>Se realizeaza tema.<\/li>\n\n\n\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\n\n\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\n\n\n<li>Se prezinta tema cadrului didactic in cadrul orelor de laborator<\/li>\n\n\n\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\n\n\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\n\n\n<li>pana la finalul urmatorului laborator (dupa cel prevazut ca deadline) &#8211; pentru evaluare cu penalizare de 10% intarziere;<\/li>\n\n\n\n<li>pana la finalul urmatorului urmatorului laborator (dupa cel prevazut ca deadline) &#8211; pentru evaluare cu penalizare de 20% intarziere;<\/li>\n\n\n\n<li>dupa expirarea acestui termen, nu se mai evalueaza temele incarcate<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/li>\n\n\n\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=\"noreferrer noopener\">link<\/a>, fie aplicatii de genul SourceTree <a href=\"https:\/\/www.sourcetreeapp.com\/\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a>)<\/li>\n\n\n\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\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Sapt<\/td><td>Curs<\/td><td>Bibliografie<\/td><td>Lab<\/td><\/tr><tr><td>S1<\/td><td>Organizatorice &#8211; [<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/00_admin.pdf\" target=\"_blank\">pdf<\/a>]<br>Introducere \u00een IA &#8211; [<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/01_introAI.pdf\" target=\"_blank\">pdf<\/a>]&nbsp;<br>Metode de c\u0103utare &#8211; [pdf]<br>&#8211; metode neinformate si informate, Hill Climbing, Simulated Annealing, Tabu Search [<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/01_search_uninformed.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">pdf<\/a>]<\/td><td>capitolele I.1, I.2, II.3, II.4 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995 <br>capitolele 1 &#8211; 4 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011 capitolele 2.1 \u2013 2.5 din <a href=\"http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/\">http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/<\/a><\/td><td>Algoritmi simpli [<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab01\/AI-lab01.md\" target=\"_blank\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/UCB0Is-l\">git<\/a>]<\/td><\/tr><tr><td>S2<\/td><td>Metode de c\u0103utare<br>&#8211; Algoritmi Evolutivi&nbsp;&nbsp; &nbsp; suplimnetar despre alti AE&nbsp; [<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/02_localSearch_EA.pdf\" target=\"_blank\">pdf<\/a>], suplim [<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/02_localSearch_EA_suplim.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">pdf<\/a>]<\/td><td>capitolul 14 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011 M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1998 <br>capitolul 7.6 din A. A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001 <br>capitolul 9 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/td><td>Algoritmi euristici&nbsp; [<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab02\/AI-lab02.md\" target=\"_blank\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/Vu-_fXkt\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S3<\/td><td>Metode de c\u0103utare- Algoritmi inspira\u0163i de furnici, algoritmi inspira\u0163i de inteligen\u0163a de grup)&nbsp;&#8211;&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/03_localSearch_PSO_ACO.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">pdf<\/a>]&nbsp; Metode de c\u0103utare adversial\u0103&nbsp;&#8211;&nbsp;[]<\/td><td>capitolul 16 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011 <br>James Kennedy, Russel Eberhart, Particle Swarm<br>Optimisation, Proceedings of IEEE International Conference<br>on Neural Networks. IV. pp. 1942\u20131948, 1995<br>Marco Dorigo, Christian Blum, Ant colony optimization<br>theory: A survey, Theoretical Computer Science 344 (2005) <br>capitolul II.5 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995 <br>capitolul 6 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/td><td>Algoritmi evolutivi&nbsp;[<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab03\/AI-lab03.md\" target=\"_blank\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/LJqJQrhc\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S4<\/td><td>&nbsp;&nbsp;Invatare automata<br>&#8211; problematica&nbsp;&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/04_ML_intro.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">pdf<\/a>]<\/td><td>capitolul VI (18) din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995 <br>capitolul 8 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001 <br>capitolul 10, 11, 12, 13, 15 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011 <br>capitolul V din D. J. C. MacKey, Information Theory, Inferenceand Learning Algorithms, Cambridge University Press, 2003 <br>capitolul 3 si 4 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/td><td>Algoritmi evolutivi (2)&nbsp;[<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab04\/AI-lab04.md\" target=\"_blank\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/4J_q8-i5\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<br><br>Optional &#8211; Algoritmi ACO &nbsp;[<a rel=\"noreferrer noopener\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab04-optional\/AI-lab04-opt.md\" target=\"_blank\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/AHpsRGWi\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>&nbsp;S5<\/td><td>&nbsp;Invatare automata supervizata<br>&#8211; algoritmi (least square, gradient descent, logistic regression)&nbsp;&nbsp;&nbsp;&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/05_ML_GD.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">pdf<\/a>]<\/td><td><\/td><td>Evaluare ML&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab05\/AI-lab05.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/NMqfGCb_\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S6<\/td><td>&nbsp;Invatare automata supervizata&nbsp;<br>&#8211; algoritmi (ANN)&nbsp;&nbsp;&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/lectures\/06_ML_ANN.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">pdf<\/a>]<\/td><td><\/td><td>&nbsp; &nbsp;MCMMP&nbsp;&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab06\/AI-lab06.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/jOxdVj0a\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S7<\/td><td> &nbsp;Invatare automata supervizata<br>&#8211; algoritmi (ANN &#8211; partea 2 )&nbsp;[]<\/td><td><\/td><td>Gradient Descrescator&nbsp;&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab07\/AI-lab07.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/mqf6wDP5\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td><\/td><td><\/td><td><\/td><td>Projects [<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/projects.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/nf3TlrNu\">git<\/a>]<\/td><\/tr><tr><td>S8<\/td><td>Invatare automata supervizata<br>&#8211; algoritmi (SVM, GP, kNN, DT)&nbsp;[]<\/td><td><\/td><td>Regresie logisitca &nbsp;&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab08\/AI-lab08.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/QomEJdeS\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S9<\/td><td>Invatare automata nesupervizata&nbsp;[]<\/td><td><\/td><td>ANN&nbsp;[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab09\/AI-lab09.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/-jIUskV0\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S10<\/td><td>Sisteme bazate pe reguli \u00een medii certe [] si incerte&nbsp;[]<\/td><td>capitolul III din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995 capitolul 4 \u015fi 5 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004 capitolul 2 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001 capitolul 6 \u015fi 7 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011 capitolul V din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995 capitolul 3 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001 capitolul 8 \u015fi 9 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/td><td>kMeans [<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab10\/AI-lab10.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/RONmAYc-\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S11<\/td><td>&nbsp;Aplicatii []<\/td><td>&nbsp;<\/td><td>Emotions\u00a0[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab11\/AI-lab11.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/Gsnjj_eE\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S12<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>User analytics [<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2022-2023\/labs\/lab12\/AI-lab12.md\" target=\"_blank\" rel=\"noreferrer noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/XXYBQs5O\" target=\"_blank\" rel=\"noreferrer noopener\">git<\/a>]<\/td><\/tr><tr><td>S13<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>\u00a0<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Salut&#8230;daca ati ajuns aici, mai faceti inca un pas si dati join pe MsTeams la grupul cu codul kf489nz. Multumesc! Vom folosi platforma MsTeams pentru activitatea din acest semestru la disciplina AI.&nbsp;&nbsp;Daca, din motive tehnice, MsTeams nu functioneaza, ne vom auzi si vedea pe zoom (link-ul spre meeting va fi aici). &#8230;. sa incepem &#8220;sa [&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\/1551"}],"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=1551"}],"version-history":[{"count":15,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1551\/revisions"}],"predecessor-version":[{"id":1603,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1551\/revisions\/1603"}],"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=1551"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}