{"id":426,"date":"2014-02-24T07:03:37","date_gmt":"2014-02-24T07:03:37","guid":{"rendered":"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/?page_id=426"},"modified":"2018-09-26T08:17:44","modified_gmt":"2018-09-26T08:17:44","slug":"inteligenta-artificiala","status":"publish","type":"page","link":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/research\/all-years\/inteligenta-artificiala\/","title":{"rendered":"Inteligenta artificiala 2017-2018"},"content":{"rendered":"

Examen in sesiunea de restante<\/p>\n

-scris, 13 iulie, ora 8, sala C310;<\/p>\n

– predare laboratoare, 13 iulie, ora 8, campus (studentii care sustin examenul scris, vor preda laboratoarele dupa terminarea examenului scris)<\/p>\n\n\n\n\n
\u00a0Evaluare sesiunea de restante
\n<\/strong><\/strong>ASSERT (NrPuncteUnLaboratorPredat > LimMinimaLab)ASSERT(existaMinim3LaboratoarePredate == True)
\nASSERT(nrPunctePeUnLaboratorNepredat == 0)
\nASSERT(nrPunctePeActivitateaDeSeminar == nr puncte pt participarea\u00a0activa\u00a0la seminarii)<\/p>\n
IF Nota >= 5 THEN examenPromovat<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ELSE examenNepromovat<\/div>\n
<\/div>\n
Nota:<\/div>\n
    \n
  1. Punctele deja acumulate in timpul semestrului se pastreaza<\/li>\n
  2. Temele de laborator predate in sesiunea de restante pot primi maxim 50% din punctajul aferente lor.<\/li>\n<\/ol>\n<\/td>\n
\u00a0Punctaj\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Nota<\/strong>
\n<801\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 nepromovat
\n[801,900]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a05
\n[901,1300]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a06
\n[1301,2000]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a07
\n[2001,3500]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a08
\n[3501,4500]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a09
\n>4500\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 10<\/td>\n<\/tr>\n
E<\/strong>valuare<\/strong>
\nASSERT (NrPrezenteSeminar >= 6)
\nASSERT (NrPrezenteLab >= 6)
\nASSERT (NrPuncteUnLaboratorPredat > LimMinimaLab)ASSERT(existaMinim3LaboratoarePredate == True)
\nASSERT(nrPunctePeUnLaboratorNepredat == 0)
\nASSERT(nrPunctePeActivitateaDeSeminar == nr puncte pt participarea\u00a0activa<\/b>\u00a0la seminarii)<\/p>\n
IF Nota >= 5 THEN examenPromovat<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ELSE examenNepromovat<\/div>\n<\/td>\n
Punctaj\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Nota<\/strong>
\n<801\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 nepromovat
\n[801,900]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a05
\n[901,1300]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a06
\n[1301,2000]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a07
\n[2001,3500]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a08
\n[3501,4500]\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a09
\n>4500\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a010<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n
<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

 <\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Data<\/b><\/td>\nCurs<\/b><\/td>\nMateriale de citit \u015fi leg\u0103turi utile<\/b><\/td>\nSeminar<\/b><\/td>\nLaborator<\/b><\/td>\n<\/tr>\n
S1<\/td>\nOrganizatorice – ro<\/a>
\nIntroducere \u00een IA – ro<\/a>
\nMetode de c\u0103utare
\n– metode neinformate si informate, Hill Climbing, Simulated Annealing, Tabu Search – ro<\/a><\/td>\n		\nMetode de c\u0103utare\u00a0sem<\/a><\/td>\nMetode de cautare – ro<\/a><\/td>\n<\/tr>\n
S2<\/td>\nMetode de c\u0103utare
\n–\u00a0Algoritmi Evolutivi –\u00a0ro<\/a>\u00a0(suplim –\u00a0ro<\/a>)<\/td>\n		\n
    \n
  • capitolul 14 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n
  • M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1998<\/span><\/li>\n
  • capitolul 7.6 din A. A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n
  • Capitolul 9 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
S3<\/td>\nMetode de c\u0103utare-\u00a0Algoritmi inspira\u0163i de furnici, algoritmi inspira\u0163i de inteligen\u0163a de grup) –\u00a0ro<\/a>– Metode de c\u0103utare adversial\u0103 –\u00a0ro<\/a><\/td>\n\n
    \n
  • capitolul 16 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n
  • James Kennedy, Russel Eberhart, Particle Swarm
    \nOptimisation, Proceedings of IEEE International Conference
    \non Neural Networks. IV. pp. 1942\u20131948, 1995
    \n(05_ACO_PSO\/PSO_00.pdf)<\/span><\/li>\n
  • Marco Dorigo, Christian Blum, Ant colony optimization
    \ntheory: A survey, Theoretical Computer Science 344 (2005)<\/span><\/li>\n
  • capitolul II.5 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n
  • capitolul 6 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<\/ul>\n<\/td>\n
