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

Databases and Information Systems Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1921 - 1950 of 3560

Full-Text Articles in Databases and Information Systems

Control Flow Integrity Enforcement With Dynamic Code Optimization, Yan Lin, Xiaoxiao Tang, Debin Gao, Jianming Fu Sep 2016

Control Flow Integrity Enforcement With Dynamic Code Optimization, Yan Lin, Xiaoxiao Tang, Debin Gao, Jianming Fu

Research Collection School Of Computing and Information Systems

Control Flow Integrity (CFI) is an attractive security property with which most injected and code reuse attacks can be defeated, including advanced attacking techniques like Return-Oriented Programming (ROP). However, comprehensive enforcement of CFI is expensive due to additional supports needed (e.g., compiler support and presence of relocation or debug information) and performance overhead. Recent research has been trying to strike the balance among reasonable approximation of the CFI properties, minimal additional supports needed, and acceptable performance. We investigate existing dynamic code optimization techniques and find that they provide an architecture on which CFI can be enforced effectively and efficiently. In …

Go to article

Soft Confidence-Weighted Learning, Jialei Wang, Peilin Zhao, Hoi, Steven C. H. Sep 2016

Soft Confidence-Weighted Learning, Jialei Wang, Peilin Zhao, Hoi, Steven C. H.

Research Collection School Of Computing and Information Systems

Online learning plays an important role in many big datamining problems because of its high efficiency and scalability. In theliterature, many online learning algorithms using gradient information havebeen applied to solve online classification problems. Recently, more effectivesecond-order algorithms have been proposed, where the correlation between thefeatures is utilized to improve the learning efficiency. Among them,Confidence-Weighted (CW) learning algorithms are very effective, which assumethat the classification model is drawn from a Gaussian distribution, whichenables the model to be effectively updated with the second-order informationof the data stream. Despite being studied actively, these CW algorithms cannothandle nonseparable datasets and noisy datasets very …

Go to article

Detecting Community Pacemakers Of Burst Topic In Twitter, Guozhong Dong, Wu Yang, Feida Zhu, Wei Wang Sep 2016

Detecting Community Pacemakers Of Burst Topic In Twitter, Guozhong Dong, Wu Yang, Feida Zhu, Wei Wang

Research Collection School Of Computing and Information Systems

Twitter has become one of largest social networks for users to broad-cast burst topics. Influential users usually have a large number of followers and play an important role in the diffusion of burst topic. There have been many studies on how to detect influential users. However, traditional influential users detection approaches have largely ignored influential users in user community. In this paper, we investigate the problem of detecting community pacemakers. Community pacemakers are defined as the influential users that promote early diffusion in the user community of burst topic. To solve this problem, we present DCPBT, a framework that can …

Go to article

Efficient Community Maintenance For Dynamic Social Networks, Hongchao Qin, Ye Yuan, Feida Zhu, Guoren Wang Sep 2016

Efficient Community Maintenance For Dynamic Social Networks, Hongchao Qin, Ye Yuan, Feida Zhu, Guoren Wang

Research Collection School Of Computing and Information Systems

Community detection plays an important role in a wide range of research topics for social networks including personalized recommendation services and information dissemination. The highly dynamic nature of social platforms, and accordingly the constant updates to the underlying network, all present a serious challenge for efficient maintenance of the identified communities. How to avoid computing from scratch the whole community detection result in face of every update, which constitutes small changes more often than not. To solve this problem, we propose a novel and efficient algorithm to maintain the communities in dynamic social networks by identifying and updating only those …

Go to article

Extracting Food Substitutes From Food Diary Via Distributional Similarity, Palakorn Achananuparp, Ingmar Weber Sep 2016

Extracting Food Substitutes From Food Diary Via Distributional Similarity, Palakorn Achananuparp, Ingmar Weber

Research Collection School Of Computing and Information Systems

In this paper, we explore the problem of identifying substitute relationship between food pairs from real-world food consumption data as the first step towards the healthier food recommendation. Our method is inspired by the distributional hypothesis in linguistics. Specifically, we assume that foods that are consumed in similar contexts are more likely to be similar dietarily. For example, a turkey sandwich can be considered a suitable substitute for a chicken sandwich if both tend to be consumed with french fries and salad. To evaluate our method, we constructed a real-world food consumption dataset from MyFitnessPal's public food diary entries and …

