Jens Lehmann
Auto-generated profile, based on publicly available information

Jens Lehmann

Faculty of Computer Science, TUD Dresden University of Technology, Dresden, Germany

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2007
Verified
Book Chapter
Closed access
PDF file
SASören Auer
Sören Auer
CBChristian Bizer
Christian Bizer
GKGeorgi Kobilarov
Georgi Kobilarov
JLJens Lehmann
Jens Lehmann
RCRichard Cyganiak
Richard Cyganiak
ZIZachary Ives
Zachary Ives

1 January 2015 in Semantic Web: – Interoperability, Usability, Applicability
Verified
Journal Article
Closed access
PDF file
JLJens Lehmann
Jens Lehmann
RIRobert Isele
Robert Isele
MJMax Jakob
Max Jakob
AJAnja Jentzsch
Anja Jentzsch
DKDimitris Kontokostas
Dimitris Kontokostas
CBChristian Bizer
Christian Bizer
The DBpedia community project extracts structured, multilingual knowledge from Wikipedia and makes it freely available on the Web using Semantic Web and Linked Data technologies. The project extracts knowledge from 111 different language editions of

1 September 2009 in Journal of Web Semantics
Verified
Journal Article
Closed access
CBChristian Bizer
Christian Bizer
JLJens Lehmann
Jens Lehmann
GKGeorgi Kobilarov
Georgi Kobilarov
SASören Auer
Sören Auer
CBChristian Becker
Christian Becker
SHSebastian Hellmann
Sebastian Hellmann

17 March 2015 in Semantic Web: – Interoperability, Usability, Applicability
Verified
Journal Article
Closed access
PDF file
AZAmrapali Zaveri
Amrapali Zaveri
ARA. Rula
A. Rula
AMA. Maurino
A. Maurino
.P.Ricardo Pietrobon
.Ricardo Pietrobon
JLJ. Lehmann
J. Lehmann
SAS. Auer
S. Auer
The development and standardization of Semantic Web technologies has resulted in an unprecedented volume of data being published on the Web as Linked Data (LD). However, we observe widely varying data quality ranging from extensively curated datasets

16 April 2012
Verified
Conference Paper
Open access
CUChristina Unger
Christina Unger
LBLorenz Bühmann
Lorenz Bühmann
JLJens Lehmann
Jens Lehmann
ANAxel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo
DGDaniel Gerber
Daniel Gerber
PCPhilipp Cimiano
Philipp Cimiano

13 September 2019 in ACM Computing Surveys
Verified
Journal Article
Open access
PDF file
ALAna Carolina Lorena
Ana Carolina Lorena
Luís Paulo Faina GarciaLuís Paulo Faina Garcia
Luís Paulo Faina Garcia
JLJens Lehmann
Jens Lehmann
MSMarcilio C. P. Souto
Marcilio C. P. Souto
THTin Kam Ho
Tin Kam Ho
Characteristics extracted from the training datasets of classification problems have proven to be effective predictors in a number of meta-analyses. Among them, measures of classification complexity can be used to estimate the difficulty in separating the data points into their expected classes. Descriptors of the spatial distribution of the data and estimates of the shape and size of the decision boundary are among the known measures for this characterization. This information can support the formulation of new data-driven pre-processing and pattern recognition techniques, which can in turn be focused on challenges highlighted by such characteristics of the problems. This article surveys and analyzes measures that can be extracted from the training datasets to characterize the complexity of the respective classification problems. Their use in recent literature is also reviewed and discussed, allowing to prospect opportunities for future work in the area. Finally, descriptions are given on an R package named Extended Complexity Library (ECoL) that implements a set of complexity measures and is made publicly available.