finland facebook
S+SSPR 2014 SSPR SPR conference workshop university of eastern finland uef joint international workshops on statistical techniques in pattern recognition and structural and syntactic pattern recognition
Program

Link to electronic proceedings
Updated 14.8.


Wednesday
20.8.
Thursday
21.8.
Friday
22.8.
8:00 Registration
8:30
Opening
9:00 IAPR Keynote:
David Hand
Combining
and Selecting
IAPR Keynote:
Ali Shokoufandeh
10:00 Coffee break
10:30 Clustering Graph
Kernels
S+SSPR
Joint
Session
Partial
Supervision
Applications
12:00 Lunch
Lunch
13:30 Graph
Edit Distance
Metrics
and
Dissimilarities
14:00
EXCURSION
TO KOLI
15:00 Coffee Coffee
&
posters
15:30 Discriminant
Analysis
Graph Models
and
Embedding
17:00 Free time
19:00 WELCOME
RECEPTION
BANQUET
Theatre Restaurant


Wednesday 20.8

IAPR Keynote

9:00
Evaluating supervised classification methods: error rate, ROC curves, and beyond
Prof. David Hand Imperial College, London, UK

Graph Kernels 10:30-12:00

Chair: Marcello Pelillo
10:30
A Graph Kernel from the Depth-Based Representation
Lu Bai and Edwin Hancock
11:00
Incorporating molecule's stereisomerism within the machine learning framework
Pierre-Anthony Grenier, Luc Brun and Didier Villemin
11:30
Transitive State Alignment for the Quantum Jensen-Shannon Kernel
Andrea Torsello, Andrea Gasparetto, Luca Rossi, Lu Bai and Edwin R. Hancock

Clustering 10:30-12:00

Chair: Francesco Tortorella
10:30
Balanced K-means for Clustering
Mikko Malinen and Pasi Fränti
11:00
Poisoning complete-linkage hierarchical clustering
Battista Biggio, Samuel Rota Bulò, Ignazio Pillai, Michele Mura, Eyasu Zemene Mequanint, Marcello Pelillo and Fabio Roli
11:30
A Comparison of Categorical Attribute Data Clustering Methods
Ville Hautamäki, Antti Pöllänen, Tomi Kinnunen, Kong Aik Lee, Haizhou Li and Pasi Fränti

Graph Edit Distance 13:00-15:00

Chair: Richard C. Wilson
13:00
Improving Approximate Graph Edit Distance using Genetic Algorithms
Kaspar Riesen, Horst Bunke and Andreas Fischer
13:30
Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks
Benoit Gaüzère, Sébastien Bougleux, Kaspar Riesen and Luc Brun
14:00
A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance
Andreas Fischer, Réjean Plamondon, Yvon Savaria, Kaspar Riesen and Horst Bunke

Graph Models and Embedding 15:30-17:00

Chair: Edwin R. Hancock
15:30
Flip-Flop Sublinear Models for Graphs
Brijnesh Jain
16:00
Node Centrality for Continuous-Time Quantum Walks
Luca Rossi, Andrea Torsello and Edwin Hancock
16:30
Max-Correlation Embedding Computation
Antonio Robles-Kelly

Discriminant Analysis 15:30-17:00

Chair: Marco Loog
15:30
Fast Gradient Computation for Learning with Tensor Product Kernels and Sparse Training Labels
Tapio Pahikkala
16:00
Comparison between Supervised and Unsupervised Learning of Probabilistic Linear Discriminant Analysis Mixture Models for Speaker Verification
Timur Pekhovsky and Aleksandr Sizov
16:30
Nonlinear Discriminant Analysis based on Probability Estimation by Gaussian Mixture Model
Akinori Hidaka and Takio Kurita

Thursday 21.8

Combining and Selecting 9:00-10:00

Chair: David M.J. Tax
9:00
Information theoretic feature selection in multi-label data through composite likelihood
Konstantinos Sechidis, Nikolaos Nikolaou and Gavin Brown
9:30
Majority Vote of Diverse Classifiers for Late Fusion
Emilie Morvant, Habrard Amaury and Ayache Stéphane

Joint session 10:30-12:00

Chair: Luc Brun
10:30
Information-theoretic selection of high-dimensional spectral features for structural recognition
Boyan Bonev, Francisco Escolano, Daniela Giorgi and Silvia Biasotti
11:00
Entropic Graph Embedding via Multivariate Degree Distributions
Cheng Ye, Richard Wilson and Edwin Hancock
11:30
On parallel lines in noisy forms
George Nagy

Metrics and Dissimilarities 13:00-15:00

