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

Numerical Analysis and Scientific Computing Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 541 - 570 of 1024

Full-Text Articles in Numerical Analysis and Scientific Computing

Manifold Learning For Jointly Modeling Topic And Visualization, Tuan Minh Van Le, Hady W. Lauw Jul 2014

Manifold Learning For Jointly Modeling Topic And Visualization, Tuan Minh Van Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Classical approaches to visualization directly reduce a document's high-dimensional representation into visualizable two or three dimensions, using techniques such as multidimensional scaling. More recent approaches consider an intermediate representation in topic space, between word space and visualization space, which preserves the semantics by topic modeling. We call the latter semantic visualization problem, as it seeks to jointly model topic and visualization. While previous approaches aim to preserve the global consistency, they do not consider the local consistency in terms of the intrinsic geometric structure of the document manifold. We therefore propose an unsupervised probabilistic model, called Semafore, which aims to …

Go to article

Soml: Sparse Online Metric Learning With Application To Image Retrieval, Xingyu Gao, Steven C. H. Hoi, Yongdong Zhang, Ji Wan, Jintao Li Jul 2014

Soml: Sparse Online Metric Learning With Application To Image Retrieval, Xingyu Gao, Steven C. H. Hoi, Yongdong Zhang, Ji Wan, Jintao Li

Research Collection School Of Computing and Information Systems

Image similarity search plays a key role in many multimedia applications, where multimedia data (such as images and videos) are usually represented in high-dimensional feature space. In this paper, we propose a novel Sparse Online Metric Learning (SOML) scheme for learning sparse distance functions from large-scale high-dimensional data and explore its application to image retrieval. In contrast to many existing distance metric learning algorithms that are often designed for low-dimensional data, the proposed algorithms are able to learn sparse distance metrics from high-dimensional data in an efficient and scalable manner. Our experimental results show that the proposed method achieves better …

Go to article

Learning Relative Similarity By Stochastic Dual Coordinate Ascent, Pengcheng Wu, Ding Yi, Peilin Zhao, Chunyan Miao, Steven C. H. Hoi Jul 2014

Learning Relative Similarity By Stochastic Dual Coordinate Ascent, Pengcheng Wu, Ding Yi, Peilin Zhao, Chunyan Miao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Learning relative similarity from pairwise instances is an important problem in machine learning and has a wide range of applications. Despite being studied for years, some existing methods solved by Stochastic Gradient Descent (SGD) techniques generally suffer from slow convergence. In this paper, we investigate the application of Stochastic Dual Coordinate Ascent (SDCA) technique to tackle the optimization task of relative similarity learning by extending from vector to matrix parameters. Theoretically, we prove the optimal linear convergence rate for the proposed SDCA algorithm, beating the well-known sublinear convergence rate by the previous best metric learning algorithms. Empirically, we conduct extensive …

Go to article

Predicting The Popularity Of Web 2.0 Items Based On User Comments, Xiangnan He, Ming Gao, Min-Yen Kan, Yiqun Liu, Kazunari Sugiyama Jul 2014

Predicting The Popularity Of Web 2.0 Items Based On User Comments, Xiangnan He, Ming Gao, Min-Yen Kan, Yiqun Liu, Kazunari Sugiyama

Research Collection School Of Computing and Information Systems

In the current Web 2.0 era, the popularity of Web resources fluctuates ephemerally, based on trends and social interest. As a result, content-based relevance signals are insufficient to meet users' constantly evolving information needs in searching for Web 2.0 items. Incorporating future popularity into ranking is one way to counter this. However, predicting popularity as a third party (as in the case of general search engines) is difficult in practice, due to their limited access to item view histories. To enable popularity prediction externally without excessive crawling, we propose an alternative solution by leveraging user comments, which are more accessible …

Go to article

Understanding The Paradigm Shift To Computational Social Science In The Presence Of Big Data, Ray M. Chang, Robert J. Kauffman, Young Ok Kwon Jul 2014

Understanding The Paradigm Shift To Computational Social Science In The Presence Of Big Data, Ray M. Chang, Robert J. Kauffman, Young Ok Kwon

Research Collection School Of Computing and Information Systems

The era of big data has created new opportunities for researchers to achieve high relevance and impact amid changes and transformations in how we study social science phenomena. With the emergence of new data collection technologies, advanced data mining and analytics support, there seems to be fundamental changes that are occurring with the research questions we can ask, and the research methods we can apply. The contexts include social networks and blogs, political discourse, corporate announcements, digital journalism, mobile telephony, home entertainment, online gaming, financial services, online shopping, social advertising, and social commerce. The changing costs of data collection and …

Go to article

Ar-Miner: Mining Informative Reviews For Developers From Mobile App Marketplace, Ning Chen, Jialiu Lin, Steven C. H. Hoi, Xiaokui Xiao, Boshen Zhang Jun 2014

Ar-Miner: Mining Informative Reviews For Developers From Mobile App Marketplace, Ning Chen, Jialiu Lin, Steven C. H. Hoi, Xiaokui Xiao, Boshen Zhang

Research Collection School Of Computing and Information Systems

With the popularity of smartphones and mobile devices, mobile application (a.k.a. “app”) markets have been growing exponentially in terms of number of users and downloads. App developers spend considerable effort on collecting and exploiting user feedback to improve user satisfaction, but suffer from the absence of effective user review analytics tools. To facilitate mobile app developers discover the most “informative” user reviews from a large and rapidly increasing pool of user reviews, we present “AR-Miner” — a novel computational framework for App Review Mining, which performs comprehensive analytics from raw user reviews by (i) first extracting informative user reviews by …

Go to article

Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng Jun 2014

Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng

Research Collection School Of Computing and Information Systems

XML data broadcast is an efficient way to disseminate semi-structured information in wireless mobile environments. In this paper, we propose a novel two-tier index structure to facilitate the access of XML document in an on-demand broadcast system. It provides the clients with an overall image of all the XML documents available at the server side and hence enables the clients to locate complete result sets accordingly. A pruning strategy is developed to cut down the index size and a two-tier structure is proposed to further remove any redundant information. In addition, two index distribution strategies, namely naive distribution and partial …

Go to article

On Efficient Reverse Skyline Query Processing, Yunjun Gao, Qing Liu, Baihua Zheng, Gang Chen Jun 2014

On Efficient Reverse Skyline Query Processing, Yunjun Gao, Qing Liu, Baihua Zheng, Gang Chen

Research Collection School Of Computing and Information Systems

Given a D-dimensional data set P and a query point q, a reverse skyline query (RSQ) returns all the data objects in P whose dynamic skyline contains q. It is important for many real life applications such as business planning and environmental monitoring. Currently, the state-of-the-art algorithm for answering the RSQ is the reverse skyline using skyline approximations (RSSA) algorithm, which is based on the precomputed approximations of the skylines. Although RSSA has some desirable features, e.g., applicability to arbitrary data distributions and dimensions, it needs for multiple accesses of the same nodes, incurring redundant I/O and CPU costs. In …

Go to article

Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw Jun 2014

Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), building upon two foundational models of data closeness and label coupling. This new form of smoothness axiomatizes a set of probability constraints, which ultimately enables class prediction. Theoretically, we provide an error and robustness analysis of PGP. Empirically, we conduct extensive experiments to show …

Go to article

Canaries In The Urban Data Mine: Analytics For Smarter City Life, Robert J. Kauffman May 2014

Canaries In The Urban Data Mine: Analytics For Smarter City Life, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Technology-based sensors and data analytics have created unprecendented levels of informedness for consumers, corporations, the public and government agencies. The information they generated provides a basis for smarter cities and more sustainable urban living.

Go to article

How Many Eyeballs Does A Bug Need? An Empirical Validation Of Linus' Law, Subhajit Datta, Proshanta Sarkar, Sutirtha Das, Sonu Sreshtha, Prasanth Lade, Subhashis Majumder May 2014

How Many Eyeballs Does A Bug Need? An Empirical Validation Of Linus' Law, Subhajit Datta, Proshanta Sarkar, Sutirtha Das, Sonu Sreshtha, Prasanth Lade, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Linus’ Law reflects on a key characteristic of open source software development: developers’ tendency to closely work together in the bug resolution process. In this paper we empirically examine Linus’ Law using a data-set of 1,000+ Android bugs, owned by 70+ developers. Our results indicate that encouraging developers to work closely with one another has nuanced implications; while one form of contact may help reduce bug resolution time, another form can have quite the opposite effect. We present statistically significant evidence in support of our results and discuss their relevance at the individual and organizational levels.