Go to article

Cross-Cultural User Perceptions Of Website Design And Security: Introduction To A Commentary And Response On Cyr (2013), Robert John Kauffman Sep 2016

Cross-Cultural User Perceptions Of Website Design And Security: Introduction To A Commentary And Response On Cyr (2013), Robert John Kauffman

Research Collection School Of Computing and Information Systems

Just as the well-known statistician, George Box, commented in a 1978 paper, “All models are wrong, but some are useful,” so are there many ways to design research inquiry approaches to explore issues in various e-commerce contexts – all useful too. In the two brief essays that follow, the reader will see a written commentary and a response that illustrates this idea. It occurred between a technology researcher who published an article on cross-cultural issues in website design in Cyr (2013), and an economist who is able to offer useful insights on the statistical work and data analytics with methods …

Go to article

Microblogging Content Propagation Modeling Using Topic-Specific Behavioral Factors, Tuan Anh Hoang, Ee-Peng Lim Sep 2016

Microblogging Content Propagation Modeling Using Topic-Specific Behavioral Factors, Tuan Anh Hoang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

When a microblogging user adopts some content propagated to her, we can attribute that to three behavioral factors, namely, topic virality, user virality, and user susceptibility. Topic virality measures the degree to which a topic attracts propagations by users. User virality and susceptibility refer to the ability of a user to propagate content to other users, and the propensity of a user adopting content propagated to her, respectively. In this paper, we study the problem of mining these behavioral factors specific to topics from microblogging content propagation data. We first construct a three dimensional tensor for representing the propagation instances. …

Go to article

Is Only One Gps Position Sufficient To Locate You To The Road Network Accurately?, Hao Wu, Weiwei Sun, Baihua Zheng Sep 2016

Is Only One Gps Position Sufficient To Locate You To The Road Network Accurately?, Hao Wu, Weiwei Sun, Baihua Zheng

Research Collection School Of Computing and Information Systems

Locating only one GPS position to a road segment accurately is crucial to many location-based services such as mobile taxihailing service, geo-tagging, POI check-in, etc. This problem is challenging because of errors including the GPS errors and the digital map errors (misalignment and the same representation of bidirectional roads) and a lack of context information. To the best of our knowledge, no existing work studies this problem directly and the work to reduce GPS signal errors by considering hardware aspect is the most relevant. Consequently, this work is the first attempt to solve the problem of locating one GPS position …

Go to article

Autoquery: Automatic Construction Of Dependency Queries For Code Search, Shaowei Wang, David Lo, Lingxiao Jiang Sep 2016

Autoquery: Automatic Construction Of Dependency Queries For Code Search, Shaowei Wang, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Many code search techniques have been proposed to return relevant code for a user query expressed as textual descriptions. However, source code is not mere text. It contains dependency relations among various program elements. To leverage these dependencies for more accurate code search results, techniques have been proposed to allow user queries to be expressed as control and data dependency relationships among program elements. Although such techniques have been shown to be effective for finding relevant code, it remains a question whether appropriate queries can be generated by average users. In this work, we address this concern by proposing a …

Go to article

Topic Extraction From Microblog Posts Using Conversation Structures, Jing Li, Ming Liao, Wei Gao, Yulan He, Kam-Fai Wong Aug 2016

Topic Extraction From Microblog Posts Using Conversation Structures, Jing Li, Ming Liao, Wei Gao, Yulan He, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Conventional topic models are ineffective for topic extraction from microblog messages since the lack of structure and context among the posts renders poor message-level word co-occurrence patterns. In this work, we organize microblog posts as conversation trees based on reposting and replying relations, which enrich context information to alleviate data sparseness. Our model generates words according to topic dependencies derived from the conversation structures. In specific, we differentiate messages as leader messages, which initiate key aspects of previously focused topics or shift the focus to different topics, and follower messages that do not introduce any new information but simply echo …

Go to article

A Novel Digital Image Classification Algorithm Via Low-Rank Sparse Bag-Of-Features Model, Xiu-Ming Zou, Huai-Jiang Sun, Sai Yang, Yan Zhu Aug 2016

