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

Baihan Shu

dblp:95/8814 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2

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
3 papers
Information retrieval · 52% Web and social media mining · 33% Data mining · 14%

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

TopicWeightPapersLastEvidence papers
Web and social media mining › event detection
burst detection
0.112012
EventSearch: a system for event discovery and retrieval on multi-type historical data · KDD 2012
Web and social media mining
event detection
0.112012
Identifying Event-related Bursts via Social Media Activities · EMNLP-CoNLL 2012
Information retrieval › document retrieval › temporal information retrieval
event retrieval
0.112012
EventSearch: a system for event discovery and retrieval on multi-type historical data · KDD 2012
Data mining › text mining
temporal text mining
0.112012
EventSearch: a system for event discovery and retrieval on multi-type historical data · KDD 2012
Information retrieval › evaluation › online evaluation
click-based evaluation
0.112011
Efficiently collecting relevance information from clickthroughs for web retrieval system evaluation · SIGIR 2011
Information retrieval › user behavior › search behavior
click model
0.112011
Efficiently collecting relevance information from clickthroughs for web retrieval system evaluation · SIGIR 2011
Information retrieval
evaluation
0.112011
Efficiently collecting relevance information from clickthroughs for web retrieval system evaluation · SIGIR 2011
Web and social media mining
social media analysis
0.012012
Identifying Event-related Bursts via Social Media Activities · EMNLP-CoNLL 2012

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

burst model · 0.1reordering · 0.1optimization · 0.1
YearPublicationVenuePosition
2012 Identifying Event-related Bursts via Social Media Activities
Wayne Xin Zhao, Baihan Shu, Jing Jiang 0001, Yang Song 0021, Hongfei Yan, Xiaoming Li 0001
EMNLP-CoNLL2
2012 EventSearch: a system for event discovery and retrieval on multi-type historical data
abstract
We present EventSearch, a system for event extraction and retrieval on four types of news-related historical data, i.e., Web news articles, newspapers, TV news program, and micro-blog short messages. The system incorporates over 11 million web pages extracted from "Web InfoMall", the Chinese Web Archive since 2001. The newspaper and TV news video clips also span from 2001 to 2011. The system, upon a user query, returns a list of event snippets from multiple data sources. A novel burst model is used to discover events from time-stamped texts. In addition to offline event extraction, our system also provides online event extraction to further meet the user needs. EventSearch provides meaningful analytics that synthesize an accurate description of events. Users interact with the system by ranking the identified events using different criteria (scale, recency and relevance) and submitting their own information needs in different input fields.
Dongdong Shan, Wayne Xin Zhao, Rishan Chen, Baihan Shu, Ziqi Wang 0002, Hongfei Yan, Xiaoming Li 0001
KDD4
2011 Efficiently collecting relevance information from clickthroughs for web retrieval system evaluation
abstract
Various click models have been recently proposed as a principled approach to infer the relevance of documents from the clickthrough data. The inferred document relevance is potentially useful in evaluating the Web retrieval systems. In practice, it generally requires to acquire the accurate evaluation results within minimal users' query submissions. This problem is important for speeding up search engine development and evaluation cycle and acquiring reliable evaluation results on tail queries. In this paper, we propose a reordering framework for efficient evaluation problem in the context of clickthrough based Web retrieval evaluation. The main idea is to move up the documents that contribute more for the evaluation task. In this framework, we propose four intuitions and formulate them as an optimization problem. Both user study and TREC data based experiments validate that the reordering framework results in much fewer query submissions to get accurate evaluation results with only a little harm to the users' utility.
Jing He 0010, Wayne Xin Zhao, Baihan Shu, Xiaoming Li 0001, Hongfei Yan
SIGIR3