Computer Science – Learning
Scientific paper
2012-04-19
Computer Science
Learning
arXiv admin note: substantial text overlap with arXiv:1001.0921
Scientific paper
Learning in Riemannian orbifolds is motivated by existing machine learning algorithms that directly operate on finite combinatorial structures such as point patterns, trees, and graphs. These methods, however, lack statistical justification. This contribution derives consistency results for learning problems in structured domains and thereby generalizes learning in vector spaces and manifolds.
Jain Brijnesh J.
Obermayer Klaus
No associations
LandOfFree
Learning in Riemannian Orbifolds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Learning in Riemannian Orbifolds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning in Riemannian Orbifolds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-34724