{"title":"Maximal Independent Sets for Pooling in Graph Neural Networks","authors":"Stevan Stanovic, Benoit Gaüzère, L. Brun","doi":"10.48550/arXiv.2307.13011","DOIUrl":"https://doi.org/10.48550/arXiv.2307.13011","url":null,"abstract":"Convolutional Neural Networks (CNNs) have enabled major advances in image classification through convolution and pooling. In particular, image pooling transforms a connected discrete lattice into a reduced lattice with the same connectivity and allows reduction functions to consider all pixels in an image. However, there is no pooling that satisfies these properties for graphs. In fact, traditional graph pooling methods suffer from at least one of the following drawbacks: Graph disconnection or overconnection, low decimation ratio, and deletion of large parts of graphs. In this paper, we present three pooling methods based on the notion of maximal independent sets that avoid these pitfalls. Our experimental results confirm the relevance of maximal independent set constraints for graph pooling.","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124210318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Practical Algorithm for Max-Norm Optimal Binary Labeling of Graphs","authors":"F. Malmberg, A. Falcão","doi":"10.48550/arXiv.2304.12642","DOIUrl":"https://doi.org/10.48550/arXiv.2304.12642","url":null,"abstract":"This paper concerns the efficient implementation of a method for optimal binary labeling of graph vertices, originally proposed by Malmberg and Ciesielski (2020). This method finds, in quadratic time with respect to graph size, a labeling that globally minimizes an objective function based on the $L_infty$-norm. The method enables global optimization for a novel class of optimization problems, with high relevance in application areas such as image processing and computer vision. In the original formulation, the Malmberg-Ciesielski algorithm is unfortunately very computationally expensive, limiting its utility in practical applications. Here, we present a modified version of the algorithm that exploits redundancies in the original method to reduce computation time. While our proposed method has the same theoretical asymptotic time complexity, we demonstrate that is substantially more efficient in practice. Even for small problems, we observe a speedup of 4-5 orders of magnitude. This reduction in computation time makes the Malmberg-Ciesielski method a viable option for many practical applications.","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133342503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Discriminant Manifold Learning with Graph Convolution Based Regression for Image Classification","authors":"Ruifeng Zhu, F. Dornaika, Y. Ruichek","doi":"10.1007/978-3-030-20081-7_22","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_22","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116674816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Donatello Conte, G. Grossi, R. Lanzarotti, Jianyi Lin, A. Petrini
{"title":"A Parallel MCMC Algorithm for the Balanced Graph Coloring Problem","authors":"Donatello Conte, G. Grossi, R. Lanzarotti, Jianyi Lin, A. Petrini","doi":"10.1007/978-3-030-20081-7_16","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_16","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124233632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
David B. Blumenthal, S. Bougleux, J. Gamper, L. Brun
{"title":"GEDLIB: A C++ Library for Graph Edit Distance Computation","authors":"David B. Blumenthal, S. Bougleux, J. Gamper, L. Brun","doi":"10.1007/978-3-030-20081-7_2","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_2","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130011345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Database and Evaluation for Classification of RNA Molecules Using Graph Methods","authors":"Enes Algul, Richard C. Wilson","doi":"10.1007/978-3-030-20081-7_8","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_8","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124199474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Lozano, M. Curado, Francisco Escolano, E. Hancock
{"title":"Network Embedding by Walking on the Line Graph","authors":"M. Lozano, M. Curado, Francisco Escolano, E. Hancock","doi":"10.1007/978-3-030-20081-7_21","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_21","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124747776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalized Median Graph via Iterative Alternate Minimizations","authors":"N. Boria, S. Bougleux, Benoit Gaüzère, L. Brun","doi":"10.1007/978-3-030-20081-7_10","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_10","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127109385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Attributed Graph Embedding Method Using the Tree-Index Algorithm","authors":"Yuhang Jiao, Yueting Yang, Lixin Cui, Lu Bai","doi":"10.1007/978-3-030-20081-7_17","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_17","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114216495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mostafa Darwiche, Donatello Conte, R. Raveaux, V. T’kindt
{"title":"Solving the Graph Edit Distance Problem with Variable Partitioning Local Search","authors":"Mostafa Darwiche, Donatello Conte, R. Raveaux, V. T’kindt","doi":"10.1007/978-3-030-20081-7_7","DOIUrl":"https://doi.org/10.1007/978-3-030-20081-7_7","url":null,"abstract":"","PeriodicalId":400237,"journal":{"name":"Workshop on Graph Based Representations in Pattern Recognition","volume":"883 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}