Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3441)
- Software Engineering (2143)
- Artificial Intelligence and Robotics (1664)
- Information Security (1056)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (921)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (178)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (53)
- Security (53)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Large Language Models (43)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 5881 - 5910 of 8479
Full-Text Articles in Computer Sciences
Theorems About Quadrilaterals And Conics, Dorde Baralic, Branko Grbic, Dorde Zikelic
Theorems About Quadrilaterals And Conics, Dorde Baralic, Branko Grbic, Dorde Zikelic
Research Collection School Of Computing and Information Systems
We study quadrilaterals inscribed and circumscribed about conics and prove interesting theorems. Theorems are discovered by experimenting with dynamical geometry software. The Poncelet theorem for quadrilaterals is proved by elementary means together with Poncelet's grid property.
Information-Theoretic Multi-View Domain Adaptation: A Theoretical And Empirical Study, Pei Yang, Wei Gao
Information-Theoretic Multi-View Domain Adaptation: A Theoretical And Empirical Study, Pei Yang, Wei Gao
Research Collection School Of Computing and Information Systems
Multi-view learning aims to improve classification performance by leveraging the consistency among different views of data. The incorporation of multiple views was paid little attention in the studies of domain adaptation, where the view consistency based on source data is largely violated in the target domain due to the distribution gap between different domain data. In this paper, we leverage multiple views for cross-domain document classification. The central idea is to strengthen the views' consistency on target data by identifying the associations of domain-specific features from different domains. We present an Information-theoretic Multi-view Adaptation Model (IMAM) using a multi-way clustering …
Sampled Fictitious Play For Multi-Action Stochastic Dynamic Programs, Archis Ghate, Shih-Fen Cheng, Stephen Baumert, Daniel Reaume, Dushyant Sharma, Robert L. Smith
Sampled Fictitious Play For Multi-Action Stochastic Dynamic Programs, Archis Ghate, Shih-Fen Cheng, Stephen Baumert, Daniel Reaume, Dushyant Sharma, Robert L. Smith
Research Collection School Of Computing and Information Systems
We introduce a class of finite-horizon dynamic optimization problems that we call multi-action stochastic dynamic programs (DPs). Their distinguishing feature is that the decision in each state is a multi-dimensional vector. These problems can in principle be solved using Bellman's backward recursion. However, complexity of this procedure grows exponentially in the dimension of the decision vectors. This is called the curse of action-space dimensionality. To overcome this computational challenge, we propose an approximation algorithm rooted in the game theoretic paradigm of Sampled Fictitious Play (SFP). SFP solves a sequence of DPs with a one-dimensional action-space, which are exponentially smaller than …
An Active Resource Orchestration Framework For Pan-Scale Sensor-Rich Environments, Youngki Lee, Chulhong Min, Younghyun Ju, Seungwoo Kang, Yunseok Rhee, Junehwa Song
An Active Resource Orchestration Framework For Pan-Scale Sensor-Rich Environments, Youngki Lee, Chulhong Min, Younghyun Ju, Seungwoo Kang, Yunseok Rhee, Junehwa Song
Research Collection School Of Computing and Information Systems
In this paper, we present Orchestrator, an active resource orchestration framework for a PAN-scale sensor-rich mobile computing platform. Incorporating diverse sensing devices connected to a mobile phone, the platform will serve as a common base to accommodate personal context-aware applications. A major challenge for the platform is to simultaneously support concurrent applications requiring continuous and complex context processing, with highly scarce and dynamic resources. To address the challenge, we build Orchestrator, which actively coordinates applications' resource uses over the distributed mobile and sensor devices. As a key approach, it adopts an active resource use orchestration, which prepares multiple alternative plans …
Time-Series Data Mining In Transportation: A Case Study On Singapore Public Train Commuter Travel Patterns, Tin Seong Kam, Roy Ka Wei Lee
Time-Series Data Mining In Transportation: A Case Study On Singapore Public Train Commuter Travel Patterns, Tin Seong Kam, Roy Ka Wei Lee
Research Collection School Of Computing and Information Systems
The adoption of smart cards technologies and automated data collection systems (ADCS) in transportation domain had provided public transport planners opportunities to amass a huge and continuously increasing amount of time-series data about the behaviors and travel patterns of commuters. However the explosive growth of temporal related databases has far outpaced the transport planners’ ability to interpret these data using conventional statistical techniques, creating an urgent need for new techniques to support the analyst in transforming the data into actionable information and knowledge. This research study thus explores and discusses the potential use of time-series data mining, a relatively new …
Online Feature Selection And Its Applications, Jialei Wang, Peilin Zhao, Steven C. H. Hoi, Rong Jin
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 …
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
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 …
Teaching Tip: The Flipped Classroom, Heng Ngee Mok
Teaching Tip: The Flipped Classroom, Heng Ngee Mok
Research Collection School Of Computing and Information Systems
The flipped classroom has been gaining popularity in recent years. In theory, flipping the classroom appears sound: passive learning activities such as unidirectional lectures are pushed to outside class hours in the form of videos, and precious class time is spent on active learning activities. Yet the courses for information systems (IS) undergraduates at the university that the author is teaching at are still conducted in the traditional lecture-in-class, homework-after-class style. In order to increase students’ engagement with the course content and to improve their experience with the course, the author implemented a trial of the flipped classroom model for …
L-Opacity: Linkage-Aware Graph Anonymization, Sadegh Nobari, Panagiotis Karras, Hwee Hwa Pang, Stephane Bressan
L-Opacity: Linkage-Aware Graph Anonymization, Sadegh Nobari, Panagiotis Karras, Hwee Hwa Pang, Stephane Bressan
Research Collection School Of Computing and Information Systems
The wealth of information contained in online social networks has created a demand for the publication of such data as graphs. Yet, publication, even after identities have been removed, poses a privacy threat. Past research has suggested ways to publish graph data in a way that prevents the re-identification of nodes. However, even when identities are effectively hidden, an adversary may still be able to infer linkage between individuals with sufficiently high confidence. In this paper, we focus on the privacy threat arising from such link disclosure. We suggest L-opacity, a sufficiently strong privacy model that aims to control an …
A Comparative Study On The Effectiveness Of Part-Of-Speech Tagging Techniques On Bug Reports, Yuan Tian, David Lo
A Comparative Study On The Effectiveness Of Part-Of-Speech Tagging Techniques On Bug Reports, Yuan Tian, David Lo
Research Collection School Of Computing and Information Systems
Many software artifacts are written in natural language or contain substantial amount of natural language contents. Thus these artifacts could be analyzed using text analysis techniques from the natural language processing (NLP) community, e.g., the part-of-speech (POS) tagging technique that assigns POS tags (e.g., verb, noun, etc.) to words in a sentence. In the literature, several studies have already applied POS tagging technique on software artifacts to recover important words in them, which are then used for automating various tasks, e.g., locating buggy files for a given bug report, etc. There are many POS tagging techniques proposed and they are …
Visual Typo Correction By Collocative Optimization: A Case Study On Merchandize Images, Xiao-Yong Wei, Zhen-Qun Yang, Chong-Wah Ngo, Wei Zhang
Visual Typo Correction By Collocative Optimization: A Case Study On Merchandize Images, Xiao-Yong Wei, Zhen-Qun Yang, Chong-Wah Ngo, Wei Zhang
Research Collection School Of Computing and Information Systems
Near-duplicate retrieval (NDR) in merchandize images is of great importance to a lot of online applications on e-Commerce websites. In those applications where the requirement of response time is critical, however, the conventional techniques developed for a general purpose NDR are limited, because expensive post-processing like spatial verification or hashing is usually employed to compromise the quantization errors among the visual words used for the images. In this paper, we argue that most of the errors are introduced because of the quantization process where the visual words are considered individually, which has ignored the contextual relations among words. We propose …
Sketch: Pen And Touch Recognition [Workshop Summary], Richard C. Davis, Aaron Adler
Sketch: Pen And Touch Recognition [Workshop Summary], Richard C. Davis, Aaron Adler
Research Collection School Of Computing and Information Systems
Sketch recognition has technically been around for 40 years, but it has come and gone several times due to the difficulty of the problem. With the rise of touch and pen enabled phones and tablets, sketch recognition is regaining popularity and public presence, and more people are becoming aware of and interested in this difficult, but valuable, problem. It is important to harness the Sketch Recognition community at this time to encourage the flourishing of this topic.
Democracy Is Good For Ranking: Towards Multi-View Rank Learning And Adaptation In Web Search, Wei Gao, Pei Yang
Democracy Is Good For Ranking: Towards Multi-View Rank Learning And Adaptation In Web Search, Wei Gao, Pei Yang
Research Collection School Of Computing and Information Systems
No abstract provided.
Examining The Growth Of Digital Wireless Phone Technology: A Take-Off Theory Analysis, Angsana A. Techatassanasoontorn, Robert J. Kauffman
Examining The Growth Of Digital Wireless Phone Technology: A Take-Off Theory Analysis, Angsana A. Techatassanasoontorn, Robert J. Kauffman
Research Collection School Of Computing and Information Systems
The early phase of diffusion plays a critical role in determining information technology (IT) success in a market. Takeoff, the transition point from the introduction to the growth phase in the IT life cycle, is viewed as an acid test for whether a technology will succeed. We develop a theory to understand global takeoff for digital wireless phones that can be extended to other technologies with related characteristics. Drawing on technology dominance and product life cycle theories, we build a model that consists of standards, market competition, technology costs, and technology substitution to explain takeoff and subsequent market penetration growth. …
Identity Based Identification From Algebraic Coding Theory, Guomin Yang, Chik How Tan, Yi Mu, Willy Susilo, Duncan S. Wong
Identity Based Identification From Algebraic Coding Theory, Guomin Yang, Chik How Tan, Yi Mu, Willy Susilo, Duncan S. Wong
Research Collection School Of Computing and Information Systems
Cryptographic identification schemes allow a remote user to prove his/her identity to a verifier who holds some public information of the user, such as the user public key or identity. Most of the existing cryptographic identification schemes are based on numbertheoretic hard problems such as Discrete Log and Factorization. This paper focuses on the design and analysis of identity based identification (IBI) schemes based on algebraic coding theory. We first revisit an existing code-based IBI scheme which is derived by combining the Courtois–Finiasz–Sendrier signature scheme and the Stern zero-knowledge identification scheme. Previous results have shown that this IBI scheme is …
Digital Certificate Management: Optimal Pricing And Crl Releasing Strategies, Jie Zhang, Nan Hu, M. K. Raka
Digital Certificate Management: Optimal Pricing And Crl Releasing Strategies, Jie Zhang, Nan Hu, M. K. Raka
Research Collection School Of Computing and Information Systems
The fast growth of e-commerce and online activities places increasing needs for authentication and secure communication to enable information exchange and online transactions. The public key infrastructure (PKI) provides a promising foundation for meeting such demand, in which certificate authorities (CAs) provide digital certificates. In practice, it is critical to understand consumer purchasing and revocation behaviors so that CAs can better manage the digital certificates and its CRL releasing process. To address this problem, we analytically model a CA's pricing and revocation releasing strategies taking into consideration the users' rational decisions. The model provides solutions two main research questions: (1) …
Extended Comprehensive Study Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Ferdian Thung, Aditya Budi
Extended Comprehensive Study Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Ferdian Thung, Aditya Budi
Research Collection School Of Computing and Information Systems
Spectrum-based fault localization is a promising approach to automatically locate root causes of failures quickly. Two well-known spectrum-based fault localization techniques, Tarantula and Ochiai, measure how likely a program element is a root cause of failures based on profiles of correct and failed program executions. These techniques are conceptually similar to association measures that have been proposed in statistics, data mining, and have been utilized to quantify the relationship strength between two variables of interest (e.g., the use of a medicine and the cure rate of a disease). In this paper, we view fault localization as a measurement of the …
Key-Aggregate Cryptosystem For Scalable Data Sharing In Cloud Storage, Cheng-Kang Chu, Sherman S. M. Chow, Wen-Guey Tzeng, Jiangying Zhou, Robert H. Deng
Key-Aggregate Cryptosystem For Scalable Data Sharing In Cloud Storage, Cheng-Kang Chu, Sherman S. M. Chow, Wen-Guey Tzeng, Jiangying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
Data sharing is an important functionality in cloud storage. In this article, we show how to securely, efficiently, and flexibly share data with others in cloud storage. We describe new public-key cryptosystems which produce constant-size ciphertexts such that efficient delegation of decryption rights for any set of ciphertexts are possible. The novelty is that one can aggregate any set of secret keys and make them as compact as a single key, but encompassing the power of all the keys being aggregated. In other words, the secret key holder can release a constant-size aggregate key for flexible choices of ciphertext set …
Representative Discovery Of Structure Cues For Weakly-Supervised Image Segmentation, Luming Zhang, Yue Gao, Yingjie Xia, Ke Lu, Jialie Shen, Rongrong Ji
Representative Discovery Of Structure Cues For Weakly-Supervised Image Segmentation, Luming Zhang, Yue Gao, Yingjie Xia, Ke Lu, Jialie Shen, Rongrong Ji
Research Collection School Of Computing and Information Systems
Weakly-supervised image segmentation is a challenging problem with multidisciplinary applications in multimedia content analysis and beyond. It aims to segment an image by leveraging its imagelevel semantics (i.e., tags). This paper presents a weakly-supervised image segmentation algorithm that learns the distribution of spatially structural superpixel sets from image-level labels. More specifically, we first extract graphlets from a given image, which are small-sized graphs consisting of superpixels and encapsulating their spatial structure. Then, an ecient manifold embedding algorithm is proposed to transfer labels from training images into graphlets. It is further observed that there are numerous redundant graphlets that are not …
Ropecker: A Generic And Practical Approach For Defending Against Rop Attack, Yueqiang Cheng, Zongwei Zhou, Yu Miao, Xuhua Ding, Robert H. Deng
Ropecker: A Generic And Practical Approach For Defending Against Rop Attack, Yueqiang Cheng, Zongwei Zhou, Yu Miao, Xuhua Ding, Robert H. Deng
Research Collection School Of Computing and Information Systems
Return-Oriented Programming (ROP) is a sophisticated exploitation technique that is able to drive target applications to perform arbitrary unintended operations by constructing a gadget chain reusing existing small code sequences (gadgets). Existing defense mechanisms either only handle specific types of gadgets, require access to source code and/or a customized compiler, break the integrity of application binary, or suffer from high performance overhead. In this paper, we present a novel system, ROPecker, to efficiently and effectively defend against ROP attacks without relying on any other side information (e.g., source code and compiler support) or binary rewriting. ROPecker detects an ROP attack …
Predicting Response In Mobile Advertising With Hierarchical Importance-Aware Factorization Machine, Richard Jayadi Oentaryo, Ee Peng Lim, Jia Wei Low, David Lo, Michael Finegold
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 …
An Empirical Study Of Bug Report Field Reassignment, Xin Xia, David Lo, Ming Wen, Shihab Emad, Bo Zhou
An Empirical Study Of Bug Report Field Reassignment, Xin Xia, David Lo, Ming Wen, Shihab Emad, Bo Zhou
Research Collection School Of Computing and Information Systems
A bug report contains many fields, such as product, component, severity, priority, fixer, operating system (OS), platform, etc., which provide important information for the bug triaging and fixing process. It is important to make sure that bug information is correct since previous studies showed that the wrong assignment of bug report fields could increase the bug fixing time, and even delay the delivery of the software. In this paper, we perform an empirical study on bug report field reassignments in open-source software projects. To better understand why bug report fields are reassigned, we manually collect 99 recent bug reports that …
Towards More Accurate Multi-Label Software Behavior Learning, Xin Xia, Feng Yang, David Lo, Zhenyu Chen, Xinyu Wang
Towards More Accurate Multi-Label Software Behavior Learning, Xin Xia, Feng Yang, David Lo, Zhenyu Chen, Xinyu Wang
Research Collection School Of Computing and Information Systems
In a modern software system, when a program fails, a crash report which contains an execution trace would be sent to the software vendor for diagnosis. A crash report which corresponds to a failure could be caused by multiple types of faults simultaneously. Many large companies such as Baidu organize a team to analyze these failures, and classify them into multiple labels (i.e., multiple types of faults). However, it would be time-consuming and difficult for developers to manually analyze these failures and come out with appropriate fault labels. In this paper, we automatically classify a failure into multiple types of …
Automated Construction Of A Software-Specific Word Similarity Database, Yuan Tian, David Lo, Julia Lawall
Automated Construction Of A Software-Specific Word Similarity Database, Yuan Tian, David Lo, Julia Lawall
Research Collection School Of Computing and Information Systems
Many automated software engineering approaches, including code search, bug report categorization, and duplicate bug report detection, measure similarities between two documents by analyzing natural language contents. Often different words are used to express the same meaning and thus measuring similarities using exact matching of words is insufficient. To solve this problem, past studies have shown the need to measure the similarities between pairs of words. To meet this need, the natural language processing community has built WordNet which is a manually constructed lexical database that records semantic relations among words and can be used to measure how similar two words …
Livelabs: Building An In-Situ Real-Time Mobile Experimentation Testbed, Rajesh Krishna Balan, Archan Misra, Youngki Lee
Livelabs: Building An In-Situ Real-Time Mobile Experimentation Testbed, Rajesh Krishna Balan, Archan Misra, Youngki Lee
Research Collection School Of Computing and Information Systems
We present LiveLabs, a mobile experimentation testbed that is currently deployed across our university campus with further deployments at a large shopping mall, a commercial airport, and a resort island soon to follow. The key goal of LiveLabs is to allow in-situ real-time experimentation of mobile applications and services that require context-specific triggers with real participants on their actual smart phones. We describe how LiveLabs works, and then explain the novel R&D required to realise it. We end with a descriptionof the current LiveLabs status (> 700 active participants to date) as well as present some key lessons learned.
Barometric Phone Sensors: More Hype Than Hope!, Kartik Muralidharan, Azeem Javed Khan, Archan Misra, Rajesh Krishna Balan, Sharad Agarwal
Barometric Phone Sensors: More Hype Than Hope!, Kartik Muralidharan, Azeem Javed Khan, Archan Misra, Rajesh Krishna Balan, Sharad Agarwal
Research Collection School Of Computing and Information Systems
The inclusion of the barometer sensor in smartphones signaled an opportunity for aiding indoor localization efforts. In this paper, we therefore investigate a possible use of the barometer sensor for detecting vertically oriented activities. We start by showing the accuracies of various commodity measurement devices and the challenges they bring forth. We then show how to use the barometer values to build a predictor that can detect floor changes and the mode (elevator, escalator, or stairs) used to change floors with nearly 100% accuracy. We validate these properties with data collected using 3 different measurement devices from 7 different buildings. …
Sinabro: Opportunistic And Unobtrusive Mobile Ecg Monitoring System, Seungwoo Kang, Sungjun Kwon, Sangwon Seo, Chungkuk Yoo, Kwangsuk Park, Junehwa Song, Youngki Lee
Sinabro: Opportunistic And Unobtrusive Mobile Ecg Monitoring System, Seungwoo Kang, Sungjun Kwon, Sangwon Seo, Chungkuk Yoo, Kwangsuk Park, Junehwa Song, Youngki Lee
Research Collection School Of Computing and Information Systems
In this paper, we propose Sinabro, an opportunistic and unobtrusive mobile electrocardiogram (ECG) monitoring system that monitors the user’s ECG opportunistically during daily smartphone use. Daily ECG monitoring will open up an unprecedented opportunity for pervasive healthcare applications. It will enable the daily detection and prevention of heart problems and also allow inferences about stress, emotion, and even sleep quality. Despite its huge potential, daily ECG monitoring still has not become reality due to its obtrusiveness. In this paper, we first study the potential opportunity to capture ECGs from daily use of smartphones, without requiring the user’s explicit attention. Based …
Building Thinc: User Incentivization And Meeting Rescheduling For Energy Savings, Jun Young Kwak, Debarun Kar, William Haskell, Pradeep Reddy Varakantham, Milind Tambe
Building Thinc: User Incentivization And Meeting Rescheduling For Energy Savings, Jun Young Kwak, Debarun Kar, William Haskell, Pradeep Reddy Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
This paper presents THINC, an agent developed for saving energy in real-world commercial buildings. While previous work has presented techniques for computing energy-efficient schedules, it fails to address two issues, centered on human users, that are essential in real-world agent deployments: (i) incentivizing users for their energy saving activities and (ii) interacting with users to reschedule key “energy-consuming” meetings in a timely fashion, while handling the uncertainty in such interactions. THINC addresses these shortcomings by providing four new major contributions. First, THINC computes fair division of credits from energy savings. For this fair division, THINC provides novel algorithmic advances for …
Libol: A Library For Online Learning Algorithms, Steven C. H. Hoi, Jialei Wang, Peilin Zhao
Libol: A Library For Online Learning Algorithms, Steven C. H. Hoi, Jialei Wang, Peilin Zhao
Research Collection School Of Computing and Information Systems
LIBOL is an open-source library for large-scale online learning, which consists of a large family of efficient and scalable state-of-the-art online learning algorithms for large- scale online classification tasks. We have offered easy-to-use command-line tools and examples for users and developers, and also have made comprehensive documents available for both beginners and advanced users. LIBOL is not only a machine learning toolbox, but also a comprehensive experimental platform for conducting online learning research.
Integrating Water Exclusion Theory Into Β Contacts To Predict Binding Free Energy Changes And Binding Hot Spots, Qian Liu, Steven C. H. Hoi, Chee Keong Kwoh, Limsoon Wong, Jinyan Li
Integrating Water Exclusion Theory Into Β Contacts To Predict Binding Free Energy Changes And Binding Hot Spots, Qian Liu, Steven C. H. Hoi, Chee Keong Kwoh, Limsoon Wong, Jinyan Li
Research Collection School Of Computing and Information Systems
Binding free energy and binding hot spots at protein-protein interfaces are two important research areas for understanding protein interactions. Computational methods have been developed previously for accurate prediction of binding free energy change upon mutation for interfacial residues. However, a large number of interrupted and unimportant atomic contacts are used in the training phase which caused accuracy loss. Results: This work proposes a new method, β ACV ASA , to predict the change of binding free energy after alanine mutations. β ACV ASA integrates accessible surface area (ASA) and our newly defined β contacts together into an atomic contact vector …