Demo Data from EDBT 2026 / reviewers in the wild / expert
Michel Speiser
dblp:05/10814
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2012
0000-0002-0032-2427ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-author
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
2 papers |
Data mining · 68% Web and social media mining · 17% Information retrieval · 15% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
pattern mining |
0.3 | 2 | 2012 | On nested palindromes in clickstream data · KDD 2012 Ranking Web-Based Partial Orders by Significance Using a Markov Reference Model · ICDM 2011 |
Data mining › pattern mining
sequential pattern mining |
0.2 | 2 | 2012 | On nested palindromes in clickstream data · KDD 2012 Ranking Web-Based Partial Orders by Significance Using a Markov Reference Model · ICDM 2011 |
Web and social media mining › web usage mining
clickstream analysis |
0.1 | 1 | 2012 | On nested palindromes in clickstream data · KDD 2012 |
Data mining › pattern mining › structured pattern mining
partial order discovery |
0.1 | 1 | 2011 | Ranking Web-Based Partial Orders by Significance Using a Markov Reference Model · ICDM 2011 |
Information retrieval › evaluation
statistical significance testing |
0.1 | 1 | 2011 | Ranking Web-Based Partial Orders by Significance Using a Markov Reference Model · ICDM 2011 |
Algorithms and data structures › sequence algorithms › string algorithms
palindrome recognition |
0.0 | 1 | 2012 | On nested palindromes in clickstream data · KDD 2012 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.0 | 1 | 2012 | On nested palindromes in clickstream data · KDD 2012 |
Methods — techniques the papers use, named apart from their topics
linear-time pattern extraction · 0.3probabilistic generative model · 0.1markov reference model · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | On nested palindromes in clickstream dataabstractIn this paper we discuss an interesting and useful property of clickstream data. Often a visit includes repeated views of the same page. We show that in three real datasets, sampled from the websites of technology and consulting groups and a news broadcaster, page repetitions occur for the majority as a very specific structure, namely in the form of nested palindromes. This can be explained by the widespread use of features which are available in any web browser: the "refresh" and "back" buttons. Among the types of patterns which can be mined from sequence data, many either stumble if symbol repetitions are involved, or else fail to capture interesting aspects related to symbol repetitions. In an attempt to remedy this, we characterize the palindromic structures, and discuss possible ways of making use of them. One way is to pre-process the sequence data by explicitly inserting these structures, in order to obtain a richer output from conventional mining algorithms. Another application we discuss is to use the information directly, in order to analyze certain aspects of the website under study. We also provide the simple linear-time algorithm which we developed to identify and extract the structures from our data. Michel Speiser, Gianluca Antonini, Abderrahim Labbi, Juliana Sutanto |
KDD | 1 |
| 2011 | Ranking Web-Based Partial Orders by Significance Using a Markov Reference ModelabstractMining web traffic data has been addressed in literature mostly using sequential pattern mining techniques. Recently, a more powerful pattern called partial order was introduced, with the hope of providing a more compact result set. A further approach towards this goal, valid for both sequential patterns and partial orders, consists in building a statistical significance test for frequent patterns. Our method is based on probabilistic generative models and provides a direct way to rank the extracted patterns. It leaves open the number of patterns of interest, which depends on the application, but provides an alternative criterion to frequency of occurrence: statistical significance. In this paper, we focus on the construction of an algorithm which calculates the probability of partial orders under a first-order Markov reference model, and we show how to use those probabilities to assess the statistical significance of a set of mined partial orders. Michel Speiser, Gianluca Antonini, Abderrahim Labbi |
ICDM | 1 |