direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Machine Learning

All Publications

2006

Vollgraf, R. and Obermayer, K. (2006). Sparse Optimization for Second Order Kernel Methods. IJCNN 2006 Conference Proceedings. IEEE, 145 – 152.,10.1109/IJCNN.2006.246672


2007

Jain, B. and Obermayer, K. (2007). Theory of the Sample Mean of Structures. LNVD 2007, Learning from Non-vectorial Data, 9-16.


Scheel, C., Neubauer, N., Lommatzsch, A., Obermayer, K. and Albayrak, S. (2007). Efficient Query Delegation by Detecting Redundant Retrieval Strategies. SIGIR Workshop on Learning to Rank for Information Retrieval 2007, (1 – 8).,


Grünewälder, S. and Obermayer, K. (2007). Optimality of LSTD and its Relation to MC. Neural Networks, IJCNN 2007, 338 – 343.,


2008

Jain, B. and Obermayer, K. (2008). On the Sample Mean of Graphs. 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence). IEEE, 993 – 1000.,10.1109/IJCNN.2008.4633920


Knebel, T., Hochreiter, S. and Obermayer, K. (2008). An SMO algorithm for the Potential Support Vector Machine. Neural Comput., 20, 271 – 287.


Lohoff, F., Lautenschlager, M., Mohr, J., Ferraro, T., Sander, T. and Gallinat, J. (2008). Association Between Variation in the Vesicular Monoamine Transporter 1 Gene on Chromosome 8p and Anxiety-Related Personality Traits. Neuroscience Letters, 434, 41 – 45.


Adiloglu, K., Annies, R., Henrich, F., Paus, A. and Obermayer, K. (2008). Geometrical Approaches to Active Learning. Autonomous Systems – Self-Organization, Management, and Control. Springer Netherlands, 11-19.,10.1007/978-1-4020-8889-6_2


Henrich, F. and Obermayer, K. (2008). Active Learning by Spherical Subdivision. Journal of Machine Learning Research, 9, 105 – 130.


2009

Jain, B. and Obermayer, K. (2009). Structure Spaces. Journal of Machine Learning Research, 10, 2667 – 2714.



Seo, S., Mohr, J. and Obermayer, K. (2009). A New Incremental Pairwise Clustering Algorithm. Proceedings of the ICMLA -09: The Eighth International Conference on Machine Learning and Applications. IEEE, 223 – 228.,10.1109/ICMLA.2009.42


Jain, B. and Obermayer, K. (2009). Algorithms for the Sample Mean of Graphs. Lecture Notes in Computer Science, 351 – 359.,


2010

Jain, B. and Obermayer, K. (2010). Elkan’s k-Means Algorithm for Graphs. Advances in Soft Computing. Springer Berlin Heidelberg, 22-32.,10.1007/978-3-642-16773-7_2


Jain, B. and Obermayer, K. (2010). Consistent Estimator of Median and Mean Graph. Proceedings of the 2010 20th International Conference on Pattern Recognition. IEEE, 1032–1035.,10.1109/ICPR.2010.258


Jain, B. and Obermayer, K. (2010). Large Sample Statistics in the Domain of Graphs. Structural, Syntactic, and Statistical Pattern Recognition. Springer Berlin Heidelberg, 690 – 697.,10.1007/978-3-642-14980-1_10


Jain, B., Srinivasan, S. D., Tissen, A. and Obermayer, K. (2010). Learning Graph Quantization. Structural, Syntactic, and Statistical Pattern Recognition. Springer Berlin Heidelberg, 109 – 118.,10.1007/978-3-642-14980-1_10


Jain, B. and Obermayer, K. (2010). Accelerating Competetive Learning Graph Quantization. ,


2011

Jain, B. and Obermayer, K. (2011). Maximum Likelihood for Gaussians on Graphs. Graph-Based Representations in Pattern Recognition. Springer Berlin Heidelberg, 62-71.,10.1007/978-3-642-20844-7_7


Jain, B. and Obermayer, K. (2011). Generalized Learning Graph Quantization. Graph-Based Representations in Pattern Recognition. Springer Berlin Heidelberg, 122-131.,10.1007/978-3-642-20844-7_13


Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions