DocumentCode
3582747
Title
Computing traffic congestion degree using SNS-based graph structure
Author
Kusmawan, Putu Y. ; Bonghee Hong ; Seungwoo Jeon ; Jiwan Lee ; Joonho Kwon
Author_Institution
Dept. of Electr. & Comput. Eng., Pusan Nat. Univ., Busan, South Korea
fYear
2014
Firstpage
397
Lastpage
404
Abstract
Social networking site (SNS) messages can contain subjective traffic information, including congestion-related expressions such as “bad traffic” or “traffic is crazy”. Moreover, they also contain heterogeneous levels of location information, such as a point (latitude, longitude), a road, or an area name, which complicates the process of collecting related traffic information. This paper aims to use SNS messages for monitoring traffic conditions on a road by computing the traffic congestion degree. The process begins by classifying those SNS messages that are related to a road in terms of location information and constructing an initial graph structure to store each message. Because of the heterogeneous location types, we need to combine the initial graph structures based on their spatial references. We can then measure the subjective congestion by computing an expression score using our rule-based approach.
Keywords
graph theory; knowledge based systems; road traffic; social networking (online); traffic information systems; SNS-based graph structure; road traffic condition monitoring; rule-based approach; social networking site message; traffic congestion degree computing; traffic information; Bridges; Dictionaries; Merging; Monitoring; Roads; Sensors; Twitter; Traffic congestion degree; graph structure; sns message;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Systems and Applications (AICCSA), 2014 IEEE/ACS 11th International Conference on
Type
conf
DOI
10.1109/AICCSA.2014.7073226
Filename
7073226
Link To Document