{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:25:46Z","timestamp":1743009946283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196435"},{"type":"electronic","value":"9783319196442"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19644-2_9","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T18:15:39Z","timestamp":1432836939000},"page":"99-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Platform for Matching Context in Real Time"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Olaru","sequence":"first","affiliation":[]},{"given":"Adina Magda","family":"Florea","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"E Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, E.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1\u20136 (1973)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR2","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"9_CR3","doi-asserted-by":"crossref","first-page":"2867","DOI":"10.1016\/S0031-3203(01)00232-1","volume":"35","author":"E Bengoetxea","year":"2002","unstructured":"Bengoetxea, E., Larra\u00f1aga, P., Bloch, I., Perchant, A., Boeres, C.: Inexact graph matching by means of estimation of distribution algorithms. Pattern Recogn. 35(12), 2867\u20132880 (2002)","journal-title":"Pattern Recogn."},{"issue":"2","key":"9_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.pmcj.2009.06.002","volume":"6","author":"C Bettini","year":"2010","unstructured":"Bettini, C., Brdiczka, O., Henricksen, K., Indulska, J., Nicklas, D., Ranganathan, A., Riboni, D.: A survey of context modelling and reasoning techniques. Pervasive Mob. Comput. 6(2), 161\u2013180 (2010)","journal-title":"Pervasive Mob. Comput."},{"issue":"4","key":"9_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1361348.1361353","volume":"36","author":"C Bolchini","year":"2007","unstructured":"Bolchini, C., Curino, C., Quintarelli, E., Schreiber, F., Tanca, L.: A data-oriented survey of context models. ACM SIGMOD Rec. 36(4), 19\u201326 (2007)","journal-title":"ACM SIGMOD Rec."},{"issue":"9","key":"9_CR6","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"6","key":"9_CR7","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T Caetano","year":"2009","unstructured":"Caetano, T., McAuley, J., Cheng, L., Le, Q., Smola, A.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-7643-7361-X_10","volume-title":"Ontologies for Agents: Theory and Experiences","author":"H Chen","year":"2005","unstructured":"Chen, H., Finin, T., Joshi, A.: The SOUPA ontology for pervasive computing. In: Cranefield, S., Finin, W.T., Willmott, S., Tamma, V. (eds.) Ontologies for Agents: Theory and Experiences, pp. 233\u2013258. Birkh\u00e4user Basel, Basel (2005)"},{"issue":"3","key":"9_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"10","key":"9_CR10","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Dobrescu, A., Olaru, A.: Graph matching for context recognition. In: Dumitrache, I., Florea, A.M., Pop, F. (eds.) In: Proceedings of CSCS 19, 19th International Conference on Control Systems and Computer Science, pp. 479\u2013486. IEEE Xplore, Romania, 29\u201313 May 2013","DOI":"10.1109\/CSCS.2013.56"},{"issue":"17","key":"9_CR12","first-page":"1","volume":"2","author":"PJ Durand","year":"1999","unstructured":"Durand, P.J., Pasari, R., Baker, J.W.: An efficient algorithm for similarity analysis of molecules. Internet J. Chem. 2(17), 1\u201316 (1999)","journal-title":"Internet J. Chem."},{"issue":"01","key":"9_CR13","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recog. Artif. Intell. 28(01), 1554\u20131585 (2014)","journal-title":"Int. J. Pattern Recog. Artif. Intell."},{"issue":"1","key":"9_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci. 250(1), 1\u201330 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"35","author":"B Luo","year":"2001","unstructured":"Luo, B., Hancock, E.: Structural graph matching using the EM algorithm and singular value decomposition. IEEE Trans. Pattern Anal. Mach. Intell. 35, 1120\u20131136 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"9_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Softw. Pract. Experience 12(1), 23\u201334 (1982)","journal-title":"Softw. Pract. Experience"},{"issue":"2","key":"9_CR17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/69.842269","volume":"12","author":"B Messmer","year":"2000","unstructured":"Messmer, B., Bunke, H.: Efficient subgraph isomorphism detection: a decomposition approach. IEEE Trans. Knowl. Data Eng. 12(2), 307\u2013323 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Olaru, A.: Context matching for ambient intelligence applications. In: Bj\u00f6rner, N., Negru, V., Ida, T., Jebelean, T., Petcu, D., Watt, S., Zaharie, D. (eds.) In: Proceedings of SYNASC 2013, 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 265\u2013272. IEEE CPS, Romania, 23\u201326 September 2013","DOI":"10.1109\/SYNASC.2013.42"},{"issue":"3","key":"9_CR19","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s11036-012-0408-9","volume":"18","author":"A Olaru","year":"2013","unstructured":"Olaru, A., Florea, A.M., El Fallah Seghrouchni, A.: A context-aware multi-agent system as a middleware for ambient intelligence. Mob. Netw. Appl. 18(3), 429\u2013443 (2013)","journal-title":"Mob. Netw. Appl."},{"issue":"1","key":"9_CR20","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/SURV.2013.042313.00197","volume":"16","author":"C Perera","year":"2013","unstructured":"Perera, C., Zaslavsky, A., Christen, P., Georgakopoulos, D.: Context aware computing for the internet of things: a survey. IEEE Commun. Surv. Tutorials 16(1), 414\u2013454 (2013)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"4","key":"9_CR21","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/1978802.1978815","volume":"43","author":"F Sadri","year":"2011","unstructured":"Sadri, F.: Ambient intelligence: a survey. ACM Comput. Surv. 43(4), 36 (2011)","journal-title":"ACM Comput. Surv."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-1-4939-1887-4_32","volume-title":"Context in Computing","author":"RM Turner","year":"2014","unstructured":"Turner, R.M.: Context-mediated behavior. In: Br\u00e9zillon, p, Gonzalez, A.J. (eds.) Context in Computing, pp. 523\u2013539. Springer, New York (2014)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19644-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:32:52Z","timestamp":1676017972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19644-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196435","9783319196442"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19644-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}