Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Databases and Information Systems

Series

Social network

Articles 1 - 15 of 15

Full-Text Articles in Physical Sciences and Mathematics

Maximizing Multifaceted Network Influence, Yuchen Li, Ju Fan, George V. Ovchinnikov, Panagiotis Karras Apr 2019

Maximizing Multifaceted Network Influence, Yuchen Li, Ju Fan, George V. Ovchinnikov, Panagiotis Karras

Research Collection School Of Computing and Information Systems

An information dissemination campaign is often multifaceted, involving several facets or pieces of information disseminating from different sources. The question then arises, how should we assign such pieces to eligible sources so as to achieve the best viral dissemination results? Past research has studied the problem of Influence Maximization (IM), which is to select a set of k promoters that maximizes the expected reach of a message over a network. However, in this classical IM problem, each promoter spreads out the same unitary piece of information. In this paper, we propose the Optimal Influential Pieces Assignment (OIPA) problem, which is …


Linky: Visualizing User Identity Linkage Results For Multiple Online Social Networks (Demo), Roy Ka-Wei Lee, Ming Shan Hee, Philips Kokoh Prasetyo, Ee-Peng Lim Nov 2018

Linky: Visualizing User Identity Linkage Results For Multiple Online Social Networks (Demo), Roy Ka-Wei Lee, Ming Shan Hee, Philips Kokoh Prasetyo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

User identity linkage across online social networks is an emerging research topic that has attracted attention in recent years. Many user identity linkage methods have been proposed so far and most of them utilize user profile, content and network information to determine if two social media accounts belong to the same person. In most cases, user identity linkage methods are evaluated by performing some prediction tasks with the results presented using some overall accuracy measures. However, the methods are rarely compared at the individual user level where a predicted matched (or linked) pair of user identities from different online social …


Location-Aware Influence Maximization Over Dynamic Social Streams, Yanhao Wang, Yuchen Li, Ju Fan, Kianlee Tan Apr 2018

Location-Aware Influence Maximization Over Dynamic Social Streams, Yanhao Wang, Yuchen Li, Ju Fan, Kianlee Tan

Research Collection School Of Computing and Information Systems

Influence maximization (IM), which selects a set of k seed users (a.k.a., a seed set) to maximize the influence spread over a social network, is a fundamental problem in a wide range of applications. However, most existing IM algorithms are static and location-unaware. They fail to provide high-quality seed sets efficiently when the social network evolves rapidly and IM queries are location-aware. In this article, we first define two IM queries, namely Stream Influence Maximization (SIM) and Location-aware SIM (LSIM), to track influential users over social streams. Technically, SIM adopts the sliding window model and maintains a seed set with …


User Identity Linkage By Latent User Space Modelling, Xin Mu, Feida Zhu, Ee-Peng Lim, Jing Xiao, Jianzong Wang, Zhi-Hua Zhou Aug 2016

User Identity Linkage By Latent User Space Modelling, Xin Mu, Feida Zhu, Ee-Peng Lim, Jing Xiao, Jianzong Wang, Zhi-Hua Zhou

Research Collection School Of Computing and Information Systems

User identity linkage across social platforms is an important problem of great research challenge and practical value. In real applications, the task often assumes an extra degree of difficulty by requiring linkage across multiple platforms. While pair-wise user linkage between two platforms, which has been the focus of most existing solutions, provides reasonably convincing linkage, the result depends by nature on the order of platform pairs in execution with no theoretical guarantee on its stability. In this paper, we explore a new concept of “Latent User Space” to more naturally model the relationship between the underlying real users and their …


Investigating The Influence Of Offline Friendship On Twitter Networking Behaviors, Young Soo Kim, Felicia Natali, Feida Zhu, Ee-Peng Lim Jan 2016

Investigating The Influence Of Offline Friendship On Twitter Networking Behaviors, Young Soo Kim, Felicia Natali, Feida Zhu, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

We investigate the influence of offline friendship in three specific areas of Twitter networking behaviors: (a) network structure, (b) Twitter content and (c) interaction on Twitter. We observe some interesting findings through the empirical analysis of 2193 pairs of users who are online friends. When these pairs of users know each other offline, they are more likely to (1) respond to the online gesture of friendship from their friend, (2) share mutual online friends, (3) distribute and gather information in their friend’s Twitter network, (4) pay attention to their friend’s tweets, (5) post tweets that might be of interest to …


