{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T21:17:43Z","timestamp":1720473463951},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1016\/j.is.2016.07.005","type":"journal-article","created":{"date-parts":[[2016,7,16]],"date-time":"2016-07-16T22:26:13Z","timestamp":1468707973000},"page":"194-205","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A polygraph test for trustworthy structural similarity"],"prefix":"10.1016","volume":"64","author":[{"given":"Kevin A.","family":"Naud\u00e9","sequence":"first","affiliation":[]},{"given":"Jean H.","family":"Greyling","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Vogts","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2016.07.005_bib1","unstructured":"F. Morain-Nicolier, J. Landr\u00e9, S. Ruan, Binary symbol recognition from local dissimilarity map, in: 8th International Workshop on Graphic Recognition GREC2009, 2009, pp. 143\u2013148. URL: \u3008http:\/\/pixel-shaker.fr\/wp-content\/uploads\/publications\/Nicolier2009.pdf\u3009."},{"key":"10.1016\/j.is.2016.07.005_bib2","doi-asserted-by":"crossref","unstructured":"L. Boyer, A. Habrard, M. Sebban, Learning Similarity between Tree Structured Data: Application to Image Recognition, Lecture Notes in Computer Science, vol. 4701, 2007, p. 54. URL: \u3008http:\/\/eprints.pascal-network.org\/archive\/00003081\/\u3009.","DOI":"10.1007\/978-3-540-74958-5_9"},{"issue":"1","key":"10.1016\/j.is.2016.07.005_bib3","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/1758-2946-1-12","article-title":"Small molecule subgraph detector (SMSD) toolkit","volume":"1","author":"Rahman","year":"2009","journal-title":"J. Cheminform."},{"issue":"13","key":"10.1016\/j.is.2016.07.005_bib4","doi-asserted-by":"crossref","first-page":"i366","DOI":"10.1093\/bioinformatics\/btn186","article-title":"A maximum common substructure-based algorithm for searching and predicting drug-like compounds","volume":"24","author":"Cao","year":"2008","journal-title":"Bioinformatics"},{"key":"10.1016\/j.is.2016.07.005_bib5","doi-asserted-by":"crossref","unstructured":"A. Islam, D. Inkpen, Semantic similarity of short texts, in: N. Nicolov, G. Angeliva, R. Mitkov (Eds.), Recent Advances in Natural Language Processing V, Current Issues in Linguistic Theory, John Benjamins Publishing Company, Amsterdam, vol. 309, 2009, pp. 227\u2013236","DOI":"10.1075\/cilt.309.18isl"},{"key":"10.1016\/j.is.2016.07.005_bib6","doi-asserted-by":"crossref","unstructured":"B. Markines, C. Cattuto, F. Menczer, D. Benz, A. Hotho, G. Stumme, Evaluating similarity measures for emergent semantics of social tagging, in: Proceedings of the 18th International Conference on World Wide Web, ACM, New York, NY, USA, Madrid, Spain, 2009, pp. 641\u2013650. URL: \u3008http:\/\/www2009.eprints.org\/65\/\u3009.","DOI":"10.1145\/1526709.1526796"},{"issue":"4","key":"10.1016\/j.is.2016.07.005_bib7","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0036144502415960","article-title":"A measure of similarity between graph vertices","volume":"46","author":"Blondel","year":"2004","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.is.2016.07.005_bib8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.aml.2007.01.006","article-title":"Graph similarity scoring and matching","volume":"21","author":"Zager","year":"2008","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/j.is.2016.07.005_bib9","doi-asserted-by":"crossref","unstructured":"K.A. Naud\u00e9, J.H. Greyling, D. Vogts, When similarity measures lie, in: Proceedings of the 8th International Conference on Similarity Search and Applications, SISAP 2015, Glasgow, Scotland, 2015, pp. 113\u2013124.","DOI":"10.1007\/978-3-319-25087-8_11"},{"key":"10.1016\/j.is.2016.07.005_bib10","unstructured":"C. Cleverdon, J. Mills, M. Keen, Factors Determining the Performance of Indexing Systems, Technical Report, ASLIB Cranfield Project, Cranfield University, Cranfield, 1966. URL: \u3008http:\/\/www.citeulike.org\/group\/1710\/article\/1295402\u3009."},{"key":"10.1016\/j.is.2016.07.005_bib11","unstructured":"S.A. Nene, S.K. Nayar, H. Murase, Columbia Object Image Library (COIL-100), Technical Report, Technical Report CUCS-006-96, Columbia University, 1996."},{"key":"10.1016\/j.is.2016.07.005_bib12","doi-asserted-by":"crossref","unstructured":"P. Colantoni, B. Laget, Color image segmentation using region adjacency graphs, in: Sixth International Conference on Image Processing and Its Applications, 1997, vol. 2, 1997, pp. 698\u2013702. doi:10.1049\/cp:19970985.","DOI":"10.1049\/cp:19970985"},{"issue":"8","key":"10.1016\/j.is.2016.07.005_bib13","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1016\/j.patrec.2006.12.009","article-title":"Retrieval of objects in video by similarity based on graph matching","volume":"28","author":"Chevalier","year":"2007","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.is.2016.07.005_bib14","doi-asserted-by":"crossref","unstructured":"K. Riesen, H. Bunke, IAM graph database repository for graph based pattern recognition and machine learning, in: Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, vol. 5342, 2008, pp. 287\u2013297. URL: \u3008http:\/\/www.springerlink.com\/index\/D35T1705G7W21403.pdf\u3009.","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"10.1016\/j.is.2016.07.005_bib15","doi-asserted-by":"crossref","unstructured":"R. Agrawal, S. Gollapudi, A. Kannan, K. Kenthapadi, Similarity search using concept graphs, in: Proceedings of the 23rd {ACM} International Conference on Information and Knowledge Management, Shanghai, China, 2014, pp. 719\u2013728.","DOI":"10.1145\/2661829.2661995"},{"issue":"6","key":"10.1016\/j.is.2016.07.005_bib16","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/2666680","article-title":"Evaluation without ground truth in social media","volume":"58","author":"Zafarani","year":"2015","journal-title":"Commun. ACM"},{"issue":"5","key":"10.1016\/j.is.2016.07.005_bib17","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.patrec.2009.10.011","article-title":"A graph matching method and a graph matching distance based on subgraph assignments","volume":"31","author":"Raveaux","year":"2010","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"10.1016\/j.is.2016.07.005_bib18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.14778\/1687627.1687631","article-title":"Comparing stars: on approximating graph edit distance","volume":"2","author":"Zeng","year":"2009","journal-title":"Proc. VLDB Endow."},{"issue":"7","key":"10.1016\/j.is.2016.07.005_bib19","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."},{"issue":"2","key":"10.1016\/j.is.2016.07.005_bib20","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.compedu.2009.09.005","article-title":"Marking student programs using graph similarity","volume":"54","author":"Naud\u00e9","year":"2010","journal-title":"Comput. Educ."},{"issue":"24","key":"10.1016\/j.is.2016.07.005_bib21","doi-asserted-by":"crossref","first-page":"5234","DOI":"10.1103\/PhysRevLett.85.5234","article-title":"Topology of evolving networks","volume":"85","author":"Albert","year":"2000","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/j.is.2016.07.005_bib22","unstructured":"A. Schenker, H. Bunke, M. Last, A. Kandel, Graph-theoretic techniques for web content mining, Series in Machine Perception and Artificial Intelligence 62. \u3008http:\/\/books.google.com\/books?hl=en&lr=&id=hNJozkPJAEwC&oi=fnd&pg=PP1&dq=Graph-Theoretic+Techniques+for+Web+Content+Mining&ots=PPVMc-VCA1&sig=d6Fok33vLb-WBFstYIpr7ijn4jM\u3009."},{"issue":"3","key":"10.1016\/j.is.2016.07.005_bib23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.2307\/1932409","article-title":"Measures of the amount of ecologic association between species","volume":"26","author":"Dice","year":"1945","journal-title":"Ecology"},{"key":"10.1016\/j.is.2016.07.005_bib24","first-page":"290","article-title":"On random graphs. I","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math."},{"issue":"1","key":"10.1016\/j.is.2016.07.005_bib25","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1136\/jech.37.1.82","article-title":"Simplified exact analysis of case-referent studies","volume":"37","author":"Liddell","year":"1983","journal-title":"J. Epidemiol. Commun. Health"},{"issue":"1","key":"10.1016\/j.is.2016.07.005_bib26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-9574.1970.tb00104.x","article-title":"Raised conditional level of significance for the 2\u00d72-table when testing the equality of two probabilities","volume":"24","author":"Boschloo","year":"1970","journal-title":"Stat. Neerl."},{"issue":"4","key":"10.1016\/j.is.2016.07.005_bib27","doi-asserted-by":"crossref","first-page":"317","DOI":"10.2307\/2981892","article-title":"Exact unconditional sample sizes for the 2\u00d72 binomial trial","volume":"148","author":"Suissa","year":"1985","journal-title":"J. R. Stat. Soc. Ser. A"},{"issue":"427","key":"10.1016\/j.is.2016.07.005_bib28","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1080\/01621459.1994.10476836","article-title":"P values maximized over a confidence set for the nuisance parameter","volume":"89","author":"Berger","year":"1994","journal-title":"J. Am. Stat. Soc."},{"issue":"2","key":"10.1016\/j.is.2016.07.005_bib29","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1111\/1541-0420.00051","article-title":"A cautionary note on exact unconditional inference for a difference between two independent binomial proportions","volume":"59","author":"Mehrotra","year":"2003","journal-title":"Biometrics"},{"issue":"7","key":"10.1016\/j.is.2016.07.005_bib30","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1002\/sim.3531","article-title":"Recommended tests for association in 2 \u00d7 2 tables","volume":"28","author":"Lydersen","year":"2009","journal-title":"Stat. Med."},{"key":"10.1016\/j.is.2016.07.005_bib31","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1037\/h0047595","article-title":"Directional statistical decisions","volume":"67","author":"Kaiser","year":"1960","journal-title":"Psychol. Rev."},{"issue":"3","key":"10.1016\/j.is.2016.07.005_bib32","doi-asserted-by":"crossref","first-page":"707","DOI":"10.2466\/pr0.1999.84.3.707","article-title":"Updating the debate on one-versus two-tailed tests with the directional two-tailed test","volume":"84","author":"Leventhal","year":"1999","journal-title":"Psychol. Rep."},{"key":"10.1016\/j.is.2016.07.005_bib33","doi-asserted-by":"crossref","unstructured":"J.P. Shaffer, Recent developments towards optimality in multiple hypothesis testing, in: Lecture Notes-Monograph Series, 2006, pp. 16\u201332.","DOI":"10.1214\/074921706000000374"},{"issue":"2","key":"10.1016\/j.is.2016.07.005_bib34","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/00401706.1965.10490252","article-title":"On simultaneous confidence intervals for multinomial proportions","volume":"7","author":"Goodman","year":"1965","journal-title":"Technometrics"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437915301903?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437915301903?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T08:01:03Z","timestamp":1718697663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437915301903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":34,"alternative-id":["S0306437915301903"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2016.07.005","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A polygraph test for trustworthy structural similarity","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2016.07.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}