Go to article

Ubiquitous Data-Centric Sensor Networks, Ting Yang, Peng Yung Woo, Zhaoxia Wang, Javid Taheri, Hoong Chor Chin, Guaqiang Hu Apr 2014

Ubiquitous Data-Centric Sensor Networks, Ting Yang, Peng Yung Woo, Zhaoxia Wang, Javid Taheri, Hoong Chor Chin, Guaqiang Hu

Research Collection School Of Computing and Information Systems

Ubiquitous data-centric sensor networks (U-DCSN) are a new integrated science and technology, which focus on data instead of individual sensor nodes. The network, as a dynamic database system, can accurately acquire data, perform high-performance processing of big data, and effectively access data from different users/actuators. Due this characteristic, U-DCSN hold huge potentials on service improvement in a wide range of applications and have attracted significant attention in recent years, for example, mobile cloud and consumer electronics. The modern mobile cloud, comprised of mobile devices (smart phones, tablets, and embedded sensor nodes), provides unlimited information resources, putting “cloud into a pocket.” …

Go to article

On Modeling Community Behaviors And Sentiments In Microblogging, Tuan Anh Hoang, William Cohen, Ee Peng Lim Apr 2014

On Modeling Community Behaviors And Sentiments In Microblogging, Tuan Anh Hoang, William Cohen, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we propose the CBS topic model, a probabilistic graphical model, to derive the user communities in microblogging networks based on the sentiments they express on their generated content and behaviors they adopt. As a topic model, CBS can uncover hidden topics and derive user topic distribution. In addition, our model associates topic-specific sentiments and behaviors with each user community. Notably, CBS has a general framework that accommodates multiple types of behaviors simultaneously. Our experiments on two Twitter datasets show that the CBS model can effectively mine the representative behaviors and emotional topics for each community. We also …

Go to article

On Finding The Point Where There Is No Return: Turning Point Mining On Game Data, Wei Gong, Ee Peng Lim, Feida Zhu, Achananuparp Palakorn, David Lo Apr 2014

On Finding The Point Where There Is No Return: Turning Point Mining On Game Data, Wei Gong, Ee Peng Lim, Feida Zhu, Achananuparp Palakorn, David Lo

Research Collection School Of Computing and Information Systems

Gaming expertise is usually accumulated through playing or watching many game instances, and identifying critical moments in these game instances called turning points. Turning point rules (shorten as TPRs) are game patterns that almost always lead to some irreversible outcomes. In this paper, we formulate the notion of irreversible outcome property which can be combined with pattern mining so as to automatically extract TPRs from any given game datasets. We specifically extend the well-known PrefixSpan sequence mining algorithm by incorporating the irreversible outcome property. To show the usefulness of TPRs, we apply them to Tetris, a popular game. We mine …

Go to article

Modeling Contextual Agreement In Preferences, Ha Loc Do, Hady Wirawan Lauw Apr 2014

Modeling Contextual Agreement In Preferences, Ha Loc Do, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Personalization, or customizing the experience of each individual user, is seen as a useful way to navigate the huge variety of choices on the Web today. A key tenet of personalization is the capacity to model user preferences. The paradigm has shifted from that of individual preferences, whereby we look at a user's past activities alone, to that of shared preferences, whereby we model the similarities in preferences between pairs of users (e.g., friends, people with similar interests). However, shared preferences are still too granular, because it assumes that a pair of users would share preferences across all items. We …

Go to article

Recommending Investors For Crowdfunding Projects, Jisun An, Daniele Quercia, Jon Crowcroft Apr 2014

Recommending Investors For Crowdfunding Projects, Jisun An, Daniele Quercia, Jon Crowcroft

Research Collection School Of Computing and Information Systems

To bring their innovative ideas to market, those embarking in new ventures have to raise money, and, to do so, they have often resorted to banks and venture capitalists. Nowadays, they have an additional option: that of crowdfunding. The name refers to the idea that funds come from a network of people on the Internet who are passionate about supporting others' projects. One of the most popular crowdfunding sites is Kickstarter. In it, creators post descriptions of their projects and advertise them on social media sites (mainly Twitter), while investors look for projects to support. The most common reason for …

