- Höffner, K., Walter, S., Marx, E., Usbeck, R., Lehmann, J. and Ngonga Ngomo, A.C. Survey on challenges of question answering in the semantic Web. Semantic Web 8, 6 (2017), 895--920.Google ScholarCross Ref
- Lin, Y., Liu, Z., Sun, M., Liu, Y. and Zhu, X. Learning entity and relation embeddings for knowledge graph completion. In Proceedings of the Assoc. Advancement of Artificial Intelligence 15, (2015), 2181--2187. Google ScholarDigital Library
- Nickel, M., Murphy, K., Tresp, V. and Gabrilovich, E. 2016. A review of relational machine learning for knowledge graphs. In Proceedings of the IEEE 104, 1 (2016), 11--33.Google ScholarCross Ref
- Paulheim, H., Knowledge graph refinement: a survey of approaches and evaluation methods. Semantic Web 8, 3 (2017), 489--508.Google Scholar
Index Terms
- Industry-scale knowledge graphs: lessons and challenges
Recommendations
Knowledge Sharing and Process Improvement in Large-Scale Agile Development
XP '16 Workshops: Proceedings of the Scientific Workshop Proceedings of XP2016When scaling agile development methods, the principle of continuous improvement is challenged since most practices to support it is described on the team level and not on the project level. In this study we compare practices from two published empirical ...
Survey on agile and lean usage in finnish software industry
ESEM '12: Proceedings of the ACM-IEEE international symposium on Empirical software engineering and measurementEarlier empirical studies have demonstrated the interest that agile methods have generated in the software industry. Currently, lean approaches are increasingly adopted for complementing agile methods in software processes. With the goal of providing up-...
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied MathematicsAbstractComparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Comments