{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:24:07Z","timestamp":1740374647224,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T00:00:00Z","timestamp":1281484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Machine Vision and Applications"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00138-010-0290-z","type":"journal-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T07:37:41Z","timestamp":1281425861000},"page":"541-555","source":"Crossref","is-referenced-by-count":9,"title":["Graph-based shape indexing"],"prefix":"10.1007","volume":"23","author":[{"given":"M. Fatih","family":"Demirci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,11]]},"reference":[{"key":"290_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, R., Pollack, J.E. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics. American Mathematical Society Press, Providence, vol. 23\u00a0pp. 1\u201356 (1999)","DOI":"10.1090\/conm\/223\/03131"},{"issue":"5","key":"290_CR2","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/34.211474","volume":"15","author":"H.A. Almohamad","year":"1993","unstructured":"Almohamad H.A., Duffuaa S.O.: A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 15(5), 522\u2013525 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"290_CR3","doi-asserted-by":"crossref","unstructured":"Amir, A., Lipsky, O., Porat, E., Umanski, J.: Approximate matching in the L1 metric. In: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching, pp. 91\u2013103. Springer, Berlin (2005)","DOI":"10.1007\/11496656_9"},{"issue":"3\u20134","key":"290_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S. Arya","year":"2000","unstructured":"Arya S., Mount D.: Approximate range searching. Comput. Geom. Theory Appl. 17(3\u20134), 135\u2013152 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2\u20133","key":"290_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00371-002-0182-y","volume":"19","author":"M. Attene","year":"2003","unstructured":"Attene M., Biasotti S., Spagnuolo M.: Shape understanding by contour-driven retiling. Vis Comput 19(2\u20133), 127\u2013138 (2003)","journal-title":"Vis Comput"},{"key":"290_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R. Bhatia","year":"1997","unstructured":"Bhatia R.: Matrix Analysis. Springer, Berlin (1997)"},{"key":"290_CR7","doi-asserted-by":"crossref","unstructured":"Biasotti, S.: Reeb graph representation of surfaces with boundary. In: SMI \u201904: Proceedings of the Shape Modeling International 2004, pp. 371\u2013374, Washington, DC, USA. IEEE Computer Society (2004)","DOI":"10.1109\/SMI.2004.1314530"},{"issue":"9","key":"290_CR8","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1016\/j.cad.2006.07.003","volume":"38","author":"S. Biasottia","year":"2006","unstructured":"Biasottia S., Marini S., Spagnuoloa M., Falcidieno B.: Sub-part correspondence by structural descriptors of 3D shapes. Comput. Aided Design 38(9), 1002\u20131019 (2006)","journal-title":"Comput. Aided Design"},{"issue":"2","key":"290_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0022-5193(73)90175-6","volume":"38","author":"H. Blum","year":"1973","unstructured":"Blum H.: Biological shape and visual science (part I). J. Theoret. Biol. 38(2), 205\u2013287 (1973)","journal-title":"J. Theoret. Biol."},{"issue":"9","key":"290_CR10","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"Bunke H.: Error correcting graph matching: on the influence of the underlying cost function. IEEE Trans. Pattern Anal. Mach. Intell. 21(9), 917\u2013922 (1999)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"290_CR11","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1002\/net.20152","volume":"49","author":"J. C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres J., Grima C.I., M\u00e1rquez A., Moreno-Gonz\u00e1lez A.: Dilation-free graphs in the l1 metric. Network 49(2), 168\u2013174 (2007)","journal-title":"Network"},{"key":"290_CR12","doi-asserted-by":"crossref","unstructured":"Chen, Q., Lim, A., Ong, K.: D(k)-index: an adaptive structural summary for graph-structured data. In: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 134\u2013144. ACM, New York (2003)","DOI":"10.1145\/872773.872776"},{"issue":"11","key":"290_CR13","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/34.888709","volume":"22","author":"J. Chuang","year":"2000","unstructured":"Chuang J., Tsai C., Ko M.: Skeletonization of three-dimensional object using generalized potential field. IEEE Trans. Pattern Anal. Mach. Intell. 22(11), 1241\u20131251 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"290_CR14","doi-asserted-by":"crossref","unstructured":"Cole-McLaughlin, K., Edelsbrunner, H., Harer, J., Natarajan, V., Pascucci, V.: Loops in Reeb graphs of 2-manifolds. In: Discrete and Computational Geometry, pp. 231\u2013244 (2004)","DOI":"10.1007\/s00454-004-1122-6"},{"key":"290_CR15","unstructured":"Costa, M.S., Shapiro, L.G.: Relational indexing. In: SSPR \u201996: Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition, pp. 130\u2013139, London, UK, 1996. Springer, Berlin (1996)"},{"issue":"3","key":"290_CR16","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.cviu.2007.09.012","volume":"110","author":"M.F. Demirci","year":"2008","unstructured":"Demirci M.F., van Leuken R.H., Veltkamp R.C.: Indexing through laplacian spectra. Comput. Vis. Image Underst. 110(3), 312\u2013325 (2008)","journal-title":"Comput. Vis. Image Underst."},{"key":"290_CR17","unstructured":"Fortin, S.: The graph isomorphism problem. Technical report, The University of Alberta, Edmonton, Alberta, Canada (1996)"},{"key":"290_CR18","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 135\u2013143. ACM, New York (1984)","DOI":"10.1145\/800057.808675"},{"key":"290_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"1\u20133","key":"290_CR20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1023761518825","volume":"54","author":"P. Giblin","year":"2003","unstructured":"Giblin P., Kimia B.: On the local form and transitions of symmetry sets, medial axes, and shocks. Int. J. Comput. Vis. 54(1\u20133), 143\u2013156 (2003)","journal-title":"Int. J. Comput. Vis."},{"key":"290_CR21","doi-asserted-by":"crossref","unstructured":"Godsil, C.D., McKay, B.D.: Constructing cospectral graphs. In: Aequationes Mathematicae, vol. 25, pp. 257\u2013268. Birkh\u00e3user Basel (1982)","DOI":"10.1007\/BF02189621"},{"key":"290_CR22","doi-asserted-by":"crossref","unstructured":"Gohberg, J.C., Krein, M.G.: Introduction to the theory of linear non-selfadjoint operators. In: Translations of Mathematical Monographs, vol. 18. AMS, New York (1969)","DOI":"10.1090\/mmono\/018"},{"key":"290_CR23","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold S., Rangarajan A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18, 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"290_CR24","unstructured":"Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In Proceedings of 23rd International Conference on Very Large Data Bases, August 25\u201329, 1997, pp. 436\u2013445. Morgan Kaufmann, Menlo Park (1997)"},{"key":"290_CR25","volume-title":"Object Recognition by Computer: The Role of Geometric Constraints","author":"W.E.L. Grimson","year":"1990","unstructured":"Grimson W.E.L., Lozano-Perez T., Huttenlocher D.P.: Object Recognition by Computer: The Role of Geometric Constraints. MIT Press, Cambridge (1990)"},{"issue":"2","key":"290_CR26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0195-6698(03)00100-8","volume":"25","author":"W.H. Haemers","year":"2004","unstructured":"Haemers W.H., Spence E.: Enumeration of cospectral graphs. Eur. J. Comb. 25(2), 199\u2013211 (2004)","journal-title":"Eur. J. Comb."},{"key":"290_CR27","volume-title":"Inequalities","author":"G.H. Hardy","year":"1959","unstructured":"Hardy G.H., Littlewood J.E., P\u00f3lya G.: Inequalities. Cambridge University Press, Cambridge (1959)"},{"key":"290_CR28","doi-asserted-by":"crossref","unstructured":"Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3D shapes. In: SIGGRAPH \u201901: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, pp. 203\u2013212. ACM Press, New York (2001)","DOI":"10.1145\/383259.383282"},{"key":"290_CR29","doi-asserted-by":"crossref","unstructured":"Horaud, R., Skordas, T.: Structural matching for stereo vision. In: Nineth International Conference on Pattern Recognition, pp. 439\u2013445, Rome, Italy (1988)","DOI":"10.1109\/ICPR.1988.28261"},{"key":"290_CR30","volume-title":"Topics in Matrix Analysis","author":"R.A. Horn","year":"1999","unstructured":"Horn R.A., Johnson C.R.: Topics in Matrix Analysis. Cambridge University Press, New York (1999)"},{"key":"290_CR31","doi-asserted-by":"crossref","unstructured":"Kittler, J., Christmas, W.J., Petrou, M.: Probabilistic relaxation for matching of symbolic structures. In: Workshop Structural and Syntactic Pattern Recognition, pp. 471\u2013480, Bern, Switzerland (1992)","DOI":"10.1142\/9789812797919_0040"},{"issue":"1","key":"290_CR32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/060649070","volume":"29","author":"A.V. Knyazev","year":"2006","unstructured":"Knyazev A.V., Argentati M.E.: Majorization for changes in angles between subspaces, ritz values, and graph laplacian spectra. SIAM J. Matrix Anal. Appl. 29(1), 15\u201332 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"290_CR33","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-8655(89)90046-9","volume":"9","author":"S.W. Lee","year":"1989","unstructured":"Lee S.W., Kim J.H.: Attributed stroke graph matching for seal imprint verification. Pattern Recognit. Lett. 9, 137\u2013145 (1989)","journal-title":"Pattern Recognit. Lett."},{"key":"290_CR34","doi-asserted-by":"crossref","unstructured":"Lueker, G.S.: A data structure for orthogonal range queries. In: Proceedings of 19th IEEE Symposium on Foundations of Computer Science, pp. 28\u201334 (1978)","DOI":"10.1109\/SFCS.1978.1"},{"key":"290_CR35","volume-title":"Inequalities: Theory of Majorization and Its Applications. Mathematics in Science and Engineering, vol. 143","author":"A.W. Marshall","year":"1979","unstructured":"Marshall A.W., Olkin I.: Inequalities: Theory of Majorization and Its Applications. Mathematics in Science and Engineering, vol. 143. Academic Press, New York (1979)"},{"key":"290_CR36","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","volume":"197","author":"R. Merris","year":"1994","unstructured":"Merris R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197, 143\u2013176 (1994)","journal-title":"Linear Algebra Appl."},{"issue":"12","key":"290_CR37","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1016\/S0031-3203(98)90142-X","volume":"32","author":"B.T. Messmer","year":"1999","unstructured":"Messmer B.T., Bunke H.: A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognit. 32(12), 1979\u20131998 (1999)","journal-title":"Pattern Recognit."},{"issue":"6","key":"290_CR38","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.is.2004.04.003","volume":"30","author":"J. Min","year":"2005","unstructured":"Min J., Chung C., Shim K.: An adaptive path index for xml data using the query workload. Inf. Syst. 30(6), 467\u2013487 (2005)","journal-title":"Inf. Syst."},{"key":"290_CR39","unstructured":"Mohar, B.: The Laplacian spectrum of graphs. In: Sixth International Conference on the Theory and Applications of Graphs, pp. 871\u2013898 (1988)"},{"issue":"1\u20133","key":"290_CR40","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(92)90288-Q","volume":"109","author":"B. Mohar","year":"1992","unstructured":"Mohar B.: Laplace eigenvalues of graphs: a survey. Discrete Math 109(1\u20133), 171\u2013183 (1992)","journal-title":"Discrete Math"},{"key":"290_CR41","doi-asserted-by":"crossref","unstructured":"Nievergelt, J., Widmayer, P.: Spatial data structures: Concepts and design choices. In: Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems, pp. 153\u2013197, London, UK. Springer, Berlin (1997)","DOI":"10.1007\/3-540-63818-0_6"},{"issue":"2","key":"290_CR42","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/cviu.1997.0631","volume":"70","author":"K. Sengupta","year":"1998","unstructured":"Sengupta K., Boyer K.L.: Modelbase partitioning using property matrix spectra. Comput. Vis. Image Underst. 70(2), 177\u2013196 (1998)","journal-title":"Comput. Vis. Image Underst."},{"issue":"5","key":"290_CR43","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","volume":"3","author":"L.G. Shapiro","year":"1981","unstructured":"Shapiro L.G., Haralick R.M.: Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. Mach. Intell. 3(5), 504\u2013519 (1981)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"290_CR44","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0262-8856(92)90043-3","volume":"10","author":"L.S. Shapiro","year":"1992","unstructured":"Shapiro L.S., Brady J.M.: Feature-based correspondence: an eigenvector approach. Image Vision Computing 10(5), 283\u2013288 (1992)","journal-title":"Image Vision Computing"},{"key":"290_CR45","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 39\u201352. ACM, New York (2002)","DOI":"10.1145\/543613.543620"},{"issue":"8","key":"290_CR46","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi J., Malik J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"290_CR47","doi-asserted-by":"crossref","unstructured":"Shmulevich, I., Yli-harja, O., Coyle, E.: Perceptual issues in music pattern recognition\u2014complexity of rhythm and key finding. In: Computers and the Humanities, pp. 23\u201335 (2001)","DOI":"10.1023\/A:1002629217152"},{"issue":"7","key":"290_CR48","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/TPAMI.2005.142","volume":"27","author":"A. Shokoufandeh","year":"2005","unstructured":"Shokoufandeh A., Macrini D., Dickinson S., Siddiqi K., Zucker S.W.: Indexing hierarchical structures using graph spectra. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), 1125\u20131140 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"290_CR49","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1008102926703","volume":"35","author":"K. Siddiqi","year":"1999","unstructured":"Siddiqi K., Shokoufandeh A., Dickinson S., Zucker S.: Shock graphs and shape matching. Int. J. Comput. Vis. 35(1), 13\u201332 (1999)","journal-title":"Int. J. Comput. Vis."},{"key":"290_CR50","doi-asserted-by":"crossref","unstructured":"Sossa, H., Horaud, R.: Model indexing: the graph-hashing approach. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 811\u2013814, Champaign, IL, USA (1992)","DOI":"10.1109\/CVPR.1992.223252"},{"key":"290_CR51","unstructured":"Sparaggis, P.D., Cassandras C.G., Towsley, D.: Very weak, p-weak majorization and their application. In: Proceedings of the 31st IEEE Conference on Decision and Control, Tucson, AZ, USA (1992)"},{"issue":"1","key":"290_CR52","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1162\/jocn.1991.3.1.71","volume":"3","author":"M. Turk","year":"1991","unstructured":"Turk M., Pentland A.P.: Eigenfaces for recognition. J. Cognit. Neurosci. 3(1), 71\u201386 (1991)","journal-title":"J. Cognit. Neurosci."},{"issue":"5","key":"290_CR53","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"290_CR54","doi-asserted-by":"crossref","unstructured":"Valiente, G.: A general method for graph isomorphism. In: Proceedings of the 13th International Symposium on Fundamentals of Computation Theory, pp. 428\u2013431, London, UK. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44669-9_49"},{"key":"290_CR55","unstructured":"Veltkamp, R., ter Haar, F.: Shrec 2007: 3D Shape Retrieval Contest. Technical Report UU-CS-2007-015, Department of Information and Computing Sciences, Utrecht University (2007)"},{"key":"290_CR56","doi-asserted-by":"crossref","unstructured":"Wang, Y.K., Fan, KC., Horng, JT.: Genetic-based search for error-correcting graph isomorphism. IEEE Trans. Syst. Man Cybernet. 27 (1997)","DOI":"10.1109\/3477.604100"},{"issue":"1","key":"290_CR57","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","volume":"14","author":"D.E. Willard","year":"1985","unstructured":"Willard D.E.: New data structures for orthogonal range queries. SIAM J. Comput. 14(1), 232\u2013253 (1985)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"290_CR58","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1016\/S0031-3203(98)00152-6","volume":"32","author":"M.L. Williams","year":"1999","unstructured":"Williams M.L., Wilson R.C., Hancock E.R.: Deterministic search for relational graph matching. Pattern Recognit. 32(7), 1255\u20131271 (1999)","journal-title":"Pattern Recognit."},{"key":"290_CR59","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/34.601251","volume":"19","author":"R. Wilson","year":"1997","unstructured":"Wilson R., Hancock E.: Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19, 634\u2013648 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"290_CR60","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0031-3203(92)90111-U","volume":"25","author":"E.K. Wong","year":"1992","unstructured":"Wong E.K.: Model matching in robot vision by subgraph isomorphism. Pattern Recognit. 25(3), 287\u2013303 (1992)","journal-title":"Pattern Recognit."},{"key":"290_CR61","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of data, pp. 335\u2013346. ACM, New York (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"290_CR62","doi-asserted-by":"crossref","unstructured":"Zhang, J., Siddiqi, K., Macrini, D., Shokoufandeh, A., Dickinson, S.J.: Retrieving articulated 3D models using medial surfaces and their graph spectra. In: International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, pp. 285\u2013300, St. Augustine, FL, USA (2005)","DOI":"10.1007\/11585978_19"}],"container-title":["Machine Vision and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-010-0290-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00138-010-0290-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-010-0290-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T01:22:42Z","timestamp":1740360162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00138-010-0290-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,11]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["290"],"URL":"https:\/\/doi.org\/10.1007\/s00138-010-0290-z","relation":{},"ISSN":["0932-8092","1432-1769"],"issn-type":[{"type":"print","value":"0932-8092"},{"type":"electronic","value":"1432-1769"}],"subject":[],"published":{"date-parts":[[2010,8,11]]}}}