Go to article

Retrieval-Based Face Annotation By Weak Label Regularized Local Coordinate Coding, Dayong Wang, Steven C. H. Hoi, Ying He, Jianke Zhu, Mei Tao, Jiebo Luo Mar 2014

Retrieval-Based Face Annotation By Weak Label Regularized Local Coordinate Coding, Dayong Wang, Steven C. H. Hoi, Ying He, Jianke Zhu, Mei Tao, Jiebo Luo

Research Collection School Of Computing and Information Systems

Auto face annotation, which aims to detect human faces from a facial image and assign them proper human names, is a fundamental research problem and beneficial to many real-world applications. In this work, we address this problem by investigating a retrieval-based annotation scheme of mining massive web facial images that are freely available over the Internet. In particular, given a facial image, we first retrieve the top n similar instances from a large-scale web facial image database using content-based image retrieval techniques, and then use their labels for auto annotation. Such a scheme has two major challenges: 1) how to …

Go to article

Online Feature Selection And Its Applications, Jialei Wang, Peilin Zhao, Steven C. H. Hoi, Rong Jin Mar 2014

Online Feature Selection And Its Applications, Jialei Wang, Peilin Zhao, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

Feature selection is an important technique for data mining. Despite its importance, most studies of feature selection are restricted to batch learning. Unlike traditional batch learning methods, online learning represents a promising family of efficient and scalable machine learning algorithms for large-scale applications. Most existing studies of online learning require accessing all the attributes/features of training instances. Such a classical setting is not always appropriate for real-world applications when data instances are of high dimensionality or it is expensive to acquire the full set of attributes/features. To address this limitation, we investigate the problem of online feature selection (OFS) in …

Go to article

Predicting Response In Mobile Advertising With Hierarchical Importance-Aware Factorization Machine, Richard Jayadi Oentaryo, Ee Peng Lim, Jia Wei Low, David Lo, Michael Finegold Feb 2014

Predicting Response In Mobile Advertising With Hierarchical Importance-Aware Factorization Machine, Richard Jayadi Oentaryo, Ee Peng Lim, Jia Wei Low, David Lo, Michael Finegold

Research Collection School Of Computing and Information Systems

Mobile advertising has recently seen dramatic growth, fueled by the global proliferation of mobile phones and devices. The task of predicting ad response is thus crucial for maximizing business revenue. However, ad response data change dynamically over time, and are subject to cold-start situations in which limited history hinders reliable prediction. There is also a need for a robust regression estimation for high prediction accuracy, and good ranking to distinguish the impacts of different ads. To this end, we develop a Hierarchical Importance-aware Factorization Machine (HIFM), which provides an effective generic latent factor framework that incorporates importance weights and hierarchical …

Go to article

Detecting Click Fraud In Online Advertising: A Data Mining Approach, Richard Oentaryo, Ee Peng Lim, Michael Finegold, David Lo, Feida Zhu, Clifton Phua, Eng-Yeow Cheu, Ghim-Eng Yap, Kelvin Sim, Kasun Perera, Bijay Neupane, Mustafa Faisal, Zeyar Aung, Wei Lee Woon, Wei Chen, Dhaval Patel, Daniel Berrar Jan 2014

Detecting Click Fraud In Online Advertising: A Data Mining Approach, Richard Oentaryo, Ee Peng Lim, Michael Finegold, David Lo, Feida Zhu, Clifton Phua, Eng-Yeow Cheu, Ghim-Eng Yap, Kelvin Sim, Kasun Perera, Bijay Neupane, Mustafa Faisal, Zeyar Aung, Wei Lee Woon, Wei Chen, Dhaval Patel, Daniel Berrar

Research Collection School Of Computing and Information Systems

Click fraud - the deliberate clicking on advertisements with no real interest on the product or service offered - is one of the most daunting problems in online advertising. Building an elective fraud detection method is thus pivotal for online advertising businesses. We organized a Fraud Detection in Mobile Advertising (FDMA) 2012 Competition, opening the opportunity for participants to work on real-world fraud data from BuzzCity Pte. Ltd., a global mobile advertising company based in Singapore. In particular, the task is to identify fraudulent publishers who generate illegitimate clicks, and distinguish them from normal publishers. The competition was held from …

