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

Jonathan Lajus

dblp:147/2938 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 3 first-authorApplied, interdisciplinary, general and emerging 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.

Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge graphs › knowledge graph quality
knowledge base completeness
0.312018
Are All People Married?: Determining Obligatory Attributes in Knowledge Bases · WWW 2018
YearPublicationVenuePosition
2020 Fast and Exact Rule Mining with AMIE 3
Jonathan Lajus, Luis Galárraga, Fabian M. Suchanek
ESWC1
2018 Are All People Married?: Determining Obligatory Attributes in Knowledge Bases
abstract
An attribute is obligatory for a class in a Knowledge Base (KB), if all instances of the class have the attribute in the real world. For example, has­Birth­Date is an obligatory attribute for the class Person, while has ­ Spouse is not. In this paper, we propose a new way to model incompleteness in KBs. From this model, we derive a method to automatically determine obligatory attributes -- using only the data from the KB. Our algorithm can detect such attributes with a precision of up to 90%.
Jonathan Lajus, Fabian M. Suchanek
WWW1
2014 Efficient data management and statistics with zero-copy integration
abstract
Statistical analysts have long been struggling with evergrowing data volumes. While specialized data management systems such as relational databases would be able to handle the data, statistical analysis tools are far more convenient to express complex data analyses. An integration of these two classes of systems has the potential to overcome the data management issue while at the same time keeping analysis convenient. However, one must keep a careful eye on implementation overheads such as serialization. In this paper, we propose the in-process integration of data management and analytical tools. Furthermore, we argue that a zero-copy integration is feasible due to the omnipresence of C-style arrays containing native types. We discuss the general concept and present a prototype of this integration based on the columnar relational database MonetDB and the R environment for statistical computing. We evaluate the performance of this prototype in a series of micro-benchmarks of common data management tasks.
Jonathan Lajus, Hannes Mühleisen
SSDBM1