{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T10:44:30Z","timestamp":1749293070246,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007512","name":"Universitat Rovira i Virgili","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007512","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In some machine learning applications, graphs tend to be composed of a large number of tiny almost constant sub-structures. The current embedding methods are not prepared for this type of graphs and thus, their representational power tends to be very low. Our aim is to define a new graph embedding that considers this specific type of graphs. We present GraphFingerprint, which is a new embedding method that specifically considers the fact that graphs are composed of millions of almost constant sub-structures. The three-dimensional characterisation of a chemical metal-oxide nanocompound easily fits in these types of graphs, which nodes are atoms and edges are their bonds. Our graph embedding method has been used to predict the toxicity of these nanocompounds, achieving a high accuracy compared to other embedding methods. The representational power of the current embedding methods do not properly satisfy the requirements of some machine learning applications based on graphs, for this reason, a new embedding method has been defined and heuristically demonstrated that achieves good accuracy.<\/jats:p>","DOI":"10.1007\/s10044-024-01366-w","type":"journal-article","created":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T17:29:57Z","timestamp":1731605397000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graphfingerprint: graph embedding of graphs with almost constant sub-structures"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6112-5913","authenticated-orcid":false,"given":"Francesc","family":"Serratosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,14]]},"reference":[{"key":"1366_CR1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013","author":"P Foggia","year":"2014","unstructured":"Foggia P, Percannella G, Vento M (2014) Graph matching and learning in pattern recognition in the last 10 years. Int J Pattern Recogn Artif Intell. https:\/\/doi.org\/10.1142\/S0218001414500013","journal-title":"Int J Pattern Recogn Artif Intell"},{"issue":"3","key":"1366_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. Int J Pattern Recognit Artif Intell 18(3):265\u2013298. https:\/\/doi.org\/10.1142\/S0218001404003228","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"4","key":"1366_CR3","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1021\/acs.jcim.8b00820","volume":"59","author":"C Garcia-Hernandez","year":"2019","unstructured":"Garcia-Hernandez C, Fern\u00e1ndez A, Serratosa F (2019) Ligand-based virtual screening using graph edit distance as molecular similarity measure. J Chem Inf Model 59(4):1410\u20131421","journal-title":"J Chem Inf Model"},{"key":"1366_CR4","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.patrec.2015.08.003","volume":"65","author":"F Serratosa","year":"2015","unstructured":"Serratosa F, Cort\u00e9s X (2015) Graph edit distance: Moving from global to local structure to solve the graph-matching problem. Pattern Recogn Lett 65:204\u2013210","journal-title":"Pattern Recogn Lett"},{"key":"1366_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00792-5","author":"F Serratosa","year":"2021","unstructured":"Serratosa F (2021) Redefining the graph edit distance. SN Comput Sci. https:\/\/doi.org\/10.1007\/s42979-021-00792-5","journal-title":"SN Comput Sci"},{"key":"1366_CR6","doi-asserted-by":"publisher","DOI":"10.1038\/s43246-022-00315-6","author":"P Reiser","year":"2022","unstructured":"Reiser P, Neubert M, Eberhard A, Torresi L, Zhou C, Shao C, Metni H, Hoesel C, Schopmans H, Sommer T, Friederich P (2022) Graph neural networks for materials science and chemistry. Commun Mater. https:\/\/doi.org\/10.1038\/s43246-022-00315-6","journal-title":"Commun Mater"},{"key":"1366_CR7","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-031-23028-8_15","volume-title":"Structural, syntactic, and statistical pattern recognition","author":"S Fadlallah","year":"2022","unstructured":"Fadlallah S, Juli\u00e0 C, Serratosa F (2022) Graph regression based on graph autoencoders. In: Krzyzak A, Suen CY, Torsello A, Nobile N (eds) Structural, syntactic, and statistical pattern recognition. Springer, Cham, pp 142\u2013151"},{"issue":"15","key":"1366_CR8","doi-asserted-by":"publisher","first-page":"11579","DOI":"10.1007\/s00521-019-04642-7","volume":"32","author":"A Dutta","year":"2020","unstructured":"Dutta A, Riba P, Llados J, Fornes A (2020) Hierarchical stochastic graphlet embedding for graph-based pattern recognition. Neural Comput Appl 32(15):11579\u201311596. https:\/\/doi.org\/10.1007\/s00521-019-04642-7","journal-title":"Neural Comput Appl"},{"key":"1366_CR9","unstructured":"Ying C, Cai T, Luo S, Shuxin Z, Ke G, He D, Shen Y, Liu T-Y (2021) Do transformers really perform badly for graph representation?"},{"key":"1366_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.patrec.2020.07.010","volume":"138","author":"F Serratosa","year":"2020","unstructured":"Serratosa F (2020) A general model to define the substitution, insertion and deletion graph edit costs based on an embedded space. Pattern Recognit Lett 138:115\u2013122. https:\/\/doi.org\/10.1016\/j.patrec.2020.07.010","journal-title":"Pattern Recognit Lett"},{"key":"1366_CR11","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2014","unstructured":"Serratosa F (2014) Speeding up fast bipartite graph matching through a new cost matrix. Int J Pattern Recogn Artif Intell 29:1550010. https:\/\/doi.org\/10.1142\/S021800141550010X","journal-title":"Int J Pattern Recogn Artif Intell"},{"key":"1366_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa F (2014) Fast computation of bipartite graph matching. Pattern Recogn Lett 45:244\u2013250","journal-title":"Pattern Recogn Lett"},{"issue":"9","key":"1366_CR13","doi-asserted-by":"publisher","first-page":"3072","DOI":"10.1016\/j.patcog.2012.01.009","volume":"45","author":"J Gibert","year":"2012","unstructured":"Gibert J, Valveny E, Bunke H (2012) Graph embedding in vector spaces by node attribute statistics. Pattern Recogn 45(9):3072\u20133083","journal-title":"Pattern Recogn"},{"issue":"1","key":"1366_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS (2021) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324. https:\/\/doi.org\/10.1109\/TNNLS.2020.2978386","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1366_CR15","unstructured":"Kipf TN (2020) Deep learning with graph-structured representations. PhD thesis, University of Amsterdam"},{"key":"1366_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108215","volume":"121","author":"J Wang","year":"2022","unstructured":"Wang J, Liang J, Yao K, Liang J, Wang D (2022) Graph convolutional autoencoders with co-learning of graph structure and node attributes. Pattern Recogn 121:108215. https:\/\/doi.org\/10.1016\/j.patcog.2021.108215","journal-title":"Pattern Recogn"},{"key":"1366_CR17","doi-asserted-by":"publisher","DOI":"10.3390\/e25040567","author":"M Lin","year":"2023","unstructured":"Lin M, Wen K, Zhu X, Zhao H, Sun X (2023) Graph autoencoder with preserving node attribute similarity. Entropy. https:\/\/doi.org\/10.3390\/e25040567","journal-title":"Entropy"},{"issue":"31","key":"1366_CR18","doi-asserted-by":"publisher","DOI":"10.1088\/1361-648X\/ac7025","volume":"34","author":"YA \u00c7etin","year":"2022","unstructured":"\u00c7etin YA, Martorell B, Serratosa F, Aguilera-Porta N, Calatayud M (2022) Analyzing the tio2 surface reactivity based on oxygen vacancies computed by dft and dftb methods. J Phys Condens Matter 34(31):314004","journal-title":"J Phys Condens Matter"},{"issue":"23","key":"1366_CR19","doi-asserted-by":"publisher","first-page":"12751","DOI":"10.3390\/ijms222312751","volume":"22","author":"E Rica","year":"2021","unstructured":"Rica E, \u00c1lvarez S, Serratosa F (2021) Ligand-based virtual screening based on the graph edit distance. Int J Mol Sci 22(23):12751","journal-title":"Int J Mol Sci"},{"issue":"18","key":"1366_CR20","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.2174\/1568026620666200603122000","volume":"20","author":"C Garcia-Hernandez","year":"2020","unstructured":"Garcia-Hernandez C, Fern\u00e1ndez A, Serratosa F (2020) Learning the edit costs of graph edit distance applied to ligand-based virtual screening. Curr Top Med Chem 20(18):1582\u20131592","journal-title":"Curr Top Med Chem"},{"issue":"4","key":"1366_CR21","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1021\/acs.jcim.8b00820","volume":"59","author":"C Garcia-Hernandez","year":"2019","unstructured":"Garcia-Hernandez C, Fern\u00e1ndez A, Serratosa F (2019) Ligand-based virtual screening using graph edit distance as molecular similarity measure. J Chem Inf Model 59(4):1410\u20131421. https:\/\/doi.org\/10.1021\/acs.jcim.8b00820","journal-title":"J Chem Inf Model"},{"key":"1366_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.comtox.2018.12.002","volume":"9","author":"L Lamon","year":"2019","unstructured":"Lamon L, Asturiol D, Vilchez A, Ruperez-Illescas R, Cabellos J, Richarz A, Worth A (2019) Computational models for the assessment of manufactured nanomaterials: Development of model reporting standards and mapping of the model landscape. Comput Toxicol 9:143\u2013151. https:\/\/doi.org\/10.1016\/j.comtox.2018.12.002","journal-title":"Comput Toxicol"},{"issue":"7\u20139","key":"1366_CR23","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1080\/1062936X.2015.1080186","volume":"26","author":"E Papa","year":"2015","unstructured":"Papa E, Doucet JP, Doucet-Panaye A (2015) Linear and non-linear modelling of the cytotoxicity of tio2 and zno nanoparticles by empirical descriptors. SAR QSAR Environ Res 26(7\u20139):647\u2013665. https:\/\/doi.org\/10.1080\/1062936X.2015.1080186","journal-title":"SAR QSAR Environ Res"},{"issue":"17","key":"1366_CR24","doi-asserted-by":"publisher","first-page":"11729","DOI":"10.1021\/acsomega.1c01076","volume":"6","author":"NA Subramanian","year":"2021","unstructured":"Subramanian NA, Palaniappan A (2021) Nanotox: development of a parsimonious in silico model for toxicity assessment of metal-oxide nanoparticles using physicochemical features. ACS Omega 6(17):11729\u201311739. https:\/\/doi.org\/10.1021\/acsomega.1c01076","journal-title":"ACS Omega"},{"key":"1366_CR25","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: 5th International conference on learning representations, ICLR 2017, Toulon, France, April 24\u201326, 2017, Conference Track Proceedings. OpenReview.net. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"issue":"12","key":"1366_CR26","doi-asserted-by":"publisher","first-page":"2380","DOI":"10.1021\/acs.jcim.8b00269","volume":"58","author":"A Chatzigoulas","year":"2018","unstructured":"Chatzigoulas A, Karathanou K, Dellis D, Cournia Z (2018) Nanocrystal: a web-based crystallographic tool for the construction of nanoparticles based on their crystal habit. J Chem Inf Model 58(12):2380\u20132386. https:\/\/doi.org\/10.1021\/acs.jcim.8b00269","journal-title":"J Chem Inf Model"},{"key":"1366_CR27","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.patrec.2019.07.001","volume":"125","author":"V Carletti","year":"2019","unstructured":"Carletti V, Foggia P, Greco A, Vento M, Vigilante V (2019) Vf3-light: a lightweight subgraph isomorphism algorithm and its experimental evaluation. Pattern Recogn Lett 125:591\u2013596. https:\/\/doi.org\/10.1016\/j.patrec.2019.07.001","journal-title":"Pattern Recogn Lett"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-024-01366-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-024-01366-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-024-01366-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T09:34:14Z","timestamp":1734341654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-024-01366-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,14]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1366"],"URL":"https:\/\/doi.org\/10.1007\/s10044-024-01366-w","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"type":"print","value":"1433-7541"},{"type":"electronic","value":"1433-755X"}],"subject":[],"published":{"date-parts":[[2024,11,14]]},"assertion":[{"value":"24 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"143"}}