Concept

Bing Liu (computer scientist)

Bing Liu (born 1963) is a Chinese-American professor of computer science who specializes in data mining, machine learning, and natural language processing. In 2002, he became a scholar at University of Illinois at Chicago. He holds a PhD from the University of Edinburgh (1988). His PhD advisors were Austin Tate and Kenneth Williamson Currie, and his PhD thesis was titled Reinforcement Planning for Resource Allocation and Constraint Satisfaction. He developed a mathematical model that can reveal fake advertising. Also, he teaches the course "Data Mining" during the Fall and Spring semesters at UIC. The course usually involves a project and various quiz/examinations as grading criteria. He is best known for his research on sentiment analysis (also called opinion mining), fake/deceptive opinion detection, and using association rules for prediction. He also made important contributions to learning from positive and unlabeled examples (or PU learning), Web data extraction, and interestingness in data mining. Two of his research papers published in KDD-1998 and KDD-2004 received KDD Test-of-Time awards in 2014 and 2015. In 2013, he was elected chair of SIGKDD, ACM Special Interest Group on Knowledge Discovery and Data Mining. Association rule-based classification takes into account the relationships between each item in a dataset and the class into which one is trying to classify that item. The basis is that there are two classes, a positive class and a negative class, into which one classifies items. Some classification algorithms only check if a case/item is in the positive class, without understanding how much exactly the probability of it being in that class is. Liu and his collaborators described a new association rule-based classification algorithm that takes into account the relationship between items and the positive and negative classes. Each item is given a probability or scoring of being in the positive class or the negative class. It then ranks the items as per which ones would be most likely to be in the positive class.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.