![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
SIMBAD 2011: Venice, Italy
- Marcello Pelillo, Edwin R. Hancock:
Similarity-Based Pattern Recognition - First International Workshop, SIMBAD 2011, Venice, Italy, September 28-30, 2011. Proceedings. Lecture Notes in Computer Science 7005, Springer 2011, ISBN 978-3-642-24470-4
Dissimilarity Characterization and Analysis
- Emilie Morvant, Amaury Habrard, Stéphane Ayache:
On the Usefulness of Similarity Based Projection Spaces for Transfer Learning. 1-16 - Aryeh Kontorovich, Danny Hendler, Eitan Menahem:
Metric Anomaly Detection via Asymmetric Risk Minimization. 17-30 - Orit Kliper-Gross, Tal Hassner, Lior Wolf:
One Shot Similarity Metric Learning for Action Recognition. 31-45 - Bernhard Moser
, Gernot Stübl, Jean-Luc Bouchot:
On a Non-monotonicity Effect of Similarity Measures. 46-60 - Oscar Sánchez Siordia, Isaac Martín de Diego
, Cristina Conde
, Enrique Cabello
:
Section-Wise Similarities for Clustering and Outlier Detection of Subjective Sequential Data. 61-76
Generative Models of Similarity Data
- Aydin Ulas
, Peter J. Schüffler
, Manuele Bicego, Umberto Castellani, Vittorio Murino
:
Hybrid Generative-Discriminative Nucleus Classification of Renal Cell Carcinoma. 77-89 - Luca Cazzanti, Sergey Feldman, Maya R. Gupta, Michael Gabbay
:
Multi-task Regularization of Generative Similarity Models. 90-103 - André Lourenço
, Ana L. N. Fred
, Mário A. T. Figueiredo:
A Generative Dyadic Aspect Model for Evidence Accumulation Clustering. 104-116
Graph Based and Relational Models
- Andrea Torsello
, Luca Rossi
:
Supervised Learning of Graph Structure. 117-132 - Lin Han, Edwin R. Hancock
, Richard C. Wilson:
An Information Theoretic Approach to Learning Generative Graph Prototypes. 133-148 - Furqan Aziz
, Richard C. Wilson, Edwin R. Hancock
:
Graph Characterization via Backtrackless Paths. 149-162 - Aureo Serrano, Luisa Micó
, José Oncina
:
Impact of the Initialization in Tree-Based Fast Similarity Search Techniques. 163-176
Clustering and Dissimilarity Data
- Aykut Erdem
, Erkut Erdem:
Multiple-Instance Learning with Instance Selection via Dominant Sets. 177-191 - Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin
, Shang-Hua Teng, Yu Xia
:
Min-sum Clustering of Protein Sequences with Limited Distance Information. 192-206 - Ludwig M. Busse, Joachim M. Buhmann:
Model-Based Clustering of Inhomogeneous Paired Comparison Data. 207-221 - David M. J. Tax, Marco Loog, Robert P. W. Duin, Veronika Cheplygina
, Wan-Jui Lee:
Bag Dissimilarities for Multiple Instance Learning. 222-234 - Zhihong Zhang, Edwin R. Hancock
:
Mutual Information Criteria for Feature Selection. 235-249
Applications
- Mehmet Gönen
, Aydin Ulas
, Peter J. Schüffler
, Umberto Castellani, Vittorio Murino
:
Combining Data Sources Nonlinearly for Cell Nucleus Classification of Renal Cell Carcinoma. 250-260 - Emanuele Olivetti
, Paolo Avesani
:
Supervised Segmentation of Fiber Tracts. 261-274 - Riccardo Satta, Giorgio Fumera, Fabio Roli
:
Exploiting Dissimilarity Representations for Person Re-identification. 275-289
Spectral Methods and Embedding
- Helena Aidos
, Ana L. N. Fred
:
A Study of Embedding Methods under the Evidence Accumulation Framework. 290-305 - Diana Porro-Muñoz, Robert P. W. Duin, Isneri Talavera-Bustamante, Mauricio Orozco-Alzate
:
A Study on the Influence of Shape in Classifying Small Spectral Data Sets. 306-320 - Muhammad Haseeb, Edwin R. Hancock
:
Feature Point Matching Using a Hermitian Property Matrix. 321-332
![](https://dblp.org/img/cog.dark.24x24.png)
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.