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

Computer Sciences Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 6481 - 6510 of 9024

Full-Text Articles in Computer Sciences

Assessing The Moderating Effect Of Consumer Product Knowledge And Online Shopping Experience On Using Recommedation Agents For Customer Loyalty, Victoria Y. Yoon, R. Eric Hostler, Zhiling Guo, Tor Guimaraes Nov 2013

Assessing The Moderating Effect Of Consumer Product Knowledge And Online Shopping Experience On Using Recommedation Agents For Customer Loyalty, Victoria Y. Yoon, R. Eric Hostler, Zhiling Guo, Tor Guimaraes

Research Collection School Of Computing and Information Systems

Social media technologies have greatly facilitated the creation of many types of user-generated information, e.g., product rating information can be used to generate preference-based recommendation. As a decision support tool, a Recommendation Agent (RA) has been widely adopted by many e-commerce websites. The impact of RAs on online shopping has been extensively examined in the IS literature. However, from Marketing and Social Media perspectives, the widely adopted cognitive–affect–conative–action framework of customer loyalty has not been tested in the presence of RAs. Moreover, there has been little research assessing the impact of increasing consumer knowledge about specific product domains on customer …


Optimization Approaches For Solving Chance Constrained Stochastic Orienteering Problems, Pradeep Varakantham, Akshat Kumar Nov 2013

Optimization Approaches For Solving Chance Constrained Stochastic Orienteering Problems, Pradeep Varakantham, Akshat Kumar

Research Collection School Of Computing and Information Systems

Orienteering problems (OPs) are typically used to model routing and trip planning problems. OP is a variant of the well known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of nodes and has an overall travel time less than the specified deadline. Stochastic orienteering problems (SOPs) extend OPs to account for uncertain travel times and are significantly harder to solve than deterministic OPs. In this paper, we contribute a scalable mixed integer LP formulation for solving risk aware SOPs, which is a principled approximation of the underlying stochastic optimization problem. Empirically, …


Efficient Index-Based Approaches For Skyline Queries In Location-Based Applications, Ken C. K. Lee, Baihua Zheng, Cindy Chen, Chi-Yin Chow Nov 2013

Efficient Index-Based Approaches For Skyline Queries In Location-Based Applications, Ken C. K. Lee, Baihua Zheng, Cindy Chen, Chi-Yin Chow

Research Collection School Of Computing and Information Systems

Enriching many location-based applications, various new skyline queries are proposed and formulated based on the notion of locational dominance, which extends conventional one by taking objects' nearness to query positions into account additional to objects' nonspatial attributes. To answer a representative class of skyline queries for location-based applications efficiently, this paper presents two index-based approaches, namely, augmented R-tree and dominance diagram. Augmented R-tree extends R-tree by including aggregated nonspatial attributes in index nodes to enable dominance checks during index traversal. Dominance diagram is a solution-based approach, by which each object is associated with a precomputed nondominance scope wherein query points …


Mining Branching-Time Scenarios, Dirk Fahland, David Lo, Shahar Maoz Nov 2013

Mining Branching-Time Scenarios, Dirk Fahland, David Lo, Shahar Maoz

Research Collection School Of Computing and Information Systems

Specification mining extracts candidate specification from existing systems, to be used for downstream tasks such as testing and verification. Specifically, we are interested in the extraction of behavior models from execution traces. In this paper we introduce mining of branching-time scenarios in the form of existential, conditional Live Sequence Charts, using a statistical data-mining algorithm. We show the power of branching scenarios to reveal alternative scenario-based behaviors, which could not be mined by previous approaches. The work contrasts and complements previous works on mining linear-time scenarios. An implementation and evaluation over execution trace sets recorded from several real-world applications shows …


Understanding The Genetic Makeup Of Linux Device Drivers, Peter Senna Tschudin, Laurent Reveillere, Lingxiao Jiang, David Lo, Julia Lawall Nov 2013

Understanding The Genetic Makeup Of Linux Device Drivers, Peter Senna Tschudin, Laurent Reveillere, Lingxiao Jiang, David Lo, Julia Lawall

Research Collection School Of Computing and Information Systems

No abstract provided.


Classification In P2p Networks With Cascade Support Vendor Machines, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee-Keong Ng Nov 2013

Classification In P2p Networks With Cascade Support Vendor Machines, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

