[{"date_updated":"2022-01-06T06:52:09Z","intvolume":"        30","status":"public","year":"2018","title":"We Like, We Post: A Joint User-Post Approach for Facebook Post Stance Labeling","author":[{"full_name":"Chen, Wei-Fan","last_name":"Chen","first_name":"Wei-Fan","id":"82920"},{"full_name":"Ku, Lun-Wei","last_name":"Ku","first_name":"Lun-Wei"}],"user_id":"82920","volume":30,"page":"2013-2023","main_file_link":[{"url":"https://ieeexplore.ieee.org/iel7/69/4358933/08305481.pdf"}],"_id":"14886","publisher":"IEEE","language":[{"iso":"eng"}],"extern":"1","publication":"IEEE Transactions on Knowledge and Data Engineering","issue":"10","citation":{"mla":"Chen, Wei-Fan, and Lun-Wei Ku. “We Like, We Post: A Joint User-Post Approach for Facebook Post Stance Labeling.” <i>IEEE Transactions on Knowledge and Data Engineering</i>, vol. 30, no. 10, IEEE, 2018, pp. 2013–23.","bibtex":"@article{Chen_Ku_2018, title={We Like, We Post: A Joint User-Post Approach for Facebook Post Stance Labeling}, volume={30}, number={10}, journal={IEEE Transactions on Knowledge and Data Engineering}, publisher={IEEE}, author={Chen, Wei-Fan and Ku, Lun-Wei}, year={2018}, pages={2013–2023} }","ama":"Chen W-F, Ku L-W. We Like, We Post: A Joint User-Post Approach for Facebook Post Stance Labeling. <i>IEEE Transactions on Knowledge and Data Engineering</i>. 2018;30(10):2013-2023.","ieee":"W.-F. Chen and L.-W. Ku, “We Like, We Post: A Joint User-Post Approach for Facebook Post Stance Labeling,” <i>IEEE Transactions on Knowledge and Data Engineering</i>, vol. 30, no. 10, pp. 2013–2023, 2018.","apa":"Chen, W.-F., &#38; Ku, L.-W. (2018). We Like, We Post: A Joint User-Post Approach for Facebook Post Stance Labeling. <i>IEEE Transactions on Knowledge and Data Engineering</i>, <i>30</i>(10), 2013–2023.","chicago":"Chen, Wei-Fan, and Lun-Wei Ku. “We Like, We Post: A Joint User-Post Approach for Facebook Post Stance Labeling.” <i>IEEE Transactions on Knowledge and Data Engineering</i> 30, no. 10 (2018): 2013–23.","short":"W.-F. Chen, L.-W. Ku, IEEE Transactions on Knowledge and Data Engineering 30 (2018) 2013–2023."},"type":"journal_article","department":[{"_id":"600"}],"date_created":"2019-11-11T12:36:42Z"},{"date_created":"2019-11-11T12:37:30Z","department":[{"_id":"600"}],"type":"journal_article","citation":{"chicago":"Chen, Mei-Hua, Wei-Fan Chen, and Lun-Wei Ku. “Application of Sentiment Analysis to Language Learning.” <i>IEEE Access</i> 6 (2018): 24433–42.","short":"M.-H. Chen, W.-F. Chen, L.-W. Ku, IEEE Access 6 (2018) 24433–24442.","apa":"Chen, M.-H., Chen, W.-F., &#38; Ku, L.-W. (2018). Application of Sentiment Analysis to Language Learning. <i>IEEE Access</i>, <i>6</i>, 24433–24442.","ieee":"M.-H. Chen, W.-F. Chen, and L.-W. Ku, “Application of Sentiment Analysis to Language Learning,” <i>IEEE Access</i>, vol. 6, pp. 24433–24442, 2018.","ama":"Chen M-H, Chen W-F, Ku L-W. Application of Sentiment Analysis to Language Learning. <i>IEEE Access</i>. 2018;6:24433-24442.","bibtex":"@article{Chen_Chen_Ku_2018, title={Application of Sentiment Analysis to Language Learning}, volume={6}, journal={IEEE Access}, publisher={IEEE}, author={Chen, Mei-Hua and Chen, Wei-Fan and Ku, Lun-Wei}, year={2018}, pages={24433–24442} }","mla":"Chen, Mei-Hua, et al. “Application of Sentiment Analysis to Language Learning.” <i>IEEE Access</i>, vol. 6, IEEE, 2018, pp. 24433–42."},"publication":"IEEE Access","extern":"1","_id":"14887","language":[{"iso":"eng"}],"publisher":"IEEE","page":"24433-24442","main_file_link":[{"url":"https://ieeexplore.ieee.org/iel7/6287639/8274985/08353227.pdf"}],"volume":6,"user_id":"82920","author":[{"first_name":"Mei-Hua","last_name":"Chen","full_name":"Chen, Mei-Hua"},{"id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","last_name":"Chen"},{"first_name":"Lun-Wei","last_name":"Ku","full_name":"Ku, Lun-Wei"}],"title":"Application of Sentiment Analysis to Language Learning","status":"public","year":"2018","intvolume":"         6","date_updated":"2022-01-06T06:52:09Z"},{"type":"journal_article","department":[{"_id":"600"}],"date_created":"2019-11-11T12:46:18Z","publication":"圖書館學與資訊科學","citation":{"ieee":"Chen W.-F. and Ku L.-W., “中文情感語意分析套件 CSentiPackage 發展與應用,” 圖書館學與資訊科學, 2018.","apa":"Chen W.-F., &#38; Ku L.-W. (2018). 中文情感語意分析套件 CSentiPackage 發展與應用. 圖書館學與資訊科學.","chicago":"Chen Wei-Fan, and Ku Lun-Wei. “中文情感語意分析套件 CSentiPackage 發展與應用.” 圖書館學與資訊科學, 2018.","short":"Chen W.-F., Ku L.-W., 圖書館學與資訊科學 (2018).","mla":"Chen Wei-Fan, and Ku Lun-Wei. “中文情感語意分析套件 CSentiPackage 發展與應用.” 圖書館學與資訊科學, 國立台灣師範大學圖書資訊學研究所, 2018.","bibtex":"@article{Chen_Ku_2018, title={中文情感語意分析套件 CSentiPackage 發展與應用}, journal={圖書館學與資訊科學}, publisher={國立台灣師範大學圖書資訊學研究所}, author={Chen Wei-Fan and Ku Lun-Wei}, year={2018} }","ama":"Chen W-F, Ku L-W. 中文情感語意分析套件 CSentiPackage 發展與應用. 圖書館學與資訊科學. 2018."},"user_id":"82920","main_file_link":[{"url":"http://rportal.lib.ntnu.edu.tw/bitstream/20.500.12235/80604/1/ntnulib_ja_A1021_4401_024.pdf"}],"language":[{"iso":"chi"}],"_id":"14888","publisher":"國立台灣師範大學圖書資訊學研究所","date_updated":"2022-01-06T06:52:09Z","year":"2018","title":"中文情感語意分析套件 CSentiPackage 發展與應用","status":"public","author":[{"first_name":"Wei-Fan","last_name":"Chen","full_name":"Chen, Wei-Fan","id":"82920"},{"first_name":"Lun-Wei","last_name":"Ku","full_name":"Ku, Lun-Wei"}]},{"publication":"2018 IEEE International Conference on Big Data (Big Data)","citation":{"short":"S. Böttcher, R. Hartel, in: 2018 IEEE International Conference on Big Data (Big Data), 2018, pp. 3996–4005.","chicago":"Böttcher, Stefan, and Rita Hartel. “RECUT: RE-Compressing Partially Unordered Trees.” In <i>2018 IEEE International Conference on Big Data (Big Data)</i>, 3996–4005, 2018. <a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">https://doi.org/10.1109/bigdata.2018.8622261</a>.","ieee":"S. Böttcher and R. Hartel, “RECUT: RE-Compressing partially Unordered Trees,” in <i>2018 IEEE International Conference on Big Data (Big Data)</i>, 2018, pp. 3996–4005.","apa":"Böttcher, S., &#38; Hartel, R. (2018). RECUT: RE-Compressing partially Unordered Trees. In <i>2018 IEEE International Conference on Big Data (Big Data)</i> (pp. 3996–4005). <a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">https://doi.org/10.1109/bigdata.2018.8622261</a>","bibtex":"@inproceedings{Böttcher_Hartel_2018, title={RECUT: RE-Compressing partially Unordered Trees}, DOI={<a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">10.1109/bigdata.2018.8622261</a>}, booktitle={2018 IEEE International Conference on Big Data (Big Data)}, author={Böttcher, Stefan and Hartel, Rita}, year={2018}, pages={3996–4005} }","ama":"Böttcher S, Hartel R. RECUT: RE-Compressing partially Unordered Trees. In: <i>2018 IEEE International Conference on Big Data (Big Data)</i>. ; 2018:3996-4005. doi:<a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">10.1109/bigdata.2018.8622261</a>","mla":"Böttcher, Stefan, and Rita Hartel. “RECUT: RE-Compressing Partially Unordered Trees.” <i>2018 IEEE International Conference on Big Data (Big Data)</i>, 2018, pp. 3996–4005, doi:<a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">10.1109/bigdata.2018.8622261</a>."},"date_created":"2019-11-21T14:43:27Z","type":"conference","department":[{"_id":"69"}],"title":"RECUT: RE-Compressing partially Unordered Trees","year":"2018","status":"public","author":[{"id":"624","full_name":"Böttcher, Stefan","last_name":"Böttcher","first_name":"Stefan"},{"id":"14961","full_name":"Hartel, Rita","first_name":"Rita","last_name":"Hartel"}],"publication_identifier":{"isbn":["9781538650356"]},"publication_status":"published","date_updated":"2022-01-06T06:52:15Z","page":"3996-4005","language":[{"iso":"eng"}],"_id":"15081","user_id":"14961","doi":"10.1109/bigdata.2018.8622261"},{"date_created":"2019-11-21T14:44:49Z","type":"conference","department":[{"_id":"69"}],"publication":"Digital Humanities 2018: Book of Abstracts/Libro de resúmenes","citation":{"mla":"Dunst, Alexander, and Rita Hartel. “Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative.” <i>Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes</i>, Red de Humanidades Digitales AC, 2018, pp. 184–87.","ama":"Dunst A, Hartel R. Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative. In: <i>Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes</i>. Red de Humanidades Digitales AC; 2018:184-187.","bibtex":"@inproceedings{Dunst_Hartel_2018, title={Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative}, booktitle={Digital Humanities 2018: Book of Abstracts/Libro de resúmenes}, publisher={Red de Humanidades Digitales AC}, author={Dunst, Alexander and Hartel, Rita}, year={2018}, pages={184–187} }","apa":"Dunst, A., &#38; Hartel, R. (2018). Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative. In <i>Digital Humanities 2018: Book of Abstracts/Libro de resúmenes</i> (pp. 184–187). Red de Humanidades Digitales AC.","ieee":"A. Dunst and R. Hartel, “Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative,” in <i>Digital Humanities 2018: Book of Abstracts/Libro de resúmenes</i>, 2018, pp. 184–187.","short":"A. Dunst, R. Hartel, in: Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes, Red de Humanidades Digitales AC, 2018, pp. 184–187.","chicago":"Dunst, Alexander, and Rita Hartel. “Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative.” In <i>Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes</i>, 184–87. Red de Humanidades Digitales AC, 2018."},"page":"184-187","publisher":"Red de Humanidades Digitales AC","_id":"15082","language":[{"iso":"eng"}],"user_id":"14961","title":"Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative","status":"public","year":"2018","author":[{"full_name":"Dunst, Alexander","last_name":"Dunst","first_name":"Alexander"},{"full_name":"Hartel, Rita","first_name":"Rita","last_name":"Hartel","id":"14961"}],"date_updated":"2022-01-06T06:52:15Z"},{"publication":"Empirical Comics Research: Digital, Multimodal, and Cognitive Methods","citation":{"mla":"Dunst, Alexander, and Rita Hartel. “The Quantitative Analysis of Comics: Towards a Visual Stylometry of Graphic Narrative.” <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>, edited by Alexander Dunst et al., Routledge, 2018, pp. 43–61.","bibtex":"@inbook{Dunst_Hartel_2018, title={The quantitative analysis of comics: Towards a visual stylometry of graphic narrative}, booktitle={Empirical Comics Research: Digital, Multimodal, and Cognitive Methods}, publisher={Routledge}, author={Dunst, Alexander and Hartel, Rita}, editor={Dunst, Alexander and Laubrock, Jochen and Wildfeuer, JaninaEditors}, year={2018}, pages={43–61} }","ama":"Dunst A, Hartel R. The quantitative analysis of comics: Towards a visual stylometry of graphic narrative. In: Dunst A, Laubrock J, Wildfeuer J, eds. <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>. Routledge; 2018:43-61.","ieee":"A. Dunst and R. Hartel, “The quantitative analysis of comics: Towards a visual stylometry of graphic narrative,” in <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>, A. Dunst, J. Laubrock, and J. Wildfeuer, Eds. Routledge, 2018, pp. 43–61.","apa":"Dunst, A., &#38; Hartel, R. (2018). The quantitative analysis of comics: Towards a visual stylometry of graphic narrative. In A. Dunst, J. Laubrock, &#38; J. Wildfeuer (Eds.), <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i> (pp. 43–61). Routledge.","chicago":"Dunst, Alexander, and Rita Hartel. “The Quantitative Analysis of Comics: Towards a Visual Stylometry of Graphic Narrative.” In <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>, edited by Alexander Dunst, Jochen Laubrock, and Janina Wildfeuer, 43–61. Routledge, 2018.","short":"A. Dunst, R. Hartel, in: A. Dunst, J. Laubrock, J. Wildfeuer (Eds.), Empirical Comics Research: Digital, Multimodal, and Cognitive Methods, Routledge, 2018, pp. 43–61."},"date_created":"2019-11-22T10:12:54Z","type":"book_chapter","department":[{"_id":"69"}],"status":"public","year":"2018","title":"The quantitative analysis of comics: Towards a visual stylometry of graphic narrative","author":[{"last_name":"Dunst","first_name":"Alexander","full_name":"Dunst, Alexander"},{"full_name":"Hartel, Rita","last_name":"Hartel","first_name":"Rita","id":"14961"}],"date_updated":"2022-01-06T06:52:16Z","page":"43-61","_id":"15160","publisher":"Routledge","language":[{"iso":"eng"}],"user_id":"14961","editor":[{"full_name":"Dunst, Alexander","last_name":"Dunst","first_name":"Alexander"},{"full_name":"Laubrock, Jochen","last_name":"Laubrock","first_name":"Jochen"},{"last_name":"Wildfeuer","first_name":"Janina","full_name":"Wildfeuer, Janina"}]},{"citation":{"ama":"Dunst A, Hartel R. Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen. In: <i>DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018</i>. ; 2018.","bibtex":"@inproceedings{Dunst_Hartel_2018, title={Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen}, booktitle={DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018}, author={Dunst, Alexander and Hartel, Rita}, year={2018} }","mla":"Dunst, Alexander, and Rita Hartel. “Auf Dem Weg Zur Visuellen Stilometrie:Automatische Genre- Und Autorunterscheidung in Graphischen Narrativen.” <i>DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018</i>, 2018.","chicago":"Dunst, Alexander, and Rita Hartel. “Auf Dem Weg Zur Visuellen Stilometrie:Automatische Genre- Und Autorunterscheidung in Graphischen Narrativen.” In <i>DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018</i>, 2018.","short":"A. Dunst, R. Hartel, in: DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018, 2018.","apa":"Dunst, A., &#38; Hartel, R. (2018). Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen. In <i>DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018</i>.","ieee":"A. Dunst and R. Hartel, “Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen,” in <i>DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018</i>, 2018."},"publication":"DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018","date_created":"2019-11-26T09:25:44Z","department":[{"_id":"69"}],"type":"conference_abstract","author":[{"full_name":"Dunst, Alexander","last_name":"Dunst","first_name":"Alexander"},{"id":"14961","first_name":"Rita","last_name":"Hartel","full_name":"Hartel, Rita"}],"year":"2018","title":"Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen","status":"public","date_updated":"2022-01-06T06:52:16Z","language":[{"iso":"eng"}],"_id":"15183","user_id":"14961"},{"author":[{"full_name":"Schäfer, D.","first_name":"D.","last_name":"Schäfer"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"year":"2018","title":"Dyad ranking using Plackett-Luce models based on joint feature representations","status":"public","intvolume":"       107","date_updated":"2022-01-06T06:52:42Z","_id":"16038","language":[{"iso":"eng"}],"page":"903-941","volume":107,"user_id":"49109","citation":{"ieee":"D. Schäfer and E. Hüllermeier, “Dyad ranking using Plackett-Luce models based on joint feature representations,” <i>Machine Learning</i>, vol. 107, no. 5, pp. 903–941, 2018.","apa":"Schäfer, D., &#38; Hüllermeier, E. (2018). Dyad ranking using Plackett-Luce models based on joint feature representations. <i>Machine Learning</i>, <i>107</i>(5), 903–941.","chicago":"Schäfer, D., and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” <i>Machine Learning</i> 107, no. 5 (2018): 903–41.","short":"D. Schäfer, E. Hüllermeier, Machine Learning 107 (2018) 903–941.","mla":"Schäfer, D., and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” <i>Machine Learning</i>, vol. 107, no. 5, 2018, pp. 903–41.","bibtex":"@article{Schäfer_Hüllermeier_2018, title={Dyad ranking using Plackett-Luce models based on joint feature representations}, volume={107}, number={5}, journal={Machine Learning}, author={Schäfer, D. and Hüllermeier, Eyke}, year={2018}, pages={903–941} }","ama":"Schäfer D, Hüllermeier E. Dyad ranking using Plackett-Luce models based on joint feature representations. <i>Machine Learning</i>. 2018;107(5):903-941."},"issue":"5","publication":"Machine Learning","date_created":"2020-02-24T15:59:19Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"type":"journal_article"},{"date_created":"2020-03-13T12:43:14Z","type":"preprint","department":[{"_id":"101"}],"oa":"1","publication":"arXiv:1801.06419","citation":{"mla":"Peitz, Sebastian. “Controlling Nonlinear PDEs Using Low-Dimensional Bilinear Approximations  Obtained from Data.” <i>ArXiv:1801.06419</i>, 2018.","bibtex":"@article{Peitz_2018, title={Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data}, journal={arXiv:1801.06419}, author={Peitz, Sebastian}, year={2018} }","ama":"Peitz S. Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data. <i>arXiv:180106419</i>. 2018.","ieee":"S. Peitz, “Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data,” <i>arXiv:1801.06419</i>. 2018.","apa":"Peitz, S. (2018). Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data. <i>ArXiv:1801.06419</i>.","chicago":"Peitz, Sebastian. “Controlling Nonlinear PDEs Using Low-Dimensional Bilinear Approximations  Obtained from Data.” <i>ArXiv:1801.06419</i>, 2018.","short":"S. Peitz, ArXiv:1801.06419 (2018)."},"abstract":[{"text":"In a recent article, we presented a framework to control nonlinear partial\r\ndifferential equations (PDEs) by means of Koopman operator based reduced models\r\nand concepts from switched systems. The main idea was to transform a control\r\nsystem into a set of autonomous systems for which the optimal switching\r\nsequence has to be computed. These individual systems can be approximated very\r\nefficiently by reduced order models obtained from data, and one can guarantee\r\nequality of the full and the reduced objective function under certain\r\nassumptions. In this article, we extend these results to continuous control\r\ninputs using convex combinations of multiple Koopman operators corresponding to\r\nconstant controls, which results in a bilinear control system. Although\r\nequality of the objectives can be carried over when the PDE depends linearly on\r\nthe control, we show that this approach is also valid in other scenarios using\r\nseveral flow control examples of varying complexity.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1801.06419.pdf"}],"_id":"16292","language":[{"iso":"eng"}],"user_id":"47427","status":"public","title":"Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data","year":"2018","author":[{"last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X","first_name":"Sebastian","full_name":"Peitz, Sebastian","id":"47427"}],"date_updated":"2022-01-06T06:52:48Z"},{"user_id":"47427","language":[{"iso":"eng"}],"_id":"16293","main_file_link":[{"url":"https://arxiv.org/pdf/1805.10118.pdf","open_access":"1"}],"date_updated":"2022-01-06T06:52:48Z","author":[{"first_name":"Stefan","last_name":"Klus","full_name":"Klus, Stefan"},{"id":"47427","last_name":"Peitz","first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","full_name":"Peitz, Sebastian"},{"full_name":"Schuster, Ingmar","first_name":"Ingmar","last_name":"Schuster"}],"year":"2018","status":"public","title":"Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions","department":[{"_id":"101"}],"oa":"1","type":"preprint","date_created":"2020-03-13T12:44:12Z","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"abstract":[{"lang":"eng","text":"Kernel transfer operators, which can be regarded as approximations of\r\ntransfer operators such as the Perron-Frobenius or Koopman operator in\r\nreproducing kernel Hilbert spaces, are defined in terms of covariance and\r\ncross-covariance operators and have been shown to be closely related to the\r\nconditional mean embedding framework developed by the machine learning\r\ncommunity. The goal of this paper is to show how the dominant eigenfunctions of\r\nthese operators in combination with gradient-based optimization techniques can\r\nbe used to detect long-lived coherent patterns in high-dimensional time-series\r\ndata. The results will be illustrated using video data and a fluid flow\r\nexample."}],"citation":{"ama":"Klus S, Peitz S, Schuster I. Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>arXiv:180510118</i>. 2018.","bibtex":"@article{Klus_Peitz_Schuster_2018, title={Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions}, journal={arXiv:1805.10118}, author={Klus, Stefan and Peitz, Sebastian and Schuster, Ingmar}, year={2018} }","mla":"Klus, Stefan, et al. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018.","short":"S. Klus, S. Peitz, I. Schuster, ArXiv:1805.10118 (2018).","chicago":"Klus, Stefan, Sebastian Peitz, and Ingmar Schuster. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018.","apa":"Klus, S., Peitz, S., &#38; Schuster, I. (2018). Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>ArXiv:1805.10118</i>.","ieee":"S. Klus, S. Peitz, and I. Schuster, “Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions,” <i>arXiv:1805.10118</i>. 2018."},"publication":"arXiv:1805.10118"},{"publication":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","citation":{"apa":"Feldkord, B., Malatyali, M., &#38; Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>","ieee":"B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, Cham, 2018.","short":"B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.","chicago":"Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>.","mla":"Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>.","ama":"Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In: <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>","bibtex":"@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>}, booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2018} }"},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-03T07:04:59Z","place":"Cham","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","status":"public","year":"2018","title":"A Dynamic Distributed Data Structure for Top-k and k-Select Queries","author":[{"full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn","id":"22704"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319125671","9783319125688"]},"user_id":"15415","doi":"10.1007/978-3-319-98355-4_18","_id":"16392","language":[{"iso":"eng"}]},{"file":[{"creator":"fossie","date_created":"2018-08-16T07:49:44Z","file_name":"2018-03 Hoffmann ACS Photonics - Tailored UV Emission by nonlinear IR excitation from ZnO photonic crystal nanocavities.pdf","file_size":2935858,"access_level":"open_access","relation":"main_file","date_updated":"2018-08-21T10:38:31Z","file_id":"3915","content_type":"application/pdf"}],"date_created":"2018-03-20T07:39:36Z","type":"journal_article","keyword":["tet_topic_phc"],"department":[{"_id":"15"},{"_id":"230"},{"_id":"61"},{"_id":"287"},{"_id":"35"},{"_id":"289"}],"publication":"ACS Photonics","language":[{"iso":"eng"}],"doi":"10.1021/acsphotonics.7b01228","title":"Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities","year":"2018","publication_identifier":{"issn":["2330-4022","2330-4022"]},"author":[{"first_name":"Sandro P.","last_name":"Hoffmann","full_name":"Hoffmann, Sandro P."},{"first_name":"Maximilian","last_name":"Albert","full_name":"Albert, Maximilian"},{"last_name":"Weber","first_name":"Nils","full_name":"Weber, Nils"},{"first_name":"Denis","last_name":"Sievers","full_name":"Sievers, Denis"},{"id":"158","last_name":"Förstner","orcid":"0000-0001-7059-9862","first_name":"Jens","full_name":"Förstner, Jens"},{"full_name":"Zentgraf, Thomas","first_name":"Thomas","orcid":"0000-0002-8662-1101","last_name":"Zentgraf","id":"30525"},{"full_name":"Meier, Cedrik","last_name":"Meier","orcid":"https://orcid.org/0000-0002-3787-3572","first_name":"Cedrik","id":"20798"}],"publication_status":"published","date_updated":"2022-01-06T06:51:58Z","intvolume":"         5","oa":"1","file_date_updated":"2018-08-21T10:38:31Z","citation":{"ieee":"S. P. Hoffmann <i>et al.</i>, “Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities,” <i>ACS Photonics</i>, vol. 5, pp. 1933–1942, 2018.","apa":"Hoffmann, S. P., Albert, M., Weber, N., Sievers, D., Förstner, J., Zentgraf, T., &#38; Meier, C. (2018). Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities. <i>ACS Photonics</i>, <i>5</i>, 1933–1942. <a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">https://doi.org/10.1021/acsphotonics.7b01228</a>","mla":"Hoffmann, Sandro P., et al. “Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities.” <i>ACS Photonics</i>, vol. 5, American Chemical Society (ACS), 2018, pp. 1933–42, doi:<a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">10.1021/acsphotonics.7b01228</a>.","bibtex":"@article{Hoffmann_Albert_Weber_Sievers_Förstner_Zentgraf_Meier_2018, title={Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities}, volume={5}, DOI={<a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">10.1021/acsphotonics.7b01228</a>}, journal={ACS Photonics}, publisher={American Chemical Society (ACS)}, author={Hoffmann, Sandro P. and Albert, Maximilian and Weber, Nils and Sievers, Denis and Förstner, Jens and Zentgraf, Thomas and Meier, Cedrik}, year={2018}, pages={1933–1942} }","chicago":"Hoffmann, Sandro P., Maximilian Albert, Nils Weber, Denis Sievers, Jens Förstner, Thomas Zentgraf, and Cedrik Meier. “Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities.” <i>ACS Photonics</i> 5 (2018): 1933–42. <a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">https://doi.org/10.1021/acsphotonics.7b01228</a>.","short":"S.P. Hoffmann, M. Albert, N. Weber, D. Sievers, J. Förstner, T. Zentgraf, C. Meier, ACS Photonics 5 (2018) 1933–1942.","ama":"Hoffmann SP, Albert M, Weber N, et al. Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities. <i>ACS Photonics</i>. 2018;5:1933-1942. doi:<a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">10.1021/acsphotonics.7b01228</a>"},"project":[{"name":"TRR 142","_id":"53"},{"_id":"54","name":"TRR 142 - Project Area A"},{"_id":"55","name":"TRR 142 - Project Area B"},{"_id":"62","name":"TRR 142 - Subproject A5"},{"_id":"66","name":"TRR 142 - Subproject B1"}],"page":"1933-1942","publisher":"American Chemical Society (ACS)","_id":"1430","urn":"14308","user_id":"30525","ddc":["530"],"volume":5,"status":"public","has_accepted_license":"1"},{"date_updated":"2022-01-06T06:51:27Z","intvolume":"        80","year":"2018","title":"Design For Small Delay Test - A Simulation Study","status":"public","author":[{"id":"10935","first_name":"Matthias","last_name":"Kampmann","full_name":"Kampmann, Matthias"},{"id":"209","orcid":"0000-0002-3717-3939","first_name":"Sybille","last_name":"Hellebrand","full_name":"Hellebrand, Sybille"}],"user_id":"659","volume":80,"page":"124-133","_id":"13057","language":[{"iso":"eng"}],"publication":"Microelectronics Reliability","citation":{"chicago":"Kampmann, Matthias, and Sybille Hellebrand. “Design For Small Delay Test - A Simulation Study.” <i>Microelectronics Reliability</i> 80 (2018): 124–33.","short":"M. Kampmann, S. Hellebrand, Microelectronics Reliability 80 (2018) 124–133.","ieee":"M. Kampmann and S. Hellebrand, “Design For Small Delay Test - A Simulation Study,” <i>Microelectronics Reliability</i>, vol. 80, pp. 124–133, 2018.","apa":"Kampmann, M., &#38; Hellebrand, S. (2018). Design For Small Delay Test - A Simulation Study. <i>Microelectronics Reliability</i>, <i>80</i>, 124–133.","bibtex":"@article{Kampmann_Hellebrand_2018, title={Design For Small Delay Test - A Simulation Study}, volume={80}, journal={Microelectronics Reliability}, author={Kampmann, Matthias and Hellebrand, Sybille}, year={2018}, pages={124–133} }","ama":"Kampmann M, Hellebrand S. Design For Small Delay Test - A Simulation Study. <i>Microelectronics Reliability</i>. 2018;80:124-133.","mla":"Kampmann, Matthias, and Sybille Hellebrand. “Design For Small Delay Test - A Simulation Study.” <i>Microelectronics Reliability</i>, vol. 80, 2018, pp. 124–33."},"type":"journal_article","department":[{"_id":"48"}],"date_created":"2019-08-28T11:49:25Z"},{"language":[{"iso":"eng"}],"_id":"13072","user_id":"659","title":"Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test","year":"2018","status":"public","author":[{"first_name":"Matthias","last_name":"Kampmann","full_name":"Kampmann, Matthias","id":"10935"},{"full_name":"Hellebrand, Sybille","first_name":"Sybille","last_name":"Hellebrand"}],"date_updated":"2022-01-06T06:51:28Z","place":"19th Workshop on RTL and High Level Testing (WRTLT'18), Hefei, Anhui, China","date_created":"2019-08-28T12:00:28Z","type":"misc","keyword":["WORKSHOP"],"department":[{"_id":"48"}],"citation":{"chicago":"Kampmann, Matthias, and Sybille Hellebrand. <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China, 2018.","short":"M. Kampmann, S. Hellebrand, Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test, 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China, 2018.","apa":"Kampmann, M., &#38; Hellebrand, S. (2018). <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China.","ieee":"M. Kampmann and S. Hellebrand, <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China, 2018.","ama":"Kampmann M, Hellebrand S. <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China; 2018.","bibtex":"@book{Kampmann_Hellebrand_2018, place={19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China}, title={Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test}, author={Kampmann, Matthias and Hellebrand, Sybille}, year={2018} }","mla":"Kampmann, Matthias, and Sybille Hellebrand. <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 2018."}},{"article_number":"P4.54","_id":"10129","language":[{"iso":"eng"}],"user_id":"15540","volume":25,"status":"public","title":"Measures of Edge-Uncolorability of Cubic Graphs","year":"2018","author":[{"first_name":"M. A.","last_name":"Fiol","full_name":"Fiol, M. A."},{"full_name":"Mazzuoccolo, Guiseppe","first_name":"Guiseppe","last_name":"Mazzuoccolo"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"date_updated":"2022-01-06T06:50:30Z","article_type":"original","intvolume":"        25","date_created":"2019-06-05T09:59:10Z","keyword":["Cubic graph","Tait coloring","Snark","Boole coloring","Berge's conjecture","Tutte's 5-flow conjecture"],"type":"journal_article","department":[{"_id":"542"}],"publication":"The Electronic Journal of Combinatorics","issue":"4","citation":{"ama":"Fiol MA, Mazzuoccolo G, Steffen E. Measures of Edge-Uncolorability of Cubic Graphs. <i>The Electronic Journal of Combinatorics</i>. 2018;25(4).","short":"M.A. Fiol, G. Mazzuoccolo, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).","chicago":"Fiol, M. A., Guiseppe Mazzuoccolo, and Eckhard Steffen. “Measures of Edge-Uncolorability of Cubic Graphs.” <i>The Electronic Journal of Combinatorics</i> 25, no. 4 (2018).","bibtex":"@article{Fiol_Mazzuoccolo_Steffen_2018, title={Measures of Edge-Uncolorability of Cubic Graphs}, volume={25}, number={4P4.54}, journal={The Electronic Journal of Combinatorics}, author={Fiol, M. A. and Mazzuoccolo, Guiseppe and Steffen, Eckhard}, year={2018} }","apa":"Fiol, M. A., Mazzuoccolo, G., &#38; Steffen, E. (2018). Measures of Edge-Uncolorability of Cubic Graphs. <i>The Electronic Journal of Combinatorics</i>, <i>25</i>(4).","mla":"Fiol, M. A., et al. “Measures of Edge-Uncolorability of Cubic Graphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 4, P4.54, 2018.","ieee":"M. A. Fiol, G. Mazzuoccolo, and E. Steffen, “Measures of Edge-Uncolorability of Cubic Graphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 4, 2018."},"abstract":[{"text":"There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for 3-edge-colorable cubic graphs, cubic graphs which are not 3-edge-colorable, often called snarks, play a key role in this context. Here, we survey parameters measuring how far apart a non 3-edge-colorable graph is from being 3-edge-colorable. We study their interrelation and prove some new results. Besides getting new insight into the structure of snarks, we show that such  measures give partial results with respect to these important conjectures. The paper closes with a list of open problems and conjectures.","lang":"eng"}]},{"volume":38,"user_id":"15540","doi":"10.7151/dmgt.1999","_id":"10132","language":[{"iso":"eng"}],"page":"165-175","intvolume":"        38","publication_status":"published","date_updated":"2022-01-06T06:50:30Z","author":[{"last_name":"Jin","first_name":"Ligang","full_name":"Jin, Ligang"},{"first_name":"Giuseppe","last_name":"Mazzuoccolo","full_name":"Mazzuoccolo, Giuseppe"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"publication_identifier":{"issn":["1234-3099","2083-5892"]},"status":"public","year":"2018","title":"Cores, joins  and the Fano-flow conjectures","department":[{"_id":"542"}],"type":"journal_article","date_created":"2019-06-05T10:08:41Z","citation":{"mla":"Jin, Ligang, et al. “Cores, Joins  and the Fano-Flow Conjectures.” <i>Discussiones Mathematicae Graph Theory</i>, vol. 38, 2018, pp. 165–75, doi:<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>.","ama":"Jin L, Mazzuoccolo G, Steffen E. Cores, joins  and the Fano-flow conjectures. <i>Discussiones Mathematicae Graph Theory</i>. 2018;38:165-175. doi:<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>","bibtex":"@article{Jin_Mazzuoccolo_Steffen_2018, title={Cores, joins  and the Fano-flow conjectures}, volume={38}, DOI={<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>}, journal={Discussiones Mathematicae Graph Theory}, author={Jin, Ligang and Mazzuoccolo, Giuseppe and Steffen, Eckhard}, year={2018}, pages={165–175} }","apa":"Jin, L., Mazzuoccolo, G., &#38; Steffen, E. (2018). Cores, joins  and the Fano-flow conjectures. <i>Discussiones Mathematicae Graph Theory</i>, <i>38</i>, 165–175. <a href=\"https://doi.org/10.7151/dmgt.1999\">https://doi.org/10.7151/dmgt.1999</a>","ieee":"L. Jin, G. Mazzuoccolo, and E. Steffen, “Cores, joins  and the Fano-flow conjectures,” <i>Discussiones Mathematicae Graph Theory</i>, vol. 38, pp. 165–175, 2018.","short":"L. Jin, G. Mazzuoccolo, E. Steffen, Discussiones Mathematicae Graph Theory 38 (2018) 165–175.","chicago":"Jin, Ligang, Giuseppe Mazzuoccolo, and Eckhard Steffen. “Cores, Joins  and the Fano-Flow Conjectures.” <i>Discussiones Mathematicae Graph Theory</i> 38 (2018): 165–75. <a href=\"https://doi.org/10.7151/dmgt.1999\">https://doi.org/10.7151/dmgt.1999</a>."},"publication":"Discussiones Mathematicae Graph Theory"},{"issue":"1","publication":"Australasian Journal of Combinatorics","citation":{"mla":"Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” <i>Australasian Journal of Combinatorics</i>, vol. 71, no. 1, 2018, pp. 153–60.","ama":"Steffen E. Approximating Vizing’s independence number conjecture. <i>Australasian Journal of Combinatorics</i>. 2018;71(1):153-160.","bibtex":"@article{Steffen_2018, title={Approximating Vizing’s independence number conjecture}, volume={71}, number={1}, journal={Australasian Journal of Combinatorics}, author={Steffen, Eckhard}, year={2018}, pages={153–160} }","apa":"Steffen, E. (2018). Approximating Vizing’s independence number conjecture. <i>Australasian Journal of Combinatorics</i>, <i>71</i>(1), 153–160.","ieee":"E. Steffen, “Approximating Vizing’s independence number conjecture,” <i>Australasian Journal of Combinatorics</i>, vol. 71, no. 1, pp. 153–160, 2018.","short":"E. Steffen, Australasian Journal of Combinatorics 71 (2018) 153–160.","chicago":"Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” <i>Australasian Journal of Combinatorics</i> 71, no. 1 (2018): 153–60."},"type":"journal_article","department":[{"_id":"542"}],"date_created":"2019-06-07T08:36:36Z","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        71","year":"2018","status":"public","title":"Approximating Vizing’s independence number conjecture","author":[{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"user_id":"15540","volume":71,"page":"153-160","language":[{"iso":"eng"}],"_id":"10142"},{"status":"public","title":"Learning to Rank Based on Analogical Reasoning","year":"2018","author":[{"full_name":"Ahmadi Fahandar, Mohsen","first_name":"Mohsen","last_name":"Ahmadi Fahandar"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"}],"date_updated":"2022-01-06T06:50:31Z","page":"2951-2958","_id":"10145","language":[{"iso":"eng"}],"user_id":"49109","publication":"Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)","citation":{"bibtex":"@inproceedings{Ahmadi Fahandar_Hüllermeier_2018, title={Learning to Rank Based on Analogical Reasoning}, booktitle={Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2018}, pages={2951–2958} }","ama":"Ahmadi Fahandar M, Hüllermeier E. Learning to Rank Based on Analogical Reasoning. In: <i>Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI)</i>. ; 2018:2951-2958.","mla":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Learning to Rank Based on Analogical Reasoning.” <i>Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI)</i>, 2018, pp. 2951–58.","short":"M. Ahmadi Fahandar, E. Hüllermeier, in: Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI), 2018, pp. 2951–2958.","chicago":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Learning to Rank Based on Analogical Reasoning.” In <i>Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI)</i>, 2951–58, 2018.","ieee":"M. Ahmadi Fahandar and E. Hüllermeier, “Learning to Rank Based on Analogical Reasoning,” in <i>Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)</i>, 2018, pp. 2951–2958.","apa":"Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2018). Learning to Rank Based on Analogical Reasoning. In <i>Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)</i> (pp. 2951–2958)."},"date_created":"2019-06-07T08:49:33Z","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}]},{"year":"2018","title":"Ranking Distributions based on Noisy Sorting","status":"public","author":[{"full_name":"El Mesaoudi-Paul, Adil","first_name":"Adil","last_name":"El Mesaoudi-Paul"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"},{"full_name":"Busa-Fekete, Robert","first_name":"Robert","last_name":"Busa-Fekete"}],"date_updated":"2022-01-06T06:50:31Z","page":"3469-3477","_id":"10148","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","publication":"Proc. 35th Int. Conference on Machine Learning (ICML)","citation":{"mla":"El Mesaoudi-Paul, Adil, et al. “Ranking Distributions Based on Noisy Sorting.” <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018, pp. 3469–77.","ama":"El Mesaoudi-Paul A, Hüllermeier E, Busa-Fekete R. Ranking Distributions based on Noisy Sorting. In: <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2018:3469-3477.","bibtex":"@inproceedings{El Mesaoudi-Paul_Hüllermeier_Busa-Fekete_2018, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ranking Distributions based on Noisy Sorting}, booktitle={Proc. 35th Int. Conference on Machine Learning (ICML)}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={El Mesaoudi-Paul, Adil and Hüllermeier, Eyke and Busa-Fekete, Robert}, year={2018}, pages={3469–3477}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"El Mesaoudi-Paul, A., Hüllermeier, E., &#38; Busa-Fekete, R. (2018). Ranking Distributions based on Noisy Sorting. <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 3469–3477.","ieee":"A. El Mesaoudi-Paul, E. Hüllermeier, and R. Busa-Fekete, “Ranking Distributions based on Noisy Sorting,” in <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 2018, pp. 3469–3477.","chicago":"El Mesaoudi-Paul, Adil, Eyke Hüllermeier, and Robert Busa-Fekete. “Ranking Distributions Based on Noisy Sorting.” In <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 3469–77. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018.","short":"A. El Mesaoudi-Paul, E. Hüllermeier, R. Busa-Fekete, in: Proc. 35th Int. Conference on Machine Learning (ICML), Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018, pp. 3469–3477."},"date_created":"2019-06-07T09:02:37Z","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}]},{"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"type":"conference","date_created":"2019-06-07T09:10:51Z","citation":{"mla":"Hesse, M., et al. “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart.” <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 2018, pp. 15–20.","ama":"Hesse M, Timmermann J, Hüllermeier E, Trächtler A. A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart. In: <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>. ; 2018:15-20.","bibtex":"@inproceedings{Hesse_Timmermann_Hüllermeier_Trächtler_2018, title={A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart}, booktitle={Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24}, author={Hesse, M. and Timmermann, J. and Hüllermeier, Eyke and Trächtler, Ansgar}, year={2018}, pages={15–20} }","apa":"Hesse, M., Timmermann, J., Hüllermeier, E., &#38; Trächtler, A. (2018). A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart. <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 15–20.","ieee":"M. Hesse, J. Timmermann, E. Hüllermeier, and A. Trächtler, “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart,” in <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 2018, pp. 15–20.","chicago":"Hesse, M., J. Timmermann, Eyke Hüllermeier, and Ansgar Trächtler. “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart.” In <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 15–20, 2018.","short":"M. Hesse, J. Timmermann, E. Hüllermeier, A. Trächtler, in: Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24, 2018, pp. 15–20."},"publication":"Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24","user_id":"5786","_id":"10149","language":[{"iso":"eng"}],"page":"15-20","date_updated":"2022-01-06T06:50:31Z","author":[{"full_name":"Hesse, M.","last_name":"Hesse","first_name":"M."},{"first_name":"J.","last_name":"Timmermann","full_name":"Timmermann, J."},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"full_name":"Trächtler, Ansgar","last_name":"Trächtler","first_name":"Ansgar"}],"title":"A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart","status":"public","year":"2018"}]