TY - CHAP A1 - Liu, Haiming A1 - Frommholz, Ingo A1 - Song, Dawai A1 - Schmitt, Ingo T1 - The 8th Symposium on Future Directions in Information Access T2 - ICTIR '18, Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval, Tianjin, China, September 14 - 17, 2018 N2 - The 8th PhD Symposium on Future Directions in Information Access (FDIA) will be held in conjunction with the 8th International Conference on the Theory of Information Retrieval (ICTIR 2018) in Tianjin, China. The symposium aims to provide a forum for early stage researchers such as PhD students, to share their research and interact with each other and senior researchers in an informal and relaxed atmosphere. The symposium provides an excellent opportunity for the participants to promote their work and obtain experience in presenting and communicating their research. The participants will learn about different topics in the area of information access and retrieval, receive feedback on their work, meet lots of peers and hear inspiring talks. Y1 - 2018 SN - 978-1-4503-5656-5 U6 - https://doi.org/10.1145/3234944.3237193 SP - S. 5 PB - ACM CY - New York, NY ER - TY - BOOK A1 - Schmitt, Ingo A1 - Saake, Gunter A1 - Türker, Can T1 - Objektdatenbanken : Konzepte, Sprachen, Architekturen KW - Objektdatenbank Y1 - 2005 SN - 3-8266-0258-7 PB - Internat. Thomson Publ. CY - Bonn ER - TY - BOOK A1 - Schmitt, Ingo T1 - Schemaintegration für den Entwurf Föderierter Datenbanken KW - Datenbanken Y1 - 1998 SN - 3-89601-443-9 PB - Infix CY - Sankt Augustin ER - TY - CHAP A1 - Schmitt, Ingo A1 - Nürnberger, Andreas A1 - Lehrack, Sebastian ED - Seising, Rudolf T1 - On the Relation between Fuzzy and Quantum Logic T2 - Views on Fuzzy Sets and Systems from Different Perspectives Y1 - 2009 SN - 978-3-540-93801-9 SP - 417 EP - 438 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Schmitt, Ingo A1 - Hentschel, Christian A1 - Nürnberger, Andreas A1 - Stober, S. T1 - SAFIRE: Towards Standardized Semantic Rich Image Annotation T2 - Adaptive multimedia retrieval, user, context, and feedback, 4th international workshop, AMR 2006, Geneva, Switzerland, July, 27 - 28, 2006 Y1 - 2007 SN - 978-3-540-71544-3 SP - 12 EP - 27 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Schmitt, Ingo T1 - Multimedia Information Retrieval - Ein kurzer Überblick. Y1 - 2007 ER - TY - CHAP A1 - Giurca, Adrian A1 - Schmitt, Ingo A1 - Baier, Daniel T1 - Performing Conjoint Analysis within a Logic-based Framework T2 - 2011 Federated Conference on Computer Science and Information Systems (FedCSIS 2011), Szczecin, Poland, 18 - 21 September 2011 Y1 - 2011 SN - 978-1-457-70041-5 SP - 261 EP - 268 PB - IEEE CY - Piscataway, NJ ER - TY - GEN A1 - Schmitt, Ingo A1 - Zellhöfer, David T1 - Interaktives Information-Retrieval auf der Basis der Polyrepräsentation T2 - Informatik Spektrum Y1 - 2011 SN - 0170-6012 VL - 33 IS - 3 SP - 183 EP - 194 ER - TY - CHAP A1 - Schmitt, Ingo A1 - Baier, Daniel ED - Lausen, Berthold ED - Poel, Dirk van den ED - Ultsch, Alfred T1 - Logic Based Conjoint Analysis Using the Commuting Quantum Query Language T2 - Algorithms from and for Nature and Life: Classification and Data Analysis Y1 - 2013 UR - http://www.springer.com/statistics/computational+statistics/book/978-3-319-00034-3 SN - 978-3-319-00035-0 SP - 481 EP - 490 PB - Springer CY - Heidelberg-Berlin ER - TY - CHAP A1 - Zierenberg, Marcel A1 - Schmitt, Ingo ED - Amato, Giuseppe ED - Connor, Richard ED - Falchi, Fabrizio ED - Gennaro, Claudio T1 - Optimizing the Distance Computation Order of Multi-Feature Similarity Search Indexing T2 - Similarity Search and Applications - 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings N2 - Multi-feature search is an effective approach to similarity search. Unfortunately, the search efficiency decreases with the number of features. Several indexing approaches aim to achieve efficiency by incrementally reducing the approximation error of aggregated distance bounds. They apply heuristics to determine the distance computations order and update the object's aggregated bounds after each computation. However, the existing indexing approaches suffer from several drawbacks. They use the same computation order for all objects, do not support important types of aggregation functions and do not take the varying CPU and I/O costs of different distance computations into account. To resolve these problems, we introduce a new heuristic to determine an efficient distance computation order for each individual object. Our heuristic supports various important aggregation functions and calculates cost-benefit-ratios to incorporate the varying computation costs of different distance functions. The experimental evaluation reveals that our heuristic outperforms state-of-the-art approaches in terms of the number of distance computations as well as search time. KW - combination of features KW - multi-feature search KW - metric indexing KW - nearest neighbor Y1 - 2015 UR - http://link.springer.com/chapter/10.1007/978-3-319-25087-8_8 SN - 978-3-319-25087-8 U6 - https://doi.org/10.1007/978-3-319-25087-8_8 SP - 90 EP - 96 ER -