Influences Of Influential Users: An Empirical Study Of Music Social Network, Jing Ren, Zhiyong Cheng, Jialie Shen, Feida Zhu Jul 2014

Influences Of Influential Users: An Empirical Study Of Music Social Network, Jing Ren, Zhiyong Cheng, Jialie Shen, Feida Zhu

Research Collection School Of Computing and Information Systems

Influential user can play a crucial role in online social networks. This paper documents an empirical study aiming at exploring the effects of influential users in the context of music social network. To achieve this goal, music diffusion graph is developed to model how information propagates over network. We also propose a heuristic method to measure users' influences. Using the real data from Last. fm, our empirical test demonstrates key effects of influential users and reveals limitations of existing influence identification/characterization schemes.


K-Pop Live: Social Networking & Language Learning Platform, Thomas Chua, Chin Leng Ong, Kian Ming Png, Aloysius Lau, Houston Toh, Feida Zhu, Kyong Jin Shim, Ee-Peng Lim Feb 2013

K-Pop Live: Social Networking & Language Learning Platform, Thomas Chua, Chin Leng Ong, Kian Ming Png, Aloysius Lau, Houston Toh, Feida Zhu, Kyong Jin Shim, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

K-Pop live is a social networking and language learning platform developed by an undergraduate student team from Singapore Management University. K-Pop live aims to combine social media together with gamification to promote Korean culture. It consolidates all relevant Tweets from Twitter as well as videos from YouTube. The platform allows the user to connect with his friends who share similar interests in terms of K-pop artists and music.


Impact Of Multimedia In Sina Weibo: Popularity And Life Span, Xun Zhao, Feida Zhu, Weining Qian, Aoying Zhou Nov 2012

Impact Of Multimedia In Sina Weibo: Popularity And Life Span, Xun Zhao, Feida Zhu, Weining Qian, Aoying Zhou

Research Collection School Of Computing and Information Systems

Multimedia contents such as images and videos are widely used in social network sites nowadays. Sina Weibo, a Chinese microblogging service, is one of the first microblog platforms to incorporate multimedia content sharing features. This work provides statistical analysis on how multimedia contents are produced, consumed, and propagated in Sina Weibo. Based on 230 million tweets and 1.8 million user profiles in Sina Weibo, we study the impact of multimedia contents on the popularity of both users and tweets as well as tweet life span. Our preliminary study shows that multimedia tweets dominant pure text ones in SinaWeibo. Multimedia contents …


Collective Churn Prediction In Social Network, Richard J. Oentaryo, Ee-Peng Lim, David Lo, Feida Zhu, Philips K. Prasetyo Aug 2012

Collective Churn Prediction In Social Network, Richard J. Oentaryo, Ee-Peng Lim, David Lo, Feida Zhu, Philips K. Prasetyo

Research Collection School Of Computing and Information Systems

In service-based industries, churn poses a significant threat to the integrity of the user communities and profitability of the service providers. As such, research on churn prediction methods has been actively pursued, involving either intrinsic, user profile factors or extrinsic, social factors. However, existing approaches often address each type of factors separately, thus lacking a comprehensive view of churn behaviors. In this paper, we propose a new churn prediction approach based on collective classification (CC), which accounts for both the intrinsic and extrinsic factors by utilizing the local features of, and dependencies among, individuals during prediction steps. We evaluate our …


Mining Diversity On Social Media Networks, Lu Liu, Feida Zhu, Meng Jiang, Jiawei Han, Lifeng Sun, Shiqiang Yang Jan 2012

Mining Diversity On Social Media Networks, Lu Liu, Feida Zhu, Meng Jiang, Jiawei Han, Lifeng Sun, Shiqiang Yang

Research Collection School Of Computing and Information Systems