Go to article

Online Portfolio Selection: A Survey, Bin Li, Steven C. H. Hoi Jan 2014

Online Portfolio Selection: A Survey, Bin Li, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Online portfolio selection is a fundamental problem in computational finance, which has been extensively studied across several research communities, including finance, statistics, artificial intelligence, machine learning, and data mining. This article aims to provide a comprehensive survey and a structural understanding of online portfolio selection techniques published in the literature. From an online machine learning perspective, we first formulate online portfolio selection as a sequential decision problem, and then we survey a variety of state-of-the-art approaches, which are grouped into several major categories, including benchmarks, Follow-the-Winner approaches, Follow-the-Loser approaches, Pattern-Matching--based approaches, and Meta-Learning Algorithms. In addition to the problem formulation …

Go to article

Modeling Preferences With Availability Constraints, Bingtian Dai, Hady W. Lauw Dec 2013

Modeling Preferences With Availability Constraints, Bingtian Dai, Hady W. Lauw

Research Collection School Of Computing and Information Systems

User preferences are commonly learned from historical data whereby users express preferences for items, e.g., through consumption of products or services. Most work assumes that a user is not constrained in their selection of items. This assumption does not take into account the availability constraint, whereby users could only access some items, but not others. For example, in subscription-based systems, we can observe only those historical preferences on subscribed (available) items. However, the objective is to predict preferences on unsubscribed (unavailable) items, which do not appear in the historical observations due to their (lack of) availability. To model preferences in …

Go to article

Topicsketch: Real-Time Bursty Topic Detection From Twitter, Wei Xie, Feida Zhu, Jing Jiang, Ee Peng Lim, Ke Wang Dec 2013

Topicsketch: Real-Time Bursty Topic Detection From Twitter, Wei Xie, Feida Zhu, Jing Jiang, Ee Peng Lim, Ke Wang

Research Collection School Of Computing and Information Systems

Twitter has become one of the largest platforms for users around the world to share anything happening around them with friends and beyond. A bursty topic in Twitter is one that triggers a surge of relevant tweets within a short time, which often reflects important events of mass interest. How to leverage Twitter for early detection of bursty topics has therefore become an important research problem with immense practical value. Despite the wealth of research work on topic modeling and analysis in Twitter, it remains a huge challenge to detect bursty topics in real-time. As existing methods can hardly scale …

Go to article

Decision Trees To Model The Impact Of Disruption And Recovery In Supply Chain Networks, Loganathan Ponnanbalam, L. Wenbin, Xiuju Fu, Xiaofeng Yin, Zhaoxia Wang, Rick S. M. Goh Dec 2013

Decision Trees To Model The Impact Of Disruption And Recovery In Supply Chain Networks, Loganathan Ponnanbalam, L. Wenbin, Xiuju Fu, Xiaofeng Yin, Zhaoxia Wang, Rick S. M. Goh

Research Collection School Of Computing and Information Systems

