26,435 research outputs found

    Community Detection from Location-Tagged Networks

    Full text link
    Many real world systems or web services can be represented as a network such as social networks and transportation networks. In the past decade, many algorithms have been developed to detect the communities in a network using connections between nodes. However in many real world networks, the locations of nodes have great influence on the community structure. For example, in a social network, more connections are established between geographically proximate users. The impact of locations on community has not been fully investigated by the research literature. In this paper, we propose a community detection method which takes locations of nodes into consideration. The goal is to detect communities with both geographic proximity and network closeness. We analyze the distribution of the distances between connected and unconnected nodes to measure the influence of location on the network structure on two real location-tagged social networks. We propose a method to determine if a location-based community detection method is suitable for a given network. We propose a new community detection algorithm that pushes the location information into the community detection. We test our proposed method on both synthetic data and real world network datasets. The results show that the communities detected by our method distribute in a smaller area compared with the traditional methods and have the similar or higher tightness on network connections

    Location Prediction: Communities Speak Louder than Friends

    Get PDF
    Humans are social animals, they interact with different communities of friends to conduct different activities. The literature shows that human mobility is constrained by their social relations. In this paper, we investigate the social impact of a person's communities on his mobility, instead of all friends from his online social networks. This study can be particularly useful, as certain social behaviors are influenced by specific communities but not all friends. To achieve our goal, we first develop a measure to characterize a person's social diversity, which we term `community entropy'. Through analysis of two real-life datasets, we demonstrate that a person's mobility is influenced only by a small fraction of his communities and the influence depends on the social contexts of the communities. We then exploit machine learning techniques to predict users' future movement based on their communities' information. Extensive experiments demonstrate the prediction's effectiveness.Comment: ACM Conference on Online Social Networks 2015, COSN 201

    Event detection in location-based social networks

    Get PDF
    With the advent of social networks and the rise of mobile technologies, users have become ubiquitous sensors capable of monitoring various real-world events in a crowd-sourced manner. Location-based social networks have proven to be faster than traditional media channels in reporting and geo-locating breaking news, i.e. Osama Bin Laden’s death was first confirmed on Twitter even before the announcement from the communication department at the White House. However, the deluge of user-generated data on these networks requires intelligent systems capable of identifying and characterizing such events in a comprehensive manner. The data mining community coined the term, event detection , to refer to the task of uncovering emerging patterns in data streams . Nonetheless, most data mining techniques do not reproduce the underlying data generation process, hampering to self-adapt in fast-changing scenarios. Because of this, we propose a probabilistic machine learning approach to event detection which explicitly models the data generation process and enables reasoning about the discovered events. With the aim to set forth the differences between both approaches, we present two techniques for the problem of event detection in Twitter : a data mining technique called Tweet-SCAN and a machine learning technique called Warble. We assess and compare both techniques in a dataset of tweets geo-located in the city of Barcelona during its annual festivities. Last but not least, we present the algorithmic changes and data processing frameworks to scale up the proposed techniques to big data workloads.This work is partially supported by Obra Social “la Caixa”, by the Spanish Ministry of Science and Innovation under contract (TIN2015-65316), by the Severo Ochoa Program (SEV2015-0493), by SGR programs of the Catalan Government (2014-SGR-1051, 2014-SGR-118), Collectiveware (TIN2015-66863-C2-1-R) and BSC/UPC NVIDIA GPU Center of Excellence.We would also like to thank the reviewers for their constructive feedback.Peer ReviewedPostprint (author's final draft

    Scalable Mining of Common Routes in Mobile Communication Network Traffic Data

    Get PDF
    A probabilistic method for inferring common routes from mobile communication network traffic data is presented. Besides providing mobility information, valuable in a multitude of application areas, the method has the dual purpose of enabling efficient coarse-graining as well as anonymisation by mapping individual sequences onto common routes. The approach is to represent spatial trajectories by Cell ID sequences that are grouped into routes using locality-sensitive hashing and graph clustering. The method is demonstrated to be scalable, and to accurately group sequences using an evaluation set of GPS tagged data

    New Applications of Radio Frequency Identification Stations for Monitoring Fish Passage through Headwater Road Crossings and Natural Reaches

    Get PDF
    Within the Ouachita National Forest, roads and streams intersect each other thousands of times. Many of these road crossings alter stream hydrology and potentially limit longitudinal fish movement. To investigate the potential impacts of these road crossings on fish passage, we monitored movements of 3 native fish species (n = 2,171) individually tagged with radio frequency identification (RFID) tags in 2012 and 2013. We installed solar-powered RFID stations in 2 streams with road crossings and 2 reference streams without road crossings. Each of the 4 monitoring stations included a pair of antennas bracketing a road crossing (or similarly-sized natural reach) to continuously detect upstream or downstream passage. To monitor natural reference streams, we avoided full-duplex RFID technology, which would have required rigid in-stream structures. Alternatively, we utilized new applications of RFID technology such as direct in-stream installation of half-duplex wire antennas and figure-eight crossover antenna designs. These techniques appear promising, but technical difficulties limited the consistency of fish passage detection and consequently limited the strength of ecological conclusions. Even so, we report evidence that fish passed at significantly higher rates across reference reaches than reaches with road crossings. Furthermore, Creek Chub (Semotilus atromaculatus) passed reference reaches at significantly higher rates than Highland Stonerollers (Campostoma spadiceum), which passed at higher rates than Longear Sunfish (Lepomis megalotis). Stream intermittency appeared to exacerbate reduced passage rates associated with the road crossings
    corecore