This document proposes methods for mining interesting locations and travel sequences from GPS trajectory data. It presents a system that first models user location histories through stay point detection and hierarchical clustering. It then infers location interest and user travel experience using a HITS-based model that considers the mutual reinforcement between users and locations. Experiments on a real GPS dataset show the proposed approach outperforms baselines in ranking interesting locations and classical travel sequences. The document also discusses related work and potential future directions.
Second part of the Course "Java Open Source GIS Development - From the building blocks to extending an existing GIS application." held at the University of Potsdam in August 2011
Technical presentation of the gesture based NUI I developed for the Aigaio smart conference room in IIT Demokritos
Demo In Greek:
https://www.youtube.com/watch?v=5C_p7MHKA4g
You can watch the replay for this Geek Sync webcast in the IDERA Resource Center: http://ow.ly/nvY550A5gH1
In this session, you will learn how to create, procure and leverage spatial data. You will be made aware of tools you can use to integrate your own spatial data with a variety of public data sources such as the Census Bureau, National Weather Service, etc. Functions and T-SQL commands related to spatial data analysis will be demonstrated. We will end the session by using the geometry data type to actually mimic a bitmapped picture using SQL (that's the fun part!).
Finding Meaning in Points, Areas and Surfaces: Spatial Analysis in RRevolution Analytics
Everything happens somewhere and spatial analysis attempts to use location as an explanatory variable. Such analysis is made complex by the very many ways we habitually record spatial location, the complexity of spatial data structures, and the wide variety of possible domain-driven questions we might ask. One option is to develop and use software for specific types of spatial data, another is to use a purpose-built geographical information system (GIS), but determined work by R enthusiasts has resulted in a multiplicity of packages in the R environment that can also be used.
Looking into the past - feature extraction from historic maps using Python, O...James Crone
Tutorial presentation providing an overview of extracting geospatial features from scanned historic maps in an automated fashion using Python, OpenCV and PostGIS.
Global Map Matching using BLE Beacons for Indoor Route and Stay EstimationDaisuke Yamamoto
This slide was presented at ACM SIGSPATIAL 2018.
https://sigspatial2018.sigspatial.org/
Author is Daisuke Yamamoto.
Author's web site is here
http://yamamoto.web.nitech.ac.jp/
Daisuke Yamamoto, Ryosuke Tanaka, Shinsuke Kajioka, Hiroshi Matsuo, Naohisa Takahashi, Global Map Matching using BLE Beacons for Indoor Route and Stay Estimation, Proc. of the 26th ACM SIGSPATIAL 2018, pp. 309-318, Seatlle, Nov. 2018.
https://doi.org/10.1145/3274895.3274918
Second part of the Course "Java Open Source GIS Development - From the building blocks to extending an existing GIS application." held at the University of Potsdam in August 2011
Technical presentation of the gesture based NUI I developed for the Aigaio smart conference room in IIT Demokritos
Demo In Greek:
https://www.youtube.com/watch?v=5C_p7MHKA4g
You can watch the replay for this Geek Sync webcast in the IDERA Resource Center: http://ow.ly/nvY550A5gH1
In this session, you will learn how to create, procure and leverage spatial data. You will be made aware of tools you can use to integrate your own spatial data with a variety of public data sources such as the Census Bureau, National Weather Service, etc. Functions and T-SQL commands related to spatial data analysis will be demonstrated. We will end the session by using the geometry data type to actually mimic a bitmapped picture using SQL (that's the fun part!).
Finding Meaning in Points, Areas and Surfaces: Spatial Analysis in RRevolution Analytics
Everything happens somewhere and spatial analysis attempts to use location as an explanatory variable. Such analysis is made complex by the very many ways we habitually record spatial location, the complexity of spatial data structures, and the wide variety of possible domain-driven questions we might ask. One option is to develop and use software for specific types of spatial data, another is to use a purpose-built geographical information system (GIS), but determined work by R enthusiasts has resulted in a multiplicity of packages in the R environment that can also be used.
Looking into the past - feature extraction from historic maps using Python, O...James Crone
Tutorial presentation providing an overview of extracting geospatial features from scanned historic maps in an automated fashion using Python, OpenCV and PostGIS.
Global Map Matching using BLE Beacons for Indoor Route and Stay EstimationDaisuke Yamamoto
This slide was presented at ACM SIGSPATIAL 2018.
https://sigspatial2018.sigspatial.org/
Author is Daisuke Yamamoto.
Author's web site is here
http://yamamoto.web.nitech.ac.jp/
Daisuke Yamamoto, Ryosuke Tanaka, Shinsuke Kajioka, Hiroshi Matsuo, Naohisa Takahashi, Global Map Matching using BLE Beacons for Indoor Route and Stay Estimation, Proc. of the 26th ACM SIGSPATIAL 2018, pp. 309-318, Seatlle, Nov. 2018.
https://doi.org/10.1145/3274895.3274918
Explore our comprehensive data analysis project presentation on predicting product ad campaign performance. Learn how data-driven insights can optimize your marketing strategies and enhance campaign effectiveness. Perfect for professionals and students looking to understand the power of data analysis in advertising. for more details visit: https://bostoninstituteofanalytics.org/data-science-and-artificial-intelligence/
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
Data Centers - Striving Within A Narrow Range - Research Report - MCG - May 2...pchutichetpong
M Capital Group (“MCG”) expects to see demand and the changing evolution of supply, facilitated through institutional investment rotation out of offices and into work from home (“WFH”), while the ever-expanding need for data storage as global internet usage expands, with experts predicting 5.3 billion users by 2023. These market factors will be underpinned by technological changes, such as progressing cloud services and edge sites, allowing the industry to see strong expected annual growth of 13% over the next 4 years.
Whilst competitive headwinds remain, represented through the recent second bankruptcy filing of Sungard, which blames “COVID-19 and other macroeconomic trends including delayed customer spending decisions, insourcing and reductions in IT spending, energy inflation and reduction in demand for certain services”, the industry has seen key adjustments, where MCG believes that engineering cost management and technological innovation will be paramount to success.
MCG reports that the more favorable market conditions expected over the next few years, helped by the winding down of pandemic restrictions and a hybrid working environment will be driving market momentum forward. The continuous injection of capital by alternative investment firms, as well as the growing infrastructural investment from cloud service providers and social media companies, whose revenues are expected to grow over 3.6x larger by value in 2026, will likely help propel center provision and innovation. These factors paint a promising picture for the industry players that offset rising input costs and adapt to new technologies.
According to M Capital Group: “Specifically, the long-term cost-saving opportunities available from the rise of remote managing will likely aid value growth for the industry. Through margin optimization and further availability of capital for reinvestment, strong players will maintain their competitive foothold, while weaker players exit the market to balance supply and demand.”
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...Subhajit Sahu
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
Show drafts
volume_up
Empowering the Data Analytics Ecosystem: A Laser Focus on Value
The data analytics ecosystem thrives when every component functions at its peak, unlocking the true potential of data. Here's a laser focus on key areas for an empowered ecosystem:
1. Democratize Access, Not Data:
Granular Access Controls: Provide users with self-service tools tailored to their specific needs, preventing data overload and misuse.
Data Catalogs: Implement robust data catalogs for easy discovery and understanding of available data sources.
2. Foster Collaboration with Clear Roles:
Data Mesh Architecture: Break down data silos by creating a distributed data ownership model with clear ownership and responsibilities.
Collaborative Workspaces: Utilize interactive platforms where data scientists, analysts, and domain experts can work seamlessly together.
3. Leverage Advanced Analytics Strategically:
AI-powered Automation: Automate repetitive tasks like data cleaning and feature engineering, freeing up data talent for higher-level analysis.
Right-Tool Selection: Strategically choose the most effective advanced analytics techniques (e.g., AI, ML) based on specific business problems.
4. Prioritize Data Quality with Automation:
Automated Data Validation: Implement automated data quality checks to identify and rectify errors at the source, minimizing downstream issues.
Data Lineage Tracking: Track the flow of data throughout the ecosystem, ensuring transparency and facilitating root cause analysis for errors.
5. Cultivate a Data-Driven Mindset:
Metrics-Driven Performance Management: Align KPIs and performance metrics with data-driven insights to ensure actionable decision making.
Data Storytelling Workshops: Equip stakeholders with the skills to translate complex data findings into compelling narratives that drive action.
Benefits of a Precise Ecosystem:
Sharpened Focus: Precise access and clear roles ensure everyone works with the most relevant data, maximizing efficiency.
Actionable Insights: Strategic analytics and automated quality checks lead to more reliable and actionable data insights.
Continuous Improvement: Data-driven performance management fosters a culture of learning and continuous improvement.
Sustainable Growth: Empowered by data, organizations can make informed decisions to drive sustainable growth and innovation.
By focusing on these precise actions, organizations can create an empowered data analytics ecosystem that delivers real value by driving data-driven decisions and maximizing the return on their data investment.
Mining interesting locations and travel sequences from gps trajectories
1. ining Interesting Locations
and Travel Sequences from
GPS Trajectories
Yu Zheng, Lizhu Zhang, Xing Xie, Wei-Ying Ma
Microsoft Research Asia
M
Johnson Chin-Hui Chen
20090923 Seminar
2.
3.
4. Agenda
! Introduction
! Overview of the System
! Modeling Location History
! Location Interest Inference
! Experiments
! Related Work
! Future Work
5. INTRODUCTION
! GPS-enabled devices, like GPS-phones, are
changing the way people interact with the Web by
using locations as contexts.
! Users record their outdoor movements because…
! Travel experience sharing
! Life logging
! Sports activity analysis
! Multimedia content management
7. INTRODUCTION
! Although there are many raw GPS data…
! Without much understanding
! It’s impossible to browse each GPS trajectory one by one
8. INTRODUCTION
! Goal :
! Mine the top n interesting locations
! Mine the top m classical travel sequences
! Mine the most k experienced users in a geo-related
community
Culturally important places
(Statue of Liberty in NY)
Commonly frequented public areas
(shopping streets)
9. INTRODUCTION
! Difficulty :
! What is a location? (geographical scales)
! The interest level of a location
! not only frequency or counts
! but also lie in these users’ travel experiences
! How to determine a user’s travel experience?
! The location interest and user travel
! are region-related
(conditioned by the given geospatial region)
! are relative value (Ranking problem)
(not reasonable to judge whether or not a location is interesting)
10. Agenda
! Introduction
! Overview of the System
! Modeling Location History
! Location Interest Inference
! Experiments
! Related Work
! Future Work
11. OVERVIEW OF THE SYSTEM
! Preliminary
! Clarify some terms
! Architecture
! Application
! GeoLife 2.0 since Oct. 2007
12. OVERVIEW OF THE SYSTEM
Preliminary
! GPS logs P and GPS trajectory
! Stay points S = {s1, s2,…, sn}.
! P = {pm,pm+1,…,pn} is a group of consecutive GPS points
S.lat = avg lat of P S.arvT = pm.T
S.lngt = avg lngt of P S.levT = pn.T
p4
p3
p5
p6
p7
AStay Point S
p1
p2
Latitude, Longitude, Time
p1: Lat1, Lngt 1, T1
p2: Lat2, Lngt 2, T2
………...
pn: Latn, Lngtn, Tn
13. OVERVIEW OF THE SYSTEM
Preliminary
! Location history :
! represented by a sequence of stay points
! with transition intervals
! Tree-Based Hierarchy H :
! H = (C,L)
! L = {ʅ1 , ʅ2 , … , ʅn}
! C = {Cij| }
! jth cluster on level ʅi
! Ci : level ʅi clusters
𝐿�𝑜�𝑐�𝐻� = (𝑠�1
∆𝑡�1
𝑠�2
∆𝑡�2
,…,
∆𝑡�𝑛�− 1
ǦǦ 𝑠�𝑛� )
Stands for a stay point S
Stands for a stay point cluster cij
{C }
High
Low
Shared Hierarchical Framework
c10
c20 c21
c30 c31 c32 c33 c34
14. OVERVIEW OF THE SYSTEM
Preliminary
! Tree-Based Hierarchical Graph (TBHG)
! TBHG = (H,G)
! H = Tree-Based Hierarchy
! G={gi = (Ci,Ei), } l1
G3
G1
G2
c30
c31
c32
c33
c34
c20
c21 l2
l3
|L|i<1 ≤
15. OVERVIEW OF THE SYSTEM
! Preliminary
! Clarify some terms
! Architecture
! Application
! GeoLife 2.0 since Oct. 2007
20. Agenda
! Introduction
! Overview of the System
! Modeling Location History
! Location Interest Inference
! Experiments
! Related Work
! Future Work
22. MODELING LOCATION HISTORY
GPS Logs of
User 1
GPS Logs of
User 2
GPS Logs of
User n
GPS Logs of
Useri
GPS Logs of
User i+1
GPS Logs of
Usern-1
Stands for a stay point S
Stands for a stay point cluster cij
{C }
High
Low
c10
c20 c21
c30 c31 c32 c33 c34
1. Stay point detection
2. Hierarchical clustering
l1
G3
G1
G2
c30
c31
c32
c33
c34
c20
c21 l2
l3
3.Graph Building
23. GPS Logs of
User 1
GPS Logs of
User 2
GPS Logs of
User n
GPS Logs of
Useri
GPS Logs of
User i+1
GPS Logs of
Usern-1
Stands for a stay point S
Stands for a stay point cluster cij
{C }
High
Low
c10
c20 c21
c30 c31 c32 c33 c34
1. Stay point detection
2. Hierarchical clustering
l1
G3
G1
G2
c30
c31
c32
c33
c34
c20
c21 l2
l3
3.Graph Building
25. Agenda
! Introduction
! Overview of the System
! Modeling Location History
! Location Interest Inference
! Experiments
! Related Work
! Future Work
30. LOCATION INTEREST INFERENCE
HITS-Based Inference Model
l1
G3
G1
G2
c30
c31
c32
c33
c34
c20
c21 l2
l3
Users:
Hub nodes
Locations:
Authority nodes
Mutual reinforcement relationship
A user with rich travel knowledge are more likely to visit
more interesting locations.
A interesting location would be accessed by many users with
rich travel knowledge.
31. LOCATION INTEREST INFERENCE
HITS-Based Inference Model
! Difficulty : region-related
! aligned with the query-dependent property of HITS
! But online selection is time consuming …
! Using the regions specified by their ascendant clusters
! a location have multiple authority scores based on the different
region scales it falls in.
! a user have multiple hub scores conditioned by the regions of
different clusters.
l1
G3
G1
G2
c30
c31
c32
c33
c34
c20
c21 l2
l3
32. LOCATION INTEREST INFERENCE
HITS-Based Inference Model
! Location Interest :
! Authority scores (cij)
: the auth scores of cij based on the region specified by
its ascendant nodes on level ,where
! User Travel Experience :
! Hub scores ( )
Stands for a stay point S
Stands for a stay point cluster cij
{C }
High
Low
Shared Hierarchical Framework
c10
c20 c21
c30 c31 c32 c33 c34
33. LOCATION INTEREST INFERENCE
HITS-Based Inference Model
33
{C }
Ascendant
Stands for a stay point cluster cij
{C }
Descendant
A region specified by a user
Stands for a cluster that covers the region specified by the user
c35c31 c32 c33 c34 c35c31 c32 c33 c34
A) A region covering locations
from single parent cluster
B) A region covering locations
from multiple parent clusters
c11
c22c21
c11
c22c21{C }
Ascendant
Stands for a stay point cluster cij
{C }
Descendant
A region specified by a user
Stands for a cluster that covers the region specified by the user
c35c31 c32 c33 c34 c35c31 c32 c33 c34
A) A region covering locations
from single parent cluster
B) A region covering locations
from multiple parent clusters
c11
c22c21
c11
c22c21
37. LOCATION INTEREST INFERENCE
Mining Classical Travel Sequences
37
• Three factors determining the classical score :
– Travel experiences (hub scores) of the users taking the sequence
– The location interests (authority scores) weighted by
– The probability that people would take a specific sequence
: Authority score of location A
: Authority score of location C
: User k’s hub score
38. LOCATION INTEREST INFERENCE
Mining Classical Travel Sequences
: Authority score of location A
: Authority score of location C
: User k’s hub score
𝑆�𝐴�𝐶� = ﻃ (𝑎�𝐴� · 𝑂�𝑢�𝑡�𝐴�𝐶� + 𝑎�𝐶� · 𝐼�𝑛�𝐴�𝐶� + ℎ𝑘�
𝑢�𝑘�∈𝑈�𝐴�𝐶�
)
A
B
C D
E
2 3
4
45
6
3
2 1
The classical score of sequence A!C:
39. Agenda
! Introduction
! Overview of the System
! Modeling Location History
! Location Interest Inference
! Experiments
! Related Work
! Future Work
43. EXPERIMENTS
Setting
! Parameter Selection
! Stay point detection :
! Tthreh = 20 mins
! Dthreh = 200m
! Extract 10,354 stay points
! Clustering :
! Use OPTICS (Ordering Points To Identify the Clustering
Structure)
Capable of detecting irregular structures
44. EXPERIMENTS
Evaluation Approaches
! User study : 29 subjects (M:F = 15:14) , who have
been in Beijing for more than 6 years
! Location : the fourth ring road of Beijing ( )
45. EXPERIMENTS
Evaluation Approaches
! 2 aspects of evaluations
! Presentation (ability of the retrieved interesting locations)
! Representative : How many locations in this retrieved set are
representative of the given region (0-10) ?
! Comprehensive : Do these locations offer a comprehensive view
of the given region (1-5) ?
! Novelty : How many locations in this retrieved set have
interested you even though they only appeared recently(0-10) ?
! Rank (ranking performance)
47. EXPERIMENTS
Evaluation Approaches
! Baselines :
! Mining interesting locations :
! Rank-by-count
! Rank-by-frequency
! Mining classical travel sequences :
! Rank-by-count
! Rank-by-interests
Consider interests of the locations in a sequence
! Rank-by-experience
Consider experiences of the users who have taken this sequence
49. EXPERIMENTS
Result
! Results Related to Interesting Locations
! Presentation ability
only 2.4>2.2 doesn’t pass T-test (p>0.2).
! Ranking ability
! There are 60% overlaping (ours vs rank-by-count) , but show
effectively ranking.
50. EXPERIMENTS
Result
! Results Related to Classical Sequences
! Classical rate : the ratio of sequences with a score of
2 in the set.
! Combine …
! user’s travel experiences + rank-by-counts : improved
! locations interests + rank-by-counts : improved
51. EXPERIMENTS
Discussions
! About Interesting Locations
! Why Rank-by-count is bad ?
! Why Rank-by-frequency is bad ?
! About Classical Sequences
! Only Rank-by-counts ?
! Only individuals’ travel experiences ?
! Only location interest ?
52. Agenda
! Introduction
! Overview of the System
! Modeling Location History
! Location Interest Inference
! Experiments
! Related Work
! Future Work
53. RELATED WORK
! Mining Location History
! Mining individual location history
! Mining multiple users’ location histories
1. Detecting significant locations of a user. [2004]
2. Predicting the user’s movement among these
locations. [2005]
3. Recognizing user-specific activities at each
location. [2003]
1. Mining similar sequences from users’ moving
trajectories. [2007]
2. Propose a framework for retrieving maximum
periodic patterns. [2004]
3. Predict where a driver may be going as a trip
progresses. [2003]
4. Recognizing the social pattern in daily user activity.
[2005]
54. RELATED WORK
! Location Recommenders
! Recommenders based on real-time location
! Recommender based on location history
1. Problem: Without understanding the individual and
the nearby locations.
2. Filter away from the returned results the invisible
entities occluded by building. [2007]
1. Recommend geographic locations like shops to
users. [2006]
2. Proposed an enhanced collaborative filtering
solution. [2006]
55. Agenda
! Introduction
! Overview of the System
! Modeling Location History
! Location Interest Inference
! Experiments
! Related Work
! Future Work
56. FUTURE WORK
! Grouping users based on their histories.
! Clustering locations in terms of people’s visits.