TY - JOUR A1 - Laskov, Pavel A1 - Gehl, Christian A1 - Krüger, Stefan A1 - Müller, Klaus-Robert T1 - Incremental support vector learning: analysis, implementation and applications JF - Journal of machine learning research N2 - Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM learning, with the aim of providing a fast, numerically stable and robust implementation. A detailed analysis of convergence and of algorithmic complexity of incremental SVM learning is carried out. Based on this analysis, a new design of storage and numerical operations is proposed, which speeds up the training of an incremental SVM by a factor of 5 to 20. The performance of the new algorithm is demonstrated in two scenarios: learning with limited resources and active learning. Various applications of the algorithm, such as in drug discovery, online monitoring of industrial devices and and surveillance of network traffic, can be foreseen. KW - incremental SVM KW - online learning KW - drug discovery KW - intrusion detection Y1 - 2006 SN - 1532-4435 VL - 7 SP - 1909 EP - 1936 PB - MIT Press CY - Cambridge, Mass. ER - TY - JOUR A1 - Steuer, Ralf A1 - Humburg, Peter A1 - Selbig, Joachim T1 - Validation and functional annotation of expression-based clusters based on gene ontology JF - BMC bioinformatics N2 - Background: The biological interpretation of large-scale gene expression data is one of the paramount challenges in current bioinformatics. In particular, placing the results in the context of other available functional genomics data, such as existing bio-ontologies, has already provided substantial improvement for detecting and categorizing genes of interest. One common approach is to look for functional annotations that are significantly enriched within a group or cluster of genes, as compared to a reference group. Results: In this work, we suggest the information-theoretic concept of mutual information to investigate the relationship between groups of genes, as given by data-driven clustering, and their respective functional categories. Drawing upon related approaches (Gibbons and Roth, Genome Research 12: 1574-1581, 2002), we seek to quantify to what extent individual attributes are sufficient to characterize a given group or cluster of genes. Conclusion: We show that the mutual information provides a systematic framework to assess the relationship between groups or clusters of genes and their functional annotations in a quantitative way. Within this framework, the mutual information allows us to address and incorporate several important issues, such as the interdependence of functional annotations and combinatorial combinations of attributes. It thus supplements and extends the conventional search for overrepresented attributes within a group or cluster of genes. In particular taking combinations of attributes into account, the mutual information opens the way to uncover specific functional descriptions of a group of genes or clustering result. All datasets and functional annotations used in this study are publicly available. All scripts used in the analysis are provided as additional files. Y1 - 2006 U6 - https://doi.org/10.1186/1471-2105-7-380 SN - 1471-2105 VL - 7 IS - 380 PB - BioMed Central CY - London ER - TY - JOUR A1 - Bordihn, Henning A1 - Fernau, Henning A1 - Holzer, Markus A1 - Manca, Vincenzo A1 - Martin-Vide, Carlos T1 - Iterated sequential transducers as language generating devices JF - Theoretical computer science N2 - Iterated finite state sequential transducers are considered as language generating devices. The hierarchy induced by the size of the state alphabet is proved to collapse to the fourth level. The corresponding language families are related to the families of languages generated by Lindenmayer systems and Chomsky grammars. Finally, some results on deterministic and extended iterated finite state transducers are established. KW - finite state sequential transducers KW - state complexity KW - Lindenmayer systems Y1 - 2006 U6 - https://doi.org/10.1016/j.tcs.2006.07.059 SN - 0304-3975 VL - 369 IS - 1 SP - 67 EP - 81 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Grell, Susanne A1 - Schaub, Torsten H. A1 - Selbig, Joachim T1 - Modelling biological networks by action languages via set programming Y1 - 2006 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/gebsch06c.pdf U6 - https://doi.org/10.1007/11799573 SN - 0302-9743 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans T1 - A Preference-Based Framework for Updating logic Programs : preliminary reports Y1 - 2006 UR - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf ER - TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - On probing and multi-threading in platypus Y1 - 2006 UR - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf ER - TY - BOOK ED - Jürgensen, Helmut T1 - Accessible Media : Pre-Proceedings of a Workshop Potsdam 8-9 May, 2006 T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 7 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Krahmer, Sebastian T1 - Generating runtime call graphs T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 8 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Jeske, Janin A1 - Brehmer, Bastian A1 - Menge, Falko A1 - Hüttenrauch, Stefan A1 - Adam, Christian A1 - Schüler, Benjamin A1 - Schult, Wolfgang A1 - Rasche, Andreas A1 - Polze, Andreas T1 - Aspektorientierte Programmierung : Überblick über Techniken und Werkzeuge T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2006 SN - 3-939469-23-8 SN - 1613-5652 VL - 14 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - THES A1 - Leininger, Andreas T1 - New diagnosis and test methods with high compaction rates Y1 - 2006 SN - 3-86664-066-8 PB - Mensch & Buch Verl. CY - Berlin ER -