عنوان
پدید آورنده
موضوع
رده
TK7882.P3
TK7882
.
P3
کتابخانه
محل استقرار
INTERNATIONAL STANDARD BOOK NUMBER
(Number (ISBN
3030200809
(Number (ISBN
3030200817
(Number (ISBN
3030200825
(Number (ISBN
9783030200800
(Number (ISBN
9783030200817
(Number (ISBN
9783030200824
Erroneous ISBN
9783030200800
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
Graph-based representations in pattern recognition :
General Material Designation
[Book]
Other Title Information
12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19-21, 2019, Proceedings /
First Statement of Responsibility
Donatello Conte, Jean-Yves Ramel, Pasquale Foggia (eds.).
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Cham, Switzerland :
Name of Publisher, Distributor, etc.
Springer,
Date of Publication, Distribution, etc.
2019.
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
1 online resource (x, 247 pages) :
Other Physical Details
illustrations (some color)
SERIES
Series Title
Lecture notes in computer science ;
Series Title
LNCS sublibrary. SL 6, Image processing, computer vision, pattern recognition, and graphics
Volume Designation
11510
GENERAL NOTES
Text of Note
Includes author index.
CONTENTS NOTE
Text of Note
Intro; Preface; Organization; Contents; Experimental Evaluation of Subgraph Isomorphism Solvers; 1 Introduction; 2 Experimental Set-Up; 3 Does the Solving Time Depend on Graph Sizes?; 4 Where Are the Hard Instances?; 5 Experimental Comparison of the Solvers; 6 Combining Solvers to Take the Best of Them; 7 Conclusion; References; GEDLIB: A C++ Library for Graph Edit Distance Computation; 1 Introduction; 2 Overall Architecture; 3 User Interface; 4 Abstract Classes for Implementing GED Algorithms; 5 Abstract Class for Implementing Edit Costs; 6 Conclusions and Future Work; References
Text of Note
2.2 Mixed Integer Linear Program2.3 F3 Formulation; 3 VPLS Heuristic; 3.1 Main Features of VPLS; 3.2 VPLS for the GED Problem; 4 Computational Experiments; 5 Conclusion; References; A Database and Evaluation for Classification of RNA Molecules Using Graph Methods; 1 Introduction; 2 Related Work; 3 Database; 4 RNA Representation; 5 Classification Methods; 5.1 Sequence-Based Methods; 5.2 Weisfeiler-Lehman Optimal Assignment (WL-OA); 5.3 Shortest Path Embedding; 5.4 All Paths and Cycles Embedding(APC); 6 Results; 7 Conclusion; References
Text of Note
3.3 Training the Classifier4 Experimental Evaluation; 4.1 Database Description; 4.2 Graph Matching Performance; 4.3 Runtime Analysis; 5 Conclusions; References; Cross-Evaluation of Graph-Based Keyword Spotting in Handwritten Historical Documents; 1 Introduction; 1.1 Related Work; 1.2 Contribution; 2 Graph-Based Keyword Spotting; 2.1 Image Preprocessing; 2.2 Handwriting Graphs; 2.3 Graph Matching; 2.4 Ensemble Methods; 3 Experimental Evaluation; 3.1 Experimental Setup; 3.2 Cross-Evaluation; 3.3 Ensemble Methods; 4 Conclusion and Outlook; References
Text of Note
Graph Edge Entropy in Maxwell-Boltzmann Statistics for Alzheimer's Disease Analysis1 Introduction; 2 Graph Representation; 2.1 Preliminaries; 2.2 Von Neumann Edge Entropy; 3 Thermodynamic Statistics and Global Entropy Decomposition; 3.1 Thermodynamic Entropy; 3.2 Maxwell-Boltzmann Statistics; 3.3 Edge Entropy Decomposition; 4 Experiments and Evaluations; 4.1 Dataset; 4.2 Experimental Results; 5 Conclusion; References; Solving the Graph Edit Distance Problem with Variable Partitioning Local Search; 1 Introduction; 2 GED Definition and F3 Formulation; 2.1 GED Problem Definition
Text of Note
Learning the Graph Edit Costs: What Do We Want to Optimise?Abstract; 1 Introduction; 2 Attributed Graphs and Graph Edit Distance; 3 Learning Methods and Objective Functions; 4 Experimental Evaluation; 5 The Conclusions; Acknowledgments; References; Sub-optimal Graph Matching by Node-to-Node Assignment Classification; 1 Introduction; 2 Definitions; 2.1 Attributed Graphs and Graph Edit Distance; 2.2 Approximating the Graph Edit Distance; 3 Learning Graph Matching; 3.1 Learning the Edit Costs and Graph Embedding; 3.2 From Edit Costs Estimation to Node Assignment Classification
0
8
8
8
8
SUMMARY OR ABSTRACT
Text of Note
This book constitutes the refereed proceedings of the 12th IAPR-TC-15 International Workshop on Graph-Based Representation in Pattern Recognition, GbRPR 2019, held in Tours, France, in June 2019. The 22 full papers included in this volume together with an invited talk were carefully reviewed and selected from 28 submissions. The papers discuss research results and applications at the intersection of pattern recognition, image analysis, and graph theory. They cover topics such as graph edit distance, graph matching, machine learning for graph problems, network and graph embedding, spectral graph problems, and parallel algorithms for graph problems.
ACQUISITION INFORMATION NOTE
Source for Acquisition/Subscription Address
Springer Nature
Stock Number
com.springer.onix.9783030200817
OTHER EDITION IN ANOTHER MEDIUM
International Standard Book Number
9783030200800
International Standard Book Number
9783030200824
PARALLEL TITLE PROPER
Parallel Title
GbRPR 2019
TOPICAL NAME USED AS SUBJECT
Computer vision, Congresses.
Graph theory, Congresses.
Pattern recognition systems, Congresses.
Computer vision.
Graph theory.
Pattern recognition systems.
(SUBJECT CATEGORY (Provisional
COM016000
UYQP
UYQP
DEWEY DECIMAL CLASSIFICATION
Number
006
.
3
Edition
23
LIBRARY OF CONGRESS CLASSIFICATION
Class number
TK7882
.
P3
PERSONAL NAME - ALTERNATIVE RESPONSIBILITY
Conte, Donatello
Foggia, P., (Pasquale)
Ramel, Jean-Yves
CORPORATE BODY NAME - PRIMARY RESPONSIBILITY
IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition(12th :2019 :, Tours, France)
ORIGINATING SOURCE
Date of Transaction
20200823091233.0
Cataloguing Rules (Descriptive Conventions))
pn
ELECTRONIC LOCATION AND ACCESS
Electronic name
مطالعه متن کتاب [Book]
Y
