![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Stefan Kramer Stefan Kramer, Bernhard Pfahringer : Inductive Logic Programming, 15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings Springer 2005 Johannes Fischer , Volker Heun , Stefan Kramer: Fast Frequent String Mining Using Suffix Arrays. ICDM 2005 : 609-612 Vahan Harput , Hermann Kaindl , Stefan Kramer: Extending Function Point Analysis of Object-Oriented Requirements Specifications. IEEE METRICS 2005 : 39 Stefan Kramer, Volker Aufschild , Andreas Hapfelmeier , Alexander Jarasch , Kristina Kessler , Stefan Reckow , Jörg Wicker , Lothar Richter : Inductive Databases in the Relational Model: The Data as the Bridge. KDID 2005 : 124-138 Lin Dong , Eibe Frank , Stefan Kramer: Ensembles of Balanced Nested Dichotomies for Multi-class Problems. PKDD 2005 : 84-95 Ulrich Rückert , Lothar Richter , Stefan Kramer: Quantitative Association Rules Based on Half-Spaces: An Optimization Approach. ICDM 2004 : 507-510 Eibe Frank , Stefan Kramer: Ensembles of nested dichotomies for multi-class problems. ICML 2004 Ulrich Rückert , Stefan Kramer: Towards tight bounds for rule learning. ICML 2004 Ulrich Rückert , Stefan Kramer: Frequent free tree discovery in graph data. SAC 2004 : 564-570 Stefan Kramer, Hermann Kaindl : Coupling and cohesion metrics for knowledge-based systems using frames and rules. ACM Trans. Softw. Eng. Methodol. 13 (3): 332-358 (2004) Hendrik Blockeel , Saso Dzeroski , Boris Kompare , Stefan Kramer, Bernhard Pfahringer , Wim Van Laer : Experiments In Predicting Biodegradability. Applied Artificial Intelligence 18 (2): 157-181 (2004) Hermann Kaindl , Stefan Kramer, Mario Hailing , Vahan Harput : Metamodel-Compliance Checking of Requirements in a Semiformal Representation. CAiSE Short Paper Proceedings 2003 Ulrich Rückert , Stefan Kramer: Stochastic Local Search in k-Term DNF Learning. ICML 2003 : 648-655 Ulrich Rückert , Stefan Kramer: Generalized Version Space Trees. KDID 2003 : 119-129 Kristian Kersting , Tapani Raiko , Stefan Kramer, Luc De Raedt : Towards Discovering Structural Signatures of Protein Folds Based on Logical Hidden Markov Models. Pacific Symposium on Biocomputing 2003 : 192-203 Christoph Helma , Stefan Kramer: A Survey of the Predictive Toxicology Challenge 2000-2001. Bioinformatics 19 (10): 1179-1182 (2003) Hannu Toivonen , Ashwin Srinivasan , Ross D. King , Stefan Kramer, Christoph Helma : Statistical Evaluation of the Predictive Toxicology Challenge 2000-2001. Bioinformatics 19 (10): 1183-1193 (2003) Ulrich Rückert , Stefan Kramer, Luc De Raedt : Phase Transitions and Stochastic Local Search in k-Term DNF Learning. ECML 2002 : 405-417 Björn Bringmann , Stefan Kramer, Friedrich Neubarth , Hannes Pirker , Gerhard Widmer : Transformation-Based Regression. ICML 2002 : 59-66 Steven Ganzert , Josef Guttmann , Kristian Kersting , Ralf Kuhlen , Christian Putensen , Michael Sydow , Stefan Kramer: Analysis of respiratory pressure-volume curves in intensive care medicine using inductive machine learning. Artificial Intelligence in Medicine 26 (1-2): 69-86 (2002) Stefan Kramer, Luc De Raedt : Feature Construction with Version Spaces for Biochemical Applications. ICML 2001 : 258-265 Luc De Raedt , Stefan Kramer: The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding. IJCAI 2001 : 853-862 Stefan Kramer: Demand-Driven Construction of Structural Features in ILP. ILP 2001 : 132-141 Stefan Kramer, Luc De Raedt , Christoph Helma : Molecular feature mining in HIV data. KDD 2001 : 136-143 Christoph Helma , Ross D. King , Stefan Kramer, Ashwin Srinivasan : The Predictive Toxicology Challenge 2000-2001. Bioinformatics 17 (1): 107-108 (2001) Stefan Kramer, Gerhard Widmer , Bernhard Pfahringer , Michael de Groeve : Prediction of Ordinal Classes Using Regression Trees. Fundam. Inform. 47 (1-2): 1-13 (2001) Johannes Fürnkranz , Bernhard Pfahringer , Hermann Kaindl , Stefan Kramer: Learning to Use Operational Advice. ECAI 2000 : 291-295 Stefan Kramer, Eibe Frank : Bottom-Up Propositionalization. ILP Work-in-progress reports 2000 Stefan Kramer, Gerhard Widmer , Bernhard Pfahringer , Michael de Groeve : Prediction of Ordinal Classes Using Regression Trees. ISMIS 2000 : 426-434 Stefan Kramer: Thesis: Relational learning vs. propositionalization. AI Commun. 13 (4): 275-276 (2000) Hermann Kaindl , Stefan Kramer, Papa Samba Niang Diallo : Semiautomatic Generation of Glossary Links: A Practical Solution. Hypertext 1999 : 3-12 Saso Dzeroski , Hendrik Blockeel , Boris Kompare , Stefan Kramer, Bernhard Pfahringer , Wim Van Laer : Experiments in Predicting Biodegradability. ILP 1999 : 80-91 Hermann Kaindl , Stefan Kramer, Luis Miguel Afonso : Combining Structure Search and Content Search for the World-Wide Web. Hypertext 1998 : 217-224 Hermann Kaindl , Stefan Kramer, Robert Kacsich : A Case Study of Decomposing Functional Requirements Using Scenarios. ICRE 1998 : 156-163 Stefan Kramer, Bernhard Pfahringer , Christopher Helma : Stochastic Propositionalization of Non-determinate Background Knowledge. ILP 1998 : 80-94 Christoph Welsch , Alexander Schalk , Stefan Kramer: Integrating Forward and Reverse Object-Oriented Software Engineering. ICSE 1997 : 560-561 Stefan Kramer, Hermann Kaindl , Stefan Schlee : Can We Benefit from Metrics in KBS Development? IJCAI (1) 1997 : 662-667 Stefan Kramer, Bernhard Pfahringer , Christoph Helma : Mining for Causes of Cancer: Machine Learning Experiments at Various Levels of Detail. KDD 1997 : 223-226 Stefan Kramer: Structural Regression Trees. AAAI/IAAI, Vol. 1 1996 : 812-819 Stefan Kramer, Bernhard Pfahringer : Efficient Search for Strong Partial Determinations. KDD 1996 : 371-374 Bernhard Pfahringer , Stefan Kramer: Compression-Based Evaluation of Partial Determinations. KDD 1995 : 234-239 1 [ 9 ] 2 [ 38 ] 3 [ 10 ] [ 31 ] 4 [ 23 ] 5 [ 11 ] 6 [ 37 ] 7 [ 10 ] [ 31 ] 8 [ 40 ] 9 [ 14 ] [ 35 ] [ 37 ] 10 [ 15 ] 11 [ 22 ] 12 [ 13 ] [ 16 ] 13 [ 22 ] 14 [ 30 ] 15 [ 38 ] 16 [ 30 ] [ 39 ] 17 [ 4 ] [ 17 ] [ 18 ] [ 25 ] [ 26 ] 18 [ 7 ] 19 [ 40 ] 20 [ 38 ] 21 [ 8 ] 22 [ 5 ] [ 8 ] [ 9 ] [ 11 ] [ 15 ] [ 30 ] [ 32 ] [ 39 ] 23 [ 22 ] [ 27 ] 24 [ 38 ] 25 [ 17 ] [ 25 ] 26 [ 10 ] [ 31 ] 27 [ 22 ] 28 [ 10 ] [ 31 ] 29 [ 23 ] 30 [ 1 ] [ 2 ] [ 4 ] [ 7 ] [ 10 ] [ 13 ] [ 15 ] [ 16 ] [ 31 ] [ 41 ] 31 [ 23 ] 32 [ 22 ] 33 [ 18 ] [ 20 ] [ 21 ] [ 24 ] [ 27 ] 34 [ 27 ] 35 [ 38 ] 36 [ 36 ] [ 38 ] 37 [ 24 ] [ 28 ] [ 29 ] [ 33 ] [ 34 ] [ 36 ] 38 [ 6 ] 39 [ 5 ] 40 [ 17 ] [ 25 ] 41 [ 22 ] 42 [ 25 ] 43 [ 6 ] 44 [ 38 ] 45 [ 13 ] [ 16 ] [ 23 ] ![]() ©2006 Association for Computing Machinery |