{"id":7506,"date":"2023-09-01T15:42:05","date_gmt":"2023-09-01T18:42:05","guid":{"rendered":"https:\/\/sbbd.org.br\/2023\/?page_id=7506"},"modified":"2023-09-16T09:35:57","modified_gmt":"2023-09-16T12:35:57","slug":"sbbd-tutorials-program","status":"publish","type":"page","link":"https:\/\/sbbd.org.br\/2023\/sbbd-tutorials-program\/","title":{"rendered":"SBBD Tutoriais &#8211; Programa\u00e7\u00e3o"},"content":{"rendered":"\n<div style=\"height:22px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h4 class=\"wp-block-heading\"><mark style=\"background-color:#ffffff\" class=\"has-inline-color has-luminous-vivid-orange-color\">Segunda-feira, 25 de setembro de 2023<\/mark><\/h4>\n\n\n\n<figure class=\"wp-block-table is-style-stripes has-small-font-size\"><table><thead><tr><th class=\"has-text-align-center\" data-align=\"center\"><\/th><th class=\"has-text-align-left\" data-align=\"left\">Tutoriais 2 e 4<\/th><\/tr><\/thead><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\">14:00 &#8211; 16:00<\/td><td class=\"has-text-align-left\" data-align=\"left\">Tutorial 4: <strong>Graph-based Methods for Similarity Searches<\/strong><br><em>Larissa Shimomura (Eindhoven University of Technology &#8211; Netherlands), Daniel Kaster (UEL &#8211; Brazil)<\/em><br>Chair: Marcos Bedo (IFF)<br><br>Similarity searches are based on retrieving similar data of one or more data used as reference according to an intrinsic characteristic of the data. Recently, graph-based methods have emerged as a very efficient option to execute similarity queries in metric and non-metric spaces. Graphs model the interconnectivity among data, enabling us to explore relationships and neighbors in an agile way. In this tutorial, we will give an introduction to similarity searches and present graph-based methods for similarity searches, the types of graphs used in such methods, their properties, open challenges, and research opportunities.<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">16:30 &#8211; 18:30<\/td><td class=\"has-text-align-left\" data-align=\"left\">Tutorial 2: <strong>Automatic Disambiguation of Author Names: Foundations, Methods and Open Issues<\/strong><br><em>Anderson Ferreira (UFOP &#8211; Brazil), Alberto Laender (UFMG &#8211; Brazil)<\/em><br>Chair: Eduardo Pena (UTFPR)<br><br>This tutorial is based on our book \u201cAutomatic Disambiguation of Author Names in Bibliographic Repositories\u201d and aims to spread the problem and its challenges among the SBBD community. Author name ambiguity problem occurs when an author publishes works under distinct names or distinct authors publish works under similar names. This problem may be caused by a number of reasons, including the lack of standards and common practices, and the decentralized generation of bibliographic content. In this tutorial, we intend to present an ample view on the automatic disambiguation of author names. We start by discussing its motivational issues, defining the author name disambiguation task and presenting its foundations. Next, we describe some methods proposed by our research group, as well as some recent approaches to author name disambiguation. Finally, we discuss open issues.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<hr class=\"wp-block-separator has-css-opacity\"\/>\n\n\n\n<h4 class=\"wp-block-heading\"><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-luminous-vivid-orange-color\">Ter\u00e7a-feira, 26 de setembro de 2023<\/mark><\/h4>\n\n\n\n<figure class=\"wp-block-table is-style-stripes has-small-font-size\"><table><thead><tr><th class=\"has-text-align-center\" data-align=\"center\"><\/th><th class=\"has-text-align-left\" data-align=\"left\">Tutoriais 1 e 3<\/th><\/tr><\/thead><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\">14:00 &#8211; 16:00<\/td><td class=\"has-text-align-left\" data-align=\"left\">Tutorial 3: <strong>Introdu\u00e7\u00e3o \u00e0 Ci\u00eancia de Dados em Ciberseguran\u00e7a<\/strong><br><em>Michele Nogueira (UFMG &#8211; Brazil), Ligia Borges (UFMG &#8211; Brazil)<\/em><br>Chair: Fabio Porto (LNCC)<br><br>Diante das mudan\u00e7as progressivas em ciberseguran\u00e7a, muitas delas impulsionadas pela ci\u00eancia de dados e pela oferta de mais recursos computacionais, \u00e9 cada vez mais necess\u00e1ria a dissemina\u00e7\u00e3o do tema e a forma\u00e7\u00e3o e\/ou atualiza\u00e7\u00e3o de profissionais. Este tutorial visa oferecer aos participantes um primeiro contato com o tema de ci\u00eancia de dados aplicada \u00e0 ciberseguran\u00e7a atrav\u00e9s de uma perspectiva h\u00edbrida: te\u00f3rica e pr\u00e1tica. O tutorial inicia com uma parte te\u00f3rica sobre ciberseguran\u00e7a e ci\u00eancia de dados destacando seu uso na preven\u00e7\u00e3o, detec\u00e7\u00e3o e mitiga\u00e7\u00e3o de ataques. Ser\u00e3o apresentadas brevemente as plataformas utilizadas em ci\u00eancia de dados, como Kaggle e Jupyter, atrav\u00e9s de exemplos na \u00e1rea de ciberseguran\u00e7a. O tutorial segue com uma s\u00e9rie de diferentes estudos de caso, em Python, representativos da \u00e1rea de ciberseguran\u00e7a e relacionados aos principais problemas, como a detec\u00e7\u00e3o de malware, detec\u00e7\u00e3o de anomalia, de bots, de spams, vazamentos de informa\u00e7\u00f5es e phishing. O tutorial segue uma abordagem introdut\u00f3ria e n\u00e3o se aprofundar\u00e1 nos t\u00f3picos abordados, por\u00e9m oferecer\u00e1 uma vis\u00e3o geral e ampla dos avan\u00e7os e conceitos relacionados ao tema.<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">14:00 &#8211; 16:00<\/td><td class=\"has-text-align-left\" data-align=\"left\">Tutorial 1: <strong>Privacy-Preserving Techniques for Social Network Analysis<\/strong><br><em>Andr\u00e9 Lu\u00eds Mendon\u00e7a (UFC &#8211; Brazil), Felipe Brito (UFC &#8211; Brazil), Javam Machado (UFC &#8211; Brazil)<\/em><br>Chair: Humberto Razente (UFU)<br><br>With the increasing concerns over data privacy, preserving the privacy of individuals in social network analysis has become crucial. This tutorial provides a comprehensive overview of methods and techniques to protect individual privacy while conducting social network analysis. We perform a deep analysis of differential privacy, which is a rigorous mathematical framework to protect individual privacy while enabling accurate analysis of network structure and characteristics. Additionally, this tutorial explores a variety of examples and case studies to demonstrate the application of these techniques in practical scenarios.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<hr class=\"wp-block-separator has-css-opacity\"\/>\n\n\n\n<h4 class=\"wp-block-heading\"><mark style=\"background-color:#ffffff\" class=\"has-inline-color has-luminous-vivid-orange-color\">Quarta-feira, 27 de setembro de 2023<\/mark><\/h4>\n\n\n\n<figure class=\"wp-block-table is-style-stripes has-small-font-size\"><table><thead><tr><th class=\"has-text-align-center\" data-align=\"center\"><\/th><th class=\"has-text-align-left\" data-align=\"left\">Tutorial 5<\/th><\/tr><\/thead><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\">13:00 &#8211; 16:00<\/td><td class=\"has-text-align-left\" data-align=\"left\">Tutorial 5: <strong>Prompting and Fine-tuning Pre-trained Generative Language Models<\/strong><br><em>Johny Moreira (UFAM &#8211; Brazil), Altigran da Silva (UFAM &#8211; Brazil), Luciano Barbosa (UFPE &#8211; Brazil)<\/em><br>Chair: Fabio Porto (LNCC)<br><br>There has been an explosion of available pre-trained and fine-tuned Generative Language Models (LM). They vary in the number of parameters, architecture, training strategy, and training set size. Aligned with it, alternative strategies exist to exploit these models, such as Fine-tuning and Prompt Engineering. However, many questions may arise throughout this process: Which model to apply for a given task? Which strategies to use? Will Prompt Engineering solve all tasks? What are the computational and financial costs involved? This tutorial will introduce and explore typical modern LM architectures with a hands-on approach to the available strategies.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Segunda-feira, 25 de setembro de 2023 Tutoriais 2 e 4 14:00 &#8211; 16:00 Tutorial 4: Graph-based Methods for Similarity SearchesLarissa&hellip; <\/p>\n","protected":false},"author":32,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-7506","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/pages\/7506","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/users\/32"}],"replies":[{"embeddable":true,"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/comments?post=7506"}],"version-history":[{"count":6,"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/pages\/7506\/revisions"}],"predecessor-version":[{"id":7714,"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/pages\/7506\/revisions\/7714"}],"wp:attachment":[{"href":"https:\/\/sbbd.org.br\/2023\/wp-json\/wp\/v2\/media?parent=7506"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}