اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدInferring High Quality Co-Travel Networks
106
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Social networks provide a new perspective for enterprises to better understand their customers and have attracted substantial attention in industry. However, inferring high quality customer social networks is a great challenge while there are no explicit customer relations in many traditional OLTP environments. In this paper, we study this issue in the field of passenger transport and introduce a new member to the family of social networks, which is named Co-Travel Networks, consisting of passengers connected by their co-travel behaviors. We propose a novel method to infer high quality co-travel networks of civil aviation passengers from their co-booking behaviors derived from the PNRs (Passenger Naming Records). In our method, to accurately evaluate the strength of ties, we present a measure of Co-Journey Times to count the co-travel times of complete journeys between passengers. We infer a high quality co-travel network based on a large encrypted PNR dataset and conduct a series of network analyses on it. The experimental results show the effectiveness of our inferring method, as well as some special characteristics of co-travel networks, such as the sparsity and high aggregation, compared with other kinds of social networks. It can be expected that such co-travel networks will greatly help the industry to better understand their passengers so as to improve their services. More importantly, we contribute a special kind of social networks with high strength of ties generated from very close and high cost travel behaviors, for further scientific researches on human travel behaviors, group travel patterns, high-end travel market evolution, etc., from the perspective of social networks.
قيم البحث
اقرأ أيضاً
In the past decade, blogging web sites have become more sophisticated and influential than ever. Much of this sophistication and influence follows from their network organization. Blogging social networks (BSNs) allow individual bloggers to form cont
act lists, subscribe to other blogs, comment on blog posts, declare interests, and participate in collective blogs. Thus, a BSN is a bimodal venue, where users can engage in publishing (post) as well as in social (make friends) activities. In this paper, we study the co-evolution of both activities. We observed a significant positive correlation between blogging and socializing. In addition, we identified a number of user archetypes that correspond to mainly bloggers, mainly socializers, etc. We analyzed a BSN at the level of individual posts and changes in contact lists and at the level of trajectories in the friendship-publishing space. Both approaches produced consistent results: the majority of BSN users are passive readers; publishing is the dominant active behavior in a BSN; and social activities complement blogging, rather than compete with it.
This paper describes the deployment of a large-scale study designed to measure human interactions across a variety of communication channels, with high temporal resolution and spanning multiple years - the Copenhagen Networks Study. Specifically, we
collect data on face-to-face interactions, telecommunication, social networks, location, and background information (personality, demographic, health, politics) for a densely connected population of 1,000 individuals, using state-of-art smartphones as social sensors. Here we provide an overview of the related work and describe the motivation and research agenda driving the study. Additionally the paper details the data-types measured, and the technical infrastructure in terms of both backend and phone software, as well as an outline of the deployment procedures. We document the participant privacy procedures and their underlying principles. The paper is concluded with early results from data analysis, illustrating the importance of multi-channel high-resolution approach to data collection.
Outbreaks of infectious diseases present a global threat to human health and are considered a major health-care challenge. One major driver for the rapid spatial spread of diseases is human mobility. In particular, the travel patterns of individuals
determine their spreading potential to a great extent. These travel behaviors can be captured and modelled using novel location-based data sources, e.g., smart travel cards, social media, etc. Previous studies have shown that individuals who cannot be characterized by their most frequently visited locations spread diseases farther and faster; however, these studies are based on GPS data and mobile call records which have position uncertainty and do not capture explicit contacts. It is unclear if the same conclusions hold for large scale real-world transport networks. In this paper, we investigate how mobility patterns impact disease spread in a large-scale public transit network of empirical data traces. In contrast to previous findings, our results reveal that individuals with mobility patterns characterized by their most frequently visited locations and who typically travel large distances pose the highest spreading risk.
Information diffusion is a fundamental process that takes place over networks. While it is rarely realistic to observe the individual transmissions of the information diffusion process, it is typically possible to observe when individuals first publi
sh the information. We look specifically at previously published algorithm NETINF that probabilistically identifies the optimal network that best explains the observed infection times. We explore how the algorithm could perform on a range of intrinsically different social and information network topologies, from news blogs and websites to Twitter to Reddit.
Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing ap
proaches to bipartite community detection have drawbacks, including implicit parameter choices, loss of information through one-mode projections, and lack of interpretability. Here we solve the community detection problem for bipartite networks by formulating a bipartite stochastic block model, which explicitly includes vertex type information and may be trivially extended to $k$-partite networks. This bipartite stochastic block model yields a projection-free and statistically principled method for community detection that makes clear assumptions and parameter choices and yields interpretable results. We demonstrate this models ability to efficiently and accurately find community structure in synthetic bipartite networks with known structure and in real-world bipartite networks with unknown structure, and we characterize its performance in practical contexts.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