Increase in the frequency of disruptions in the recent times and their impact have increased the attention in supply chain disruption management research. The objective of this paper is to understand as to how a disruption might affect the supply chain network - depending upon the network structure, the node that is disrupted, the disruption in production capacity of the disrupted node and the period of the disruption - via decision trees. To this end, we first developed a 5-tier agent-based supply chain model and then simulated it for various what-if disruptive scenarios for 3 different network structures (80 trials …

Go to article

The Influence Of Online Word-Of-Mouth On Long Tail Formation, Bin Gu, Qian Tang, Andrew B. Whinston Dec 2013

The Influence Of Online Word-Of-Mouth On Long Tail Formation, Bin Gu, Qian Tang, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

The long tail phenomenon has been attributed to both supply side and demand side economies. While the cause on the supply side is well-known, research on the demand side has largely focused on the awareness effect of online information that helps consumers discover new and often niche products. This study expands the demand side factors by showing that online information also influences the long tail phenomenon through the informative effect, which affects consumers' evaluation of product quality. We examine the informative effect in the context of online WOM. Two sets of theories suggest opposite directions for the implication of the …

Go to article

Modeling Temporal Adoptions Using Dynamic Matrix Factorization, Freddy Chong-Tat Chua, Richard Jayadi Oentaryo, Ee Peng Lim Dec 2013

Modeling Temporal Adoptions Using Dynamic Matrix Factorization, Freddy Chong-Tat Chua, Richard Jayadi Oentaryo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The problem of recommending items to users is relevant to many applications and the problem has often been solved using methods developed from Collaborative Filtering (CF). Collaborative Filtering model-based methods such as Matrix Factorization have been shown to produce good results for static rating-type data, but have not been applied to time-stamped item adoption data. In this paper, we adopted a Dynamic Matrix Factorization (DMF) technique to derive different temporal factorization models that can predict missing adoptions at different time steps in the users' adoption history. This DMF technique is an extension of the Non-negative Matrix Factorization (NMF) based on …

Go to article

A Social Network-Empowered Research Analytics Framework For Project Selection, Thushari Silva, Zhiling Guo, Jian Ma, Hongbing Jiang, Huaping Chen Nov 2013

A Social Network-Empowered Research Analytics Framework For Project Selection, Thushari Silva, Zhiling Guo, Jian Ma, Hongbing Jiang, Huaping Chen

Research Collection School Of Computing and Information Systems

Traditional approaches for research project selection by government funding agencies mainly focus on the matching of research relevance by keywords or disciplines. Other research relevant information such as social connections (e.g., collaboration and co-authorship) and productivity (e.g., quality, quantity, and citations of published journal articles) of researchers is largely ignored. To overcome these limitations, this paper proposes a social network-empowered research analytics framework (RAF) for research project selections. Scholarmate.com, a professional research social network with easy access to research relevant information, serves as a platform to build researcher profiles from three dimensions, i.e., relevance, productivity and connectivity. Building upon profiles …

Go to article

Social Sensing For Urban Crisis Management: The Case Of Singapore Haze, Philips Kokoh Prasetyo, Ming Gao, Ee Peng Lim, Christie N. Scollon Nov 2013

Social Sensing For Urban Crisis Management: The Case Of Singapore Haze, Philips Kokoh Prasetyo, Ming Gao, Ee Peng Lim, Christie N. Scollon

Research Collection School Of Computing and Information Systems

Sensing social media for trends and events has become possible as increasing number of users rely on social media to share information. In the event of a major disaster or social event, one can therefore study the event quickly by gathering and analyzing social media data. One can also design appropriate responses such as allocating resources to the affected areas, sharing event related information, and managing public anxiety. Past research on social event studies using social media often focused on one type of data analysis (e.g., hashtag clusters, diffusion of events, influential users, etc.) on a single social media data …

Go to article

Covariance Selection By Thresholding The Sample Correlation Matrix, Binyan Jiang Nov 2013

Covariance Selection By Thresholding The Sample Correlation Matrix, Binyan Jiang

Research Collection School Of Computing and Information Systems

This article shows that when the nonzero coefficients of the population correlation matrix are all greater in absolute value than (C1logp/n)1/2 for some constant C1, we can obtain covariance selection consistency by thresholding the sample correlation matrix. Furthermore, the rate (logp/n)1/2 is shown to be optimal.

Go to article

Predicting User's Political Party Using Ideological Stances, Swapna Gottopati, Minghui Qiu, Liu Yang, Feida Zhu, Jing Jiang Nov 2013

Predicting User's Political Party Using Ideological Stances, Swapna Gottopati, Minghui Qiu, Liu Yang, Feida Zhu, Jing Jiang

Research Collection School Of Computing and Information Systems

Predicting users political party in social media has important impacts on many real world applications such as targeted advertising, recommendation and personalization. Several political research studies on it indicate that political parties’ ideological beliefs on sociopolitical issues may influence the users political leaning. In our work, we exploit users’ ideological stances on controversial issues to predict political party of online users. We propose a collaborative filtering approach to solve the data sparsity problem of users stances on ideological topics and apply clustering method to group the users with the same party. We evaluated several state-of-the-art methods for party prediction task …

Go to article

First Prev Next Last