The fast development of multimedia technology and increasing availability of network bandwidth has given rise to an abundance of network data as a result of all the ever-booming social media and social websites in recent years, e.g., Flickr, Youtube, MySpace, Facebook, etc. Social network analysis has therefore become a critical problem attracting enthusiasm from both academia and industry. However, an important measure that captures a participant’s diversity in the network has been largely neglected in previous studies. Namely, diversity characterizes how diverse a given node connects with its peers. In this paper, we give a comprehensive study of this concept. …


A Heuristic Algorithm For Trust-Oriented Service Provider Selection In Complex Social Networks, Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee Peng Lim Jul 2010

A Heuristic Algorithm For Trust-Oriented Service Provider Selection In Complex Social Networks, Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In a service-oriented online social network consisting of service providers and consumers, a service consumer can search trustworthy service providers via the social network. This requires the evaluation of the trustworthiness of a service provider along a certain social trust path from the service consumer to the service provider. However, there are usually many social trust paths between participants in social networks. Thus, a challenging problem is which social trust path is the optimal one that can yield the most trustworthy evaluation result. In this paper, we first present a novel complex social network structure and a new concept, Quality …


Stevent: Spatio-Temporal Event Model For Social Network Discovery, Hady W. Lauw, Ee Peng Lim, Hwee Hwa Pang, Teck-Tim Tan Jun 2010

Stevent: Spatio-Temporal Event Model For Social Network Discovery, Hady W. Lauw, Ee Peng Lim, Hwee Hwa Pang, Teck-Tim Tan

Research Collection School Of Computing and Information Systems

Spatio-temporal data concerning the movement of individuals over space and time contains latent information on the associations among these individuals. Sources of spatio-temporal data include usage logs of mobile and Internet technologies. This article defines a spatio-temporal event by the co-occurrences among individuals that indicate potential associations among them. Each spatio-temporal event is assigned a weight based on the precision and uniqueness of the event. By aggregating the weights of events relating two individuals, we can determine the strength of association between them. We conduct extensive experimentation to investigate both the efficacy of the proposed model as well as the …


Homophily In The Digital World: A Livejournal Case Study, Hady W. Lauw, John C. Shafer, Rakesh Agrawal, Alexandros Ntoulas Mar 2010

Homophily In The Digital World: A Livejournal Case Study, Hady W. Lauw, John C. Shafer, Rakesh Agrawal, Alexandros Ntoulas

Research Collection School Of Computing and Information Systems

Are two users more likely to be friends if they share common interests? Are two users more likely to share common interests if they're friends? The authors study the phenomenon of homophily in the digital world by answering these central questions. Unlike the physical world, the digital world doesn't impose any geographic or organizational constraints on friendships. So, although online friends might share common interests, a priori there's no reason to believe that two users with common interests are more likely to be friends. Using data from LiveJournal, the authors show that the answer to both questions is yes.


Innovation In The Programmable Web: Characterizing The Mashup Ecosystem, C. Jason Woodard, Shuli Yu Dec 2008

Innovation In The Programmable Web: Characterizing The Mashup Ecosystem, C. Jason Woodard, Shuli Yu

Research Collection School Of Computing and Information Systems

This paper investigates the structure and dynamics of the Web 2.0 software ecosystem by analyzing empirical data on web service APIs and mashups. Using network analysis tools to visualize the growth of the ecosystem from December 2005 to 2007, we find that the APIs are organized into three tiers, and that mashups are often formed by combining APIs across tiers. Plotting the cumulative distribution of mashups to APIs reveals a power-law relationship, although the tail is short compared to previously reported distributions of book and movie sales. While this finding highlights the dominant role played by the most popular APIs …


Mining Social Network From Spatio-Temporal Events, Hady Wirawan Lauw, Ee Peng Lim, Teck Tim Tan, Hwee Hwa Pang Apr 2005

Mining Social Network From Spatio-Temporal Events, Hady Wirawan Lauw, Ee Peng Lim, Teck Tim Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Knowing patterns of relationship in a social network is very useful for law enforcement agencies to investigate collaborations among criminals, for businesses to exploit relationships to sell products, or for individuals who wish to network with others. After all, it is not just what you know, but also whom you know, that matters. However, finding out who is related to whom on a large scale is a complex problem. Asking every single individual would be impractical, given the huge number of individuals and the changing dynamics of relationships. Recent advancement in technology has allowed more data about activities of individuals …