Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Improved Algorithm For Distributed Points Positioning Using Uncertain Objects Clustering (CROSBI ID 239518)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Lukić, Ivica ; Köhler, Mirko ; Galba, Tomislav Improved Algorithm For Distributed Points Positioning Using Uncertain Objects Clustering // Tehnički vjesnik : znanstveno-stručni časopis tehničkih fakulteta Sveučilišta u Osijeku, 26 (2019), 2; 283-288. doi: 10.17559/TV-20151109144645

Podaci o odgovornosti

Lukić, Ivica ; Köhler, Mirko ; Galba, Tomislav

engleski

Improved Algorithm For Distributed Points Positioning Using Uncertain Objects Clustering

Positioning of mobile objects that require communication with some kind of online service application is very challenging task. Proper positioning with minimal deviation ensures that mobile service system (MSS) e.g. taxi service used in this paper, would complete its tasks to the end users and reduce overall travel distance. This paper is focused on development of the algorithm that will find the best location for MSS object and to improve its efficiency when uncertain data clustering is used. If best location for the mobile system object is chosen, then the respond time can be minimized and the given tasks could also be performed in a reasonable time. Improved bisector pruning method was proposed for clustering previous data of MSS objects to find the best location for its application. Cluster centres are used as best locations for MSS objects. In this way, total expected distance from tasks that have been set to the service system is minimized. Therefore, MSS will be improved and capable to fulfil more tasks during the shortest period of time.

Clustering ; Data Mining ; Euclidian Distance ; Information Service ; Positioning

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

26 (2)

2019.

283-288

objavljeno

1330-3651

10.17559/TV-20151109144645

Povezanost rada

Računarstvo, Informacijske i komunikacijske znanosti

Poveznice
Indeksiranost