Ing. Maroš Čavojský, PhD.
maros.cavojsky@stuba.sk
profile photo

Assistant professor at Mobile Computing Group
Faculty of Electrical Engineering and Information Technology
Slovak University of Technology
Ilkovicova 3,
81219 Bratislava,
Slovakia.
http://www.fei.stuba.sk

PhD. student - Erasmus Winter 2017/2018
CTU Faculty of Electrical Engineering
Technická 2,
166 27 PRAGUE,
Czech Republic.
http://www.fel.cvut.cz
Mobile Computing Group
Web: http://www.mcomputing.eu
Mail: mcomputing.eu@gmail.com
Address:
Faculty of Electrical Engineering and Information Technology
Slovak University of Technology
Ilkovicova 3,
81219 Bratislava,
Slovakia.
http://www.fei.stuba.sk

Témy pre záverečné práce

Analýza a modelovanie pohybu objektov/ludi/zvierat.


Aj takto môže vyzerať vizualizácia dopravy v mega-aglomerácii ako je mesto Peking. Vizualizácia zobrazuje dátovú množinu Geolife od Microsoft Research Asia. Táto dátová množina bola využitá v nedávno publikovanom článku Analysis and Experimental Evaluation of the Needleman-Wunsch Algorithm for Trajectory Comparison, ktorý využíva Needleman-Wunsch algoritmus na porovnávanie trajektórií a ich zhlukovanie podľa podobnosti.


Aj ako téma na dizertačnú tému pre tvoje PhD. štúdium, ak máš záujem napíš a radi sa ti ozveme či máme v našom výskumnom tíme voľné miesto práve pre teba. Samozrejme ak máš záujem vyskúšať si niečo praktické, a máš záujem o túto tému pre svoju bakalársku či diplomovú prácu budeme radi ak nám napíšeš na maros.cavojsky@stuba.sk .

Odporucana Literatúra pre BP/DP:

Authors,Title,Publication,Volume,Number,Pages,Year,Publisher
"Zheng, Bolong; Weng, Lianggui; Zhao, Xi; Zeng, Kai; Zhou, Xiaofang; Jensen, Christian S; ",REPOSE: distributed top-k trajectory similarity search with local reference point tries,2021 IEEE 37th International Conference on Data Engineering (ICDE),,,708-719,2021,IEEE
"Chen, Lei; Özsu, M Tamer; Oria, Vincent; ",Robust and fast similarity search for moving object trajectories,Proceedings of the 2005 ACM SIGMOD international conference on Management of data,,,491-502,2005,
"Faloutsos, Christos; Ranganathan, Mudumbai; Manolopoulos, Yannis; ",Fast subsequence matching in time-series databases,Acm Sigmod Record,23,2,419-429,1994,"ACM New York, NY, USA"
"Shang, Zeyuan; Li, Guoliang; Bao, Zhifeng; ",DITA: distributed in-memory trajectory analytics,Proceedings of the 2018 International Conference on Management of Data,,,725-740,2018,
"Li, Haoda; Li, Guoliang; Liu, Jiayang; Yuan, Haitao; Wang, Haiquan; ",Ratel: Interactive analytics for large scale trajectories,Proceedings of the 2019 International Conference on Management of Data,,,1949-1952,2019,
"Parent, Christine; Spaccapietra, Stefano; Renso, Chiara; Andrienko, Gennady; Andrienko, Natalia; Bogorny, Vania; Damiani, Maria Luisa; Gkoulalas-Divanis, Aris; Macedo, Jose; Pelekis, Nikos; ",Semantic trajectories modeling and analysis,ACM Computing Surveys (CSUR),45,4,1-32,2013,"ACM New York, NY, USA"
"Andrienko, Gennady; Andrienko, Natalia; Wrobel, Stefan; ",Visual analytics tools for analysis of movement data,ACM SIGKDD Explorations Newsletter,9,2,38-46,2007,"ACM New York, NY, USA"
"Andrienko, Natalia; Andrienko, Gennady; Pelekis, Nikos; Spaccapietra, Stefano; ",Basic concepts of movement data,"Mobility, data mining and privacy",,,15-38,2008,Springer
"Luo, Ting; Zheng, Xinwei; Xu, Guangluan; Fu, Kun; Ren, Wenjuan; ",An improved DBSCAN algorithm to detect stops in individual trajectories,ISPRS International Journal of Geo-Information,6,3,63,2017,MDPI
"Zheng, Yu; Zhang, Lizhu; Xie, Xing; Ma, Wei-Ying; ",Mining interesting locations and travel sequences from GPS trajectories,Proceedings of the 18th international conference on World wide web,,,791-800,2009,
Čavojský, Maroš, and Martin Drozda. "Comparison of user trajectories with the Needleman-Wunsch algorithm." International Conference on Mobile Computing, Applications, and Services. Springer, Cham, 2019.
Čavojský, Maroš, Martin Drozda, and Zoltán Balogh. "Analysis and experimental evaluation of the Needleman-Wunsch algorithm for trajectory comparison." Expert Systems with Applications 165 (2021): 114068.
Needleman–Wunsch algorithm,  https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm
Smith–Waterman algorithm, https://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm
Levenshtein distance, https://en.wikipedia.org/wiki/Levenshtein_distance
Geohash, https://en.wikipedia.org/wiki/Geohash

http://search.mcomputing.eu/  - Only from STU network ( VPN needed, if not at faculty)