{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T02:28:44Z","timestamp":1762050524537,"version":"build-2065373602"},"reference-count":85,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Granular Computing is a powerful information processing paradigm, particularly useful for the synthesis of pattern recognition systems in structured domains (e.g., graphs or sequences). According to this paradigm, granules of information play the pivotal role of describing the underlying (possibly complex) process, starting from the available data. Under a pattern recognition viewpoint, granules of information can be exploited for the synthesis of semantically sound embedding spaces, where common supervised or unsupervised problems can be solved via standard machine learning algorithms. In this work, we show a comparison between different strategies for the automatic synthesis of information granules in the context of graph classification. These strategies mainly differ on the specific topology adopted for subgraphs considered as candidate information granules and the possibility of using or neglecting the ground-truth class labels in the granulation process. Computational results on 10 different open-access datasets show that by using a class-aware granulation, performances tend to improve (regardless of the information granules topology), counterbalanced by a possibly higher number of information granules.<\/jats:p>","DOI":"10.3390\/a15050148","type":"journal-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:40:57Z","timestamp":1651066857000},"page":"148","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Information Granulation via Data Clustering for Granular Computing-Based Pattern Recognition: A Graph Embedding Case Study"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1730-5436","authenticated-orcid":false,"given":"Alessio","family":"Martino","sequence":"first","affiliation":[{"name":"Department of Business and Management, LUISS University, Viale Romania 32, 00197 Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4391-2598","authenticated-orcid":false,"given":"Luca","family":"Baldini","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, Electronics and Telecommunications, University of Rome \u201dLa Sapienza\u201d, Via Eudossiana 18, 00184 Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8244-0015","authenticated-orcid":false,"given":"Antonello","family":"Rizzi","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, Electronics and Telecommunications, University of Rome \u201dLa Sapienza\u201d, Via Eudossiana 18, 00184 Rome, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Bargiela, A., and Pedrycz, W. (2003). Granular Computing: An Introduction, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1033-8"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Pedrycz, W., Skowron, A., and Kreinovich, V. (2008). Handbook of Granular Computing, John Wiley & Sons.","DOI":"10.1002\/9780470724163"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0165-0114(97)00077-8","article-title":"Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic","volume":"90","author":"Zadeh","year":"1997","journal-title":"Fuzzy Sets Syst."},{"key":"ref_4","unstructured":"Yager, R., and Filev, D. (1998, January 4\u20139). Operations for granular computing: Mixing words and numbers. Proceedings of the 1998 IEEE International Conference on Fuzzy Systems Proceedings, IEEE World Congress on Computational Intelligence (Cat. No.98CH36228), Anchorage, AK, USA."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/91.493904","article-title":"Fuzzy logic = computing with words","volume":"4","author":"Zadeh","year":"1996","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Yao, Y. (2005, January 25\u201327). Perspectives of granular computing. Proceedings of the 2005 IEEE International Conference on Granular Computing, Beijing, China.","DOI":"10.1109\/GRC.2005.1547239"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.fss.2012.03.009","article-title":"Granular representation and granular computing with fuzzy sets","volume":"203","author":"Pedrycz","year":"2012","journal-title":"Fuzzy Sets Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s41066-015-0008-8","article-title":"Bridging gaps between several forms of granular computing","volume":"1","author":"Dubois","year":"2016","journal-title":"Granul. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ijar.2016.06.001","article-title":"The Uncertainty of Probabilistic Rough Sets in Multi-Granulation Spaces","volume":"77","author":"Zhang","year":"2016","journal-title":"Int. J. Approx. Reason."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/3477.658584","article-title":"Shadowed sets: Representing and processing fuzzy sets","volume":"28","author":"Pedrycz","year":"1998","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kreinovich, V. (2008). Interval Computation as an Important Part of Granular Computing: An Introduction. Handbook of Granular Computing, John Wiley & Sons, Ltd.","DOI":"10.1002\/9780470724163.ch1"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1109\/TFUZZ.2012.2236842","article-title":"Proximity-based clustering: A search for structural consistency in data with semantic blocks of features","volume":"21","author":"Pedrycz","year":"2013","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s11571-015-9351-3","article-title":"Survey on granularity clustering","volume":"9","author":"Ding","year":"2015","journal-title":"Cogn. Neurodyn."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41066-015-0012-z","article-title":"DCC: A framework for dynamic granular clustering","volume":"1","author":"Peters","year":"2016","journal-title":"Granul. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data Clustering: A Review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput. Surv."},{"key":"ref_17","first-page":"49","article-title":"Sur les probl\u00e8mes aux d\u00e9riv\u00e9s partielles et leur signification physique","volume":"13","author":"Hadamard","year":"1902","journal-title":"Princet. Univ. Bull."},{"key":"ref_18","first-page":"65","article-title":"Clustering: Science or Art?","volume":"Volume 27","author":"Guyon","year":"2012","journal-title":"Proceedings of ICML Workshop on Unsupervised and Transfer Learning"},{"key":"ref_19","unstructured":"Bouveyron, C., Hammer, B., and Villmann, T. (2012). Recent developments in clustering algorithms. ESANN 2012, ESANN."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","article-title":"Survey of clustering algorithms","volume":"16","author":"Xu","year":"2005","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_21","unstructured":"MacQueen, J. (July, January 21). Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA."},{"key":"ref_22","unstructured":"Dodge, Y. (1987). Clustering by means of Medoids. Statistical Data Analysis Based on the L1 Norm and Related Methods, Elsevier."},{"key":"ref_23","unstructured":"Huang, Z. (1997, January 23\u201324). Clustering large data sets with mixed numeric and categorical values. Proceedings of the First Pacific Asia Knowledge Discovery and Data Mining Conference, Singapore."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Bezdek, J.C. (1981). Pattern Recognition with Fuzzy Objective Function Algorithms, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-0450-1"},{"key":"ref_25","unstructured":"Livi, L., Del Vescovo, G., and Rizzi, A. (2012, January 6\u20138). Graph Recognition by Seriation and Frequent Substructures Mining. Proceedings of the ICPRAM 2012\u20141st International Conference on Pattern Recognition Applications and Methods, Algarve, Portugal."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Rizzi, A., and Del Vescovo, G. (2006, January 6\u20138). Automatic Image Classification by a Granular Computing Approach. Proceedings of the 2006 16th IEEE Signal Processing Society Workshop on Machine Learning for Signal Processing, Maynooth, Ireland.","DOI":"10.1109\/MLSP.2006.275517"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., and Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Springer. [2nd ed.].","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Pedrycz, W. (2005). Knowledge-Based Clustering: From Data to Information Granules, John Wiley & Sons.","DOI":"10.1002\/0471708607"},{"key":"ref_29","unstructured":"Theodoridis, S., and Koutroumbas, K. (2008). Pattern Recognition, Academic Press. [4th ed.]."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","article-title":"A distance measure between attributed relational graphs for pattern recognition","volume":"SMC-13","author":"Sanfeliu","year":"1983","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","article-title":"A survey of graph edit distance","volume":"13","author":"Gao","year":"2010","journal-title":"Pattern Anal. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"15426","DOI":"10.1109\/ACCESS.2021.3053085","article-title":"An Enhanced Filtering-Based Information Granulation Procedure for Graph Embedding and Classification","volume":"9","author":"Martino","year":"2021","journal-title":"IEEE Access"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Baldini, L., Martino, A., and Rizzi, A. (2021, January 10\u201313). Relaxed Dissimilarity-based Symbolic Histogram Variants for Granular Graph Embedding. Proceedings of the 13th International Joint Conference on Computational Intelligence\u2014NCTA, Singapore.","DOI":"10.5220\/0010652500003063"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_35","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","year":"1993","journal-title":"Combinatorics"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-4149(74)90001-5","article-title":"Random walks on graphs","volume":"2","author":"Jagers","year":"1974","journal-title":"Stoch. Process. Their Appl."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"4209","DOI":"10.1016\/j.asoc.2013.06.017","article-title":"Building the fundamentals of granular computing: A principle of justifiable granularity","volume":"13","author":"Pedrycz","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s41066-016-0032-3","article-title":"Granular computing: From granularity optimization to multi-granularity joint problem solving","volume":"2","author":"Wang","year":"2017","journal-title":"Granul. Comput."},{"key":"ref_39","first-page":"299","article-title":"The rise of granular computing","volume":"20","author":"Yao","year":"2008","journal-title":"J. Chongqing Univ. Posts Telecommun."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2012.05.021","article-title":"A measurement theory view on the granularity of partitions","volume":"213","author":"Yao","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Merelo, J.J., Garibaldi, J., Linares-Barranco, A., Warwick, K., and Madani, K. (2021). Towards a Class-Aware Information Granulation for Graph Embedding and Classification. Computational Intelligence, Proceedings of the 11th International Joint Conference, IJCCI 2019, Vienna, Austria, 17\u201319 September 2019, Revised Selected Papers, Springer International Publishing.","DOI":"10.1007\/978-3-030-70594-7"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"194","DOI":"10.2307\/2392063","article-title":"An Analysis of Clique Formation and Structure in Organizations","volume":"18","author":"Tichy","year":"1973","journal-title":"Adm. Sci. Q."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","article-title":"A method of matrix analysis of group structure","volume":"14","author":"Luce","year":"1949","journal-title":"Psychometrika"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Algorithm 457: Finding All Cliques of an Undirected Graph","volume":"16","author":"Bron","year":"1973","journal-title":"Commun. ACM"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","volume":"3","author":"Moon","year":"1965","journal-title":"Isr. J. Math."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Baldini, L., Martino, A., and Rizzi, A. (2020, January 19\u201324). Exploiting Cliques for Granular Computing-based Graph Classification. Proceedings of the 2020 International Joint Conference on Neural Networks (IJCNN), Glasgow, UK.","DOI":"10.1109\/IJCNN48605.2020.9206690"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential Evolution\u2014A Simple and Efficient Heuristic for global Optimization over Continuous Spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_48","unstructured":"Grandini, M., Bagli, E., and Visani, G. (2020). Metrics for Multi-Class Classification: An Overview. arXiv."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., and Loog, M. (2008). IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning. Structural, Syntactic, and Statistical Pattern Recognition, Springer.","DOI":"10.1007\/978-3-540-89689-0"},{"key":"ref_50","unstructured":"Morris, C., Kriege, N.M., Bause, F., Kersting, K., Mutzel, P., and Neumann, M. (2020). TUDataset: A collection of benchmark datasets for learning with graphs. ICML 2020 Workshop on Graph Representation Learning and Beyond (GRL+ 2020). arXiv."},{"key":"ref_51","unstructured":"Webb, E.C. (1992). Enzyme Nomenclature 1992. Recommendations of the Nomenclature Committee of the International Union of Biochemistry and Molecular Biology on the Nomenclature and Classification of Enzymes, Academic Press. [6th ed.]."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Liu, W., and Llad\u00f3s, J. (2006). Report on the Second Symbol Recognition Contest. Graphics Recognition. Ten Years Review and Future Perspectives, Springer Berlin Heidelberg.","DOI":"10.1007\/11767978"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1021\/jm040835a","article-title":"Derivation and Validation of Toxicophores for Mutagenicity Prediction","volume":"48","author":"Kazius","year":"2005","journal-title":"J. Med. Chem."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1021\/jm00106a046","article-title":"Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity","volume":"34","author":"Debnath","year":"1991","journal-title":"J. Med. Chem."},{"key":"ref_55","first-page":"291","article-title":"Subgraph Matching Kernels for Attributed Graphs","volume":"Volume ICML\u201912","author":"Kriege","year":"2012","journal-title":"Proceedings of the 29th International Coference on International Conference on Machine Learning"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/S0022-2836(03)00628-4","article-title":"Distinguishing Enzyme Structures from Non-enzymes without Alignments","volume":"330","author":"Dobson","year":"2003","journal-title":"J. Mol. Biol."},{"key":"ref_57","first-page":"2539","article-title":"Weisfeiler-Lehman Graph Kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Wale, N., and Karypis, G. (2006, January 18\u201322). Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification. Proceedings of the Sixth International Conference on Data Mining (ICDM\u201906), Hong Kong, China.","DOI":"10.1109\/ICDM.2006.39"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"D431","DOI":"10.1093\/nar\/gkh081","article-title":"BRENDA, the enzyme database: Updates and major new developments","volume":"32","author":"Schomburg","year":"2004","journal-title":"Nucleic Acids Res."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"i47","DOI":"10.1093\/bioinformatics\/bti1007","article-title":"Protein function prediction via graph kernels","volume":"21","author":"Borgwardt","year":"2005","journal-title":"Bioinformatics"},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Deza, M.M., and Deza, E. (2009). Encyclopedia of Distances, Springer. [1st ed.].","DOI":"10.1007\/978-3-642-00234-2"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Varoquaux, G., Vaught, T., and Millman, J. (2008). Exploring Network Structure, Dynamics, and Function using NetworkX. Proceedings of the 7th Python in Science Conference, Los Alamos National Lab.","DOI":"10.25080\/PFVC8793"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Kiss, O., and Sarkar, R. (2020, January 19\u201323). Little Ball of Fur: A Python Library for Graph Sampling. Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM \u201920), Online.","DOI":"10.1145\/3340531.3412758"},{"key":"ref_64","first-page":"2825","article-title":"Scikit-learn: Machine Learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","article-title":"SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python","volume":"17","author":"Virtanen","year":"2020","journal-title":"Nat. Methods"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Baldini, L., Martino, A., and Rizzi, A. (2019, January 4\u20136). Stochastic Information Granules Extraction for Graph Embedding and Classification. Proceedings of the 11th International Joint Conference on Computational Intelligence, NCTA, (IJCCI 2019), Hendaye, France.","DOI":"10.5220\/0008149403910402"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","article-title":"Approximate graph edit distance computation by means of bipartite graph matching","volume":"27","author":"Riesen","year":"2009","journal-title":"Image Vis. Comput."},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., and Jiang, X. (2013). A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition. Graph-Based Representations in Pattern Recognition, Springer.","DOI":"10.1007\/978-3-642-38221-5"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.neucom.2015.12.110","article-title":"Ordered Decompositional DAG kernels enhancements","volume":"192","author":"Navarin","year":"2016","journal-title":"Neurocomputing"},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Martino, A., and Rizzi, A. (2020). (Hyper)graph Kernels over Simplicial Complexes. Entropy, 22.","DOI":"10.3390\/e22101155"},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1145\/2783258.2783417","article-title":"Deep Graph Kernels","volume":"Volume KDD \u201915","author":"Yanardag","year":"2015","journal-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/TSMCB.2009.2019264","article-title":"Graph Classification by Means of Lipschitz Embedding","volume":"39","author":"Riesen","year":"2009","journal-title":"IEEE Trans. Syst. Man, Cybern. Part B Cybern."},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"Jiang, X., Ferrer, M., and Torsello, A. (2011). Dimensionality Reduction for Graph of Words Embedding. Graph-Based Representations in Pattern Recognition, Springer.","DOI":"10.1007\/978-3-642-20844-7"},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Martino, A., Giuliani, A., and Rizzi, A. (2019). (Hyper)Graph Embedding and Classification via Simplicial Complexes. Algorithms, 12.","DOI":"10.3390\/a12110223"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/3292500.3330982","article-title":"Graph Convolutional Networks with EigenPooling","volume":"Volume KDD \u201919","author":"Ma","year":"2019","journal-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"},{"key":"ref_76","unstructured":"Bacciu, D., Errica, F., and Micheli, A. (2018, January 10\u201315). Contextual graph markov model: A deep and generative approach to graph processing. Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholm, Sweden."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.patrec.2018.03.031","article-title":"Learning error-correcting graph matching with a multiclass neural network","volume":"134","author":"Martineau","year":"2020","journal-title":"Pattern Recognit. Lett."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"99103","DOI":"10.1109\/ACCESS.2021.3096845","article-title":"Graph Neural Networks Using Local Descriptions in Attributed Graphs: An Application to Symbol Recognition and Hand Written Character Recognition","volume":"9","author":"Kajla","year":"2021","journal-title":"IEEE Access"},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Riba, P., Dutta, A., Llad\u00f3s, J., and Forn\u00e9s, A. (2017, January 13\u201315). Graph-Based Deep Learning for Graphics Classification. Proceedings of the 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR), Kyoto, Japan.","DOI":"10.1109\/ICDAR.2017.262"},{"key":"ref_80","doi-asserted-by":"crossref","unstructured":"Sid\u00e8re, N., H\u00e9roux, P., and Ramel, J.Y. (2009, January 26\u201329). Vector Representation of Graphs: Application to the Classification of Symbols and Letters. Proceedings of the 2009 10th International Conference on Document Analysis and Recognition, Barcelona, Spain.","DOI":"10.1109\/ICDAR.2009.218"},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.patcog.2012.07.029","article-title":"Fuzzy multilevel graph embedding","volume":"46","author":"Luqman","year":"2013","journal-title":"Pattern Recognit."},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"3072","DOI":"10.1016\/j.patcog.2012.01.009","article-title":"Graph embedding in vector spaces by node attribute statistics","volume":"45","author":"Gibert","year":"2012","journal-title":"Pattern Recognit."},{"key":"ref_83","unstructured":"Kamel, M., and Campilho, A. (2011). A Graph-Kernel Method for Re-identification. Image Analysis and Recognition, Springer."},{"key":"ref_84","doi-asserted-by":"crossref","first-page":"2038","DOI":"10.1016\/j.patrec.2012.03.020","article-title":"Two New Graphs Kernels in Chemoinformatics","volume":"33","author":"Brun","year":"2012","journal-title":"Pattern Recogn. Lett."},{"key":"ref_85","unstructured":"Ga\u00fcz\u00e8re, B., Brun, L., Villemin, D., and Brun, M. (2012, January 11\u201315). Graph kernels based on relevant patterns and cycle information for chemoinformatics. Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012), Tsukuba, Japan."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/5\/148\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:01:45Z","timestamp":1760137305000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/5\/148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,27]]},"references-count":85,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2022,5]]}},"alternative-id":["a15050148"],"URL":"https:\/\/doi.org\/10.3390\/a15050148","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,4,27]]}}}