{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T06:29:26Z","timestamp":1776493766221,"version":"3.51.2"},"reference-count":91,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"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>This paper investigates a novel graph embedding procedure based on simplicial complexes. Inherited from algebraic topology, simplicial complexes are collections of increasing-order simplices (e.g., points, lines, triangles, tetrahedrons) which can be interpreted as possibly meaningful substructures (i.e., information granules) on the top of which an embedding space can be built by means of symbolic histograms. In the embedding space, any Euclidean pattern recognition system can be used, possibly equipped with feature selection capabilities in order to select the most informative symbols. The selected symbols can be analysed by field-experts in order to extract further knowledge about the process to be modelled by the learning system, hence the proposed modelling strategy can be considered as a grey-box. The proposed embedding has been tested on thirty benchmark datasets for graph classification and, further, we propose two real-world applications, namely predicting proteins\u2019 enzymatic function and solubility propensity starting from their 3D structure in order to give an example of the knowledge discovery phase which can be carried out starting from the proposed embedding strategy.<\/jats:p>","DOI":"10.3390\/a12110223","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T04:41:27Z","timestamp":1571978487000},"page":"223","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["(Hyper)Graph Embedding and Classification via Simplicial Complexes"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1730-5436","authenticated-orcid":false,"given":"Alessio","family":"Martino","sequence":"first","affiliation":[{"name":"Department of Information Engineering, Electronics and Telecommunications, University of Rome \u201cLa Sapienza\u201d, Via Eudossiana 18, 00184 Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4640-804X","authenticated-orcid":false,"given":"Alessandro","family":"Giuliani","sequence":"additional","affiliation":[{"name":"Department of Environment and Health, Istituto Superiore di Sanit\u00e0, Viale Regina Elena 299, 00161 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 \u201cLa Sapienza\u201d, Via Eudossiana 18, 00184 Rome, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2019,10,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.3389\/fgene.2014.00083","article-title":"Why network approach can promote a new way of thinking in biology","volume":"5","author":"Giuliani","year":"2014","journal-title":"Front. Genet."},{"key":"ref_2","first-page":"1598","article-title":"Protein contact networks: An emerging paradigm in chemistry","volume":"113","author":"Paci","year":"2012","journal-title":"Chem. Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2174\/138920308783565705","article-title":"Proteins as networks: Usefulness of graph theory in protein science","volume":"9","author":"Krishnan","year":"2008","journal-title":"Curr. Protein Pept. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/35036627","article-title":"The large-scale organization of metabolic networks","volume":"407","author":"Jeong","year":"2000","journal-title":"Nature"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Di Paola, L., and Giuliani, A. (2017). Protein\u2013Protein Interactions: The Structural Foundation of Life Complexity. Encyclopedia of Life Sciences (eLS), John Wiley & Sons.","DOI":"10.1002\/9780470015902.a0001346.pub2"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1694","DOI":"10.1093\/oxfordjournals.molbev.a003957","article-title":"Scale-Free Behavior in Protein Domain Networks","volume":"18","author":"Wuchty","year":"2001","journal-title":"Mol. Biol. Evol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1126\/science.1069883","article-title":"A Genomic Regulatory Network for Development","volume":"295","author":"Davidson","year":"2002","journal-title":"Science"},{"key":"ref_8","unstructured":"Gasteiger, J., and Engel, T. (2006). Chemoinformatics: A Textbook, John Wiley & Sons."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1016\/S1389-1286(99)00020-1","article-title":"A query language for XML","volume":"31","author":"Deutsch","year":"1999","journal-title":"Comput. Netw."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Weis, M., and Naumann, F. (2006, January 3\u20137). Detecting Duplicates in Complex XML Data. Proceedings of the 22nd International Conference on Data Engineering (ICDE\u201906), Atlanta, GA, USA.","DOI":"10.1109\/ICDE.2006.49"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Collins, M., and Duffy, N. (2001, January 3\u20138). Convolution Kernels for Natural Language. Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic (NIPS\u201901), Vancouver, BC, Canada.","DOI":"10.7551\/mitpress\/1120.003.0085"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Das, N., Ghosh, S., Gon\u00e7alves, T., and Quaresma, P. (2014). Comparison of Different Graph Distance Metrics for Semantic Text Based Classification. Polibits, 51\u201358.","DOI":"10.17562\/PB-49-6"},{"key":"ref_14","unstructured":"Przepi\u00f3rkowski, A., and Ogrodniczuk, M. (2014). Using Graphs and Semantic Information to Improve Text Classifiers. Advances in Natural Language Processing, Springer."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/j.asoc.2014.08.072","article-title":"Granular modeling and computing approaches for intelligent analysis of non-geometric data","volume":"27","author":"Livi","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s41066-015-0003-0","article-title":"Granular computing, computational intelligence, and the analysis of non-geometric input spaces","volume":"1","author":"Livi","year":"2016","journal-title":"Granul. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Pedrycz, W., and Chen, S.M. (2018). Granular Computing Techniques for Bioinformatics Pattern Recognition Problems in Non-metric Spaces. Computational Intelligence for Pattern Recognition, Springer.","DOI":"10.1007\/978-3-319-89629-8"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"P\u0119kalska, E., and Duin, R.P. (2005). The Dissimilarity Representation for Pattern Recognition: Foundations and Applications, World Scientific.","DOI":"10.1142\/9789812703170"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.fss.2013.01.001","article-title":"Graph ambiguity","volume":"221","author":"Livi","year":"2013","journal-title":"Fuzzy Sets Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10044-012-0284-8","article-title":"The graph matching problem","volume":"16","author":"Livi","year":"2013","journal-title":"Pattern Anal. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., and Bunke, H. (2007). Bridging the Gap between Graph Edit Distance and Kernel Machines, World Scientific.","DOI":"10.1142\/9789812770202"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Cinti, A., Bianchi, F.M., Martino, A., and Rizzi, A. (2019). A Novel Algorithm for Online Inexact String Matching and its FPGA Implementation. Cognit. Comput.","DOI":"10.1007\/s12559-019-09646-y"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.patcog.2005.06.012","article-title":"Prototype selection for dissimilarity-based classifiers","volume":"39","author":"Duin","year":"2006","journal-title":"Pattern Recognit."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ins.2014.01.005","article-title":"Optimized dissimilarity space embedding for labeled graphs","volume":"266","author":"Livi","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"De Santis, E., Martino, A., Rizzi, A., and Frattale Mascioli, F.M. (2018, January 8\u201313). Dissimilarity Space Representations and Automatic Feature Selection for Protein Function Prediction. Proceedings of the 2018 International Joint Conference on Neural Networks (IJCNN), Rio de Janeiro, Brazil.","DOI":"10.1109\/IJCNN.2018.8489115"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Martino, A., De Santis, E., Giuliani, A., and Rizzi, A. (2019). Modelling and Recognition of Protein Contact Networks by Multiple Kernel Learning and Dissimilarity Representations. Inf. Sci., Under Review.","DOI":"10.3390\/e22070794"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Shawe-Taylor, J., and Cristianini, N. (2004). Kernel Methods for Pattern Analysis, Cambridge University Press.","DOI":"10.1017\/CBO9780511809682"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf, B., and Smola, A.J. (2002). Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond, MIT Press.","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Cristianini, N., and Shawe-Taylor, J. (2000). An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods, Cambridge University Press.","DOI":"10.1017\/CBO9780511801389"},{"key":"ref_30","first-page":"415","article-title":"Functions of positive and negative type, and their connection with the theory of integral equations","volume":"209","author":"Mercer","year":"1909","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A Contain. Pap. A Math. Phys. Character"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Cover, T.M. (1965). Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition. IEEE Trans. Electron. Comput., 326\u2013334.","DOI":"10.1109\/PGEC.1965.264137"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Li, J.B., Chu, S.C., and Pan, J.S. (2014). Kernel Learning Algorithms for Face Recognition, Springer.","DOI":"10.1007\/978-1-4614-0161-2"},{"key":"ref_33","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_34","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_35","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_36","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_37","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ins.2018.03.026","article-title":"Knowledge distance measure in multigranulation spaces of fuzzy equivalence relations","volume":"448","author":"Yang","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_38","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":"Cognit. Neurodyn."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Martino, A., Rizzi, A., and Frattale Mascioli, F.M. (2017). Efficient Approaches for Solving the Large-Scale k-medoids Problem. Proceedings of the 9th International Joint Conference on Computational Intelligence\u2014Volume 1: IJCCI, SciTePress.","DOI":"10.5220\/0006515003380347"},{"key":"ref_40","first-page":"9","article-title":"On the problem of modeling structured data with the MinSOD representative","volume":"6","author":"Livi","year":"2014","journal-title":"Int. J. Comput. Theory Eng."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Sabourin, C., Merelo, J.J., Madani, K., and Warwick, K. (2019). Efficient Approaches for Solving the Large-Scale k-Medoids Problem: Towards Structured Data. Computational Intelligence, Proceedings of the 9th International Joint Conference, IJCCI 2017, Funchal-Madeira, Portugal, 1\u20133 November 2017, Springer. Revised Selected Papers.","DOI":"10.1007\/978-3-030-16469-0"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Martino, A., Rizzi, A., and Frattale Mascioli, F.M. (2018, January 8\u201313). Distance Matrix Pre-Caching and Distributed Computation of Internal Validation Indices in k-medoids Clustering. Proceedings of the 2018 International Joint Conference on Neural Networks (IJCNN), Rio de Janeiro, Brazil.","DOI":"10.1109\/IJCNN.2018.8489101"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00500-013-1065-z","article-title":"A Granular Computing approach to the design of optimized graph classification systems","volume":"18","author":"Bianchi","year":"2014","journal-title":"Soft Comput."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/s12559-015-9369-1","article-title":"Granular Computing Techniques for Classification and Semantic Characterization of Structured Data","volume":"8","author":"Bianchi","year":"2016","journal-title":"Cognit. Comput."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/s12559-017-9527-8","article-title":"Similar Vague Concepts Selection Using Their Euclidean Distance at Different Granulation","volume":"10","author":"Singh","year":"2018","journal-title":"Cognit. Comput."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Del Vescovo, G., and Rizzi, A. (2007, January 2\u20134). Automatic classification of graphs by symbolic histograms. Proceedings of the 2007 IEEE International Conference on Granular Computing (GRC 2007), Fremont, CA, USA.","DOI":"10.1109\/GRC.2007.4403133"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Rizzi, A., Del Vescovo, G., Livi, L., and Frattale Mascioli, F.M. (2012, January 10\u201315). A new Granular Computing approach for sequences representation and classification. Proceedings ot the 2012 International Joint Conference on Neural Networks (IJCNN), Brisbane, QLD, Australia.","DOI":"10.1109\/IJCNN.2012.6252680"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"P03034","DOI":"10.1088\/1742-5468\/2009\/03\/P03034","article-title":"Persistent homology of complex networks","volume":"2009","author":"Horak","year":"2009","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_49","unstructured":"Estrada, E., and Rodriguez-Velazquez, J.A. (2005). Complex networks as hypergraphs. arXiv."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","article-title":"Topology and data","volume":"46","author":"Carlsson","year":"2009","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1146\/annurev-statistics-031017-100045","article-title":"Topological Data Analysis","volume":"5","author":"Wasserman","year":"2018","journal-title":"Annu. Rev. Stat. Its Appl."},{"key":"ref_52","unstructured":"Ramadan, E., Tarafdar, A., and Pothen, A. (2004, January 26\u201330). A hypergraph model for the yeast protein complex network. Proceedings of the 18th International Parallel and Distributed Processing Symposium, Santa Fe, NM, USA."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"i944","DOI":"10.1093\/bioinformatics\/bty570","article-title":"Higher-order molecular organization as a source of biological function","volume":"34","author":"Gaudelet","year":"2018","journal-title":"Bioinformatics"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Malod-Dognin, N., and Pr\u017eulj, N. (2018). Functional geometry of protein-protein interaction networks. arXiv.","DOI":"10.1038\/s41598-017-01085-9"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Barbarossa, S., and Sardellitti, S. (2019). Topological Signal Processing over Simplicial Complexes. arXiv.","DOI":"10.1109\/DSW.2018.8439885"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Barbarossa, S., and Tsitsvero, M. (2016, January 20\u201325). An introduction to hypergraph signal processing. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Shanghai, China.","DOI":"10.1109\/ICASSP.2016.7472914"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Barbarossa, S., Sardellitti, S., and Ceci, E. (2018, January 4\u20136). Learning from signals defined over simplicial complexes. Proceedings of the 2018 IEEE Data Science Workshop (DSW), Lausanne, Switzerland.","DOI":"10.1109\/DSW.2018.8439885"},{"key":"ref_58","unstructured":"Berge, C. (1973). Graphs and Hypergraphs, Elsevier."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/psapm\/070\/587","article-title":"Topological data analysis","volume":"70","author":"Zomorodian","year":"2012","journal-title":"Adv. Appl. Comput. Topol."},{"key":"ref_60","unstructured":"Ghrist, R.W. (2014). Elementary Applied Topology, Createspace."},{"key":"ref_61","first-page":"175","article-title":"On the Vietoris-Rips complexes and a cohomology theory for metric spaces","volume":"138","author":"Hausmann","year":"1995","journal-title":"Ann. Math. Stud."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.cag.2010.03.007","article-title":"Fast construction of the Vietoris-Rips complex","volume":"34","author":"Zomorodian","year":"2010","journal-title":"Comput. Graph."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/conm\/453\/08795","article-title":"Metric graph theory and geometry: A survey","volume":"453","author":"Bandelt","year":"2008","journal-title":"Contemp. Math."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","article-title":"Clique graphs and Helly graphs","volume":"51","author":"Bandelt","year":"1991","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10827-016-0608-6","article-title":"Two\u2019s company, three (or more) is a simplex","volume":"41","author":"Giusti","year":"2016","journal-title":"J. Comput. Neurosci."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","article-title":"Computing persistent homology","volume":"33","author":"Zomorodian","year":"2005","journal-title":"Discret. Comput. Geom."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Martino, A., Rizzi, A., and Frattale Mascioli, F.M. (2018, January 8\u201313). Supervised Approaches for Protein Function Prediction by Topological Data Analysis. Proceedings of the 2018 International Joint Conference on Neural Networks (IJCNN), Rio de Janeiro, Brazil.","DOI":"10.1109\/IJCNN.2018.8489307"},{"key":"ref_68","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_69","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","article-title":"A note on the problem of reporting maximal cliques","volume":"407","author":"Cazals","year":"2008","journal-title":"Theor. Comput. Sci."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","article-title":"The worst-case time complexity for generating all maximal cliques and computational experiments","volume":"363","author":"Tomita","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"ref_71","unstructured":"Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc.. [1st ed.]."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1162\/089976600300015565","article-title":"New support vector algorithms","volume":"12","author":"Smola","year":"2000","journal-title":"Neural Comput."},{"key":"ref_73","unstructured":"Zhu, J., Rosset, S., Tibshirani, R., and Hastie, T.J. (2003, January 9\u201311). 1-norm support vector machines. Proceedings of the 16th International Conference on Neural Information Processing Systems, Whistler, BC, Canada."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I., and Vapnik, V. (1992, January 27\u201329). A training algorithm for optimal margin classifiers. Proceedings of the Fifth Annual Workshop on Computational Learning Theory, Pittsburgh, PA, USA.","DOI":"10.1145\/130385.130401"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00994018","article-title":"Support-vector networks","volume":"20","author":"Cortes","year":"1995","journal-title":"Mach. Learn."},{"key":"ref_76","first-page":"37","article-title":"Evaluation: From precision, recall and f-measure to roc., informedness, markedness & correlation","volume":"2","author":"Powers","year":"2011","journal-title":"J. Mach. Learn. Technol."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1002\/1097-0142(1950)3:1<32::AID-CNCR2820030106>3.0.CO;2-3","article-title":"Index for rating diagnostic tests","volume":"3","author":"Youden","year":"1950","journal-title":"Cancer"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Martino, A., and Rizzi, A. (2019). (Hyper)Graph Kernels over Simplicial Complexes. Pattern Recognit., Under Review.","DOI":"10.3390\/e22101155"},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Bianchi, F.M., Scardapane, S., Livi, L., Uncini, A., and Rizzi, A. (2014, January 6\u201311). An interpretable graph-based image classifier. Proceedings of the 2014 International Joint Conference on Neural Networks (IJCNN), Beijing, China.","DOI":"10.1109\/IJCNN.2014.6889601"},{"key":"ref_80","unstructured":"Baldini, L., Martino, A., and Rizzi, A. Stochastic Information Granules Extraction for Graph Embedding and Classification. Proceedings of the 11th International Joint Conference on Computational Intelligence\u2014Volume 1: NCTA."},{"key":"ref_81","unstructured":"Kersting, K., Kriege, N.M., Morris, C., Mutzel, P., and Neumann, M. (2019, September 26). Benchmark Data Sets for Graph Kernels. Available online: http:\/\/graphkernels.cs.tu-dortmund.de."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Di Noia, A., Martino, A., Montanari, P., and Rizzi, A. (2019). Supervised machine learning techniques and genetic optimization for occupational diseases risk prediction. Soft Comput.","DOI":"10.1007\/s00500-019-04200-2"},{"key":"ref_83","first-page":"1871","article-title":"LIBLINEAR: A library for large linear classification","volume":"9","author":"Fan","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"The UniProt Consortium (2017). UniProt: The universal protein knowledgebase. Nucleic Acids Res., 45, D158\u2013D169.","DOI":"10.1093\/nar\/gkw1099"},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","article-title":"The Protein Data Bank","volume":"28","author":"Berman","year":"2000","journal-title":"Nucleic Acids Res."},{"key":"ref_86","unstructured":"Sharma, P., and Bianchi, F.M. (2017). Supervised Approaches for Function Prediction of Proteins Contact Networks from Topological Structure Information. Image Analysis, Proceedings of the 20th Scandinavian Conference, Troms\u00f8, Norway, 12\u201314 June 2017, Springer. Part I."},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1038\/90802","article-title":"Cell-free translation reconstituted with purified components","volume":"19","author":"Shimizu","year":"2001","journal-title":"Nat. Biotechnol."},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1021\/acs.jcim.7b00488","article-title":"Improved descriptors for the quantitative structure\u2013activity relationship modeling of peptides and proteins","volume":"58","author":"Barley","year":"2018","journal-title":"J. Chem. Inf. Model."},{"key":"ref_89","doi-asserted-by":"crossref","first-page":"3587","DOI":"10.1021\/acs.jpcb.7b10780","article-title":"Cosolvent effects on polymer hydration drive hydrophobic collapse","volume":"122","author":"Nayar","year":"2018","journal-title":"J. Phys. Chem. B"},{"key":"ref_90","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1111\/j.1469-1809.1938.tb02189.x","article-title":"The statistical utilization of multiple measurements","volume":"8","author":"Fisher","year":"1938","journal-title":"Ann. Eugen."},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1021\/ci049838m","article-title":"Structure-related statistical singularities along protein sequences: A correlation study","volume":"45","author":"Colafranceschi","year":"2005","journal-title":"J. Chem. Inf. Model."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/223\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:29:14Z","timestamp":1760189354000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,25]]},"references-count":91,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2019,11]]}},"alternative-id":["a12110223"],"URL":"https:\/\/doi.org\/10.3390\/a12110223","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,25]]}}}