A Novel Digital Image Classification Algorithm Via Low-Rank Sparse Bag-Of-Features Model, Xiu-Ming Zou, Huai-Jiang Sun, Sai Yang, Yan Zhu

Research Collection School of Computing and Information Systems

Bag-of-features (BoF) is one of the most well-known methods used to represent digital image features because of its simplicity and efficiency. A variety of improved algorithms have been employed to enhance the performance of BoF in characterization. However, challenges in the application of BoF in the field still exist. This study focused on BoF by decomposing local features and presented a novel framework for BoF on the basis of low-rank and sparse matrix decomposition to obtain a more robust and discriminative digital image classification. First, the local feature matrix of a digital image is decomposed into a low-rank matrix and …

Go to article

Profiling Social Media Users With Selective Self-Disclosure Behavior, Wei Gong Aug 2016

Profiling Social Media Users With Selective Self-Disclosure Behavior, Wei Gong

Dissertations and Theses Collection

Social media has become a popular platform for millions of users to share activities and thoughts. Many applications are now tapping on social media to disseminate information (e.g., news), to promote products (e.g., advertisements), to manage customer relationship (e.g., customer feedback), and to source for investment (e.g., crowdfunding). Many of these applications require user profile knowledge to select the target social media users or to personalize messages to users. Social media user profiling is a task of constructing user profiles such as demographical labels, interests, and opinions, etc., using social media data. Among the social media user profiling research works, …

Go to article

Unsupervised Multi-Graph Cross-Modal Hashing For Large-Scale Multimedia Retrieval, Liang Xie, Lei Zhu, Guoqi Chen Aug 2016

Unsupervised Multi-Graph Cross-Modal Hashing For Large-Scale Multimedia Retrieval, Liang Xie, Lei Zhu, Guoqi Chen

Research Collection School Of Computing and Information Systems

With the advance of internet and multimedia technologies, large-scale multi-modal representation techniques such as cross-modal hashing, are increasingly demanded for multimedia retrieval. In cross-modal hashing, three essential problems should be seriously considered. The first is that effective cross-modal relationship should be learned from training data with scarce label information. The second is that appropriate weights should be assigned for different modalities to reflect their importance. The last is the scalability of training process which is usually ignored by previous methods. In this paper, we propose Multi-graph Cross-modal Hashing (MGCMH) by comprehensively considering these three points. MGCMH is unsupervised method which …

Go to article

Probabilistic Robust Route Recovery With Spatio-Temporal Dynamics, Hao Wu, Jiangyun Mao, Weiwei Sun, Baihua Zheng, Hanyuan Zhang, Ziyang Chen, Wei Wang Aug 2016

Probabilistic Robust Route Recovery With Spatio-Temporal Dynamics, Hao Wu, Jiangyun Mao, Weiwei Sun, Baihua Zheng, Hanyuan Zhang, Ziyang Chen, Wei Wang

Research Collection School Of Computing and Information Systems

Vehicle trajectories are one of the most important data in location-based services. The quality of trajectories directly affects the services. However, in the real applications, trajectory data are not always sampled densely. In this paper, we study the problem of recovering the entire route between two distant consecutive locations in a trajectory. Most existing works solve the problem without using those informative historical data or solve it in an empirical way. We claim that a data-driven and probabilistic approach is actually more suitable as long as data sparsity can be well handled. We propose a novel route recovery system in …

Go to article

Intermediaries Vs Peer-To-Peer: A Study Of Lenders’ Incentive On A Donation-Based Crowdfunding Platform, Ling Ge, Zhiling Guo, Xuechen Luo Aug 2016

Intermediaries Vs Peer-To-Peer: A Study Of Lenders’ Incentive On A Donation-Based Crowdfunding Platform, Ling Ge, Zhiling Guo, Xuechen Luo

Research Collection School Of Computing and Information Systems

Donation-based crowdfunding platform Kiva seems to hold the promise of peer-to-peer lending with zero interest rate to help the poor. However, it is actually intermediated by microfinance institutions, which raise funds from Kiva lenders, disburse the funds to borrowers and collect high interest. Later Kiva launched another platform Kiva Zip that implements interest-free loans directly from lenders to borrowers. This unique setup enables us to examine how lenders choose between Kiva and Kiva Zip, i.e. a platform with intermediaries and a real P2P platform. We develop a theoretical model and explicate that the lenders trade-off is between the sustainability of …

