Sciweavers

4313 search results - page 337 / 863
» Using time travel to diagnose computer problems
Sort
View
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
15 years 6 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
EKNOW
2009
15 years 5 months ago
The Method for a Summarization of Product Reviews Using the User's Opinion
As the number of transactions in E-market places is growing, more and more product information and product reviews are posted on the Internet. Because customers want to purchase go...
Jung-Yeon Yang, Jaeseok Myung, Sang-goo Lee
WWW
2007
ACM
16 years 8 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
ICRA
2009
IEEE
227views Robotics» more  ICRA 2009»
16 years 2 months ago
Adaptive autonomous control using online value iteration with gaussian processes
— In this paper, we present a novel approach to controlling a robotic system online from scratch based on the reinforcement learning principle. In contrast to other approaches, o...
Axel Rottmann, Wolfram Burgard
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
16 years 1 months ago
An experimental analysis of evolution strategies and particle swarm optimisers using design of experiments
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...
Oliver Kramer, Bartek Gloger, Andreas Goebels