Thomas Gärtner

Thomas Gärtner is a person.

• See: Kernel-based Algorithm.

---

---

References

• Professional Home Page: http://www-kd.iai.uni-bonn.de/index.php?page=people_details&id=2
• Google Scholar Author Page: http://scholar.google.com/citations?user=sOI8QyoAAAAJ

2011

• (Boley et al., 2011) ⇒ Mario Boley, Claudio Lucchese, Daniel Paurat, and Thomas Gärtner. (2011). “Direct Local Pattern Sampling by Efficient Two-step Random Procedures.” In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2011). doi:10.1145/2020408.2020500

2004

• (Gärtner et al., 2004) ⇒ Thomas Gärtner, John W. Lloyd, and Peter A. Flach. (2004). “Kernels and Distances for Structured Data.” In: Machine Learning Journal, 57(3). doi:10.1023/B:MACH.0000039777.23772.30
• (Horváth et al., 2004) ⇒ Tamás Horváth, Thomas Gärtner, and Stefan Wrobel. (2004). “Cyclic pattern kernels for predictive graph mining.” In: Proceedings of the tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2004).

2003

• (Gärtner et al., 2003) ⇒ Thomas Gärtner, Peter Flach, and Stefan Wrobel. (2003). “On Graph Kernels: Hardness results and efficient alternatives.” In: Learning Theory and Kernel Machines..
• (Gartner, 2003) ⇒ Thomas Gärtner. (2003). “A Survey of Kernels for Structured Data.” In: ACM SIGKDD Explorations Newsletter, 5(1).

2002

• (Gärtner et al., 2002) ⇒ Thomas Gärtner, Peter A. Flach, Adam Kowalczyk, and Alex J. Smola. (2002). “Multi-Instance Kernels.” In: Proceedings of ICML 2002 (ICML 2002).

---