Classification in Peer-to-Peer (P2P) networks is important to many real applications, such as distributed intrusion detection, distributed recommendation systems, and distributed antispam detection. However, it is very challenging to perform classification in P2P networks due to many practical issues, such as scalability, peer dynamism, and asynchronism. This article investigates the practical techniques of constructing Support Vector Machine (SVM) classifiers in the P2P networks. In particular, we demonstrate how to efficiently cascade SVM in a P2P network with the use of reduced SVM. In addition, we propose to fuse the concept of cascade SVM with bootstrap aggregation to effectively balance the …


Constraint-Based Automatic Symmetry Detection, Shao Jie Zhang, Jun Sun, Chengnian Sun, Yang Liu, Junwei Ma, Jin Song Dong Nov 2013

Constraint-Based Automatic Symmetry Detection, Shao Jie Zhang, Jun Sun, Chengnian Sun, Yang Liu, Junwei Ma, Jin Song Dong

Research Collection School Of Computing and Information Systems

We present an automatic approach to detecting symmetry relations for general concurrent models. Despite the success of symmetry reduction in mitigating state explosion problem, one essential step towards its soundness and effectiveness, i.e., how to discover sufficient symmetries with least human efforts, is often either overlooked or oversimplified. In this work, we show how a concurrent model can be viewed as a constraint satisfaction problem (CSP), and present an algorithm capable of detecting symmetries arising from the CSP which induce automorphisms of the model. To the best of our knowledge, our method is the first approach that can automatically detect …


Symmetry Robust Descriptor For Non-Rigid Surface Matching, Zhiyuan Zhang, Kangkang Yin, Kelvin W. C. Foong Nov 2013

Symmetry Robust Descriptor For Non-Rigid Surface Matching, Zhiyuan Zhang, Kangkang Yin, Kelvin W. C. Foong

Research Collection School Of Computing and Information Systems

In this paper, we propose a novel shape descriptor that is robust in differentiating intrinsic symmetric points on geometric surfaces. Our motivation is that even the state-of-theart shape descriptors and non-rigid surface matching algorithms suffer from symmetry flips. They cannot differentiate surface points that are symmetric or near symmetric. Hence a left hand of one human model may be matched to a right hand of another. Our Symmetry Robust Descriptor (SRD) is based on a signed angle field, which can be calculated from the gradient fields of the harmonic fields of two point pairs. Experiments show that the proposed shape …


Multimedia Modeling, Chong-Wah Ngo, Klaus Schoeffmann, Yiannis Andreopoulos, Christian Breiteneder Nov 2013

Multimedia Modeling, Chong-Wah Ngo, Klaus Schoeffmann, Yiannis Andreopoulos, Christian Breiteneder

Research Collection School Of Computing and Information Systems

Multimedia modeling aims to study computational models for addressing real-world multimedia problems from various perspectives, including information fusion, perceptual understanding, performance evaluation and social media. The topic becomes increasingly important with the massive amount of data available over the Internet, representing different pieces of information in heterogeneous forms that need to be consolidated before being used for multimedia problems. On the other hand, the advancement in technologies such as mobile and sensing devices drive the needs for revisiting the existing models for not only dealing with audio-visual cues but also incorporating various sensory modalities that have potential in providing cheaper …


Why Do I Retweet It? An Information Propagation Model For Microblogs, Fabio Pezzoni, Jisun An, Andrea Passarella, Jon Crowcroft, Marco Conti Nov 2013

Why Do I Retweet It? An Information Propagation Model For Microblogs, Fabio Pezzoni, Jisun An, Andrea Passarella, Jon Crowcroft, Marco Conti

Research Collection School Of Computing and Information Systems

Microblogging platforms are Web 2.0 services that represent a suitable environment for studying how information is propagated in social networks and how users can become influential. In this work we analyse the impact of the network features and of the users' behaviour on the information diffusion. Our analysis highlights a strong relation between the level of visibility of a message in the flow of information seen by a user and the probability that the user further disseminates the message. In addition, we also highlight the existence of other latent factors that impact on the dissemination probability, correlated with the properties …


Mining Fraudulent Patterns In Online Advertising, Richard J. Oentaryo, Ee-Peng Lim Nov 2013

Mining Fraudulent Patterns In Online Advertising, Richard J. Oentaryo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Advances in web technologies have rendered onlineadvertising as an effective means for small and large businesses to target different market segments on the fly. Online advertising is a huge industry. According to Gartner Inc., worldwide online advertising revenue is projected tohit $11.4 billion in 2013, up from $9.6 billion in 2012. Global revenue will also reach $24.5 billion in 2016, with online advertising creating opportunities for app developers, advertising networks, and service providersin various regions. An online advertising ecosystem is typically coordinated by an advertising commissioner, acting as a broker between advertisers and content publishers. An advertiser plans a budget, …


