{"id":88,"date":"2018-01-25T15:34:51","date_gmt":"2018-01-25T13:34:51","guid":{"rendered":"https:\/\/coursepages.uta.fi\/tiets44\/?page_id=88"},"modified":"2019-02-01T12:38:29","modified_gmt":"2019-02-01T10:38:29","slug":"assignment-2","status":"publish","type":"page","link":"https:\/\/coursepages2.tuni.fi\/tiets44\/assignment-2\/","title":{"rendered":"Assignment 2"},"content":{"rendered":"<p><strong>Students presentations on Friday, Feb 8, Pinni B0016, 14.00-16.00, and Thursday, Feb 14, Pinni B0016, 14.00-16.00.<\/strong><\/p>\n<p>For the second assignment, we will work in 6 groups.<\/p>\n<p>Next, you can find the reading material for this assignment (please read carefully):<\/p>\n<ul>\n<li>[Paper 1] <a href=\"https:\/\/people.uta.fi\/~kostas.stefanidis\/docs\/tbd17.pdf\" target=\"_blank\" rel=\"noopener\">Benchmarking Blocking Algorithms for Web Entities<\/a><\/li>\n<li>[Paper 2] <a href=\"http:\/\/www.vldb.org\/pvldb\/vol9\/p684-papadakis.pdf\" target=\"_blank\" rel=\"noopener\">Comparative Analysis of Approximate Blocking Techniques for Entity Resolution<\/a><\/li>\n<li>[Paper 3] <a href=\"http:\/\/www.mi.parisdescartes.fr\/~themisp\/publications\/bdr16.pdf\" target=\"_blank\" rel=\"noopener\">Boosting the Efficiency of Large-Scale Entity Resolution with Enhanced Meta-Blocking<\/a><\/li>\n<li>[Paper 4] <a href=\"http:\/\/www.mi.parisdescartes.fr\/~themisp\/publications\/semantics17.pdf\" target=\"_blank\" rel=\"noopener\">Multi-core Meta-blocking for Big Linked Data<\/a><\/li>\n<\/ul>\n<p>Each group is associated with a sub-assignment.<\/p>\n<p>The presenters (P) of each group will prepare an around 25 minutes presentation that answers the questions associated with the sub-assignment of the group. Presenters will work independently to each other, and each presenter will prepare his\/her own presentation.<br \/>\nAfter this presentation, the reviewers of the corresponding group (R) will explain their own point of view regarding the sub-assignment, e.g., they can add more details and explanations to the presented material, explain if they understood some concepts of the original paper in a different way, or even provide their vision for alternative ideas or solutions. Answers of the form &#8220;I do not have actually something to add&#8221;, are not well accepted. At least, you can propose your own preliminary solution for the problem we discuss.<\/p>\n<p><span style=\"text-decoration: underline\">Sub-assignment 1<\/span>:<br \/>\nGroup 1 will focus mainly on [Paper 1]. Specifically, the target here is to discuss the quality and performance of the evaluated blocking methods, as well as the results of blocking, when different kinds of links, other than owl:sameAs, are used as ground truth (Section 5). Please include briefly in your presentation\u00a0a discussion on the datasets and measures used (Section 4), and a discussion on the lessons learned from your analysis.<\/p>\n<p><span style=\"text-decoration: underline\">Sub-assignment 2<\/span>:<br \/>\nGroup 2 will focus mainly on [Paper 2]. Specifically, the target here is to discuss a way for organizing blocking methods. According to this taxonomy, the presentation will focus on lazy blocking methods, block-refinement methods, comparison-refinement methods and proactive blocking methods (Section 4).<\/p>\n<p><span style=\"text-decoration: underline\">Sub-assignment 3<\/span>:<br \/>\nGroup 3 will focus mainly on [Paper 2]. Specifically, the target here is to discuss the effectiveness, efficiency and scalability of the evaluated blocking methods (Sections 6.2, 6.3 and 6.4). Please include briefly in your presentation a discussion on the datasets used and how the parameters are tuned (Section 5).<\/p>\n<p><span style=\"text-decoration: underline\">Sub-assignment 4<\/span>:<br \/>\nGroup 4 will focus mainly on [Paper 3]. Specifically, the target here is to discuss two methods, namely graph partitioning and redundancy pruning, that lead to scalable Meta-blocking (Sections 4.1 and 4.2).<\/p>\n<p><span style=\"text-decoration: underline\">Sub-assignment 5<\/span>:<br \/>\nGroup 5 will focus mainly on [Paper 3]. Specifically, the target here is to discuss two methods, namely reciprocal pruning and block filtering, that lead to scalable Meta-blocking (Sections 4.3 and 4.4).<\/p>\n<p><span style=\"text-decoration: underline\">Sub-assignment 6<\/span>:<br \/>\nGroup 6 will focus mainly on [Paper 4]. Specifically, the target here is to discuss the multi-core techniques for parallelizing the pruning algorithms of Meta-blocking (Section 4).<\/p>\n<p><strong>Students presentations on Friday, Feb 8, Pinni B0016, 14.00-16.00, and Thursday, Feb 14, Pinni B0016, 14.00-16.00.<\/strong><\/p>\n<p style=\"color:#FF0000\">Please send your presentations at konstantinos.stefanidis@tuni.fi before 10.00am, Friday, February 8. <\/p>\n<p>Groups and group members are as follows (P stands for a presenter, R stands for a reviewer):<\/p>\n<p><strong>Group 1<\/strong><br \/>\nP &#8211; Gong Jin<br \/>\nP &#8211; Bagale Krishna<br \/>\nR &#8211; Jari Haapaniemi<br \/>\nR &#8211; Nayan Subba<\/p>\n<p><strong>Group 2<\/strong><br \/>\nP &#8211; Thiago Braguim Neves<br \/>\nP &#8211; Guo Bujia<br \/>\nR &#8211; Maria Stratigi<br \/>\nR &#8211; Lea Kahkonen<br \/>\nR &#8211; Jimi Laakso<\/p>\n<p><strong>Group 3<\/strong><br \/>\nP &#8211; Jari Haapaniemi<br \/>\nP &#8211; Samuli Lumirae<br \/>\nR &#8211; Jakub Hruska<br \/>\nR &#8211; Heidi Mikkola<\/p>\n<p><strong>Group 4<\/strong><br \/>\nP &#8211; Thi Nguyen<br \/>\nP &#8211; Heidi Mikkola<br \/>\nR &#8211; Bagale Krishna<br \/>\nR &#8211; Gong Jin<\/p>\n<p><strong>Group 5<\/strong><br \/>\nP &#8211; Jakub Hruska<br \/>\nP &#8211; Nayan Subba<br \/>\nP &#8211; Jimi Laakso<br \/>\nR &#8211; Thiago Braguim Neves<br \/>\nR &#8211; Guo Bujia<\/p>\n<p><strong>Group 6<\/strong><br \/>\nP &#8211; Maria Stratigi<br \/>\nP &#8211; Lea Kahkonen<br \/>\nR &#8211; Thi Nguyen<br \/>\nR &#8211; Samuli Lumirae<\/p>\n<p>Each student will work independently of the others. Please send an email at konstantinos.stefanidis@tuni.fi <u>if you cannot find your name in the above assignment to groups<\/u>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Students presentations on Friday, Feb 8, Pinni B0016, 14.00-16.00, and Thursday, Feb 14, Pinni B0016, 14.00-16.00. For the second assignment, we will work in 6 groups. Next, you can find the reading material for this assignment (please read carefully): [Paper 1] Benchmarking Blocking Algorithms for Web Entities [Paper 2] Comparative Analysis of Approximate Blocking Techniques &hellip; <a href=\"https:\/\/coursepages2.tuni.fi\/tiets44\/assignment-2\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Assignment 2<\/span><\/a><\/p>\n","protected":false},"author":33,"featured_media":0,"parent":0,"menu_order":3,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-88","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/pages\/88","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/users\/33"}],"replies":[{"embeddable":true,"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/comments?post=88"}],"version-history":[{"count":36,"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/pages\/88\/revisions"}],"predecessor-version":[{"id":285,"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/pages\/88\/revisions\/285"}],"wp:attachment":[{"href":"https:\/\/coursepages2.tuni.fi\/tiets44\/wp-json\/wp\/v2\/media?parent=88"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}