Jessica Lin 0001

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 Yuan Li

> Home > Persons > Jessica Lin 0001

Publications

2012
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/jiis/0001KL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jiis/0001KL12
Jessica Lin, Rohan Khade, Yuan Li:
Rotation-invariant similarity in time series using bag-of-patterns representation. J. Intell. Inf. Syst. 39(2): 287-315 (2012)
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/sdm/LiLO12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sdm/LiLO12
Yuan Li, Jessica Lin, Tim Oates:
Visualizing Variable-Length Time Series Motifs. SDM 2012: 895-906
2010
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/cbms/LinL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cbms/LinL10
Jessica Lin, Yuan Li:
Finding approximate frequent patterns in streaming medical data. CBMS 2010: 13-18
2009
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/cbms/LinL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cbms/LinL09
Jessica Lin, Yuan Li:
Finding structurally different medical data. CBMS 2009: 1-8
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/ssdbm/LinL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ssdbm/LinL09
Jessica Lin, Yuan Li:
Finding Structural Similarity in Time Series Data Using Bag-of-Patterns Representation. SSDBM 2009: 461-477

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.