Social Informatics, Adam Jatowt, Ee-Peng Lim, Ying Ding, Asako Miura, Taro Tezuka, Gael Dias, Katsumi Tanaka, Andrew J. Flanagin, Bing Tian Dai Nov 2013

Social Informatics, Adam Jatowt, Ee-Peng Lim, Ying Ding, Asako Miura, Taro Tezuka, Gael Dias, Katsumi Tanaka, Andrew J. Flanagin, Bing Tian Dai

Research Collection School Of Computing and Information Systems

This book constitutes the proceedings of the 5th International Conference on Social Informatics, SocInfo 2013, held in Kyoto, Japan, in November 2013. The 23 full papers, 15 short papers, and three poster papers included in this volume were carefully reviewed and selected from 103 submissions. The papers present original research work on studying the interplay between socially-centric platforms and social phenomena.


Social Listening For Customer Acquisition, Juan Du, Biying Tan, Feida Zhu, Ee-Peng Lim Nov 2013

Social Listening For Customer Acquisition, Juan Du, Biying Tan, Feida Zhu, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Social network analysis has received much attention from corporations recently. Corporations are trying to utilize social media platforms such as Twitter, Facebook and Sina Weibo to expand their own markets. Our system is an online tool to assist these corporations to 1) find potential customers, and 2) track a list of users by specific events from social networks. We employ both textual and network information, and thus produce a keyword-based relevance score for each user in pre-defined dimensions, which indicates the probability of the adoption of a product. Based on the score and its trend, out tool is able to …


Challenges And Opportunities In Taxi Fleet Anomaly Detection, Rijurekha Sen, Rajesh Krishna Balan Nov 2013

Challenges And Opportunities In Taxi Fleet Anomaly Detection, Rijurekha Sen, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

To enhance fleet operation and management, logistics companies instrument their vehicles with GPS receivers and network connectivity to servers. Mobility traces from such large fleets provide significant information on commuter travel patterns, traffic congestion and road anomalies, and hence several researchers have mined such datasets to gain useful urban insights. These logistics companies, however, incur significant cost in deploying and maintaining their vast network of instrumented vehicles. Thus research problems, that are not only of interest to urban planners, but to the logistics companies themselves are important to attract and engage these companies for collaborative data analysis. In this paper, …


Automatically Partition Software Into Least Privilege Components Using Dynamic Data Dependency Analysis, Yongzheng Wu, Jun Sun, Yang Liu, Jin Song Dong Nov 2013

Automatically Partition Software Into Least Privilege Components Using Dynamic Data Dependency Analysis, Yongzheng Wu, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

The principle of least privilege requires that software components should be granted only necessary privileges, so that compromising one component does not lead to compromising others. However, writing privilege separated software is difficult and as a result, a large number of software is monolithic, i.e., it runs as a whole without separation. Manually rewriting monolithic software into privilege separated software requires significant effort and can be error prone. We propose ProgramCutter, a novel approach to automatically partitioning monolithic software using dynamic data dependency analysis. ProgramCutter works by constructing a data dependency graph whose nodes are functions and edges are data …


Tzuyu: Learning Stateful Typestates, Hao Xiao, Jun Sun, Yang Liu, Shang-Wei Lin, Chengnian Sun Nov 2013

Tzuyu: Learning Stateful Typestates, Hao Xiao, Jun Sun, Yang Liu, Shang-Wei Lin, Chengnian Sun

Research Collection School Of Computing and Information Systems

Behavioral models are useful for various software engineering tasks. They are, however, often missing in practice. Thus, specification mining was proposed to tackle this problem. Existing work either focuses on learning simple behavioral models such as finite-state automata, or relies on techniques (e.g., symbolic execution) to infer finite-state machines equipped with data states, referred to as stateful typestates. The former is often inadequate as finite-state automata lack expressiveness in capturing behaviors of data-rich programs, whereas the latter is often not scalable. In this work, we propose a fully automated approach to learn stateful typestates by extending the classic active learning …


Social-Loc: Improving Indoor Localization With Social Sensing, Jung-Hyun Jun, Yu Gu, Long Cheng, Banghui Lu, Jun Sun, Ting Zhu, Jianwei Niu Nov 2013

Social-Loc: Improving Indoor Localization With Social Sensing, Jung-Hyun Jun, Yu Gu, Long Cheng, Banghui Lu, Jun Sun, Ting Zhu, Jianwei Niu

