Kai Puolamäki

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jussi Korpela

> Home > Persons > Kai Puolamäki

Publications

2017
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/sdm/KorpelaOPU17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sdm/KorpelaOPU17
Jussi Korpela, Emilia Oikarinen, Kai Puolamäki, Antti Ukkonen:
Multivariate Confidence Intervals. SDM 2017: 696-704
2016
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/datamine/KorpelaHAKP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/datamine/KorpelaHAKP16
Jussi Korpela, Andreas Henelius, Lauri Ahonen, Arto Klami, Kai Puolamäki:
Using regression makes extraction of shared variation in multiple datasets easy. Data Min. Knowl. Discov. 30(5): 1112-1133 (2016)
2014
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/datamine/KorpelaPG14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/datamine/KorpelaPG14
Jussi Korpela, Kai Puolamäki, Aristides Gionis:
Confidence bands for time series data. Data Min. Knowl. Discov. 28(5-6): 1530-1553 (2014)
2013
[c16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/pkdd/HeneliusKP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pkdd/HeneliusKP13
Andreas Henelius, Jussi Korpela, Kai Puolamäki:
Explaining Interval Sequences by Randomization. ECML/PKDD (1) 2013: 337-352

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.