[{"file":[{"file_size":875404,"file_id":"5275","creator":"ups","content_type":"application/pdf","date_updated":"2018-11-02T14:33:54Z","success":1,"relation":"main_file","date_created":"2018-11-02T14:33:54Z","file_name":"p561-wever.pdf","access_level":"closed"}],"file_date_updated":"2018-11-02T14:33:54Z","keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018","publisher":"ACM","author":[{"id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"date_created":"2018-03-31T13:51:23Z","has_accepted_license":"1","status":"public","abstract":[{"text":"In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance.","lang":"eng"}],"user_id":"33176","ddc":["000"],"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562","open_access":"1"}],"year":"2018","type":"conference","citation":{"bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles of Evolved Nested Dichotomies for Classification}, DOI={10.1145/3205455.3205562}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","mla":"Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for Classification.” Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, 2018, doi:10.1145/3205455.3205562.","apa":"Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). Ensembles of Evolved Nested Dichotomies for Classification. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM. https://doi.org/10.1145/3205455.3205562","ama":"Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for Classification. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM; 2018. doi:10.1145/3205455.3205562","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of Evolved Nested Dichotomies for Classification.” In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM, 2018. https://doi.org/10.1145/3205455.3205562.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies for Classification,” in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, Kyoto, Japan, 2018.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, Kyoto, Japan, 2018."},"conference":{"location":"Kyoto, Japan","name":"GECCO 2018","start_date":"2018-07-15","end_date":"2018-07-19"},"_id":"2109","department":[{"_id":"355"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publication_status":"published","place":"Kyoto, Japan","title":"Ensembles of Evolved Nested Dichotomies for Classification","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:45Z","oa":"1","doi":"10.1145/3205455.3205562"},{"date_created":"2020-11-30T09:32:12Z","status":"public","publication_identifier":{"issn":["2326-3881"]},"department":[{"_id":"76"}],"keyword":["Debugging","Static analysis","Tools","Computer bugs","Standards","Writing","Encoding","Testing and Debugging","Program analysis","Development tools","Integrated environments","Graphical environments","Usability testing"],"publication":"IEEE Transactions on Software Engineering","author":[{"full_name":"Nguyen Quang Do, Lisa","first_name":"Lisa","last_name":"Nguyen Quang Do"},{"full_name":"Krüger, Stefan","first_name":"Stefan","last_name":"Krüger"},{"last_name":"Hill","first_name":"Patrick","full_name":"Hill, Patrick"},{"last_name":"Ali","full_name":"Ali, Karim","first_name":"Karim"},{"full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric","id":"59256","last_name":"Bodden"}],"user_id":"5786","title":"Debugging Static Analysis","language":[{"iso":"eng"}],"page":"1-1","year":"2018","citation":{"chicago":"Nguyen Quang Do, Lisa, Stefan Krüger, Patrick Hill, Karim Ali, and Eric Bodden. “Debugging Static Analysis.” IEEE Transactions on Software Engineering, 2018, 1–1. https://doi.org/10.1109/TSE.2018.2868349.","apa":"Nguyen Quang Do, L., Krüger, S., Hill, P., Ali, K., & Bodden, E. (2018). Debugging Static Analysis. IEEE Transactions on Software Engineering, 1–1. https://doi.org/10.1109/TSE.2018.2868349","ama":"Nguyen Quang Do L, Krüger S, Hill P, Ali K, Bodden E. Debugging Static Analysis. IEEE Transactions on Software Engineering. Published online 2018:1-1. doi:10.1109/TSE.2018.2868349","mla":"Nguyen Quang Do, Lisa, et al. “Debugging Static Analysis.” IEEE Transactions on Software Engineering, 2018, pp. 1–1, doi:10.1109/TSE.2018.2868349.","bibtex":"@article{Nguyen Quang Do_Krüger_Hill_Ali_Bodden_2018, title={Debugging Static Analysis}, DOI={10.1109/TSE.2018.2868349}, journal={IEEE Transactions on Software Engineering}, author={Nguyen Quang Do, Lisa and Krüger, Stefan and Hill, Patrick and Ali, Karim and Bodden, Eric}, year={2018}, pages={1–1} }","short":"L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, E. Bodden, IEEE Transactions on Software Engineering (2018) 1–1.","ieee":"L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, and E. Bodden, “Debugging Static Analysis,” IEEE Transactions on Software Engineering, pp. 1–1, 2018, doi: 10.1109/TSE.2018.2868349."},"type":"journal_article","main_file_link":[{"url":"http://www.bodden.de/pubs/tse18debugging.pdf"}],"doi":"10.1109/TSE.2018.2868349","date_updated":"2022-01-06T06:54:29Z","_id":"20543"},{"date_updated":"2023-12-13T10:44:28Z","_id":"48857","doi":"10.1109/SSCI.2017.8285183","language":[{"iso":"eng"}],"page":"1–8","year":"2017","citation":{"ieee":"J. Bossek and C. Grimme, “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem,” in 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8, doi: 10.1109/SSCI.2017.8285183.","short":"J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8.","bibtex":"@inproceedings{Bossek_Grimme_2017, title={A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem}, DOI={10.1109/SSCI.2017.8285183}, booktitle={2017 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Bossek, Jakob and Grimme, Christian}, year={2017}, pages={1–8} }","mla":"Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem.” 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8, doi:10.1109/SSCI.2017.8285183.","chicago":"Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem.” In 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 1–8, 2017. https://doi.org/10.1109/SSCI.2017.8285183.","apa":"Bossek, J., & Grimme, C. (2017). A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem. 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 1–8. https://doi.org/10.1109/SSCI.2017.8285183","ama":"Bossek J, Grimme C. A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI). ; 2017:1–8. doi:10.1109/SSCI.2017.8285183"},"type":"conference","abstract":[{"lang":"eng","text":"While finding minimum-cost spanning trees (MST) in undirected graphs is solvable in polynomial time, the multi-criteria minimum spanning tree problem (mcMST) is NP-hard. Interestingly, the mcMST problem has not been in focus of evolutionary computation research for a long period of time, although, its relevance for real world problems is easy to see. The available and most notable approaches by Zhou and Gen as well as by Knowles and Corne concentrate on solution encoding and on fairly dated selection mechanisms. In this work, we revisit the mcMST and focus on the mutation operators as exploratory components of evolutionary algorithms neglected so far. We investigate optimal solution characteristics to discuss current mutation strategies, identify shortcomings of these operators, and propose a sub-tree based operator which offers what we term Pareto-beneficial behavior: ensuring convergence and diversity at the same time. The operator is empirically evaluated inside modern standard evolutionary meta-heuristics for multi-criteria optimization and compared to hitherto applied mutation operators in the context of mcMST."}],"extern":"1","user_id":"102979","title":"A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem","department":[{"_id":"819"}],"publication":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","keyword":["Convergence","Encoding","Euclidean distance","Evolutionary computation","Heating systems","Optimization","Standards"],"author":[{"first_name":"Jakob","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979"},{"last_name":"Grimme","full_name":"Grimme, Christian","first_name":"Christian"}],"date_created":"2023-11-14T15:58:54Z","status":"public","publication_status":"published"},{"title":"Peripheral visual cues: Their fate in processing and effects on attention and temporal-order perception.","publication_status":"published","publication_identifier":{"issn":["1664-1078"]},"department":[{"_id":"424"}],"oa":"1","doi":"10.3389/fpsyg.2016.01442","date_updated":"2022-06-06T16:29:50Z","language":[{"iso":"eng"}],"user_id":"42165","abstract":[{"lang":"eng","text":"Peripheral visual cues lead to large shifts in psychometric distributions of temporal-order judgments. In one view, such shifts are attributed to attention speeding up processing of the cued stimulus, so-called prior entry. However, sometimes these shifts are so large that it is unlikely that they are caused by attention alone. Here we tested the prevalent alternative explanation that the cue is sometimes confused with the target on a perceptual level, bolstering the shift of the psychometric function. We applied a novel model of cued temporal-order judgments, derived from Bundesen’s Theory of Visual Attention.We found that cue–target confusions indeed contribute to shifting psychometric functions. However, cue-induced changes in the processing rates of the target stimuli play an important role, too. At smaller cueing intervals, the cue increased the processing speed of the target. At larger intervals, inhibition of return was predominant. Earlier studies of cued TOJs were insensitive"}],"date_created":"2018-12-10T07:06:09Z","status":"public","volume":7,"publication":"Frontiers in Psychology","keyword":["cueing","temporal-order judgements","theory of visual attention (TVA)","peripheral cue","processing speed","stimulus encoding","prior entry","Attention","Cues","Face Perception","Judgment"],"author":[{"last_name":"Tünnermann","first_name":"Jan","full_name":"Tünnermann, Jan"},{"id":"451","last_name":"Scharlau","full_name":"Scharlau, Ingrid","orcid":"0000-0003-2364-9489","first_name":"Ingrid"}],"intvolume":" 7","_id":"6080","year":"2016","citation":{"ieee":"J. Tünnermann and I. Scharlau, “Peripheral visual cues: Their fate in processing and effects on attention and temporal-order perception.,” Frontiers in Psychology, vol. 7, 2016, doi: 10.3389/fpsyg.2016.01442.","short":"J. Tünnermann, I. Scharlau, Frontiers in Psychology 7 (2016).","mla":"Tünnermann, Jan, and Ingrid Scharlau. “Peripheral Visual Cues: Their Fate in Processing and Effects on Attention and Temporal-Order Perception.” Frontiers in Psychology, vol. 7, 2016, doi:10.3389/fpsyg.2016.01442.","bibtex":"@article{Tünnermann_Scharlau_2016, title={Peripheral visual cues: Their fate in processing and effects on attention and temporal-order perception.}, volume={7}, DOI={10.3389/fpsyg.2016.01442}, journal={Frontiers in Psychology}, author={Tünnermann, Jan and Scharlau, Ingrid}, year={2016} }","ama":"Tünnermann J, Scharlau I. Peripheral visual cues: Their fate in processing and effects on attention and temporal-order perception. Frontiers in Psychology. 2016;7. doi:10.3389/fpsyg.2016.01442","apa":"Tünnermann, J., & Scharlau, I. (2016). Peripheral visual cues: Their fate in processing and effects on attention and temporal-order perception. Frontiers in Psychology, 7. https://doi.org/10.3389/fpsyg.2016.01442","chicago":"Tünnermann, Jan, and Ingrid Scharlau. “Peripheral Visual Cues: Their Fate in Processing and Effects on Attention and Temporal-Order Perception.” Frontiers in Psychology 7 (2016). https://doi.org/10.3389/fpsyg.2016.01442."},"type":"journal_article","main_file_link":[{"url":"https://www.frontiersin.org/articles/10.3389/fpsyg.2016.01442/full","open_access":"1"}]}]