Go to article

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 …

Go to article

Understanding Patient Portal Use Intentions: Enablers And Inhibitors Of It Use, M. Moqbel, Fiona Fui-Hoon Nah, V. Bartelt, R. O’Dell Aug 2016

Understanding Patient Portal Use Intentions: Enablers And Inhibitors Of It Use, M. Moqbel, Fiona Fui-Hoon Nah, V. Bartelt, R. O’Dell

Research Collection School Of Computing and Information Systems

This research explores factors that influence patient’s intentions to use a hospital’s patient portal. Specifically, we investigate patient portal use intentions using two different perspectives: enablers of IT use (patient need for healthcare empowerment and healthcare professional encouragement) and inhibitors of IT use (privacy and security concerns). Drawing on theories of privacy calculus and protection motivation, we propose a research model to assess the relationships between the enablers and inhibitors of IT use as well as their effects on patient portal adoption. We will administer a survey questionnaire to existing patients of a major hospital in the Midwest and employ …

Go to article

Fine-Grained Detection Of Programming Students’ Frustration Using Keystrokes, Mouse Clicks And Interaction Logs, Hua Leong Fwa Jul 2016

Fine-Grained Detection Of Programming Students’ Frustration Using Keystrokes, Mouse Clicks And Interaction Logs, Hua Leong Fwa

Research Collection School Of Computing and Information Systems

Prolonged frustration leads to loss of confidence and eventual disinterest in the learning itself. The modelling of frustration in learning is thus important as it informs on the appropriate time to intervene to sustain the interest and motivation of students. To automatically detect learner’s frustration in a naturalistic learning environment, the novel use of keystrokes, mouse clicks and interaction patterns of students captured within the context of a tutoring system was proposed. The modelling approach was described and a comparison was made between the proposed model using Bayesian Network and the baseline Naïve Bayes model. With the formulation of an …

Go to article

Outlier Detection In Complex Categorical Data By Modeling The Feature Value Couplings, Guansong Pang, Longbing Cao, Ling Chen Jul 2016

Outlier Detection In Complex Categorical Data By Modeling The Feature Value Couplings, Guansong Pang, Longbing Cao, Ling Chen

Research Collection School Of Computing and Information Systems

This paper introduces a novel unsupervised outlier detection method, namely Coupled Biased Random Walks (CBRW), for identifying outliers in categorical data with diversified frequency distributions and many noisy features. Existing pattern-based outlier detection methods are ineffective in handling such complex scenarios, as they misfit such data. CBRW estimates outlier scores of feature values by modelling feature value level couplings, which carry intrinsic data characteristics, via biased random walks to handle this complex data. The outlier scores of feature values can either measure the outlierness of an object or facilitate the existing methods as a feature weighting and selection indicator. Substantial …

Go to article

On Effective Personalized Music Retrieval By Exploring Online User Behaviors, Zhiyong Cheng, Jialie Shen, Steven C. H. Hoi Jul 2016

On Effective Personalized Music Retrieval By Exploring Online User Behaviors, Zhiyong Cheng, Jialie Shen, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of personalized text based music retrieval which takes users’ music preferences on songs into account via the analysis of online listening behaviours and social tags. Towards the goal, a novel DualLayer Music Preference Topic Model (DL-MPTM) is proposed to construct latent music interest space and characterize the correlations among (user, song, term). Based on the DL-MPTM, we further develop an effective personalized music retrieval system. To evaluate the system’s performance, extensive experimental studies have been conducted over two test collections to compare the proposed method with the state-of-the-art music retrieval methods. The results …

Go to article

Build Emotion Lexicon From The Mood Of Crowd Via Topic-Assisted Joint Non-Negative Matrix Factorization, Kaisong Song, Wei Gao, Ling Chen, Shi Feng, Daling Wang, Chengqi Zhang Jul 2016

Build Emotion Lexicon From The Mood Of Crowd Via Topic-Assisted Joint Non-Negative Matrix Factorization, Kaisong Song, Wei Gao, Ling Chen, Shi Feng, Daling Wang, Chengqi Zhang

