Arto Kaarna

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 Aidin Hassanzadeh

> Home > Persons > Arto Kaarna

Publications

2018
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/asc/HassanzadehKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/asc/HassanzadehKK18
Aidin Hassanzadeh, Arto Kaarna, Tuomo Kauranne:
Sequential spectral clustering of hyperspectral remote sensing image over bipartite graph. Appl. Soft Comput. 73: 727-734 (2018)
2017
[c41]
- view
  authority control:
- export record
  dblp key:
  - conf/scia/HassanzadehKK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/scia/HassanzadehKK17
Aidin Hassanzadeh, Arto Kaarna, Tuomo Kauranne:
Unsupervised Multi-manifold Classification of Hyperspectral Remote Sensing Images with Contractive Autoencoder. SCIA (2) 2017: 169-180
2016
[c40]
- view
  authority control:
- export record
  dblp key:
  - conf/igarss/HassanzadehKK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/igarss/HassanzadehKK16
Aidin Hassanzadeh, Tuomo Kauranne, Arto Kaarna:
A multi-manifold clustering algorithm for hyperspectral remote sensing imagery. IGARSS 2016: 3326-3329
[c39]
- view
  authority control:
- export record
  dblp key:
  - conf/sspr/HassanzadehKK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sspr/HassanzadehKK16
Aidin Hassanzadeh, Arto Kaarna, Tuomo Kauranne:
Outlier Robust Geodesic K-means Algorithm for High Dimensional Data. S+SSPR 2016: 252-262

a service of

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.