Research Collection School Of Computing and Information Systems

Location-based services, such as targeted advertisement, geo-social networking and emergency services, are becoming increasingly popular for mobile applications. While GPS provides accurate outdoor locations, accurate indoor localization schemes still require either additional infrastructure support (e.g., ranging devices) or extensive training before system deployment (e.g., WiFi signal fingerprinting). In order to help existing localization systems to overcome their limitations or to further improve their accuracy, we propose Social-Loc, a middleware that takes the potential locations for individual users, which is estimated by any underlying indoor localization system as input and exploits both social encounter and non-encounter events to cooperatively calibrate the …


Self-Blindable Credential: Towards Anonymous Entity Authentication Upon Resource-Constrained Devices, Yanjiang Yang, Xuhua Ding, Haibing Lu, Jian Weng, Jianying Zhou Nov 2013

Self-Blindable Credential: Towards Anonymous Entity Authentication Upon Resource-Constrained Devices, Yanjiang Yang, Xuhua Ding, Haibing Lu, Jian Weng, Jianying Zhou

Research Collection School Of Computing and Information Systems

We are witnessing the rapid expansion of smart devices in our daily life. The need for individual privacy protection calls for anonymous entity authentication techniques with affordable efficiency upon the resource-constrained smart devices. Towards this objective, in this paper we propose self-blindable credential, a lightweight anonymous entity authentication primitive.We provide a formulation of the primitive and present two concrete instantiations. The first scheme implements verifier-local revocation and the second scheme enhances the former with forward security. Our analytical performance results show that our schemes outperform relevant existing schemes.


Achieving Revocable Fine-Grained Cryptographic Access Control Over Cloud Data, Yanjiang Yang, Xuhua Ding, Haibing Lu, Zhiguo Wan, Jianying Zhou Nov 2013

Achieving Revocable Fine-Grained Cryptographic Access Control Over Cloud Data, Yanjiang Yang, Xuhua Ding, Haibing Lu, Zhiguo Wan, Jianying Zhou

Research Collection School Of Computing and Information Systems

Attribute-based encryption (ABE) is well suited for finegrained access control for data residing on a cloud server. However, existing approaches for user revocation are not satisfactory. In this work, we propose a new approach which works by splitting an authorized user’s decryption capability between the cloud and the user herself. User revocation is attained by simply nullifying the decryption ability at the cloud, requiring neither key update nor re-generation of cloud data. We propose a concrete scheme instantiating the approach, which features lightweight computation at the user side. This makes it possible for users to use resource-constrained devices such as …


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 …


Information Vs Interaction: An Alternative User Ranking Model For Social Networks, Wei Xie, Ai Phuong Hoang, Feida Zhu, Ee Peng Lim Nov 2013

Information Vs Interaction: An Alternative User Ranking Model For Social Networks, Wei Xie, Ai Phuong Hoang, Feida Zhu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The recent years have seen an unprecedented boom of social network services, such as Twitter, which boasts over 200 million users. In such big social platforms, the influential users are ideal targets for viral marketing to potentially reach an audience of maximal size. Most proposed algorithms rely on the linkage structure of the respective underlying network to determine the information flow and hence indicate a users influence. From social interaction perspective, we built a model based on the dynamic user interactions constantly taking place on top of these linkage structures. In particular, in the Twitter setting we supposed a principle …


Adaptable Ciphertext-Policy Attribute-Based Encryption, Junzuo Lai, Robert H. Deng, Yanjiang Yang, Jian Weng Nov 2013

Adaptable Ciphertext-Policy Attribute-Based Encryption, Junzuo Lai, Robert H. Deng, Yanjiang Yang, Jian Weng

Research Collection School Of Computing and Information Systems

In this paper, we introduce a new cryptographic primitive, called adaptable ciphertext-policy attribute-based encryption (CP-ABE). Adaptable CP-ABE extends the traditional CP-ABE by allowing a semi-trusted proxy to modify a ciphertext under one access policy into ciphertexts of the same plaintext under any other access policies; the proxy, however, learns nothing about the underlying plaintext. With such “adaptability” possessed by the proxy, adaptable CP-ABE has many real world applications, such as handling policy changes in CP-ABE encryption of cloud data and outsourcing of CP-ABE encryption. Specifically, we first specify a formal model of adaptable CP-ABE; then, based on the CP-ABE scheme …


