Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mike Zaharkin

dblp:243/0326 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge graphs › knowledge graph construction
enterprise knowledge graph
0.412019
Building and Querying an Enterprise Knowledge Graph · IEEE Trans. Serv. Comput. 2019
Knowledge graphs
knowledge graph construction
0.412019
Building and Querying an Enterprise Knowledge Graph · IEEE Trans. Serv. Comput. 2019
Knowledge graphs
knowledge graph querying
0.412019
Building and Querying an Enterprise Knowledge Graph · IEEE Trans. Serv. Comput. 2019
Knowledge graphs
entity linking
0.112019
Building and Querying an Enterprise Knowledge Graph · IEEE Trans. Serv. Comput. 2019

Methods — techniques the papers use, named apart from their topics

natural language translation to queries · 0.8RDF modeling · 0.8
YearPublicationVenuePosition
2019 Building and Querying an Enterprise Knowledge Graph
abstract
Information providers are faced with a critical challenge to process, retrieve and present information to their users in order to satisfy their complex information needs, because data has been increasing in an unprecedented manner, coming from diverse sources, and covering a variety of domains in heterogeneous formats. In this paper, we present Thomson Reuters' effort in developing a family of services for building and querying an enterprise knowledge graph in order to address this challenge. We first acquire data from various sources via different approaches. Furthermore, we mine useful information from the data by adopting a variety of techniques, including Named Entity Recognition and Relation Extraction; such mined information is further integrated with existing structured data (e.g., via Entity Linking techniques) in order to obtain relatively comprehensive descriptions of the entities. By modeling the data as an RDF graph model, we enable easy data management and the embedding of rich semantics in our data. Finally, in order to facilitate the querying of this mined and integrated data, i.e., the knowledge graph, we propose TR Discover, a natural language interface that allows users to ask questions of our knowledge graph in their own words; such natural language questions are then translated into executable queries for answer retrieval. We evaluate our services, i.e., named entity recognition, relation extraction, entity linking and natural language interface, on real-world datasets, and demonstrate and discuss their practicability and limitations.
Dezhao Song, Frank Schilder, Shai Hertz, Giuseppe Saltini, Charese Smiley, Phani Nivarthi, Oren Hazai, Dudi Landau, Mike Zaharkin, Tom Zielund, Hugo Molina-Salgado, Chris Brew, Dan Bennett
IEEE Trans. Serv. Comput.9