Research Collection School Of Computing and Information Systems

Kaisong Song, Wei Gao, Ling Chen, Shi Feng, Daling Wang, and Chengqi Zhang. (2016). . In , pages 773–776, Pisa, Italy. ACM Press. https://doi.org/10.1145/2911451.2914759

Go to article

Ordinal Text Quantification, Giovanni Da San Martino, Wei Gao, Fabrizio Sebastiani Jul 2016

Ordinal Text Quantification, Giovanni Da San Martino, Wei Gao, Fabrizio Sebastiani

Research Collection School Of Computing and Information Systems

In recent years there has been a growing interest in text quantification, a supervised learning task where the goal is to accurately estimate, in an unlabelled set of items, the prevalence (or "relative frequency") of each class c in a predefined set C. Text quantification has several applications, and is a dominant concern in fields such as market research, the social sciences, political science, and epidemiology. In this paper we tackle, for the first time, the problem of ordinal text quantification, defined as the task of performing text quantification when a total order is defined on the set of classes; …

Go to article

Detecting Rumors From Microblogs With Recurrent Neural Networks, Jing Ma, Wei Gao, Prasenjit Mitra, Sejeong Kwon, Bernard J. Jansen, Kam-Fai Wong, Meeyoung Cha Jul 2016

Detecting Rumors From Microblogs With Recurrent Neural Networks, Jing Ma, Wei Gao, Prasenjit Mitra, Sejeong Kwon, Bernard J. Jansen, Kam-Fai Wong, Meeyoung Cha

Research Collection School Of Computing and Information Systems

Microblogging platforms are an ideal place for spreading rumors and automatically debunking rumors is a crucial problem. To detect rumors, existing approaches have relied on hand-crafted features for employing machine learning algorithms that require daunting manual effort. Upon facing a dubious claim, people dispute its truthfulness by posting various cues over time, which generates long-distance dependencies of evidence. This paper presents a novel method that learns continuous representations of microblog events for identifying rumors. The proposed model is based on recurrent neural networks (RNN) for learning the hidden representations that capture the variation of contextual information of relevant posts over …

Go to article

Three Strategies To Success: Learning Adversary Models In Security Games, Nika Haghtalab, Fei Fang, Thanh Hong Nguyen, Arunesh Sinha, Ariel D. Procaccia, Milind Tambe Jul 2016

Three Strategies To Success: Learning Adversary Models In Security Games, Nika Haghtalab, Fei Fang, Thanh Hong Nguyen, Arunesh Sinha, Ariel D. Procaccia, Milind Tambe

Research Collection School Of Computing and Information Systems

State-of-the-art applications of Stackelberg security games -- including wildlife protection -- offer a wealth of data, which can be used to learn the behavior of the adversary. But existing approaches either make strong assumptions about the structure of the data, or gather new data through online algorithms that are likely to play severely suboptimal strategies. We develop a new approach to learning the parameters of the behavioral model of a bounded rational attacker (thereby pinpointing a near optimal strategy), by observing how the attacker responds to only three defender strategies. We also validate our approach using experiments on real and …

Go to article

Self-Regulated Incremental Clustering With Focused Preferences, Di Wang, Ah-Hwee Tan Jul 2016

Self-Regulated Incremental Clustering With Focused Preferences, Di Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Due to their online learning nature, incremental clustering techniques can handle a continuous stream of data. In particular, various incremental clustering techniques based on Adaptive Resonance Theory (ART) have been shown to have low computational complexity in adaptive learning and are less sensitive to noisy information. However, parameter regularization in existing ART clustering techniques is applied either on different features or on different clusters exclusively. In this paper, we introduce Interest-Focused Clustering based on Adaptive Resonance Theory (IFC-ART), which self-regulates the vigilance parameter associated with each feature and each cluster. As such, we can incorporate the domain knowledge of the …

Go to article

The Impact Of Nasd Rule 2711 And Nyse Rule 472 On Analyst Behavior: The Strategic Timing Of Recommendations Issued On Weekends, Yi Dong, Nan Hu Jul 2016

