{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:01:29Z","timestamp":1742954489550,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031188398"},{"type":"electronic","value":"9783031188404"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18840-4_29","type":"book-chapter","created":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T07:04:51Z","timestamp":1667631891000},"page":"407-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Decoding of\u00a0Hidden Markov Models with\u00a0Consistency Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3302-870X","authenticated-orcid":false,"given":"Alexandre","family":"Dubray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Derval","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,6]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Adam, A., Finance, O., Thomas, I.: Monitoring trucks to reveal belgian geographical structures and dynamics: From GPS traces to spatial interactions. J. Transp. Geogr. 91, 102977 (2021)","DOI":"10.1016\/j.jtrangeo.2021.102977"},{"key":"29_CR2","unstructured":"Bird, S., Klein, E., Loper, E.: Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit. O\u2019Reilly Media, Inc. (2009)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Christiansen, H., Have, C.T., Lassen, O.T., Petit, M.: Inference with constrained hidden markov models in prism. Theory Pract. Logic Program. 10, (2010)","DOI":"10.1017\/S1471068410000219"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Cooper, M.C., De Givry, S., S\u00e1nchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artif. Intell. 174, 449-478 (2010)","DOI":"10.1016\/j.artint.2010.02.001"},{"key":"29_CR5","unstructured":"Dubray, A., Derval, G., Nijssen, S., Schaus, P.: On the complexity of the shortest path problem in a layered directed acyclic graph with consistency constraints (2022). 2078.1\/264677"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Fallmann, S., Kropf, J.: Human activity recognition of continuous data using hidden markov models and the aspect of including discrete data. In: UIC, pp.121\u2013126 (2016)","DOI":"10.1109\/UIC-ATC-ScalCom-CBDCom-IoP-SmartWorld.2016.0039"},{"key":"29_CR7","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10601-016-9245-y","volume":"21","author":"B Hurley","year":"2016","unstructured":"Hurley, B., et al.: Multi-language evaluation of exact solvers in graphical model discrete optimization. Constraints 21(3), 413\u2013434 (2016). https:\/\/doi.org\/10.1007\/s10601-016-9245-y","journal-title":"Constraints"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Kabir, M.H., Hoque, M.R., Thapa, K., Yang, S.H.: Two-layer hidden markov model for human activity recognition in home environments. Int. J. Distrib. Sens. Netw. IJDSN. 2016, 1\u201312 (2016)","DOI":"10.1155\/2016\/4560365"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Rabiner, L.R.: A tutorial on hidden markov models and selected applications in speech recognition. In: Proceedings of the IEEE (1989)","DOI":"10.1016\/B978-0-08-051584-7.50027-9"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Roth, D., Yih, W.T.: Integer linear programming inference for conditional random fields. In: ICML (2005)","DOI":"10.1145\/1102351.1102444"},{"key":"29_CR12","unstructured":"Rush, A.M., Sontag, D., Collins, M., Jaakkola, T.: On dual decomposition and linear programming relaxations for natural language processing (2010)"},{"key":"29_CR13","unstructured":"Sato, T., Kameya, Y.: Prism: a language for symbolic-statistical modeling. In: IJCAI (1997)"},{"key":"29_CR14","unstructured":"Schiex, T., de Givry, S., Sanchez, M.: Toulbar2-an open source weighted constraint satisfaction solver (2006). https:\/\/toulbar2.github.io\/toulbar2"},{"key":"29_CR15","unstructured":"Sonnhammer, E.L., et al.: A hidden markov model for predicting transmembrane helices in protein sequences. In: ISMB (1998)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Taghavi, M., Irannezhad, E., Prato, C.G.: Identifying truck stops from a large stream of GPS data via a hidden markov chain model. In: ITCS (2019)","DOI":"10.1109\/ITSC.2019.8917156"},{"issue":"12","key":"29_CR17","doi-asserted-by":"publisher","first-page":"2945","DOI":"10.1587\/transinf.2017EDP7109","volume":"10","author":"F Takeuchi","year":"2017","unstructured":"Takeuchi, F., Nishino, M., Yasuda, N., Akiba, T., Minato, S.I., Nagata, M.: BDD-constrained a* search: a fast method for solving constrained shortest-path problems. IEICE Trans. Inform. Syst. 10(12), 2945\u20132952 (2017)","journal-title":"IEICE Trans. Inform. Syst."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Van Kasteren, T., Noulas, A., Englebienne, G., Kr\u00f6se, B.: Accurate activity recognition in a home setting. In: UbiComp, pp. 1-9,(2008)","DOI":"10.1145\/1409635.1409637"},{"issue":"2","key":"29_CR19","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"13","author":"A Viterbi","year":"1967","unstructured":"Viterbi, A.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theo. 13(2), 260\u2013269 (1967)","journal-title":"IEEE Trans. Inform. Theo."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Yoshikawa, M., Mineshima, K., Noji, H., Bekki, D.: Consistent CCG parsing over multiple sentences for improved logical reasoning. arXiv preprint (2018)","DOI":"10.18653\/v1\/N18-2065"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18840-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T07:10:38Z","timestamp":1667632238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18840-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031188398","9783031188404"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18840-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montpellier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ds2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}