Median is a general concept of capturing the essential information of a given set of objects. In this work we adopt this concept to the problem of learning, or synthesis, of representative graphical symbols from given examples. Graphical symbols are represented by graphs. This way the learning task is transformed into that of computing the generalized median of a given set of graphs, which is a novel graph matching problem and solved by a genetic algorithm.
CITATION STYLE
Jiang, X., Münger, A., & Bunke, H. (2000). Synthesis of representative graphical symbols by computing generalized median graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1941, pp. 183–192). Springer Verlag. https://doi.org/10.1007/3-540-40953-x_15
Mendeley helps you to discover research relevant for your work.