[{"_id":"15920","date_updated":"2022-01-06T06:52:41Z","publisher":"Universität Paderborn","date_created":"2020-02-17T12:03:40Z","status":"public","language":[{"iso":"eng"}],"type":"mastersthesis","year":"2019","user_id":"477","citation":{"chicago":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","ieee":"M. Keerthipati, <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","ama":"Keerthipati M. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn; 2019.","apa":"Keerthipati, M. (2019). <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn.","short":"M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking, Universität Paderborn, 2019.","mla":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","bibtex":"@book{Keerthipati_2019, title={A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking}, publisher={Universität Paderborn}, author={Keerthipati, Monica}, year={2019} }"},"department":[{"_id":"78"}],"author":[{"first_name":"Monica","full_name":"Keerthipati, Monica","last_name":"Keerthipati"}],"title":"A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking","abstract":[{"lang":"eng","text":"Secure hardware design is the most important aspect to be considered in addition to functional correctness. Achieving hardware security in today’s globalized Integrated Cir- cuit(IC) supply chain is a challenging task. One solution that is widely considered to help achieve secure hardware designs is Information Flow Tracking(IFT). It provides an ap- proach to verify that the systems adhere to security properties either by static verification during design phase or dynamic checking during runtime.\r\nProof-Carrying Hardware(PCH) is an approach to verify a functional design prior to using it in hardware. It is a two-party verification approach, where the target party, the consumer requests new functionalities with pre-defined properties to the producer. In response, the producer designs the IP (Intellectual Property) cores with the requested functionalities that adhere to the consumer-defined properties. The producer provides the IP cores and a proof certificate combined into a proof-carrying bitstream to the consumer to verify it. If the verification is successful, the consumer can use the IP cores in his hardware. In essence, the consumer can only run verified IP cores. Correctly applied, PCH techniques can help consumers to defend against many unintentional modifications and malicious alterations of the modules they receive. There are numerous published examples of how to use PCH to detect any change in the functionality of a circuit, i.e., pairing a PCH approach with functional equivalence checking for combinational or sequential circuits. For non-functional properties, since opening new covert channels to leak secret information from secure circuits is a viable attack vector for hardware trojans, i.e., intentionally added malicious circuitry, IFT technique is employed to make sure that secret/untrusted information never reaches any unclassified/trusted outputs.\r\nThis master thesis aims to explore the possibility of adapting Information Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream level enabling consumers to validate the trustworthiness of a module’s information flow without the computational costs of a complete flow analysis."}],"supervisor":[{"last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"},{"orcid":"0000-0002-3717-3939","first_name":"Sybille","full_name":"Hellebrand, Sybille","id":"209","last_name":"Hellebrand"}],"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"}]},{"_id":"15921","date_updated":"2022-01-06T06:52:41Z","publisher":"ACM","date_created":"2020-02-18T16:39:35Z","status":"public","publication_identifier":{"isbn":["9781450368858"]},"year":"2019","language":[{"iso":"eng"}],"publication_status":"published","citation":{"apa":"Desouki, A. A., Röder, M., &#38; Ngonga Ngomo, A.-C. (2019). Ranking on Very Large Knowledge Graphs. In <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i> (pp. 163–171). ACM. <a href=\"https://doi.org/10.1145/3342220.3343660\">https://doi.org/10.1145/3342220.3343660</a>","ama":"Desouki AA, Röder M, Ngonga Ngomo A-C. Ranking on Very Large Knowledge Graphs. In: <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>. ACM; 2019:163-171. doi:<a href=\"https://doi.org/10.1145/3342220.3343660\">10.1145/3342220.3343660</a>","ieee":"A. A. Desouki, M. Röder, and A.-C. Ngonga Ngomo, “Ranking on Very Large Knowledge Graphs,” in <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>, 2019, pp. 163–171.","chicago":"Desouki, Abdelmoneim Amer, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “Ranking on Very Large Knowledge Graphs.” In <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>, 163–71. ACM, 2019. <a href=\"https://doi.org/10.1145/3342220.3343660\">https://doi.org/10.1145/3342220.3343660</a>.","bibtex":"@inproceedings{Desouki_Röder_Ngonga Ngomo_2019, title={Ranking on Very Large Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1145/3342220.3343660\">10.1145/3342220.3343660</a>}, booktitle={Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19}, publisher={ACM}, author={Desouki, Abdelmoneim Amer and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2019}, pages={163–171} }","mla":"Desouki, Abdelmoneim Amer, et al. “Ranking on Very Large Knowledge Graphs.” <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>, ACM, 2019, pp. 163–71, doi:<a href=\"https://doi.org/10.1145/3342220.3343660\">10.1145/3342220.3343660</a>.","short":"A.A. Desouki, M. Röder, A.-C. Ngonga Ngomo, in: Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19, ACM, 2019, pp. 163–171."},"department":[{"_id":"574"}],"author":[{"first_name":"Abdelmoneim Amer","full_name":"Desouki, Abdelmoneim Amer","last_name":"Desouki"},{"full_name":"Röder, Michael","first_name":"Michael","last_name":"Röder"},{"last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"conference":{"name":"30th ACM Conference on Hypertext and Social Media","start_date":"2019-09-17","end_date":"2019-09-20"},"page":"163-171","publication":"Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT '19","type":"conference","user_id":"69382","keyword":["Knowledge Graphs","Ranking","RDF"],"title":"Ranking on Very Large Knowledge Graphs","doi":"10.1145/3342220.3343660","abstract":[{"text":"Ranking plays a central role in a large number of applications driven by RDF knowledge graphs. Over the last years, many popular RDF knowledge graphs have grown so large that rankings for the facts they contain cannot be computed directly using the currently common 64-bit platforms. In this paper, we tackle two problems:\r\nComputing ranks on such large knowledge bases efficiently and incrementally. First, we present D-HARE, a distributed approach for computing ranks on very large knowledge graphs. D-HARE assumes the random surfer model and relies on data partitioning to compute matrix multiplications and transpositions on disk for matrices of arbitrary size. Moreover, the data partitioning underlying D-HARE allows the execution of most of its steps in parallel.\r\nAs very large knowledge graphs are often updated periodically, we tackle the incremental computation of ranks on large knowledge bases as a second problem. We address this problem by presenting\r\nI-HARE, an approximation technique for calculating the overall ranking scores of a knowledge without the need to recalculate the ranking from scratch at each new revision. We evaluate our approaches by calculating ranks on the 3 × 10^9 and 2.4 × 10^9 triples from Wikidata resp. LinkedGeoData. Our evaluation demonstrates\r\nthat D-HARE is the first holistic approach for computing ranks on very large RDF knowledge graphs. In addition, our incremental approach achieves a root mean squared error of less than 10E−7 in the best case. Both D-HARE\r\n and I-HARE are open-source and are available at: https://github.com/dice-group/incrementalHARE.\r\n","lang":"eng"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}]},{"date_updated":"2022-01-06T06:52:03Z","page":"289-290","_id":"14568","year":"2019","type":"conference","language":[{"iso":"eng"}],"status":"public","publication":"INFORMATIK","date_created":"2019-11-05T15:48:52Z","department":[{"_id":"66"}],"citation":{"short":"S. Heindorf, Y. Scholten, G. Engels, M. Potthast, in: INFORMATIK, 2019, pp. 289–290.","mla":"Heindorf, Stefan, et al. “Debiasing Vandalism Detection Models at Wikidata (Extended Abstract).” <i>INFORMATIK</i>, 2019, pp. 289–90, doi:<a href=\"https://doi.org/10.18420/inf2019_48\">10.18420/inf2019_48</a>.","bibtex":"@inproceedings{Heindorf_Scholten_Engels_Potthast_2019, title={Debiasing Vandalism Detection Models at Wikidata (Extended Abstract)}, DOI={<a href=\"https://doi.org/10.18420/inf2019_48\">10.18420/inf2019_48</a>}, booktitle={INFORMATIK}, author={Heindorf, Stefan and Scholten, Yan and Engels, Gregor and Potthast, Martin}, year={2019}, pages={289–290} }","chicago":"Heindorf, Stefan, Yan Scholten, Gregor Engels, and Martin Potthast. “Debiasing Vandalism Detection Models at Wikidata (Extended Abstract).” In <i>INFORMATIK</i>, 289–90, 2019. <a href=\"https://doi.org/10.18420/inf2019_48\">https://doi.org/10.18420/inf2019_48</a>.","ieee":"S. Heindorf, Y. Scholten, G. Engels, and M. Potthast, “Debiasing Vandalism Detection Models at Wikidata (Extended Abstract),” in <i>INFORMATIK</i>, 2019, pp. 289–290.","apa":"Heindorf, S., Scholten, Y., Engels, G., &#38; Potthast, M. (2019). Debiasing Vandalism Detection Models at Wikidata (Extended Abstract). In <i>INFORMATIK</i> (pp. 289–290). <a href=\"https://doi.org/10.18420/inf2019_48\">https://doi.org/10.18420/inf2019_48</a>","ama":"Heindorf S, Scholten Y, Engels G, Potthast M. Debiasing Vandalism Detection Models at Wikidata (Extended Abstract). In: <i>INFORMATIK</i>. ; 2019:289-290. doi:<a href=\"https://doi.org/10.18420/inf2019_48\">10.18420/inf2019_48</a>"},"user_id":"11871","oa":"1","main_file_link":[{"open_access":"1","url":"https://dl.gi.de/bitstream/handle/20.500.12116/24997/paper3_25.pdf"}],"doi":"10.18420/inf2019_48","title":"Debiasing Vandalism Detection Models at Wikidata (Extended Abstract)","author":[{"orcid":"0000-0002-4525-6865","id":"11871","last_name":"Heindorf","first_name":"Stefan","full_name":"Heindorf, Stefan"},{"first_name":"Yan","full_name":"Scholten, Yan","last_name":"Scholten"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"},{"first_name":"Martin","full_name":"Potthast, Martin","last_name":"Potthast"}]},{"department":[{"_id":"589"}],"publication_status":"published","user_id":"49154","citation":{"short":"C. Sommer, S. Basagni, Ad Hoc Networks (2019).","mla":"Sommer, Christoph, and Stefano Basagni. “Advances and Novel Applications of Mobile Wireless Networking.” <i>Ad Hoc Networks</i>, 101975, 2019, doi:<a href=\"https://doi.org/10.1016/j.adhoc.2019.101975\">10.1016/j.adhoc.2019.101975</a>.","bibtex":"@article{Sommer_Basagni_2019, title={Advances and novel applications of mobile wireless networking}, DOI={<a href=\"https://doi.org/10.1016/j.adhoc.2019.101975\">10.1016/j.adhoc.2019.101975</a>}, number={101975}, journal={Ad Hoc Networks}, author={Sommer, Christoph and Basagni, Stefano}, year={2019} }","chicago":"Sommer, Christoph, and Stefano Basagni. “Advances and Novel Applications of Mobile Wireless Networking.” <i>Ad Hoc Networks</i>, 2019. <a href=\"https://doi.org/10.1016/j.adhoc.2019.101975\">https://doi.org/10.1016/j.adhoc.2019.101975</a>.","ieee":"C. Sommer and S. Basagni, “Advances and novel applications of mobile wireless networking,” <i>Ad Hoc Networks</i>, 2019.","apa":"Sommer, C., &#38; Basagni, S. (2019). Advances and novel applications of mobile wireless networking. <i>Ad Hoc Networks</i>. <a href=\"https://doi.org/10.1016/j.adhoc.2019.101975\">https://doi.org/10.1016/j.adhoc.2019.101975</a>","ama":"Sommer C, Basagni S. Advances and novel applications of mobile wireless networking. <i>Ad Hoc Networks</i>. 2019. doi:<a href=\"https://doi.org/10.1016/j.adhoc.2019.101975\">10.1016/j.adhoc.2019.101975</a>"},"doi":"10.1016/j.adhoc.2019.101975","author":[{"first_name":"Christoph","full_name":"Sommer, Christoph","last_name":"Sommer","id":"49154","orcid":"0000-0002-4336-7350"},{"full_name":"Basagni, Stefano","first_name":"Stefano","last_name":"Basagni"}],"title":"Advances and novel applications of mobile wireless networking","date_updated":"2022-01-06T06:52:06Z","article_number":"101975","_id":"14817","status":"public","language":[{"iso":"eng"}],"type":"journal_article","year":"2019","publication_identifier":{"issn":["1570-8705"]},"date_created":"2019-11-05T18:38:44Z","publication":"Ad Hoc Networks"},{"author":[{"first_name":"Julian","full_name":"Heinovski, Julian","last_name":"Heinovski"},{"last_name":"Stratmann","first_name":"Lukas","full_name":"Stratmann, Lukas"},{"full_name":"Buse, Dominik S.","first_name":"Dominik S.","last_name":"Buse"},{"full_name":"Klingler, Florian","first_name":"Florian","last_name":"Klingler"},{"last_name":"Franke","full_name":"Franke, Mario","first_name":"Mario"},{"last_name":"Oczko","full_name":"Oczko, Marie-Christin H.","first_name":"Marie-Christin H."},{"orcid":"0000-0002-4336-7350","last_name":"Sommer","id":"49154","first_name":"Christoph","full_name":"Sommer, Christoph"},{"first_name":"Ingrid","full_name":"Scharlau, Ingrid","last_name":"Scharlau"},{"last_name":"Dressler","first_name":"Falko","full_name":"Dressler, Falko"}],"title":"Modeling Cycling Behavior to Improve Bicyclists' Safety at Intersections - A Networking Perspective","doi":"10.1109/wowmom.2019.8793008","publication_status":"published","user_id":"49154","citation":{"apa":"Heinovski, J., Stratmann, L., Buse, D. S., Klingler, F., Franke, M., Oczko, M.-C. H., … Dressler, F. (2019). Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections - A Networking Perspective. In <i>2019 IEEE 20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM)</i>. <a href=\"https://doi.org/10.1109/wowmom.2019.8793008\">https://doi.org/10.1109/wowmom.2019.8793008</a>","ama":"Heinovski J, Stratmann L, Buse DS, et al. Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections - A Networking Perspective. In: <i>2019 IEEE 20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1109/wowmom.2019.8793008\">10.1109/wowmom.2019.8793008</a>","ieee":"J. Heinovski <i>et al.</i>, “Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections - A Networking Perspective,” in <i>2019 IEEE 20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM)</i>, 2019.","chicago":"Heinovski, Julian, Lukas Stratmann, Dominik S. Buse, Florian Klingler, Mario Franke, Marie-Christin H. Oczko, Christoph Sommer, Ingrid Scharlau, and Falko Dressler. “Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections - A Networking Perspective.” In <i>2019 IEEE 20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM)</i>, 2019. <a href=\"https://doi.org/10.1109/wowmom.2019.8793008\">https://doi.org/10.1109/wowmom.2019.8793008</a>.","bibtex":"@inproceedings{Heinovski_Stratmann_Buse_Klingler_Franke_Oczko_Sommer_Scharlau_Dressler_2019, title={Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections - A Networking Perspective}, DOI={<a href=\"https://doi.org/10.1109/wowmom.2019.8793008\">10.1109/wowmom.2019.8793008</a>}, booktitle={2019 IEEE 20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM)}, author={Heinovski, Julian and Stratmann, Lukas and Buse, Dominik S. and Klingler, Florian and Franke, Mario and Oczko, Marie-Christin H. and Sommer, Christoph and Scharlau, Ingrid and Dressler, Falko}, year={2019} }","mla":"Heinovski, Julian, et al. “Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections - A Networking Perspective.” <i>2019 IEEE 20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM)</i>, 2019, doi:<a href=\"https://doi.org/10.1109/wowmom.2019.8793008\">10.1109/wowmom.2019.8793008</a>.","short":"J. Heinovski, L. Stratmann, D.S. Buse, F. Klingler, M. Franke, M.-C.H. Oczko, C. Sommer, I. Scharlau, F. Dressler, in: 2019 IEEE 20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM), 2019."},"department":[{"_id":"589"}],"date_created":"2019-11-05T18:38:48Z","publication":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","status":"public","language":[{"iso":"eng"}],"type":"conference","year":"2019","publication_identifier":{"isbn":["9781728102702"]},"_id":"14819","date_updated":"2022-01-06T06:52:06Z"},{"_id":"14829","date_updated":"2022-01-06T06:52:07Z","date_created":"2019-11-06T10:43:41Z","publisher":"ACM","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-4503-6184-2"]},"year":"2019","type":"conference_editor","status":"public","citation":{"short":"C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, ACM, 2019.","mla":"Scheideler, Christian, and Petra Berenbrink, editors. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>.","bibtex":"@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}, DOI={<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>}, publisher={ACM}, year={2019} }","chicago":"Scheideler, Christian, and Petra Berenbrink, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>.","ieee":"C. Scheideler and P. Berenbrink, Eds., <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019.","apa":"Scheideler, C., &#38; Berenbrink, P. (Eds.). (2019). <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>","ama":"Scheideler C, Berenbrink P, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>"},"user_id":"477","department":[{"_id":"79"}],"title":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019","editor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"doi":"10.1145/3323165"},{"page":"177-199","_id":"14830","volume":63,"issue":"2","date_updated":"2022-01-06T06:52:07Z","date_created":"2019-11-06T10:54:58Z","publication":"Theory Comput. Syst.","language":[{"iso":"eng"}],"type":"journal_article","year":"2019","status":"public","citation":{"chicago":"Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i> 63, no. 2 (2019): 177–99. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>.","ieee":"R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, pp. 177–199, 2019.","apa":"Gmyr, R., Lefevre, J., &#38; Scheideler, C. (2019). Self-Stabilizing Metric Graphs. <i>Theory Comput. Syst.</i>, <i>63</i>(2), 177–199. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>","ama":"Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. <i>Theory Comput Syst</i>. 2019;63(2):177-199. doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>","short":"R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, 2019, pp. 177–99, doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>.","bibtex":"@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs}, volume={63}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>}, number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }"},"user_id":"15504","department":[{"_id":"79"}],"title":"Self-Stabilizing Metric Graphs","author":[{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"full_name":"Lefevre, Jonas","first_name":"Jonas","last_name":"Lefevre"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"doi":"10.1007/s00224-017-9823-4","intvolume":"        63"},{"date_updated":"2022-01-06T06:52:07Z","_id":"14831","status":"public","language":[{"iso":"eng"}],"type":"mastersthesis","year":"2019","publisher":"Paderborn University","date_created":"2019-11-06T12:06:09Z","department":[{"_id":"78"}],"user_id":"3118","citation":{"short":"N.S. Sabu, FPGA Acceleration of String Search Techniques in Huge Data Sets, Paderborn University, 2019.","mla":"Sabu, Nithin S. <i>FPGA Acceleration of String Search Techniques in Huge Data Sets</i>. Paderborn University, 2019.","bibtex":"@book{Sabu_2019, title={FPGA Acceleration of String Search Techniques in Huge Data Sets}, publisher={Paderborn University}, author={Sabu, Nithin S.}, year={2019} }","chicago":"Sabu, Nithin S. <i>FPGA Acceleration of String Search Techniques in Huge Data Sets</i>. Paderborn University, 2019.","ieee":"N. S. Sabu, <i>FPGA Acceleration of String Search Techniques in Huge Data Sets</i>. Paderborn University, 2019.","apa":"Sabu, N. S. (2019). <i>FPGA Acceleration of String Search Techniques in Huge Data Sets</i>. Paderborn University.","ama":"Sabu NS. <i>FPGA Acceleration of String Search Techniques in Huge Data Sets</i>. Paderborn University; 2019."},"supervisor":[{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"},{"last_name":"Böttcher","first_name":"Stefan","full_name":"Böttcher, Stefan"},{"first_name":"Tobias","full_name":"Wiersema, Tobias","last_name":"Wiersema","id":"3118"}],"author":[{"last_name":"Sabu","first_name":"Nithin S.","full_name":"Sabu, Nithin S."}],"title":"FPGA Acceleration of String Search Techniques in Huge Data Sets"},{"date_updated":"2022-01-06T06:52:08Z","_id":"14849","file_date_updated":"2019-11-07T14:13:14Z","status":"public","year":"2019","type":"dissertation","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","ddc":["040"],"date_created":"2019-11-07T14:13:54Z","department":[{"_id":"518"}],"user_id":"477","citation":{"mla":"Vaz, Gavin Francis. <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn, 2019.","bibtex":"@book{Vaz_2019, title={Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems}, publisher={Universität Paderborn}, author={Vaz, Gavin Francis}, year={2019} }","short":"G.F. Vaz, Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems, Universität Paderborn, 2019.","apa":"Vaz, G. F. (2019). <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn.","ama":"Vaz GF. <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn; 2019.","chicago":"Vaz, Gavin Francis. <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn, 2019.","ieee":"G. F. Vaz, <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn, 2019."},"supervisor":[{"orcid":"0000-0001-5728-9982","id":"16153","last_name":"Plessl","full_name":"Plessl, Christian","first_name":"Christian"}],"has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"file":[{"success":1,"relation":"main_file","date_updated":"2019-11-07T14:13:14Z","date_created":"2019-11-07T14:13:14Z","content_type":"application/pdf","access_level":"closed","file_id":"14850","file_name":"PhDThesis_GavinVaz_2019-07-11.pdf","file_size":1462659,"creator":"florida"}],"author":[{"full_name":"Vaz, Gavin Francis","first_name":"Gavin Francis","last_name":"Vaz","id":"30332"}],"title":"Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems"},{"date_updated":"2022-01-06T06:52:08Z","_id":"14851","type":"dissertation","year":"2019","language":[{"iso":"eng"}],"status":"public","ddc":["000"],"date_created":"2019-11-07T14:17:05Z","related_material":{"link":[{"url":"https://doi.org/10.17619/UNIPB/1-828","relation":"confirmation"}]},"department":[{"_id":"63"}],"citation":{"chicago":"Mäcker, Alexander. <i>On Scheduling with Setup Times</i>. Universität Paderborn, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-828\">https://doi.org/10.17619/UNIPB/1-828</a>.","ieee":"A. Mäcker, <i>On Scheduling with Setup Times</i>. Universität Paderborn, 2019.","ama":"Mäcker A. <i>On Scheduling with Setup Times</i>. Universität Paderborn; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-828\">10.17619/UNIPB/1-828</a>","apa":"Mäcker, A. (2019). <i>On Scheduling with Setup Times</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-828\">https://doi.org/10.17619/UNIPB/1-828</a>","short":"A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019.","mla":"Mäcker, Alexander. <i>On Scheduling with Setup Times</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-828\">10.17619/UNIPB/1-828</a>.","bibtex":"@book{Mäcker_2019, place={Universität Paderborn}, title={On Scheduling with Setup Times}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-828\">10.17619/UNIPB/1-828</a>}, author={Mäcker, Alexander}, year={2019} }"},"user_id":"15415","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"place":"Universität Paderborn","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"doi":"10.17619/UNIPB/1-828","title":"On Scheduling with Setup Times","author":[{"full_name":"Mäcker, Alexander","first_name":"Alexander","last_name":"Mäcker","id":"13536"}]},{"author":[{"full_name":"Dann, Andreas","first_name":"Andreas","last_name":"Dann"},{"last_name":"Hermann","id":"66173","first_name":"Ben","full_name":"Hermann, Ben","orcid":"0000-0001-9848-2017"},{"orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","first_name":"Eric","id":"59256","last_name":"Bodden"}],"title":"ModGuard: Identifying Integrity &Confidentiality Violations in Java Modules","doi":"10.1109/tse.2019.2931331","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"user_id":"5786","publication_status":"published","citation":{"short":"A. Dann, B. Hermann, E. Bodden, IEEE Transactions on Software Engineering (2019) 1–1.","bibtex":"@article{Dann_Hermann_Bodden_2019, title={ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules}, DOI={<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>}, journal={IEEE Transactions on Software Engineering}, author={Dann, Andreas and Hermann, Ben and Bodden, Eric}, year={2019}, pages={1–1} }","mla":"Dann, Andreas, et al. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>.","ieee":"A. Dann, B. Hermann, and E. Bodden, “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules,” <i>IEEE Transactions on Software Engineering</i>, pp. 1–1, 2019, doi: <a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>.","chicago":"Dann, Andreas, Ben Hermann, and Eric Bodden. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>.","apa":"Dann, A., Hermann, B., &#38; Bodden, E. (2019). ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>","ama":"Dann A, Hermann B, Bodden E. ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>. Published online 2019:1-1. doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>"},"department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"publication":"IEEE Transactions on Software Engineering","date_created":"2019-11-12T12:20:56Z","status":"public","type":"journal_article","publication_identifier":{"issn":["0098-5589","1939-3520","2326-3881"]},"year":"2019","language":[{"iso":"eng"}],"page":"1-1","_id":"14896","date_updated":"2022-01-06T06:52:10Z"},{"author":[{"last_name":"Dann","first_name":"Andreas","full_name":"Dann, Andreas"},{"orcid":"0000-0001-9848-2017","full_name":"Hermann, Ben","first_name":"Ben","id":"66173","last_name":"Hermann"},{"id":"59256","last_name":"Bodden","full_name":"Bodden, Eric","first_name":"Eric","orcid":"0000-0003-3470-3647"}],"title":"SootDiff: bytecode comparison across different Java compilers","doi":"10.1145/3315568.3329966","publication_status":"published","main_file_link":[{"url":"https://thewhitespace.de/publications/dhb19-sootdiff.pdf"}],"user_id":"5786","citation":{"ieee":"A. Dann, B. Hermann, and E. Bodden, “SootDiff: bytecode comparison across different Java compilers,” 2019, doi: <a href=\"https://doi.org/10.1145/3315568.3329966\">10.1145/3315568.3329966</a>.","chicago":"Dann, Andreas, Ben Hermann, and Eric Bodden. “SootDiff: Bytecode Comparison across Different Java Compilers.” In <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>, 2019. <a href=\"https://doi.org/10.1145/3315568.3329966\">https://doi.org/10.1145/3315568.3329966</a>.","ama":"Dann A, Hermann B, Bodden E. SootDiff: bytecode comparison across different Java compilers. In: <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>. ; 2019. doi:<a href=\"https://doi.org/10.1145/3315568.3329966\">10.1145/3315568.3329966</a>","apa":"Dann, A., Hermann, B., &#38; Bodden, E. (2019). SootDiff: bytecode comparison across different Java compilers. <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>. <a href=\"https://doi.org/10.1145/3315568.3329966\">https://doi.org/10.1145/3315568.3329966</a>","short":"A. Dann, B. Hermann, E. Bodden, in: Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019, 2019.","bibtex":"@inproceedings{Dann_Hermann_Bodden_2019, title={SootDiff: bytecode comparison across different Java compilers}, DOI={<a href=\"https://doi.org/10.1145/3315568.3329966\">10.1145/3315568.3329966</a>}, booktitle={Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019}, author={Dann, Andreas and Hermann, Ben and Bodden, Eric}, year={2019} }","mla":"Dann, Andreas, et al. “SootDiff: Bytecode Comparison across Different Java Compilers.” <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3315568.3329966\">10.1145/3315568.3329966</a>."},"department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"date_created":"2019-11-12T12:21:11Z","publication":"Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019","status":"public","language":[{"iso":"eng"}],"type":"conference","year":"2019","publication_identifier":{"isbn":["9781450367202"]},"_id":"14897","date_updated":"2022-01-06T06:52:10Z"},{"citation":{"short":"S. Kruger, B. Hermann, in: 2019 IEEE/ACM 2nd International Workshop on Gender Equality in Software Engineering (GE), 2019.","mla":"Kruger, Stefan, and Ben Hermann. “Can an Online Service Predict Gender? On the State-of-the-Art in Gender Identification from Texts.” <i>2019 IEEE/ACM 2nd International Workshop on Gender Equality in Software Engineering (GE)</i>, 2019, doi:<a href=\"https://doi.org/10.1109/ge.2019.00012\">10.1109/ge.2019.00012</a>.","bibtex":"@inproceedings{Kruger_Hermann_2019, title={Can an Online Service Predict Gender? On the State-of-the-Art in Gender Identification from Texts}, DOI={<a href=\"https://doi.org/10.1109/ge.2019.00012\">10.1109/ge.2019.00012</a>}, booktitle={2019 IEEE/ACM 2nd International Workshop on Gender Equality in Software Engineering (GE)}, author={Kruger, Stefan and Hermann, Ben}, year={2019} }","chicago":"Kruger, Stefan, and Ben Hermann. “Can an Online Service Predict Gender? On the State-of-the-Art in Gender Identification from Texts.” In <i>2019 IEEE/ACM 2nd International Workshop on Gender Equality in Software Engineering (GE)</i>, 2019. <a href=\"https://doi.org/10.1109/ge.2019.00012\">https://doi.org/10.1109/ge.2019.00012</a>.","ieee":"S. Kruger and B. Hermann, “Can an Online Service Predict Gender? On the State-of-the-Art in Gender Identification from Texts,” 2019, doi: <a href=\"https://doi.org/10.1109/ge.2019.00012\">10.1109/ge.2019.00012</a>.","apa":"Kruger, S., &#38; Hermann, B. (2019). Can an Online Service Predict Gender? On the State-of-the-Art in Gender Identification from Texts. <i>2019 IEEE/ACM 2nd International Workshop on Gender Equality in Software Engineering (GE)</i>. <a href=\"https://doi.org/10.1109/ge.2019.00012\">https://doi.org/10.1109/ge.2019.00012</a>","ama":"Kruger S, Hermann B. Can an Online Service Predict Gender? On the State-of-the-Art in Gender Identification from Texts. In: <i>2019 IEEE/ACM 2nd International Workshop on Gender Equality in Software Engineering (GE)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1109/ge.2019.00012\">10.1109/ge.2019.00012</a>"},"user_id":"5786","publication_status":"published","department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"title":"Can an Online Service Predict Gender? On the State-of-the-Art in Gender Identification from Texts","author":[{"last_name":"Kruger","first_name":"Stefan","full_name":"Kruger, Stefan"},{"full_name":"Hermann, Ben","first_name":"Ben","last_name":"Hermann","id":"66173","orcid":"0000-0001-9848-2017"}],"doi":"10.1109/ge.2019.00012","_id":"14899","date_updated":"2022-01-06T06:52:10Z","publication":"2019 IEEE/ACM 2nd International Workshop on Gender Equality in Software Engineering (GE)","date_created":"2019-11-12T12:22:48Z","year":"2019","type":"conference","publication_identifier":{"isbn":["9781728122458"]},"language":[{"iso":"eng"}],"status":"public"},{"department":[{"_id":"34"},{"_id":"355"}],"user_id":"315","publication_status":"published","citation":{"chicago":"Couso, Ines, Christian Borgelt, Eyke Hüllermeier, and Rudolf Kruse. “Fuzzy Sets in Data Analysis: From Statistical Foundations to Machine Learning.” <i>IEEE Computational Intelligence Magazine</i>, 2019, 31–44. <a href=\"https://doi.org/10.1109/mci.2018.2881642\">https://doi.org/10.1109/mci.2018.2881642</a>.","ieee":"I. Couso, C. Borgelt, E. Hüllermeier, and R. Kruse, “Fuzzy Sets in Data Analysis: From Statistical Foundations to Machine Learning,” <i>IEEE Computational Intelligence Magazine</i>, pp. 31–44, 2019.","ama":"Couso I, Borgelt C, Hüllermeier E, Kruse R. Fuzzy Sets in Data Analysis: From Statistical Foundations to Machine Learning. <i>IEEE Computational Intelligence Magazine</i>. 2019:31-44. doi:<a href=\"https://doi.org/10.1109/mci.2018.2881642\">10.1109/mci.2018.2881642</a>","apa":"Couso, I., Borgelt, C., Hüllermeier, E., &#38; Kruse, R. (2019). Fuzzy Sets in Data Analysis: From Statistical Foundations to Machine Learning. <i>IEEE Computational Intelligence Magazine</i>, 31–44. <a href=\"https://doi.org/10.1109/mci.2018.2881642\">https://doi.org/10.1109/mci.2018.2881642</a>","short":"I. Couso, C. Borgelt, E. Hüllermeier, R. Kruse, IEEE Computational Intelligence Magazine (2019) 31–44.","mla":"Couso, Ines, et al. “Fuzzy Sets in Data Analysis: From Statistical Foundations to Machine Learning.” <i>IEEE Computational Intelligence Magazine</i>, 2019, pp. 31–44, doi:<a href=\"https://doi.org/10.1109/mci.2018.2881642\">10.1109/mci.2018.2881642</a>.","bibtex":"@article{Couso_Borgelt_Hüllermeier_Kruse_2019, title={Fuzzy Sets in Data Analysis: From Statistical Foundations to Machine Learning}, DOI={<a href=\"https://doi.org/10.1109/mci.2018.2881642\">10.1109/mci.2018.2881642</a>}, journal={IEEE Computational Intelligence Magazine}, author={Couso, Ines and Borgelt, Christian and Hüllermeier, Eyke and Kruse, Rudolf}, year={2019}, pages={31–44} }"},"doi":"10.1109/mci.2018.2881642","author":[{"last_name":"Couso","full_name":"Couso, Ines","first_name":"Ines"},{"full_name":"Borgelt, Christian","first_name":"Christian","last_name":"Borgelt"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"},{"last_name":"Kruse","full_name":"Kruse, Rudolf","first_name":"Rudolf"}],"title":"Fuzzy Sets in Data Analysis: From Statistical Foundations to Machine Learning","date_updated":"2022-01-06T06:52:13Z","_id":"15001","page":"31-44","status":"public","year":"2019","publication_identifier":{"issn":["1556-603X","1556-6048"]},"type":"journal_article","language":[{"iso":"eng"}],"publication":"IEEE Computational Intelligence Magazine","date_created":"2019-11-15T10:11:37Z"},{"title":"Multi-target prediction: a unifying view on problems and methods","file":[{"date_updated":"2020-02-28T12:45:26Z","relation":"main_file","access_level":"open_access","file_id":"16155","content_type":"application/pdf","date_created":"2020-02-28T12:43:39Z","creator":"lettmann","file_size":837808,"file_name":"multi-target-prediction.pdf"}],"doi":"10.1007/s10618-018-0595-5","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Many problem settings in machine learning are concerned with the simultaneous prediction of multiple target variables of diverse type. Amongst others, such problem settings arise in multivariate regression, multi-label classification, multi-task learning, dyadic prediction, zero-shot learning, network inference, and matrix completion. These subfields of machine learning are typically studied in isolation, without highlighting or exploring important relationships. In this paper, we present a unifying view on what we call multi-target prediction (MTP) problems and methods. First, we formally discuss commonalities and differences between existing MTP problems. To this end, we introduce a general framework that covers the above subfields as special cases. As a second contribution, we provide a structured overview of MTP methods. This is accomplished by identifying a number of key properties, which distinguish such methods and determine their suitability for different types of problems. Finally, we also discuss a few challenges for future research."}],"oa":"1","user_id":"315","ddc":["000"],"publication":"Data Mining and Knowledge Discovery","type":"journal_article","page":"293-324","volume":33,"issue":"2","author":[{"first_name":"Willem","full_name":"Waegeman, Willem","last_name":"Waegeman"},{"full_name":"Dembczynski, Krzysztof","first_name":"Krzysztof","last_name":"Dembczynski"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"intvolume":"        33","citation":{"chicago":"Waegeman, Willem, Krzysztof Dembczynski, and Eyke Hüllermeier. “Multi-Target Prediction: A Unifying View on Problems and Methods.” <i>Data Mining and Knowledge Discovery</i> 33, no. 2 (2019): 293–324. <a href=\"https://doi.org/10.1007/s10618-018-0595-5\">https://doi.org/10.1007/s10618-018-0595-5</a>.","ieee":"W. Waegeman, K. Dembczynski, and E. Hüllermeier, “Multi-target prediction: a unifying view on problems and methods,” <i>Data Mining and Knowledge Discovery</i>, vol. 33, no. 2, pp. 293–324, 2019.","apa":"Waegeman, W., Dembczynski, K., &#38; Hüllermeier, E. (2019). Multi-target prediction: a unifying view on problems and methods. <i>Data Mining and Knowledge Discovery</i>, <i>33</i>(2), 293–324. <a href=\"https://doi.org/10.1007/s10618-018-0595-5\">https://doi.org/10.1007/s10618-018-0595-5</a>","ama":"Waegeman W, Dembczynski K, Hüllermeier E. Multi-target prediction: a unifying view on problems and methods. <i>Data Mining and Knowledge Discovery</i>. 2019;33(2):293-324. doi:<a href=\"https://doi.org/10.1007/s10618-018-0595-5\">10.1007/s10618-018-0595-5</a>","short":"W. Waegeman, K. Dembczynski, E. Hüllermeier, Data Mining and Knowledge Discovery 33 (2019) 293–324.","mla":"Waegeman, Willem, et al. “Multi-Target Prediction: A Unifying View on Problems and Methods.” <i>Data Mining and Knowledge Discovery</i>, vol. 33, no. 2, 2019, pp. 293–324, doi:<a href=\"https://doi.org/10.1007/s10618-018-0595-5\">10.1007/s10618-018-0595-5</a>.","bibtex":"@article{Waegeman_Dembczynski_Hüllermeier_2019, title={Multi-target prediction: a unifying view on problems and methods}, volume={33}, DOI={<a href=\"https://doi.org/10.1007/s10618-018-0595-5\">10.1007/s10618-018-0595-5</a>}, number={2}, journal={Data Mining and Knowledge Discovery}, author={Waegeman, Willem and Dembczynski, Krzysztof and Hüllermeier, Eyke}, year={2019}, pages={293–324} }"},"department":[{"_id":"34"},{"_id":"355"}],"date_created":"2019-11-15T10:16:34Z","year":"2019","publication_identifier":{"issn":["1573-756X"]},"language":[{"iso":"eng"}],"status":"public","file_date_updated":"2020-02-28T12:45:26Z","_id":"15002","date_updated":"2022-01-06T06:52:14Z"},{"_id":"15003","date_updated":"2022-01-06T06:52:14Z","date_created":"2019-11-15T10:20:55Z","publication":"Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019","language":[{"iso":"eng"}],"type":"conference","year":"2019","status":"public","citation":{"ama":"Mortier T, Wydmuch M, Dembczynski K, Hüllermeier E, Waegeman W. Set-Valued Prediction in Multi-Class Classification. In: <i>Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019</i>. ; 2019.","apa":"Mortier, T., Wydmuch, M., Dembczynski, K., Hüllermeier, E., &#38; Waegeman, W. (2019). Set-Valued Prediction in Multi-Class Classification. In <i>Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019</i>.","ieee":"T. Mortier, M. Wydmuch, K. Dembczynski, E. Hüllermeier, and W. Waegeman, “Set-Valued Prediction in Multi-Class Classification,” in <i>Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019</i>, 2019.","chicago":"Mortier, Thomas, Marek Wydmuch, Krzysztof Dembczynski, Eyke Hüllermeier, and Willem Waegeman. “Set-Valued Prediction in Multi-Class Classification.” In <i>Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019</i>, 2019.","bibtex":"@inproceedings{Mortier_Wydmuch_Dembczynski_Hüllermeier_Waegeman_2019, title={Set-Valued Prediction in Multi-Class Classification}, booktitle={Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019}, author={Mortier, Thomas and Wydmuch, Marek and Dembczynski, Krzysztof and Hüllermeier, Eyke and Waegeman, Willem}, year={2019} }","mla":"Mortier, Thomas, et al. “Set-Valued Prediction in Multi-Class Classification.” <i>Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019</i>, 2019.","short":"T. Mortier, M. Wydmuch, K. Dembczynski, E. Hüllermeier, W. Waegeman, in: Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019, 2019."},"user_id":"315","department":[{"_id":"34"},{"_id":"355"}],"title":"Set-Valued Prediction in Multi-Class Classification","author":[{"first_name":"Thomas","full_name":"Mortier, Thomas","last_name":"Mortier"},{"last_name":"Wydmuch","first_name":"Marek","full_name":"Wydmuch, Marek"},{"full_name":"Dembczynski, Krzysztof","first_name":"Krzysztof","last_name":"Dembczynski"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"last_name":"Waegeman","first_name":"Willem","full_name":"Waegeman, Willem"}]},{"_id":"15004","date_updated":"2022-01-06T06:52:14Z","date_created":"2019-11-15T10:24:45Z","publication":"Discovery Science","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783030337773","9783030337780"],"issn":["0302-9743","1611-3349"]},"type":"book_chapter","year":"2019","status":"public","citation":{"ieee":"M. Ahmadi Fahandar and E. Hüllermeier, “Feature Selection for Analogy-Based Learning to Rank,” in <i>Discovery Science</i>, Cham, 2019.","chicago":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” In <i>Discovery Science</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">https://doi.org/10.1007/978-3-030-33778-0_22</a>.","apa":"Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2019). Feature Selection for Analogy-Based Learning to Rank. In <i>Discovery Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">https://doi.org/10.1007/978-3-030-33778-0_22</a>","ama":"Ahmadi Fahandar M, Hüllermeier E. Feature Selection for Analogy-Based Learning to Rank. In: <i>Discovery Science</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">10.1007/978-3-030-33778-0_22</a>","short":"M. Ahmadi Fahandar, E. Hüllermeier, in: Discovery Science, Cham, 2019.","bibtex":"@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Feature Selection for Analogy-Based Learning to Rank}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">10.1007/978-3-030-33778-0_22</a>}, booktitle={Discovery Science}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }","mla":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” <i>Discovery Science</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">10.1007/978-3-030-33778-0_22</a>."},"publication_status":"published","user_id":"315","department":[{"_id":"34"},{"_id":"355"}],"title":"Feature Selection for Analogy-Based Learning to Rank","author":[{"last_name":"Ahmadi Fahandar","id":"59547","full_name":"Ahmadi Fahandar, Mohsen","first_name":"Mohsen"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"place":"Cham","doi":"10.1007/978-3-030-33778-0_22"},{"date_updated":"2022-01-06T06:52:14Z","_id":"15005","status":"public","language":[{"iso":"eng"}],"type":"book_chapter","publication_identifier":{"isbn":["9783030301781","9783030301798"],"issn":["0302-9743","1611-3349"]},"year":"2019","date_created":"2019-11-15T10:30:10Z","publication":"KI 2019: Advances in Artificial Intelligence","department":[{"_id":"34"},{"_id":"355"}],"publication_status":"published","user_id":"315","citation":{"chicago":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” In <i>KI 2019: Advances in Artificial Intelligence</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">https://doi.org/10.1007/978-3-030-30179-8_3</a>.","ieee":"M. Ahmadi Fahandar and E. Hüllermeier, “Analogy-Based Preference Learning with Kernels,” in <i>KI 2019: Advances in Artificial Intelligence</i>, Cham, 2019.","ama":"Ahmadi Fahandar M, Hüllermeier E. Analogy-Based Preference Learning with Kernels. In: <i>KI 2019: Advances in Artificial Intelligence</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">10.1007/978-3-030-30179-8_3</a>","apa":"Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2019). Analogy-Based Preference Learning with Kernels. In <i>KI 2019: Advances in Artificial Intelligence</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">https://doi.org/10.1007/978-3-030-30179-8_3</a>","short":"M. Ahmadi Fahandar, E. Hüllermeier, in: KI 2019: Advances in Artificial Intelligence, Cham, 2019.","mla":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” <i>KI 2019: Advances in Artificial Intelligence</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">10.1007/978-3-030-30179-8_3</a>.","bibtex":"@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Analogy-Based Preference Learning with Kernels}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">10.1007/978-3-030-30179-8_3</a>}, booktitle={KI 2019: Advances in Artificial Intelligence}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }"},"doi":"10.1007/978-3-030-30179-8_3","place":"Cham","author":[{"full_name":"Ahmadi Fahandar, Mohsen","first_name":"Mohsen","id":"59547","last_name":"Ahmadi Fahandar"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"title":"Analogy-Based Preference Learning with Kernels"},{"_id":"15006","date_updated":"2022-01-06T06:52:14Z","publication":"Discovery Science","date_created":"2019-11-15T10:35:08Z","year":"2019","type":"book_chapter","publication_identifier":{"isbn":["9783030337773","9783030337780"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"status":"public","citation":{"short":"V.-L. Nguyen, S. Destercke, E. Hüllermeier, in: Discovery Science, Cham, 2019.","bibtex":"@inbook{Nguyen_Destercke_Hüllermeier_2019, place={Cham}, title={Epistemic Uncertainty Sampling}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">10.1007/978-3-030-33778-0_7</a>}, booktitle={Discovery Science}, author={Nguyen, Vu-Linh and Destercke, Sébastien and Hüllermeier, Eyke}, year={2019} }","mla":"Nguyen, Vu-Linh, et al. “Epistemic Uncertainty Sampling.” <i>Discovery Science</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">10.1007/978-3-030-33778-0_7</a>.","ieee":"V.-L. Nguyen, S. Destercke, and E. Hüllermeier, “Epistemic Uncertainty Sampling,” in <i>Discovery Science</i>, Cham, 2019.","chicago":"Nguyen, Vu-Linh, Sébastien Destercke, and Eyke Hüllermeier. “Epistemic Uncertainty Sampling.” In <i>Discovery Science</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">https://doi.org/10.1007/978-3-030-33778-0_7</a>.","ama":"Nguyen V-L, Destercke S, Hüllermeier E. Epistemic Uncertainty Sampling. In: <i>Discovery Science</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">10.1007/978-3-030-33778-0_7</a>","apa":"Nguyen, V.-L., Destercke, S., &#38; Hüllermeier, E. (2019). Epistemic Uncertainty Sampling. In <i>Discovery Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">https://doi.org/10.1007/978-3-030-33778-0_7</a>"},"user_id":"49109","publication_status":"published","department":[{"_id":"34"},{"_id":"355"}],"title":"Epistemic Uncertainty Sampling","author":[{"first_name":"Vu-Linh","full_name":"Nguyen, Vu-Linh","last_name":"Nguyen"},{"first_name":"Sébastien","full_name":"Destercke, Sébastien","last_name":"Destercke"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"place":"Cham","doi":"10.1007/978-3-030-33778-0_7"},{"department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"publication_status":"published","citation":{"ama":"Melnikov V, Hüllermeier E. Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA. In: <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>","apa":"Melnikov, V., &#38; Hüllermeier, E. (2019). Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA. In <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>. <a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">https://doi.org/10.1016/j.jmva.2019.02.017</a>","ieee":"V. Melnikov and E. Hüllermeier, “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA,” in <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019.","chicago":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA.” In <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019. <a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">https://doi.org/10.1016/j.jmva.2019.02.017</a>.","bibtex":"@inproceedings{Melnikov_Hüllermeier_2019, title={Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA}, DOI={<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>}, booktitle={Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)}, author={Melnikov, Vitaly and Hüllermeier, Eyke}, year={2019} }","mla":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA.” <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019, doi:<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>.","short":"V. Melnikov, E. Hüllermeier, in: Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101), 2019."},"author":[{"id":"58747","last_name":"Melnikov","first_name":"Vitaly","full_name":"Melnikov, Vitaly"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"date_updated":"2022-01-06T06:52:14Z","_id":"15007","file_date_updated":"2020-02-28T12:47:07Z","status":"public","language":[{"iso":"eng"}],"year":"2019","date_created":"2019-11-15T10:43:26Z","user_id":"477","oa":"1","doi":"10.1016/j.jmva.2019.02.017","has_accepted_license":"1","project":[{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"file":[{"file_size":2331320,"file_name":"learning-to-aggregate-owa.pdf","creator":"lettmann","date_created":"2020-02-28T12:47:07Z","file_id":"16156","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-02-28T12:47:07Z","relation":"main_file"}],"title":"Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA","type":"conference","publication":"Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)","ddc":["000"]}]