Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitemtc-m21c.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP3W34R/42GRPC2
Repositorysid.inpe.br/mtc-m21c/2020/05.20.14.24
Last Update2020:05.20.14.24.51 (UTC) simone
Metadata Repositorysid.inpe.br/mtc-m21c/2020/05.20.14.24.51
Metadata Last Update2023:01.30.13.10.00 (UTC) administrator
Secondary KeyINPE--PRE/
Citation KeyTanakaVieiKast:2015:EfAlDi
TitleEfficient algorithms to discover flock patterns in trajectories
Year2015
Access Date2024, Apr. 24
Secondary TypePRE CN
Number of Files1
Size438 KiB
2. Context
Author1 Tanaka, Pedro Sena
2 Vieira, Marcos R.
3 Kaster, Daniel S.
Affiliation1 Universidade Estadual de Londrina (UEL)
2 Big Data Research Lab
3 Universidade Estadual de Londrina (UEL)
Author e-Mail Address1 pedro.stanaka@gmail.com
2 marcos.vieira@hds.com
3 dskaster@uel.br
EditorFileto, Renato
Korting, Thales Sehn
Conference NameSimpósio Brasileiro de Geoinformática, 16 (GEOINFO)
Conference LocationCampos do Jordão, SP
Date27 nov. a 02 dez.
PublisherInstituto Nacional de Pesquisas Espaciais (INPE)
Publisher CitySão José dos Campos
Book TitleAnais
History (UTC)2020-05-20 14:25:27 :: simone -> administrator :: 2015
2023-01-30 13:10:00 :: administrator -> simone :: 2015
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
AbstractWith the ubiquitous use of location enabled devices, pattern discovery in trajectories has been receiving increasing interest. Among such patterns, we have queries related to how groups of moving objects behave over time such as discovering flocks. A flock pattern is defined as a set of moving objects that move within a predefined distance to each other for a given continuous period of time. A typical application example is surveillance, where relies on discovering flocks on very large streaming spatiotemporal data efficiently. Previous work presented a polynomial solution to the problem of finding flocks with fixed time duration. And presented as well a set of algorithms based on this solution, which are the state-of-the-art algorithms regarding this problem. In this paper, we improve those algorithms by applying the plane sweeping technique in conjunction to an inverted index. The plane sweeping accelerates the detection of groups of objects that are candidates to be a flock in a time instant and the inverted index is used to compare candidate disks across time instants quickly. Using an assortment of real-world trajectory datasets, we show that our proposed methods are very efficient. When compared with the baseline flock algorithm, our proposed methods achieved up to 46x speedup reducing the elapsed time from thousands of seconds to milliseconds.
AreaSRE
Arrangement 1urlib.net > Fonds > GEOINFO > XVI GEOINFO > Efficient algorithms to...
Arrangement 2urlib.net > BDMCI > Fonds > Produção anterior à 2021 > DIDPI > XVI GEOINFO > Efficient algorithms to...
Arrangement 3urlib.net > BDMCI > Fonds > GEOINFO > Coleção GEOINFO > Efficient algorithms to...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 20/05/2020 11:24 1.0 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGP3W34R/42GRPC2
zipped data URLhttp://urlib.net/zip/8JMKD3MGP3W34R/42GRPC2
Languageen
Target Filetanaka_efficient1.pdf
User Groupsimone
Reader Groupadministrator
simone
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositoryurlib.net/www/2017/11.22.19.04.03
Next Higher Units8JMKD3MGPDW34P/42T288P
8JMKD3MGPDW34P/48F29JE
Citing Item Listsid.inpe.br/mtc-m16c/2020/07.21.21.26 2
Host Collectionurlib.net/www/2017/11.22.19.04
6. Notes
Empty Fieldsarchivingpolicy archivist callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination doi e-mailaddress edition format group isbn issn keywords label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readpermission resumeid rightsholder schedulinginformation secondarydate secondarymark serieseditor session shorttitle sponsor subject tertiarymark tertiarytype type url versiontype volume
7. Description control
e-Mail (login)simone
update 


Close