<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0575836</ARLID> <utime>20250310155947.7</utime><mtime>20230926235959.9</mtime>   <SCOPUS>85175788005</SCOPUS> <WOS>001075119400005</WOS>  <DOI>10.14311/NNW.2023.33.017</DOI>           <title language="eng" primary="1">Using Poisson proximity-based weights for traffic flow state prediction</title>  <specification> <page_count>25 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0290321</ARLID><ISSN>1210-0552</ISSN><title>Neural Network World</title><part_num/><part_title/><volume_id>33</volume_id><volume>4 (2023)</volume><page_num>291-315</page_num><publisher><place/><name>Ústav informatiky AV ČR, v. v. i.</name><year/></publisher></serial>    <keyword>traffic counts</keyword>   <keyword>traffic flow state</keyword>   <keyword>cluster prediction</keyword>   <keyword>Poisson mixture</keyword>   <keyword>recursive mixture estimation</keyword>    <author primary="1"> <ARLID>cav_un_auth*0383037</ARLID> <name1>Uglickich</name1> <name2>Evženie</name2> <institution>UTIA-B</institution> <full_dept language="cz">Zpracování signálů</full_dept> <full_dept language="eng">Department of Signal Processing</full_dept> <department language="cz">ZS</department> <department language="eng">ZS</department> <full_dept>Department of Signal Processing</full_dept> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101167</ARLID> <name1>Nagy</name1> <name2>Ivan</name2> <institution>UTIA-B</institution> <full_dept language="cz">Zpracování signálů</full_dept> <full_dept>Department of Signal Processing</full_dept> <department language="cz">ZS</department> <department>ZS</department> <full_dept>Department of Signal Processing</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <source_type>pdf</source_type> <url>http://library.utia.cas.cz/separaty/2023/ZS/uglickich-0575836.pdf</url> </source> <source> <url>http://nnw.cz/doi/2023/NNW.2023.33.017.pdf</url>  </source>        <cas_special> <project> <project_id>8A21009</project_id> <agency>GA MŠk</agency> <ARLID>cav_un_auth*0432581</ARLID> </project>  <abstract language="eng" primary="1">The development of traffic state prediction algorithms embedded in intelligent transportation systems is of great importance for improving traffic conditions for drivers and pedestrians.  Despite the large number of prediction methods, existing limitations still confirm the need to find a systematic solution and its adaptation to specific traffic data. This paper focuses on the relationship between traffic flow states in different urban locations, where these states are identified as clusters of traffic counts. Extending the recursive Bayesian mixture estimation theory to the Poisson mixtures, the paper uses the mixture pointers to construct the traffic state prediction model. Using the predictive model, the cluster at the target urban location is predicted based on the traffic counts measured in real time at the explanatory urban location. The main contributions of this study are: (i) recursive identification and prediction of the traffic state at each time instant, (ii) straightforward Poisson mixture initialization, and (iii) systematic theoretical background of the prediction approach.   Results of testing the prediction algorithm on real traffic counts are presented.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BB</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10103</FORD2>    <reportyear>2024</reportyear>      <num_of_auth>2</num_of_auth>  <unknown tag="mrcbC52"> 2 R hod 4 4rh 4 20250310155031.2 4 20250310155947.7 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>https://hdl.handle.net/11104/0345847</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> Article Computer Science Artificial Intelligence </unknown> <unknown tag="mrcbC91"> A </unknown>         <unknown tag="mrcbT16-e">COMPUTERSCIENCE.ARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-f">1</unknown> <unknown tag="mrcbT16-g">0.1</unknown> <unknown tag="mrcbT16-h">7.9</unknown> <unknown tag="mrcbT16-i">0.00016</unknown> <unknown tag="mrcbT16-j">0.164</unknown> <unknown tag="mrcbT16-k">328</unknown> <unknown tag="mrcbT16-q">30</unknown> <unknown tag="mrcbT16-s">0.251</unknown> <unknown tag="mrcbT16-y">30.07</unknown> <unknown tag="mrcbT16-x">1.29</unknown> <unknown tag="mrcbT16-3">87</unknown> <unknown tag="mrcbT16-4">Q4</unknown> <unknown tag="mrcbT16-5">0.500</unknown> <unknown tag="mrcbT16-6">26</unknown> <unknown tag="mrcbT16-7">Q4</unknown> <unknown tag="mrcbT16-C">9.9</unknown> <unknown tag="mrcbT16-D">Q4</unknown> <unknown tag="mrcbT16-E">Q4</unknown> <unknown tag="mrcbT16-M">0.11</unknown> <unknown tag="mrcbT16-N">Q4</unknown> <unknown tag="mrcbT16-P">9.9</unknown> <arlyear>2023</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: uglickich-0575836.pdf </unknown>    <unknown tag="mrcbU14"> 85175788005 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 001075119400005 WOS </unknown> <unknown tag="mrcbU56"> pdf </unknown> <unknown tag="mrcbU63"> cav_un_epca*0290321 Neural Network World 1210-0552 Roč. 33 č. 4 2023 291 315 Ústav informatiky AV ČR, v. v. i. </unknown> </cas_special> </bibitem>