Robert Kennes

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

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:54/68 · DBLP profile ↗

← Back

6ranked-venue papers

4as first author

0since 2021 · last 1994

—ORCID · none

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

Artificial intelligence and machine learning · 5 · 3 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

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

Knowledge representation and reasoning · 50% Trustworthy machine learning · 38% Probabilistic and Bayesian machine learning · 12%

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

Topic	Papers	Last	Evidence papers
Machine learning › Trustworthy machine learning › uncertainty modeling transferable belief model	1	1994	The Transferable Belief Model · Artif. Intell. 1994
Knowledge, reasoning and agents › Knowledge representation and reasoning uncertainty reasoning	1	1994	The Transferable Belief Model · Artif. Intell. 1994
Machine learning › Probabilistic and Bayesian machine learning › statistical inference bayesian inference	1	1994	The Transferable Belief Model · Artif. Intell. 1994
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief change belief update	1	1994	The Transferable Belief Model · Artif. Intell. 1994

Year	Publication	Venue	Position
1994	The Transferable Belief Model Philippe Smets, Robert Kennes	Artif. Intell.	2
1992	Computational aspects of the Mobius transformation of graphs abstract Mobius transformations are defined and studied in the framework of general binary relations. From the application point of view fast Mobius transformation algorithms are presented for computing the Mobius transformation of the Boolean lattice. It is proved that they are actually the best algorithms among a large class of algorithms. These algorithms have a polynomial routine, whereas the usual algorithms have an exponential routine. From a theoretical point of view, the major point of the study is the functoriality of the Mobius transformation, which implies that it is recursive. An algorithm for computing Dempster's rule of combination that is much faster than the usual one is obtained. A series of related fast algorithms for Dempster-Shafer theory is included.> Robert Kennes	IEEE Trans. Syst. Man Cybern.	1
1991	The Transferable Belief Model Philippe Smets, Yen-Teh Hsia, Alessandro Saffiotti, Robert Kennes, Elizabeth Umkehrer	ECSQARU	4
1991	Evidential Reasoning in a Categorial Perspective Robert Kennes	UAI	1
1990	Fast Algorithms for Dempster-Shafer Theory Robert Kennes, Philippe Smets	IPMU	1
1990	Computational aspects of the Mobius transformation Robert Kennes, Philippe Smets	UAI	1