Lecture

Entity Disambiguation and Link Prediction

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CS-423: Distributed information systems

This course introduces the foundations of information retrieval, data mining and knowledge bases, which constitute the foundations of today's Web-based distributed information systems. ...

Description

This lecture covers the concepts of entity disambiguation, linking text mentions to knowledge bases, and link prediction in knowledge graphs. It discusses challenges like homonyms and synonyms, using examples from Wikipedia entries. The instructor explains the Personalized PageRank algorithm, coherence in node selection, and scoring methods for entity disambiguation. The lecture also explores computing Personalized PageRank, considering popularity measures for nodes, and presents results comparing different disambiguation methods.

Instructor

Karl Aberer

Karl Aberer received his PhD in mathematics in 1991 from the ETH Zürich. From 1991 to 1992 he was postdoctoral fellow at the International Computer Science Institute (ICSI) at the University of California, Berkeley. In 1992, he joined the Integrated Publication and Information Systems institute (IPSI) of GMD in Germany, where he was leading the research division Open Adaptive Information Management Systems. In 2000 he joined EPFL as full professor. Since 2005 he is the director of the Swiss National Research Center for Mobile Information and Communication Systems ( NCCR-MICS, www.mics.ch ). He is member of the editorial boards of VLDB Journal, ACM Transaction on Autonomous and Adaptive Systems and World Wide Web Journal. He has been consulting for the Swiss government in research and science policy as a member of the Swiss Research and Technology Council ( SWTR ) from 2003 - 2011.

Official source

Related concepts (32)

Word-sense disambiguation

Word-sense disambiguation (WSD) is the process of identifying which sense of a word is meant in a sentence or other segment of context. In human language processing and cognition, it is usually subconscious/automatic but can often come to conscious attention when ambiguity impairs clarity of communication, given the pervasive polysemy in natural language. In computational linguistics, it is an open problem that affects other computer-related writing, such as discourse, improving relevance of search engines, anaphora resolution, coherence, and inference.

Synonym

A synonym is a word, morpheme, or phrase that means exactly or nearly the same as another word, morpheme, or phrase in a given language. For example, in the English language, the words begin, start, commence, and initiate are all synonyms of one another: they are synonymous. The standard test for synonymy is substitution: one form can be replaced by another in a sentence without changing its meaning. Words are considered synonymous in only one particular sense: for example, long and extended in the context long time or extended time are synonymous, but long cannot be used in the phrase extended family.

Named-entity recognition

Named-entity recognition (NER) (also known as (named) entity identification, entity chunking, and entity extraction) is a subtask of information extraction that seeks to locate and classify named entities mentioned in unstructured text into pre-defined categories such as person names, organizations, locations, medical codes, time expressions, quantities, monetary values, percentages, etc. Most research on NER/NEE systems has been structured as taking an unannotated block of text, such as this one: Jim bought 300 shares of Acme Corp.

Polysemy

Polysemy (pəˈlɪsᵻmi or ˈpɒlᵻˌsiːmi; ) is the capacity for a sign (e.g. a symbol, a morpheme, a word, or a phrase) to have multiple related meanings. For example, a word can have several word senses. Polysemy is distinct from monosemy, where a word has a single meaning. Polysemy is distinct from homonymy—or homophony—which is an accidental similarity between two or more words (such as bear the animal, and the verb bear); whereas homonymy is a mere linguistic coincidence, polysemy is not.

Homograph

A homograph (from the ὁμός, homós, "same" and γράφω, gráphō, "write") is a word that shares the same written form as another word but has a different meaning. However, some dictionaries insist that the words must also be pronounced differently, while the Oxford English Dictionary says that the words should also be of "different origin". In this vein, The Oxford Guide to Practical Lexicography lists various types of homographs, including those in which the words are discriminated by being in a different word class, such as hit, the verb to strike, and hit, the noun a blow.

Related lectures (44)

Information Extraction & Knowledge Inference

Explores information extraction, knowledge inference, taxonomy induction, and entity disambiguation.

Entity Disambiguation

Explores Entity Disambiguation, linking text mentions to a knowledge base, coherence in entity graphs, and Personalized PageRank.

Knowledge Inference: Entity Disambiguation and Graph Embeddings

Explores entity disambiguation, graph embeddings, scoring functions, and learning methods.