{"id":24250,"date":"2019-11-27T09:58:48","date_gmt":"2019-11-27T08:58:48","guid":{"rendered":"https:\/\/lium.univ-lemans.fr\/?p=24250"},"modified":"2019-11-29T11:02:01","modified_gmt":"2019-11-29T10:02:01","slug":"une-approche-graphe-reseaux-complexes-pour-modeliser-le-sens-des-mots","status":"publish","type":"post","link":"https:\/\/lium.univ-lemans.fr\/en\/une-approche-graphe-reseaux-complexes-pour-modeliser-le-sens-des-mots\/","title":{"rendered":"Une approche graphe\/r\u00e9seaux complexes pour mod\u00e9liser le sens des mots"},"content":{"rendered":"<div class=\"panel-grid\" id=\"pg-24250-0\" ><div class=\"panel-grid-core\"><div class=\"panel-grid-cell\" id=\"pgc-24250-0-0\" ><div class=\"panel-widget-style\" ><h2 style=\"color: #e5442d;\">Une approche graphe\/r\u00e9seaux complexes pour mod\u00e9liser le sens des mots<\/h2>\n<p>&nbsp;<\/p>\n<p><strong>Encadrant(s):<\/strong> Nicolas Dugu\u00e9<br \/>\n<strong>Equipe d&#8217;accueil :<\/strong> LIUM &#8211; LST<br \/>\n<strong>Lieu :<\/strong> Le Mans<br \/>\n<strong>Contexte :<\/strong>Le projet #neo s&#8217;int\u00e9resse \u00e0 la d\u00e9tection automatique de n\u00e9ologismes en exploitant de grands corpus textuels. En particulier, il s&#8217;agit de d\u00e9tecter des mots qui changent de sens ou dont un nouveau sens appara\u00eet.<br \/>\n<strong>Mots-cl\u00e9s :<\/strong> Word embeddings, graphes, r\u00e9seaux complexes, Corpus textuels, Programmation Python<br \/>\n<strong>Contact : <\/strong>nicolas.dugue(at)univ-lemans.fr<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p align=\"justify\">Lors de pr\u00e9c\u00e9dents travaux, nous avons montr\u00e9 que des approches d&#8217;apprentissage de plongements lexicaux (word embeddings) bas\u00e9es sur la th\u00e9orie des r\u00e9seaux complexes (graphes) peuvent pr\u00e9senter plusieurs avantages :<\/p>\n<ul>\n<li>Interpr\u00e9tabilit\u00e9 des dimensions des embeddings appris ;<\/li>\n<li>Possibilit\u00e9 d&#8217;apprendre rapidement l&#8217;embedding d&#8217;un mot pr\u00e9c\u00e9demment inconnu ;<\/li>\n<li>Gestion inh\u00e9rente de la polys\u00e9mie.<\/li>\n<\/ul>\n<p align=\"justify\">Nous souhaitons exp\u00e9rimenter ces mod\u00e8les bas\u00e9s th\u00e9ories des r\u00e9seaux complexes sur de nouveaux corpus affin d&#8217;explorer leur propri\u00e9t\u00e9 et de montrer leur robustesse. Durant le stage, il s&#8217;agira de :<\/p>\n<ul>\n<li>Apprendre \u00e0 ma\u00eetriser l&#8217;\u00e9tat de l&#8217;art des word embeddings ;<\/li>\n<li>Prendre en main le mod\u00e8le bas\u00e9 r\u00e9seaux complexes d\u00e9velopp\u00e9 en Python et le mettre \u00e0 jour, l&#8217;am\u00e9liorer ;<\/li>\n<li>Exp\u00e9rimenter le mod\u00e8le am\u00e9lior\u00e9 sur de nouveaux corpus.<\/li>\n<\/ul>\n<p>&nbsp;<br \/>\n<strong>Bibliographie:<\/strong><\/p>\n<p align=\"justify\"><\/div><\/div><\/div><\/div>","protected":false},"excerpt":{"rendered":"<p>Une approche graphe\/r\u00e9seaux complexes pour mod\u00e9liser le sens des mots &nbsp; Encadrant(s): Nicolas Dugu\u00e9 Equipe d&#8217;accueil : LIUM &#8211; LST Lieu : Le Mans Contexte :Le projet #neo s&#8217;int\u00e9resse \u00e0 la d\u00e9tection automatique de n\u00e9ologismes en exploitant de grands corpus textuels. En particulier, il s&#8217;agit de d\u00e9tecter des mots qui changent de sens ou dont [&hellip;]<\/p>\n<p class=\"more-link style2\"><a href=\"https:\/\/lium.univ-lemans.fr\/en\/une-approche-graphe-reseaux-complexes-pour-modeliser-le-sens-des-mots\/\"  class=\"themebutton\"><span class=\"more-text\">READ MORE<\/span><span class=\"more-icon\"><i class=\"fa fa-angle-right fa-lg\"><\/i><\/span><\/a><\/p>\n","protected":false},"author":14,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[83],"tags":[72,49],"acf":[],"_links":{"self":[{"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/posts\/24250"}],"collection":[{"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/users\/14"}],"replies":[{"embeddable":true,"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/comments?post=24250"}],"version-history":[{"count":0,"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/posts\/24250\/revisions"}],"wp:attachment":[{"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/media?parent=24250"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/categories?post=24250"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lium.univ-lemans.fr\/en\/wp-json\/wp\/v2\/tags?post=24250"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}