PWPaul Wagenseller

Paul Wagenseller

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Paul Wagenseller has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Location Prediction with Communities in User Ego-Net in Social Media

    by Paul Wagenseller, Adrian Avram, Eric Jiang, Feng Wang, Yunpeng Zhao

    Social media embed rich but noisy signals of physical locations of their users. Accurately inferring a user's location can significantly improve the user's experience on the social media and enable the development of new location-based applications. This paper proposes a novel community-based approach for predicting the location of a user by using communities in the egonet of the user. We further propose both geographical proximity and structural proximity metrics to profile communities in the ego-net of a user, and then evaluate the effectiveness of each individual metric on real social media data. We discover that geographical proximity metrics, such as average/median haversine distance and community closeness, are strong indicators of a good community for geotagging. In addition, structural proximity metric conductance performs comparable to geographical proximity metrics while triangle participation ratio and internal density are weak location indicators. To the best of our knowledge, this is the first effort to infer the physical location of a user from the perspective of latent communities in the user's ego-net.


  • Size Matters: A Comparative Analysis of Community Detection Algorithms

    by Paul Wagenseller, Feng Wang, Weili Wu

    Understanding the community structure of social media is critical due to its broad applications such as friend recommendations, user modeling, and content personalization. Existing research uses structural metrics such as modularity and conductance and functional metrics such as ground truth to measure the quality of the communities discovered by various community detection algorithms, while overlooking a natural and important dimension, community size. Recently, the anthropologist Dunbar suggests that the size of a stable community in social media should be limited to 150, referred to as Dunbar's number. In this paper, we propose a systematic way of algorithm comparison by orthogonally integrating community size as a new dimension into existing structural metrics for consistently and holistically evaluating the community quality in the social media context. We design a heuristic clique-based algorithm which controls the size and overlap of communities with adjustable parameters and evaluate it along with six state-of-the-art community detection algorithms on both Twitter and DBLP networks. Specifically, we divide the discovered communities based on their size into four classes called a close friend, a casual friend, acquaintance, and just-a-face, and then calculate the coverage, modularity, triangle participation ratio, conductance, transitivity, and the internal density of communities in each class. We discover that communities in different classes exhibit diverse structural qualities and many existing community detection algorithms tend to output extremely large communities.


  • Open Access

    Towards Understanding Community Interests With Topic Modeling

    by Feng Wang, Kenneth Orton, Paul Wagenseller, Kuai Xu

    Community plays an important role in shaping a network. Quantitatively interpreting a community is necessary for graph generalization which is used for privacy preserving, summarization, and dimensionality reduction in social network mining. However, there are few works in community detection focusing on making sense of the identified communities. In this paper, we study communities in the social media context and investigate structure-based communities from the perspective of community topical homophily. We train Latent Dirichlet Allocation topic model to capture the topics in the aggregated tweets of each user in a community and propose new distance metrics to quantify the topic similarity of individual users, cliques, and communities. By building a Twitter topic modeling system to interpret the communities identified by two community detection algorithms in a large scale Twitter topology, we discover evidence that Twitter users in a community show common interests in general. The major contributions of this paper lie in that it verifies the topical homophily in structure-based social media communities and proposes new metrics to quantitatively label the degree of the homophily and describe the theme of the communities.


  • Open Access

    Size Matters: A Comparative Analysis of Community Detection Algorithms

    by Paul Wagenseller Iii, Feng Wang

    Understanding community structure of social media is critical due to its broad applications such as friend recommendations, user modeling and content personalizations. Existing research uses structural metrics such as modularity and conductance and functional metrics such as ground truth to measure the qualify of the communities discovered by various community detection algorithms, while overlooking a natural and important dimension, community size. Recently, anthropologist Dunbar suggests that the size of stable community in social media should be limited to 150, referred to as Dunbar's number. In this study, we propose a systematic way of algorithm comparison by orthogonally integrating community size as a new dimension into existing structural metrics for consistently and holistically evaluating the community quality in social media context. we design a heuristic clique based algorithm which controls the size and overlap of communities with adjustable parameters and evaluate it along with five state-of-the-art community detection algorithms on both Twitter network and DBLP network. Specifically, we divide the discovered communities based on their size into four classes called close friend, casual friend, acquaintance, and just a face, and then calculate the coverage, modularity, triangle participation ratio, conductance, transitivity, and the internal density of communities in each class. We discover that communities in different classes exhibit diverse structural qualities and many existing community detection algorithms tend to output extremely large communities.

  • Open Access

    Community Detection Algorithm Evaluation using Size and Hashtags

    by Paul Wagenseller Iii, Feng Wang

    Understanding community structure in social media is critical due to its broad applications such as friend recommendations, link predictions and collaborative filtering. However, there is no widely accepted definition of community in literature. Existing work use structure related metrics such as modularity and function related metrics such as ground truth to measure the performance of community detection algorithms, while ignoring an important metric, size of the community. [1] suggests that the size of community with strong ties in social media should be limited to 150. As we discovered in this paper, the majority of the communities obtained by many popular community detection algorithms are either very small or very large. Too small communities don't have practical value and too large communities contain weak connections therefore not stable. In this paper, we compare various community detection algorithms considering the following metrics: size of the communities, coverage of the communities, extended modularity, triangle participation ratio, and user interest in the same community. We also propose a simple clique based algorithm for community detection as a baseline for the comparison. Experimental results show that both our proposed algorithm and the well-accepted disjoint algorithm InfoMap perform well in all the metrics.