Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Raul Kompass

dblp:21/4058 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Robot navigation and mapping · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › active perception
active recognition
0.112007
MESH-Based Active Monte Carlo Recognition (MESH-AMCR) · IJCAI 2007
Algorithms and data structures › randomized algorithms
monte carlo methods
0.012007
MESH-Based Active Monte Carlo Recognition (MESH-AMCR) · IJCAI 2007

Methods — techniques the papers use, named apart from their topics

monte carlo · 0.1
YearPublicationVenuePosition
2007 MESH-Based Active Monte Carlo Recognition (MESH-AMCR)
Felix von Hundelshausen, Hans-Joachim Wünsche, Marco Block, Raul Kompass, Raúl Rojas 0001
IJCAI4
2007 A Generalized Divergence Measure for Nonnegative Matrix Factorization
abstract
This letter presents a general parametric divergence measure. The metric includes as special cases quadratic error and Kullback-Leibler divergence. A parametric generalization of the two different multiplicative update rules for nonnegative matrix factorization by Lee and Seung (2001) is shown to lead to locally optimal solutions of the nonnegative matrix factorization problem with this new cost function. Numeric simulations demonstrate that the new update rule may improve the quadratic distance convergence speed. A proof of convergence is given that, as in Lee and Seung, uses an auxiliary function known from the expectation-maximization theoretical framework.
Raul Kompass
Neural Comput.1