Got Issues? Who Cares About It? A Large Scale Investigation Of Issue Trackers From Github, Tegawende F. Bissyande, David Lo, Lingxiao Jiang, Laurent Reveillere, Jacques Klein, Yves Le Traon Nov 2013

Got Issues? Who Cares About It? A Large Scale Investigation Of Issue Trackers From Github, Tegawende F. Bissyande, David Lo, Lingxiao Jiang, Laurent Reveillere, Jacques Klein, Yves Le Traon

Research Collection School Of Computing and Information Systems

Feedback from software users constitutes a vital part in the evolution of software projects. By filing issue reports, users help identify and fix bugs, document software code, and enhance the software via feature requests. Many studies have explored issue reports, proposed approaches to enable the submission of higher-quality reports, and presented techniques to sort, categorize and leverage issues for software engineering needs. Who, however, cares about filing issues? What kind of issues are reported in issue trackers? What kind of correlation exist between issue reporting and the success of software projects? In this study, we address the need for answering …


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 …


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 …


Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks, Pradeep Varakantham, Na Fu, William Yeoh, Shih-Fen Cheng, Hoong Chuin Lau Nov 2013

Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks, Pradeep Varakantham, Na Fu, William Yeoh, Shih-Fen Cheng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Congestion occurs when there is competition for resources by sel sh agents. In this paper, we are concerned with smoothing out congestion in a network of resources by using personalized well-timed in- centives that are subject to budget constraints. To that end, we provide: (i) a mathematical formulation that computes equilibrium for the re- source sharing congestion game with incentives and budget constraints; (ii) an integrated approach that scales to larger problems by exploiting the factored network structure and approximating the attained equilib- rium; (iii) an iterative best response algorithm for solving the uncon- strained version (no budget) of the …


Using Micro-Reviews To Select An Efficient Set Of Reviews, Thanh-Son Nguyen, Hady W. Lauw, Panayiotis Tsaparas Nov 2013

Using Micro-Reviews To Select An Efficient Set Of Reviews, Thanh-Son Nguyen, Hady W. Lauw, Panayiotis Tsaparas

Research Collection School Of Computing and Information Systems

Online reviews are an invaluable resource for web users trying to make decisions regarding products or services. However, the abundance of review content, as well as the unstructured, lengthy, and verbose nature of reviews make it hard for users to locate the appropriate reviews, and distill the useful information. With the recent growth of social networking and micro-blogging services, we observe the emergence of a new type of online review content, consisting of bite-sized, 140 character-long reviews often posted reactively on the spot via mobile devices. These micro-reviews are short, concise, and focused, nicely complementing the lengthy, elaborate, and verbose …


Adaptive Gameplay For Programming Practice, Chris Boesch, Sandra Boesch Oct 2013

Adaptive Gameplay For Programming Practice, Chris Boesch, Sandra Boesch

Research Collection School Of Computing and Information Systems

Over the past four years, we have collaborated to develop a set of online games to enable users to practice software languages in a self-directed manner and as part of a class. Recently we introduced a new adaptive difficulty feature that enables players to self-regulate the difficulty of the games they are playing to practice. These new features also provide additional information to further adapt the problem content to better meet the needs of the users.


Modeling Interaction Features For Debate Side Clustering, Minghui Qiu, Liu Yang, Jing Jiang Oct 2013

Modeling Interaction Features For Debate Side Clustering, Minghui Qiu, Liu Yang, Jing Jiang

Research Collection School Of Computing and Information Systems

Online discussion forums are popular social media platforms for users to express their opinions and discuss controversial issues with each other. To automatically identify the sides/stances of posts or users from textual content in forums is an important task to help mine online opinions. To tackle the task, it is important to exploit user posts that implicitly contain support and dispute (interaction) information. The challenge we face is how to mine such interaction information from the content of posts and how to use them to help identify stances. This paper proposes a two-stage solution based on latent variable models: an …


Automated Library Recommendation, Ferdian Thung, David Lo, Julia Lawall Oct 2013

Automated Library Recommendation, Ferdian Thung, David Lo, Julia Lawall

Research Collection School Of Computing and Information Systems

Many third party libraries are available to be downloaded and used. Using such libraries can reduce development time and make the developed software more reliable. However, developers are often unaware of suitable libraries to be used for their projects and thus they miss out on these benefits. To help developers better take advantage of the available libraries, we propose a new technique that automatically recommends libraries to developers. Our technique takes as input the set of libraries that an application currently uses, and recommends other libraries that are likely to be relevant. We follow a hybrid approach that combines association …