The Impact Of Nasd Rule 2711 And Nyse Rule 472 On Analyst Behavior: The Strategic Timing Of Recommendations Issued On Weekends, Yi Dong, Nan Hu

Research Collection School Of Computing and Information Systems

Amendments to NASD Rule 2711 and NYSE Rule 472, enacted in May 2002, mandate that sell-side analysts disclose the distribution of their security recommendations by buy, hold and sell category. This regulation enhances the transparency of analysts' information and mitigates the long-recognized optimistic bias in their recommendations. However, we find that analysts are more likely to issue sell recommendations or downgrade revisions on weekends when investors have limited attention after these rule changes. This pattern is more pronounced for prestigious analysts, who are more likely to influence stock prices. Market reaction tests reveal an incomplete immediate response and a greater …

Go to article

Real-Time Salient Object Detection With A Minimum Spanning Tree, Wei-Chih Tu, Shengfeng He, Qingxiong Yang, Shao-Yi Chien Jul 2016

Real-Time Salient Object Detection With A Minimum Spanning Tree, Wei-Chih Tu, Shengfeng He, Qingxiong Yang, Shao-Yi Chien

Research Collection School Of Computing and Information Systems

In this paper, we present a real-time salient object detection system based on the minimum spanning tree. Due to the fact that background regions are typically connected to the image boundaries, salient objects can be extracted by computing the distances to the boundaries. However, measuring the image boundary connectivity efficiently is a challenging problem. Existing methods either rely on superpixel representation to reduce the processing units or approximate the distance transform. Instead, we propose an exact and iteration free solution on a minimum spanning tree. The minimum spanning tree representation of an image inherently reveals the object geometry information in …

Go to article

Word Clouds With Latent Variable Analysis For Visual Comparison Of Documents, Tuan M. V. Le, Hady W. Lauw Jul 2016

Word Clouds With Latent Variable Analysis For Visual Comparison Of Documents, Tuan M. V. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Word cloud is a visualization form for text that is recognized for its aesthetic, social, and analytical values. Here, we are concerned with deepening its analytical value for visual comparison of documents. To aid comparative analysis of two or more documents, users need to be able to perceive similarities and differences among documents through their word clouds. However, as we are dealing with text, approaches that treat words independently may impede accurate discernment of similarities among word clouds containing different words of related meanings. We therefore motivate the principle of displaying related words in a coherent manner, and propose to …

Go to article

Robust Median Reversion Strategy For Online Portfolio Selection, Dingjiang Huang, Junlong Zhou, Bin Li, Hoi, Steven C. H., Shuigeng Zhou Jul 2016

Robust Median Reversion Strategy For Online Portfolio Selection, Dingjiang Huang, Junlong Zhou, Bin Li, Hoi, Steven C. H., Shuigeng Zhou

Research Collection School Of Computing and Information Systems

On-line portfolio selection has been attracting increasing interests from artificial intelligence community in recent decades. Mean reversion, as one most frequent pattern in financial markets, plays an important role in some state-of-the-art strategies. Though successful in certain datasets, existing mean reversion strategies do not fully consider noises and outliers in the data, leading to estimation error and thus non-optimal portfolios, which results in poor performance in practice. To overcome the limitation, we propose to exploit the reversion phenomenon by robust L1-median estimator, and design a novel on-line portfolio selection strategy named "Robust Median Reversion" (RMR), which makes optimal portfolios based …

Go to article

On Effective Personalized Music Retrieval Via Exploring Online User Behaviors, Zhiyong Cheng, Jialie Shen, Steven C. H. Hoi Jul 2016

On Effective Personalized Music Retrieval Via Exploring Online User Behaviors, Zhiyong Cheng, Jialie Shen, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of personalized text based music retrieval which takes users' music preferences on songs into account via the analysis of online listening behaviours and social tags. Towards the goal, a novel Dual-Layer Music Preference Topic Model (DL-MPTM) is proposed to construct latent music interest space and characterize the correlations among (user, song, term). Based on the DL-MPTM, we further develop an effective personalized music retrieval system. To evaluate the system's performance, extensive experimental studies have been conducted over two test collections to compare the proposed method with the state-of-the-art music retrieval methods. The results …

Go to article

First Prev Next Last