{"id":"https://openalex.org/W2602044404","doi":"https://doi.org/10.1109/ifost.2016.7884135","title":"Method for estimating origin-destination matrices using Markov models","display_name":"Method for estimating origin-destination matrices using Markov models","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2602044404","doi":"https://doi.org/10.1109/ifost.2016.7884135","mag":"2602044404"},"language":"en","primary_location":{"id":"doi:10.1109/ifost.2016.7884135","doi":"https://doi.org/10.1109/ifost.2016.7884135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ifost.2016.7884135","pdf_url":null,"source":{"id":"https://openalex.org/S4306419988","display_name":"International Forum on Strategic Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th International Forum on Strategic Technology (IFOST)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070419477","display_name":"Valeriy I. Khabarov","orcid":"https://orcid.org/0000-0002-7690-241X","observed_orcids":["https://orcid.org/0000-0002-7690-241X"]},"institutions":[{"id":"https://openalex.org/I91727514","display_name":"Novosibirsk State Technical University","ror":"https://ror.org/01b2f6h61","country_code":"RU","type":"education","lineage":["https://openalex.org/I91727514"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Valeriy Khabarov","raw_affiliation_strings":["Department of Theoretical and Applied Informatics, NSTU, Novosibirsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Theoretical and Applied Informatics, NSTU, Novosibirsk, Russia","institution_ids":["https://openalex.org/I91727514"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074053113","display_name":"Alexandr Tesselkin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I91727514","display_name":"Novosibirsk State Technical University","ror":"https://ror.org/01b2f6h61","country_code":"RU","type":"education","lineage":["https://openalex.org/I91727514"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexandr Tesselkin","raw_affiliation_strings":["Department of Theoretical and Applied Informatics, NSTU, Novosibirsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Theoretical and Applied Informatics, NSTU, Novosibirsk, Russia","institution_ids":["https://openalex.org/I91727514"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91727514"],"apc_list":null,"apc_paid":null,"fwci":1.1531,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77048155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"389","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8130000233650208,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8130000233650208,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.033799998462200165,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13601","display_name":"Urban Transport Systems Analysis","score":0.026200000196695328,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/origin-destination-matrix-estimation","display_name":"origin-destination matrix estimation","score":0.9459999799728394},{"id":"https://openalex.org/keywords/markov-chains","display_name":"Markov chains","score":0.6029999852180481},{"id":"https://openalex.org/keywords/transition-probabilities","display_name":"transition probabilities","score":0.6510000228881836},{"id":"https://openalex.org/keywords/transportation-networks","display_name":"transportation networks","score":0.6740000247955322},{"id":"https://openalex.org/keywords/fundamental-matrix","display_name":"fundamental matrix","score":0.7929999828338623},{"id":"https://openalex.org/keywords/maximum-likelihood-estimation","display_name":"maximum likelihood estimation","score":0.8510000109672546}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.8514014482498169},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.7032572031021118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6178150773048401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5804151892662048},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5518273115158081},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.5246589183807373},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.48185810446739197},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4682639241218567},{"id":"https://openalex.org/C76408418","wikidata":"https://www.wikidata.org/wiki/Q5419314","display_name":"Examples of Markov chains","level":5,"score":0.44116508960723877},{"id":"https://openalex.org/C147080032","wikidata":"https://www.wikidata.org/wiki/Q176720","display_name":"Continuous-time Markov chain","level":5,"score":0.4277358651161194},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4062294661998749},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37722405791282654},{"id":"https://openalex.org/C158917313","wikidata":"https://www.wikidata.org/wiki/Q4849964","display_name":"Balance equation","level":4,"score":0.3461902141571045},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3166871964931488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3034745454788208},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14773967862129211},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.11970314383506775},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11157682538032532},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ifost.2016.7884135","doi":"https://doi.org/10.1109/ifost.2016.7884135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ifost.2016.7884135","pdf_url":null,"source":{"id":"https://openalex.org/S4306419988","display_name":"International Forum on Strategic Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th International Forum on Strategic Technology (IFOST)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5378999710083008,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2006093883","https://openalex.org/W2038138468","https://openalex.org/W2044807855","https://openalex.org/W2052474426","https://openalex.org/W2060140077","https://openalex.org/W2797618158","https://openalex.org/W4213214460","https://openalex.org/W7131643398"],"related_works":["https://openalex.org/W2593405742","https://openalex.org/W7099380555","https://openalex.org/W2169655705","https://openalex.org/W2434274165","https://openalex.org/W2915212070","https://openalex.org/W575402444","https://openalex.org/W579912176","https://openalex.org/W2126446298","https://openalex.org/W1759670244","https://openalex.org/W3133518908"],"abstract_inverted_index":{"The":[0],"method":[1,49,66,98],"of":[2,10,19,28,31,43,59,80,84,95],"origin-destination":[3,76],"flows":[4],"estimation":[5],"based":[6],"on":[7],"Markov":[8,61],"properties":[9],"a":[11,20,56,74,81,92],"transportation":[12,21,36,86],"network":[13],"is":[14,23,38,46,63,67,88],"considered.":[15],"A":[16,25,48],"formal":[17],"description":[18],"graph":[22,37,87],"provided.":[24,47,100],"canonical":[26],"form":[27],"the":[29,35,60,96],"matrix":[30,58,82],"transition":[32,44,53],"probabilities":[33,45,54],"for":[34,50,72,91],"obtained.":[39],"Maximum":[40],"likelihood":[41],"estimates":[42],"estimating":[51],"indirect":[52],"using":[55],"fundamental":[57],"chain":[62],"proposed.":[64],"This":[65],"able":[68],"to":[69],"be":[70],"used":[71],"obtaining":[73],"transport":[75],"matrix.":[77],"An":[78],"example":[79],"calculation":[83],"some":[85],"presented.":[89],"Opportunities":[90],"practical":[93],"usage":[94],"proposed":[97],"are":[99]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2017-04-07T00:00:00"}