Metode de c\u0103utare\u00a0sem<\/a><\/td>\nMetode de c\u0103utare – ro<\/a> date<\/a><\/td>\n<\/tr>\n
S4<\/td>\nInvatare automata
\n– problematica ro<\/a>
\nInvatare automata supervizata
\n– algoritmi (least square, gradient descent)<\/td>\n		\n
    \n
  • capitolul VI (18) din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n
  • capitolul 8 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n
  • capitolul 10, 11, 12, 13, 15 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n
  • Capitolul V din D. J. C. MacKey, Information Theory, Inferenceand Learning Algorithms, Cambridge University Press, 2003<\/span><\/li>\n
  • Capitolul 3 si 4 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
S5<\/td>\nInvatare automata supervizata
\n– algoritmi (logistic regression, kNN, decision trees, SVM) ro<\/a><\/td>\n		Regresie\u00a0sem<\/a><\/td>\nRegresie link <\/a><\/td>\n<\/tr>\n
S6<\/td>\nInvatare automata supervizata
\n– algoritmi\u00a0 (ANN, GP) ANN <\/a> GP <\/a><\/td>\n<\/tr>\n
S7<\/td>\nInvatare automata supervizata
\n– algoritmi\u00a0 (deep learning)<\/td>\n		Clasificare\u00a0sem<\/a><\/td>\nClasificare link <\/a><\/td>\n<\/tr>\n
S8<\/td>\nInvatare automata nesupervizata
\n– algoritmi\u00a0 (kMeans) ro <\/a><\/td>\n<\/tr>\n
S9<\/td>\nInvatare automata prin intarire ro <\/a><\/td>\nRegresie si clasificare\u00a0sem<\/a><\/td>\nRegresie si clasificare link <\/a><\/td>\n<\/tr>\n
S10<\/td>\nInvatare automata semi-supervizata ro <\/a><\/td>\n<\/tr>\n
S11<\/td>\n <\/p>\n

Sisteme inteligente
\n– sisteme bazate pe reguli \u00een medii certe\u00a0ro<\/a><\/td>\n

\n
    \n
  • capitolul III din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n
  • capitolul 4 \u015fi 5 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n
  • capitolul 2 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n
  • capitolul 6 \u015fi 7 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n
Regresie si clasificare sem<\/a><\/td>\nProiecte –\u00a0link<\/a><\/p>\n

Date\u00a0link<\/a><\/td>\n<\/tr>\n

S12<\/td>\nPrezentare Bosch\u00a0pdf<\/a>\u00a0pdf<\/a><\/td>\n<\/td>\n<\/tr>\n
S13<\/td>\nPrezentare Evozone\u00a0pdf<\/a><\/td>\n<\/td>\nInvatare nesupervizata<\/td>\n<\/td>\n<\/tr>\n
S14<\/td>\nSisteme inteligente
\n– sisteme bazate pe reguli \u00een medii incertee\u00a0ro<\/a><\/td>\n		\n
    \n
  • capitolul V din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n
  • capitolul 3 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n
  • capitolul 8 \u015fi 9 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

    Modificare orar<\/strong><\/span><\/p>\n

    Seminar IA grupa 224: marti (27 feb), 18-20, C510 (in loc de vineri, 2 martie, 10-12)<\/p>\n

    Seminar IA grupa 225: vineri (2 martie), 18-20, L321 (in loc de vineri, 2 martie, 12-14)<\/p>\n

     <\/p>\n

     <\/p>\n

     <\/p>\n","protected":false},"excerpt":{"rendered":"

    Examen in sesiunea de restante -scris, 13 iulie, ora 8, sala C310; – predare laboratoare, 13 iulie, ora 8, campus (studentii care sustin examenul scris, vor preda laboratoarele dupa terminarea examenului scris) \u00a0Evaluare sesiunea de restante ASSERT (NrPuncteUnLaboratorPredat > LimMinimaLab)ASSERT(existaMinim3LaboratoarePredate == True) ASSERT(nrPunctePeUnLaboratorNepredat == 0) ASSERT(nrPunctePeActivitateaDeSeminar == nr puncte pt participarea\u00a0activa\u00a0la seminarii) IF Nota >= […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":32,"menu_order":3,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/426"}],"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=426"}],"version-history":[{"count":204,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/426\/revisions"}],"predecessor-version":[{"id":968,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/426\/revisions\/968"}],"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=426"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}