Chair: Battista Biggio
13:00
Metric learning in dissimilarity space for improved nearest neighbor performance
Robert P. W. Duin, Manuele Bicego, Mauricio Orozco-Alzate, Sang-Woon Kim and Marco Loog
13:30
Improving distance based image retrieval using non-dominated sorting genetic algorithm
Miguel Arevalillo-Herráez, Francesc J. Ferri and Salvador Moreno-Picot
14:00
Matching similarity for Keyword-Based Clustering
Mohammad Rezaei and Pasi Fränti

Posters 15:00-17:00

Chair: Francisco Escolano and Marco Loog
 
Edit Distance computed by Fast Bipartite Graph Matching
Francesc Serratosa and Xavier Cortés
 
Statistical Method for Semantic Segmentation of Dominant Plane from Remote Exploration Image Sequence
Shun Inagaki and Atsushi Imiya
 
Analyses on Generalization Error of Ensemble Kernel Regressors
Akira Tanaka, Ichigaku Takigawa, Hideyuki Imai and Mineichi Kudo
 
Structural Human Shape Analysis for Modelling and Recognition
Chutisant Kerdvibulvech and Koichiro Yamauchi
 
On Cross-Validation for MLP Model Evaluation
Tommi Kärkkäinen
 
Weighted Mean Assignment of a Pair of Correspondences using Optimisation functions
Francesc Serratosa and Carlos Moreno
 
Chemical Symbol Feature Set for Handwritten Chemical Symbol Recognition
Peng Tang, Siu Cheung Hui and Chi-Wing Fu
 
An Empirical Study about Combining Metric Learning and Prototype Generation
Adrian Perez-Suay and Francesc J. Ferri
 
Tracking System with Re-identification using a RGB String Kernel
Amal Mahboubi and Luc Brun
 
Towards Scalable Prototype Selection by Genetic Algorithms with Fast Criteria
Yenisel Plasencia, Mauricio Orozco-Alzate, Heydi Mendez-Vazquez, Edel Garcia and Robert P. W. Duin
 
IOWA operators and its application to image retrieval
Pedro Zuccarello, Guillermo Ayala, Teresa León and Esther de Ves Cuenca
 
On Optimum Thresholding of Multivariate Change Detectors
William Faithfull and Ludmila Kuncheva
 
Commute Time for a Gaussian Wave Packet on a Graph
Furqan Aziz, Richard Wilson and Edwin Hancock
 
Properties of Object-Level Cross-Validation Schemes for Symmetric Pair-Input Data
Juho Heimonen, Tapio Salakoski and Tapio Pahikkala
 
A binary Factor Graph model for biclustering
Matteo Denitto, Alessandro Farinelli, Giuditta Franco and Manuele Bicego
 
Improved BLSTM Neural Networks for Recognition of On-line Bangla Complex Words
Volkmar Frinken, Nilanjana Bhattacharya, Seiichi Uchida and Umapada Pal
 
A Ranking Part Model for Object Detection
Chaobo Sun and Xiaojie Wang
 
Regular decomposition of multivariate time series and other matrices
Hannu Reittu, Fülöp Bazsó and Robert Weiss
 
Texture Synthesis: From Convolutional RBMs to Efficient Deterministic Algorithms
Qi Gao and Stefan Roth
 
Improved object matching using structural relations
Estephan Dazzi, Roberto Cesar and Teofilo De Campos
 
Designing LDPC codes for ECOC Classfication Systems
Claudio Marrocco and Francesco Tortorella
 
Unifying Probabilistic Linear Discriminant Analysis Variants in Biometric Authentication
Aleksandr Sizov, Kong-Aik Lee and Tomi Kinnunen
 
The active geometric shape model: A new robust deformable shape model and its applications
Quan Wang and Kim Boyer
 
Multi-label learning under feature extraction budgets
Pekka Naula, Antti Airola, Tapio Salakoski and Tapio Pahikkala

Friday 22.8

IAPR Keynote

9:00
Approximation of hard combinatorial problems via embedding to hierarchically separated trees
Prof. Ali Shokoufandeh, Drexel University, Philadelphia, US

Applications 10:30-12:00

Chair: Antonio Robles-Kelly
10:30
Quantum vs Classical Ranking in Segment Grouping
Francisco Escolano, Boyan Bonev and Edwin R. Hancock
11:00
Remove noise in video with 3D topological maps
Donatello Conte and Guillaume Damiand
11:30
Video analysis of a snooker footage based on kinematic model
Aysylu Gabdulkhakova and Walter Kropatsch

Partial Supervision 10:30-12:00

Chair: Francesc J. Ferri
10:30
Evaluating classification performance with only positive and unlabeled samples
Siamak Hajizadeh, Zili Li, Rolf P.B.J. Dollevoet and David M.J. Tax
11:00
Semi-Supervised Nearest Mean Classification through a Constrained Log-Likelihood
Marco Loog and Are C. Jensen
11:30
Who is missing? A New Pattern Recognition Puzzle
Ludmila Kuncheva and Aaron Jackson
Link to electronic proceedings