Demo Data from VLDB 2026 / reviewers in the wild / expert
Kari Vasko
dblp:89/3002
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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 · 100% | |
| Artificial intelligence
1 paper |
Learning theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory
model selection |
0.0 | 1 | 2002 | Estimating the number of segments in time series data using permutation tests · ICDM 2002 |
Data mining
time series analysis |
0.0 | 1 | 2002 | Estimating the number of segments in time series data using permutation tests · ICDM 2002 |
Data mining › time series analysis
time series segmentation |
0.0 | 1 | 2002 | Estimating the number of segments in time series data using permutation tests · ICDM 2002 |
Methods — techniques the papers use, named apart from their topics
permutation testing · 0.1monte carlo cross-validation · 0.1BIC · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Estimating the number of segments in time series data using permutation testsabstractSegmentation is a popular technique for discovering structure in time series data. We address the largely open problem of estimating the number of segments that can be reliably discovered. We introduce a novel method for the problem, called Pete. Pete is based on permutation testing. The problem is an instance of model (dimension) selection. The proposed method analyzes the possible overfit of a model to the available data rather than using a term for penalizing model complexity. In this respect the approach is more similar to cross-validation than regularization based techniques (e.g., AIC, BIC, MDL, MML). Furthermore, the method produces a p value for each increase in the number of segments. This gives the user an overview of the statistical significance of segmentations. We evaluate the performance of the proposed method using both synthetic and real time series data. The experiments show that permutation testing gives realistic results for the number of reliably identifiable segments and compares favorably with Monte Carlo cross-validation (MCCV) and commonly used BIC criteria. Kari Vasko, Hannu Toivonen |
ICDM | 1 |
| 2000 | Gene Mapping by Haplotype Pattern MiningabstractGenetic markers are being increasingly utilized in gene mapping. The discovery of associations between markers and patient phenotypes - such as a disease status - enables the identification of potential disease gene loci. The rationale is that, in diseases with a reasonable genetic contribution, diseased individuals are more likely to have associated marker alleles near the disease susceptibility gene than control individuals. We describe a new gene mapping method-haplotype pattern mining (HPM) - that is based on discovering recurrent marker patterns. We define a class of useful haplotype patterns in genetic case-control data, give an algorithm for finding disease-associated haplotypes, and show how to use them to identify disease susceptibility loci. Experimental studies show that the method has good localization power in data sets with large degrees of phenocopies and with lots of missing and erroneous data. We also demonstrate how the method can be used to discover several genes simultaneously. Hannu Toivonen, Paivi Onkamo, Kari Vasko, Vesa Ollikainen, Petteri Sevon, Heikki Mannila, Juha Kere |
BIBE | 3 |