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

Databases and Information Systems Commons™

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

Social Media

2011

Articles 1 - 10 of 10

Full-Text Articles in Databases and Information Systems

Wsm 2011: Third Acm Workshop On Social Media, Steven C. H. Hoi, Michal Jacovi, Ioannis Kompatsiaris, Jiebo Luo, Konstantinos Tserpes Dec 2011

Wsm 2011: Third Acm Workshop On Social Media, Steven C. H. Hoi, Michal Jacovi, Ioannis Kompatsiaris, Jiebo Luo, Konstantinos Tserpes

Research Collection School Of Computing and Information Systems

The Third Workshop on Social Media (WSM2011) continues the series of Workshops on Social Media in 2009 and 2010 and has been established as a platform for the presentation and discussion of the latest, key research issues in social media analysis, exploration, search, mining, and emerging new social media applications. It is held in conjunction with the ACM International Multimedia Conference (MM'11) at Scottsdale, Arizona, USA, 2011 and has attracted contributions on various aspects of social media including data mining from social media, content organization, geo-localization, personalization, recommendation systems, user experience, machine learning and social media approaches and architectures for …

Go to article

Modeling Social Strength In Social Media Community Via Kernel-Based Learning, Jinfeng Zhuang, Tao Mei, Steven C. H. Hoi, Xian-Sheng Hua, Shipeng Li Dec 2011

Modeling Social Strength In Social Media Community Via Kernel-Based Learning, Jinfeng Zhuang, Tao Mei, Steven C. H. Hoi, Xian-Sheng Hua, Shipeng Li

Research Collection School Of Computing and Information Systems

Modeling continuous social strength rather than conventional binary social ties in the social network can lead to a more precise and informative description of social relationship among people. In this paper, we study the problem of social strength modeling (SSM) for the users in a social media community, who are typically associated with diverse form of data. In particular, we take Flickr---the most popular online photo sharing community---as an example, in which users are sharing their experiences through substantial amounts of multimodal contents (e.g., photos, tags, geo-locations, friend lists) and social behaviors (e.g., commenting and joining interest groups). Such heterogeneous …

Go to article

Context-Based Friend Suggestion In Online Photo-Sharing Community, Ting Yao, Chong-Wah Ngo, Tao Mei Dec 2011

Context-Based Friend Suggestion In Online Photo-Sharing Community, Ting Yao, Chong-Wah Ngo, Tao Mei

Research Collection School Of Computing and Information Systems

With the popularity of social media, web users tend to spend more time than before for sharing their experience and interest in online photo-sharing sites. The wide variety of sharing behaviors generate different metadata which pose new opportunities for the discovery of communities. We propose a new approach, named context-based friend suggestion, to leverage the diverse form of contextual cues for more effective friend suggestion in the social media community. Different from existing approaches, we consider both visual and geographical cues, and develop two user-based similarity measurements, i.e., visual similarity and geo similarity for characterizing user relationship. The problem of …

Go to article

Mining Interesting Link Formation Rules In Social Networks, Cane Wing-Ki Leung, Ee Peng Lim, David Lo, Jianshu Weng Nov 2011

Mining Interesting Link Formation Rules In Social Networks, Cane Wing-Ki Leung, Ee Peng Lim, David Lo, Jianshu Weng

David LO

Link structures are important patterns one looks out for when modeling and analyzing social networks. In this paper, we propose the task of mining interesting Link Formation rules (LF-rules) containing link structures known as Link Formation patterns (LF-patterns). LF-patterns capture various dyadic and/or triadic structures among groups of nodes, while LF-rules capture the formation of a new link from a focal node to another node as a postcondition of existing connections between the two nodes. We devise a novel LF-rule mining algorithm, known as LFR-Miner, based on frequent subgraph mining for our task. In addition to using a support-confidence framework …

Go to article

Mining Direct Antagonistic Communities In Explicit Trust Networks, David Lo, Didi Surian, Zhang Kuan, Ee Peng Lim Oct 2011

Mining Direct Antagonistic Communities In Explicit Trust Networks, David Lo, Didi Surian, Zhang Kuan, Ee Peng Lim

Research Collection School Of Computing and Information Systems

There has been a recent increase of interest in analyzing trust and friendship networks to gain insights about relationship dynamics among users. Many sites such as Epinions, Facebook, and other social networking sites allow users to declare trusts or friendships between different members of the community. In this work, we are interested in extracting direct antagonistic communities (DACs) within a rich trust network involving trusts and distrusts. Each DAC is formed by two subcommunities with trust relationships among members of each sub-community but distrust relationships across the sub-communities. We develop an efficient algorithm that could analyze large trust networks leveraging …

Go to article

On Modeling Virality Of Twitter Content, Tuan Anh Hoang, Ee Peng Lim, Palakorn Achananuparp, Jing Jiang, Feida Zhu Oct 2011

On Modeling Virality Of Twitter Content, Tuan Anh Hoang, Ee Peng Lim, Palakorn Achananuparp, Jing Jiang, Feida Zhu

Research Collection School Of Computing and Information Systems

Twitter is a popular microblogging site where users can easily use mobile phones or desktop machines to generate short messages to be shared with others in realtime. Twitter has seen heavy usage in many recent international events including Japan earthquake, Iran election, etc. In such events, many tweets may become viral for different reasons. In this paper, we study the virality of socio-political tweet content in the Singapore’s 2011 general election (GE2011). We collected tweet data generated by about 20K Singapore users from 1 April 2011 till 12 May 2011, and the follow relationships among them. We introduce several quantitative …

Go to article

A Survey Of Information Diffusion Models And Relevant Problems, Minh Duc Luu, Tuan Anh Hoang, Ee-Peng Lim Oct 2011

A Survey Of Information Diffusion Models And Relevant Problems, Minh Duc Luu, Tuan Anh Hoang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

There has been tremendous interest in diffusion of innovations or information in a social system. Nowadays, social networks (offline as well as online) are considered as important medium for diffusion and large amount of research has been conducted to understand the dynamics of diffusion in social networks. In this work, we review some of the models proposed for diffusion in social networks. We also highlight the major features of these models by dividing the surveyed models into two categories: non-network and network diffusion models. The former refers to user communities without any knowledge about the user relationship network and the …

Go to article

Topical Keyphrase Extraction From Twitter, Xin Zhao, Jing Jiang, Jing He, Yang Song, Palakorn Achananuparp, Ee Peng Lim, Xiaoming Li Jun 2011

Topical Keyphrase Extraction From Twitter, Xin Zhao, Jing Jiang, Jing He, Yang Song, Palakorn Achananuparp, Ee Peng Lim, Xiaoming Li

Research Collection School Of Computing and Information Systems

Summarizing and analyzing Twitter content is an important and challenging task. In this paper, we propose to extract topical keyphrases as one way to summarize Twitter. We propose a context-sensitive topical PageRank method for keyword ranking and a probabilistic scoring function that considers both relevance and interestingness of keyphrases for keyphrase ranking. We evaluate our proposed methods on a large Twitter data set. Experiments show that these methods are very effective for topical keyphrase extraction.

Go to article

Utility-Oriented K-Anonymization On Social Networks, Yazhe Wang, Long Xie, Baihua Zheng, Ken C. K. Lee Apr 2011

Utility-Oriented K-Anonymization On Social Networks, Yazhe Wang, Long Xie, Baihua Zheng, Ken C. K. Lee

Research Collection School Of Computing and Information Systems

"Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in nontrivial utility loss. The reason is that the number of the edges modified when anonymizing the social network is the only metric to evaluate utility loss, not considering the fact that different edge modifications have different impact on the network structure. To tackle this issue, we propose a novel utility-oriented social network anonymization scheme to achieve privacy protection with relatively low utility loss. First, a proper utility evaluation model is proposed. It focuses on the changes on …

Go to article

Comparing Twitter And Traditional Media Using Topic Models, Wayne Xin Zhao, Jing Jiang, Jianshu Weng, Jing He, Ee Peng Lim, Hongfei Yan, Xiaoming Li Apr 2011

Comparing Twitter And Traditional Media Using Topic Models, Wayne Xin Zhao, Jing Jiang, Jianshu Weng, Jing He, Ee Peng Lim, Hongfei Yan, Xiaoming Li

Research Collection School Of Computing and Information Systems

Twitter as a new form of social media can potentially contain much useful information, but content analysis on Twitter has not been well studied. In particular, it is not clear whether as an information source Twitter can be simply regarded as a faster news feed that covers mostly the same information as traditional news media. In This paper we empirically compare the content of Twitter with a traditional news medium, New York Times, using unsupervised topic modeling. We use a Twitter-LDA model to discover topics from a representative sample of the entire Twitter. We then use text mining techniques to …

Go to article