Sciweavers

683 search results - page 116 / 137
» Generalization Bounds for Learning Kernels
Sort
View
EKAW
2008
Springer
13 years 9 months ago
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Christian Meilicke, Johanna Völker, Heiner St...
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
12 years 2 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
ICCV
2009
IEEE
15 years 10 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
14 years 29 days ago
Supervised Learning of Places from Range Data using AdaBoost
— This paper addresses the problem of classifying places in the environment of a mobile robot into semantic categories. We believe that semantic information about the type of pla...
Óscar Martínez Mozos, Cyrill Stachni...
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
13 years 12 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...