The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Unsupervised generation of data mining features from linked open data
Abstract
The quality of the results of a data mining process strongly depends on the quality of the data it processes. A good result is more likely to obtain the more useful background knowledge there is in a dataset. In this paper, we present a fully automatic approach for enriching data with features that are derived from Linked Open Data, a very large, openly available data collection. We identify six different types of feature generators, which are implemented in our open-source tool FeGeLOD. In four case studies, we show that our approach can be applied to different problems, ranging from classical data mining to ontology learning and ontology matching on the semantic web. The results show that features generated from publicly available information may allow data mining in problems where features are not available at all, as well as help improving the results for tasks where some features are already available.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
Cited by
Modeling Relational Data with Graph Convolutional Networks
Schlichtkrull, M., Kipf, T. N., Bloem, P., van den Berg, R., Titov, I., & Welling, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93417-4_38 · Cited by 5,570
Knowledge graph refinement: A survey of approaches and evaluation methods
Paulheim, H. (2016) · Semantic Web · doi:10.3233/sw-160218 · Cited by 849
Self-citationComposition-based Multi-Relational Graph Convolutional Networks
Vashishth, S., Sanyal, S., Nitin, V., & Talukdar, P. (2019) · arXiv · doi:10.48550/arxiv.1911.03082 · Cited by 581
Deep feature synthesis: Towards automating data science endeavors
Kanter, J. M., & Veeramachaneni, K. (2015) · 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa.2015.7344858 · Cited by 421
RDF2Vec: RDF Graph Embeddings for Data Mining
Ristoski, P., & Paulheim, H. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46523-4_30 · Cited by 413
Self-citation
Metadata
- Authors
- Paulheim, H., & Fümkranz, J.
- Venue
- Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics
- Publisher
- ACM
- Published
- 2012-06-13
- Pages
- 1-12
- OpenAlex
- W2087159174
- Cited by
- 162
- References
- 2
- FWCI
- 13.79
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unsupervised generation of data mining features from linked open data. https://app.cochat.ai/papers/10.1145/2254129.2254168
- The paper
- Paulheim, H., & Fümkranz, J. (2012). Unsupervised generation of data mining features from linked open data. Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics. https://doi.org/10.1145/2254129.2254168
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.