skip to main content
10.1145/3357384.3357856acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

MiCRon: Making Sense of News via Relationship Subgraphs

Published:03 November 2019Publication History

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.

References

  1. 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 ScholarGoogle Scholar
  2. 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 ScholarGoogle Scholar
  3. 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 ScholarGoogle Scholar
  4. 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 ScholarGoogle Scholar
  5. Gong Cheng, Daxin Liu, and Yuzhong Qu. 2016. Efficient Algorithms for Association Finding and Frequent Association Pattern Mining. In ISWC. 119--134.Google ScholarGoogle Scholar
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. David Corney, Dyaa Albakour, Miguel Martinez-Alvarez, and Samir Moussa. 2016. What do a Million News Articles Look like?. In NewsIR. 42--47.Google ScholarGoogle Scholar
  9. 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 ScholarGoogle Scholar
  10. M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle Scholar
  12. Edmund Ihler. 1991. The Complexity of Approximating the Class Steiner Tree Problem. In WG. 85--96.Google ScholarGoogle Scholar
  13. Gjergji Kasneci, Shady Elbassuoni, and Gerhard Weikum. 2009a. MING: mining informative entity relationship subgraphs. In CIKM. 1653--1656.Google ScholarGoogle Scholar
  14. 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 ScholarGoogle Scholar
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarCross RefCross Ref
  20. Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. 2016. Efficient and Progressive Group Steiner Tree Search. In SIGMOD. 91--106.Google ScholarGoogle Scholar
  21. 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 ScholarGoogle Scholar
  22. 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 ScholarGoogle Scholar
  23. 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 ScholarGoogle Scholar
  24. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  25. Hanghang Tong and Christos Faloutsos. 2006. Center-piece subgraphs: problem definition and fast solutions. In SIGKDD. 404--413.Google ScholarGoogle Scholar
  26. 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 ScholarGoogle Scholar

Index Terms

  1. MiCRon: Making Sense of News via Relationship Subgraphs

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        CIKM '19: Proceedings of the 28th ACM International Conference on Information and Knowledge Management
        November 2019
        3373 pages
        ISBN:9781450369763
        DOI:10.1145/3357384

        Copyright © 2019 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 3 November 2019

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        CIKM '19 Paper Acceptance Rate202of1,031submissions,20%Overall Acceptance Rate1,861of8,427submissions,22%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader