國立虎尾科技大學 |

Structural Pattern Recognition with Graph Edit Distance = Approximation Algorithms and Applications /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Structural Pattern Recognition with Graph Edit Distance/ by Kaspar Riesen.
其他題名:	Approximation Algorithms and Applications /
作者:	Riesen, Kaspar.
面頁冊數:	XIII, 158 p. 28 illus., 4 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Pattern recognition. -
電子資源:	https://doi.org/10.1007/978-3-319-27252-8
ISBN:	9783319272528

Structural Pattern Recognition with Graph Edit Distance = Approximation Algorithms and Applications /
Riesen, Kaspar.

Structural Pattern Recognition with Graph Edit DistanceApproximation Algorithms and Applications /[electronic resource] :by Kaspar Riesen. - 1st ed. 2015. - XIII, 158 p. 28 illus., 4 illus. in color.online resource. - Advances in Computer Vision and Pattern Recognition,2191-6586. - Advances in Computer Vision and Pattern Recognition,.

This unique text/reference presents a thorough introduction to the field of structural pattern recognition, with a particular focus on graph edit distance (GED), one of the most flexible graph distance models available. The book also provides a detailed review of a diverse selection of novel methods related to GED, and concludes by suggesting possible avenues for future research. Topics and features: Formally introduces the concept of GED, and highlights the basic properties of this graph matching paradigm Describes a reformulation of GED to a quadratic assignment problem Illustrates how the quadratic assignment problem of GED can be reduced to a linear sum assignment problem Reviews strategies for reducing both the overestimation of the true edit distance and the matching time in the approximation framework Examines the improvement demonstrated by the described algorithmic framework with respect to the distance accuracy and the matching time Includes appendices listing the datasets employed for the experimental evaluations discussed in the book Researchers and graduate students interested in the field of structural pattern recognition will find this focused work to be an essential reference on the latest developments in GED. Dr. Kaspar Riesen is a university lecturer of computer science in the Institute for Information Systems at the University of Applied Sciences and Arts Northwestern Switzerland, Olten, Switzerland.

ISBN: 9783319272528

Standard No.: 10.1007/978-3-319-27252-8doiSubjects--Topical Terms:

1253525
Pattern recognition.

LC Class. No.: Q337.5

Dewey Class. No.: 006.4

Structural Pattern Recognition with Graph Edit Distance = Approximation Algorithms and Applications /
LDR:02917nam a22004095i 4500 001 970700
003 DE-He213
005 20200706201209.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319272528 $9 978-3-319-27252-8
024 7 $a 10.1007/978-3-319-27252-8 $2 doi
035 $a 978-3-319-27252-8
050 4 $a Q337.5
050 4 $a TK7882.P3
072 7 $a UYQP $2 bicssc
072 7 $a COM016000 $2 bisacsh
072 7 $a UYQP $2 thema
082 0 4 $a 006.4 $2 23
100 1 $a Riesen, Kaspar. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 856884
245 1 0 $a Structural Pattern Recognition with Graph Edit Distance $h [electronic resource] : $b Approximation Algorithms and Applications / $c by Kaspar Riesen.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XIII, 158 p. 28 illus., 4 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Advances in Computer Vision and Pattern Recognition, $x 2191-6586
520 $a This unique text/reference presents a thorough introduction to the field of structural pattern recognition, with a particular focus on graph edit distance (GED), one of the most flexible graph distance models available. The book also provides a detailed review of a diverse selection of novel methods related to GED, and concludes by suggesting possible avenues for future research. Topics and features: Formally introduces the concept of GED, and highlights the basic properties of this graph matching paradigm Describes a reformulation of GED to a quadratic assignment problem Illustrates how the quadratic assignment problem of GED can be reduced to a linear sum assignment problem Reviews strategies for reducing both the overestimation of the true edit distance and the matching time in the approximation framework Examines the improvement demonstrated by the described algorithmic framework with respect to the distance accuracy and the matching time Includes appendices listing the datasets employed for the experimental evaluations discussed in the book Researchers and graduate students interested in the field of structural pattern recognition will find this focused work to be an essential reference on the latest developments in GED. Dr. Kaspar Riesen is a university lecturer of computer science in the Institute for Information Systems at the University of Applied Sciences and Arts Northwestern Switzerland, Olten, Switzerland.
650 0 $a Pattern recognition. $3 1253525
650 0 $a Data structures (Computer science). $3 680370
650 1 4 $a Pattern Recognition. $3 669796
650 2 4 $a Data Structures. $3 669824
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319272511
776 0 8 $i Printed edition: $z 9783319272535
776 0 8 $i Printed edition: $z 9783319801018
830 0 $a Advances in Computer Vision and Pattern Recognition, $x 2191-6586 $3 1256102
856 4 0 $u https://doi.org/10.1007/978-3-319-27252-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)