Demo Data from EDBT 2026 / reviewers in the wild / expert
Majin Liu
dblp:02/8166
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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 |
Data mining · 70% Information retrieval · 23% Data stream processing · 7% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › pattern mining › temporal pattern mining
event pattern mining |
0.1 | 1 | 2010 | An algorithmic approach to event summarization · SIGMOD Conference 2010 |
Information retrieval › text summarization
event summarization |
0.1 | 1 | 2010 | An algorithmic approach to event summarization · SIGMOD Conference 2010 |
Data mining › probabilistic graphical models
hidden markov model |
0.1 | 1 | 2010 | An algorithmic approach to event summarization · SIGMOD Conference 2010 |
Data mining
pattern mining |
0.1 | 1 | 2010 | An algorithmic approach to event summarization · SIGMOD Conference 2010 |
Methods — techniques the papers use, named apart from their topics
minimum description length · 0.1hidden markov model · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | An algorithmic approach to event summarizationabstractRecently, much study has been directed toward summarizing event data, in the hope that the summary will lead us to a better understanding of the system that generates the events. However, instead of offering a global picture of the system, the summary obtained by most current approaches are piecewise, each describing an isolated snapshot of the system. We argue that the best summary, both in terms of its minimal description length and its interpretability, is the one obtained with the understanding of the internal dynamics of the system. Such understanding includes, for example, what are the internal states of the system, and how the system alternates among these states. In this paper, we adopt an algorithmic approach for event data summarization. More specifically, we use a hidden Markov model to describe the event generation process. We show that summarizing events based on the learned hidden Markov Model achieves short description length and high interpretability. Experiments show that our approach is both efficient and effective. Peng Wang 0027, Haixun Wang, Majin Liu, Wei Wang 0009 |
SIGMOD Conference | 3 |