In this paper we propose a prototype size selection method for a set of sample graphs. Our first contribution is to show how approximate set coding can be extended from the vector to graph domain. With this framework to hand we show how prototype selection can be posed as optimizing the mutual information between two partitioned sets of sample graphs. We show how the resulting method can be used for prototype graph size selection. In our experiments, we apply our method to a real-world dataset and investigate its performance on prototype size selection tasks. © 2012 Springer-Verlag Berlin Heidelberg.
|Data di pubblicazione:||2012|
|Titolo:||Information Theoretic Prototype Selection for Unattributed Graphs|
|Titolo del libro:||Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, SSPR&SPR 2012|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-642-34166-3_4|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|