Social networks contain a large amount of information on transportation, e.g., traffic accidents, congestions, and vehicles. Such information is the original ideas of people with respect to real-world transportation issues, and detecting communities on the topic of transportation from the information will benefit many ITS applications. However, real-world social network nodes often contain multiple attributes, and the network can be very large. The two properties can lead to confusion and unscalability problem to clustering methods. In this paper, we propose a semisupervised method, namely, \underline{Tra}nsportation \underline{C}ommunity \underline{De}tection (TRACED), to address this problem. TRACED allows multiple individuals to select their familiar nodes as the participants of a certain community, and thus, the confusion of multiple attributes can be largely reduced. Moreover, the proposed method can be expanded to large networks since it is able to conduct an effective clustering with low time complexity. With the help of TRACED, we can detect densely connected communities on the topic of transportation for further studies.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Detecting Communities on Topic of Transportation With Sparse Crowd Annotations




    Publication date :

    2017




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    55.84 Straßenverkehr / 55.24 / 55.84 / 55.24 Fahrzeugführung, Fahrtechnik



    Detecting Communities on Topic of Transportation With Sparse Crowd Annotations

    Cao, Jianping / Wang, Senzhang / Wang, Hui | IEEE | 2017



    Crowd management in transportation infrastructures

    Forschungszentrum Jülich / University of Wuppertal / Ruhr University Bochum | DataCite | 2022


    Over-Crowd Avoiding In Transportation With Face DetectionUsing Raspberrypi

    Suneel, T / Vishnu Mahesh, A S / Akhil Kumar, B et al. | IEEE | 2024