ABSTRACT
Knowledge graphs (KGs) have been extensively used to annotate text, e.g., news articles, in order to enhance its comprehension by readers. This requires to map entities occurring in the news to the target entities of the KG and to extract a so-called relationship sub-graph (RSG) that spans these entities. RSG extraction is computationally demanding and cannot scale to large KGs. Existing approximation algorithms that focus on structurally compact RSGs are not satisfactory since they often return no answers. We address this problem and develop an efficient algorithm to find approximations that connect the most salient subset of the target entities. Moreover, we propose a context-aware method to rank RSGs by their relevance to the news and their semantic cohesion. In the demo we will present our approach and the attendees will be able to experience how our system MiCRon helps to make sense of news article by computing and presenting RSGs relevant to these articles.
- Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349--360.Google Scholar
- Marcelo Arenas, Bernardo Cuenca Grau, Evgeny Kharlamov, Sarunas Marciuska, and Dmitriy Zheleznyakov. 2016. Faceted search over RDF-based knowledge graphs. J. Web Semant. , Vol. 37--38 (2016), 55--74.Google Scholar
- Bruno Charron, Yu Hirate, David Purcell, and Martin Rezk. 2016. Extracting Semantic Information for e-Commerce. In The Semantic Web - ISWC 2016 - 15th International Semantic Web Conference, Kobe, Japan, October 17--21, 2016, Proceedings, Part II. 273--290.Google Scholar
- Chen Chen, Guoren Wang, Huilin Liu, Junchang Xin, and Ye Yuan. 2011. SISP: a new framework for searching the informative subgraph based on PSO. In CIKM. 453--462.Google Scholar
- Gong Cheng, Daxin Liu, and Yuzhong Qu. 2016. Efficient Algorithms for Association Finding and Frequent Association Pattern Mining. In ISWC. 119--134.Google Scholar
- Gong Cheng, Fei Shao, and Yuzhong Qu. 2017. An Empirical Evaluation of Techniques for Ranking Semantic Associations. IEEE Trans. Knowl. Data Eng. , Vol. 29, 11 (2017), 2388--2401.Google ScholarDigital Library
- Joel Coffman and Alfred C. Weaver. 2014. An Empirical Performance Evaluation of Relational Keyword Search Techniques. IEEE Trans. Knowl. Data Eng. , Vol. 26, 1 (2014), 30--42.Google ScholarDigital Library
- David Corney, Dyaa Albakour, Miguel Martinez-Alvarez, and Samir Moussa. 2016. What do a Million News Articles Look like?. In NewsIR. 42--47.Google Scholar
- Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. 2007. Finding Top-k Min-Cost Connected Trees in Databases. In ICDE. 836--845.Google Scholar
- M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman.Google ScholarDigital Library
- Vinh Thinh Ho, Daria Stepanova, Mohamed H. Gad-Elrab, Evgeny Kharlamov, and Gerhard Weikum. 2018. Rule Learning from Knowledge Graphs Guided by Embedding Models. In ISWC. 72--90.Google Scholar
- Edmund Ihler. 1991. The Complexity of Approximating the Class Steiner Tree Problem. In WG. 85--96.Google Scholar
- Gjergji Kasneci, Shady Elbassuoni, and Gerhard Weikum. 2009a. MING: mining informative entity relationship subgraphs. In CIKM. 1653--1656.Google Scholar
- Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabian M. Suchanek, and Gerhard Weikum. 2009b. STAR: Steiner-Tree Approximation in Relationship Graphs. In ICDE. 868--879.Google Scholar
- Evgeny Kharlamov, Dag Hovland, Martin G. Skjæveland, Dimitris Bilidas, Ernesto Jimé nez-Ruiz, Guohui Xiao, Ahmet Soylu, Davide Lanti, Martin Rezk, Dmitriy Zheleznyakov, Martin Giese, Hallstein Lie, Yannis E. Ioannidis, Yannis Kotidis, Manolis Koubarakis, and Arild Waaler. 2017a. Ontology Based Data Access in Statoil . J. Web Semant. , Vol. 44 (2017), 3--36.Google ScholarDigital Library
- Evgeny Kharlamov, Yannis Kotidis, Theofilos Mailis, Christian Neuenstadt, Charalampos Nikolaou, Ö zgü r L. Ö zcc ep, Christoforos Svingos, Dmitriy Zheleznyakov, Yannis E. Ioannidis, Steffen Lamparter, Ralf Mö ller, and Arild Waaler. 2019 a. An ontology-mediated analytics-aware approach to support monitoring and diagnostics of static and streaming data. J. Web Semant. , Vol. 56 (2019), 30--55.Google ScholarDigital Library
- Evgeny Kharlamov, Theofilos Mailis, Gulnar Mehdi, Christian Neuenstadt, Ö zgü r L. Ö zcc ep, Mikhail Roshchin, Nina Solomakhina, Ahmet Soylu, Christoforos Svingos, Sebastian Brandt, Martin Giese, Yannis E. Ioannidis, Steffen Lamparter, Ralf Mö ller, Yannis Kotidis, and Arild Waaler. 2017b. Semantic access to streaming and static data at Siemens . J. Web Semant. , Vol. 44 (2017), 54--74.Google ScholarDigital Library
- Evgeny Kharlamov, Gulnar Mehdi, Ognjen Savkovic, Guohui Xiao, Elem Gü zel Kalayci, and Mikhail Roshchin. 2019 b. Semantically-enhanced rule-based diagnostics for industrial Internet of Things: The SDRL language and case study for Siemens trains and turbines. J. Web Semant. , Vol. 56 (2019), 11--29.Google ScholarDigital Library
- Jens Lehmann, Robert Isele, Max Jakob, Anja Jentzsch, Dimitris Kontokostas, Pablo N. Mendes, Sebastian Hellmann, Mohamed Morsey, Patrick van Kleef, Sö ren Auer, and Christian Bizer. 2015. DBpedia - A large-scale, multilingual knowledge base extracted from Wikipedia. Sem. Web , Vol. 6, 2 (2015), 167--195.Google ScholarCross Ref
- Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. 2016. Efficient and Progressive Group Steiner Tree Search. In SIGMOD. 91--106.Google Scholar
- Pablo N. Mendes, Max Jakob, André s Garc'i a-Silva, and Christian Bizer. 2011. DBpedia spotlight: shedding light on the web of documents. In I-SEMANTICS. 1--8.Google Scholar
- Yuan Ni, Qiong Kai Xu, Feng Cao, Yosi Mass, Dafna Sheinwald, Huijia Zhu, and Shao Sheng Cao. 2016. Semantic Documents Relatedness using Concept Graph Representation. In WSDM. 635--644.Google Scholar
- Martin Ringsquandl, Evgeny Kharlamov, Daria Stepanova, Marcel Hildebrandt, Steffen Lamparter, Raffaello Lepratti, Ian Horrocks, and Peer Krö ger. 2018. Event-Enhanced Learning for KG Completion. In ESWC. 541--559.Google Scholar
- Ahmet Soylu, Evgeny Kharlamov, Dmitriy Zheleznyakov, Ernesto Jimé nez-Ruiz, Martin Giese, Martin G. Skjæveland, Dag Hovland, Rudolf Schlatte, Sebastian Brandt, Hallstein Lie, and Ian Horrocks. 2018. OptiqueVQS: A visual query system over ontologies for industry. Semantic Web , Vol. 9, 5 (2018), 627--660.Google ScholarDigital Library
- Hanghang Tong and Christos Faloutsos. 2006. Center-piece subgraphs: problem definition and fast solutions. In SIGKDD. 404--413.Google Scholar
- Alberto Tonon, Michele Catasta, Roman Prokofyev, Gianluca Demartini, Karl Aberer, and Philippe Cudré -Mauroux. 2016. Contextualized ranking of entity types based on knowledge graphs. J. Web Sem. , Vol. 37--38 (2016), 170--183.Google Scholar
Index Terms
- MiCRon: Making Sense of News via Relationship Subgraphs
Recommendations
Context-aware ranking in web search
SIGIR '10: Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrievalThe context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused on the development of context models or limited to a relatively small ...
Ranking Associative Entities in Knowledge Graph by Graphical Modeling of Frequent Patterns
Database Systems for Advanced ApplicationsAbstractRanking associative entities in Knowledge Graph (KG) is critical for entity-oriented tasks like entity recommendation and associative inference. Existing methods benefit from explicit linkages in KG w.r.t. exactly two query entities via the ...
An Entity Alignment Method Based on Graph Attention Network with Pre-classification
Web Information Systems and ApplicationsAbstractEntity alignment is the process of identifying entities that point to the same object in different knowledge graphs. Entity alignment is a key step in building knowledge graphs, and the result of entity alignment directly affects the quality of ...
Comments