Mobility Mining Using Nonnegative Tensor Factorization

dc.contributor.author Nosratabadi,HE en
dc.contributor.author Hadi Fanaee Tork en
dc.contributor.author João Gama en
dc.date.accessioned 2018-01-19T09:43:01Z
dc.date.available 2018-01-19T09:43:01Z
dc.date.issued 2017 en
dc.description.abstract Mobility mining has lots of applications in urban planning and transportation systems. In particular, extracting mobility patterns enables service providers to have a global insight about the mobility behaviors which consequently leads to providing better services to the citizens. In the recent years several data mining techniques have been presented to tackle this problem. These methods usually are either spatial extension of temporal methods or temporal extension of spatial methods. However, still a framework that can keep the natural structure of mobility data has not been considered. Non-negative tensor factorizations (NNTF) have shown great applications in topic modelling and pattern recognition. However, unfortunately their usefulness in mobility mining is less explored. In this paper we propose a new mobility pattern mining framework based on a recent non-negative tensor model called BetaNTF. We also present a new approach based on interpretability concept for determination of number of components in the tensor rank selection process. We later demonstrate some meaningful mobility patterns extracted with the proposed method from bike sharing network mobility data in Boston, USA. © Springer International Publishing AG 2017. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/7041
dc.identifier.uri http://dx.doi.org/10.1007/978-3-319-65340-2_27 en
dc.language eng en
dc.relation 5732 en
dc.relation 5120 en
dc.rights info:eu-repo/semantics/openAccess en
dc.title Mobility Mining Using Nonnegative Tensor Factorization en
dc.type conferenceObject en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
P-00M-YHT.pdf
Size:
670.28 KB
Format:
Adobe Portable Document Format
Description: