Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Social and Behavioral Sciences (1505)
- Communication (945)
- Business (886)
- OS and Networks (858)
- Numerical Analysis and Scientific Computing (808)
-
- Life Sciences (727)
- Communication Technology and New Media (691)
- Bioinformatics (656)
- Science and Technology Studies (650)
- Artificial Intelligence and Robotics (629)
- Engineering (547)
- Software Engineering (524)
- Graphics and Human Computer Interfaces (473)
- Information Security (395)
- Theory and Algorithms (355)
- Computer Engineering (344)
- Management Information Systems (294)
- Medicine and Health Sciences (261)
- Social Media (220)
- Education (217)
- Other Computer Sciences (215)
- Data Science (212)
- Systems Architecture (187)
- Library and Information Science (181)
- Programming Languages and Compilers (172)
- Public Affairs, Public Policy and Public Administration (167)
- Business Administration, Management, and Operations (164)
- Institution
-
- Singapore Management University (3560)
- Wright State University (631)
- Walden University (447)
- New Jersey Institute of Technology (143)
- University of Malaya (131)
-
- University of Nebraska at Omaha (119)
- Old Dominion University (108)
- California State University, San Bernardino (100)
- San Jose State University (89)
- University of Dayton (82)
- City University of New York (CUNY) (70)
- University of Dar es Salaam (63)
- Air Force Institute of Technology (61)
- University of Nebraska - Lincoln (60)
- University of South Florida (56)
- Kennesaw State University (54)
- Nova Southeastern University (52)
- Technological University Dublin (51)
- University of Arkansas, Fayetteville (46)
- Dakota State University (43)
- Claremont Colleges (42)
- California Polytechnic State University, San Luis Obispo (41)
- Institute of Business Administration (38)
- Western Kentucky University (36)
- Purdue University (35)
- Ateneo de Manila University (34)
- Governors State University (34)
- Portland State University (34)
- University of Arkansas Little Rock (33)
- University of Nevada, Las Vegas (32)
- Keyword
-
- Machine learning (122)
- Information technology (91)
- Data mining (90)
- Social media (83)
- Machine Learning (64)
-
- Cybersecurity (63)
- Deep learning (60)
- Twitter (60)
- Artificial intelligence (58)
- Semantic Web (53)
- Online learning (51)
- Databases (46)
- Cloud computing (45)
- Information Technology (45)
- Information retrieval (45)
- Classification (43)
- Database (42)
- Blockchain (41)
- Natural language processing (41)
- Ontology (41)
- Big data (40)
- Security (39)
- Technology (39)
- Computer science (38)
- Privacy (38)
- Algorithms (37)
- Clustering (37)
- Deep Learning (37)
- Information systems (37)
- Management (37)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (3441)
- Kno.e.sis Publications (540)
- Walden Dissertations and Doctoral Studies (447)
- Theses and Dissertations (129)
- Student Works (2000-2009) (120)
-
- Dissertations (113)
- Computer Science Faculty Publications (95)
- Computer Science and Engineering Faculty Publications (91)
- Theses Digitization Project (86)
- Master's Projects (68)
- Information Systems and Quantitative Analysis Faculty Proceedings & Presentations (64)
- Tanzania Journal of Engineering and Technology (TJET) (60)
- Dissertations and Theses Collection (Open Access) (58)
- USF Tampa Graduate Theses and Dissertations (51)
- Theses (48)
- CCAC Theses and Dissertations (43)
- Information Systems and Quantitative Analysis Faculty Publications (41)
- CGU Faculty Publications and Research (37)
- International Conference on Information and Communication Technologies (36)
- Open Educational Resources (35)
- Graduate Theses and Dissertations (34)
- Department of Information Systems & Computer Science Faculty Publications (33)
- All Capstone Projects (32)
- Masters Theses & Doctoral Dissertations (32)
- Conference papers (28)
- All Maxine Goodman Levin School of Urban Affairs Publications (27)
- UBT International Conference (23)
- Electronic Theses and Dissertations (22)
- Faculty Articles (22)
- Master's Theses (22)
- Publication Type
- File Type
Articles 2071 - 2100 of 7256
Full-Text Articles in Databases and Information Systems
Bootstrapping Web Archive Collections From Micro-Collections In Social Media, Alexander C. Nwala
Bootstrapping Web Archive Collections From Micro-Collections In Social Media, Alexander C. Nwala
Computer Science Theses & Dissertations
In a Web plagued by disappearing resources, Web archive collections provide a valuable means of preserving Web resources important to the study of past events. These archived collections start with seed URIs (Uniform Resource Identifiers) hand-selected by curators. Curators produce high quality seeds by removing non-relevant URIs and adding URIs from credible and authoritative sources, but this ability comes at a cost: it is time consuming to collect these seeds. The result of this is a shortage of curators, a lack of Web archive collections for various important news events, and a need for an automatic system for generating seeds. …
Meta-Learning On Heterogeneous Information Networks For Cold-Start Recommendation, Yuanfu Lu, Yuan Fang, Chuan Shi
Meta-Learning On Heterogeneous Information Networks For Cold-Start Recommendation, Yuanfu Lu, Yuan Fang, Chuan Shi
Research Collection School Of Computing and Information Systems
Cold-start recommendation has been a challenging problem due to sparse user-item interactions for new users or items. Existing efforts have alleviated the cold-start issue to some extent, most of which approach the problem at the data level. Earlier methods often incorporate auxiliary data as user or item features, while more recent methods leverage heterogeneous information networks (HIN) to capture richer semantics via higher-order graph structures. On the other hand, recent meta-learning paradigm sheds light on addressing cold-start recommendation at the model level, given its ability to rapidly adapt to new tasks with scarce labeled data, or in the context of …
A Systematic Density-Based Clustering Method Using Anchor Points, Yizhang Wang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou
A Systematic Density-Based Clustering Method Using Anchor Points, Yizhang Wang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou
Research Collection School Of Computing and Information Systems
Clustering is an important unsupervised learning method in machine learning and data mining. Many existing clustering methods may still face the challenge in self-identifying clusters with varying shapes, sizes and densities. To devise a more generic clustering method that considers all the aforementioned properties of the natural clusters, we propose a novel clustering algorithm named Anchor Points based Clustering (APC). The anchor points in APC are characterized by having a relatively large distance from data points with higher densities. We take anchor points as centers to obtain intermediate clusters, which can divide the whole dataset more appropriately so as to …
Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi
Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Sequential user behavior modeling plays a crucial role in online user-oriented services, such as product purchasing, news feed consumption, and online advertising. The performance of sequential modeling heavily depends on the scale and quality of historical behaviors. However, the number of user behaviors inherently follows a long-tailed distribution, which has been seldom explored. In this work, we argue that focusing on tail users could bring more benefits and address the long tails issue by learning transferrable parameters from both optimization and feature perspectives. Specifically, we propose a gradient alignment optimizer and adopt an adversarial training scheme to facilitate knowledge transfer …
An Attention-Based Rumor Detection Model With Tree-Structured Recursive Neural Networks, Jing Ma, Wei Gao, Shafiq Joty, Kam-Fai Wong
An Attention-Based Rumor Detection Model With Tree-Structured Recursive Neural Networks, Jing Ma, Wei Gao, Shafiq Joty, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Rumor spread in social media severely jeopardizes the credibility of online content. Thus, automatic debunking of rumors is of great importance to keep social media a healthy environment. While facing a dubious claim, people often dispute its truthfulness sporadically in their posts containing various cues, which can form useful evidence with long-distance dependencies. In this work, we propose to learn discriminative features from microblog posts by following their non-sequential propagation structure and generate more powerful representations for identifying rumors. For modeling non-sequential structure, we first represent the diffusion of microblog posts with propagation trees, which provide valuable clues on how …
Accelerating Exact Constrained Shortest Paths On Gpus, Shengliang Lu, Bingsheng He, Yuchen Li, Hao Fu
Accelerating Exact Constrained Shortest Paths On Gpus, Shengliang Lu, Bingsheng He, Yuchen Li, Hao Fu
Research Collection School Of Computing and Information Systems
The recently emerging applications such as software-defined networks and autonomous vehicles require efficient and exact solutions for constrained shortest paths (CSP), which finds the shortest path in a graph while satisfying some user-defined constraints. Compared with the common shortest path problems without constraints, CSP queries have a significantly larger number of subproblems. The most widely used labeling algorithm becomes prohibitively slow and impractical. Other existing approaches tend to find approximate solutions and build costly indices on graphs for fast query processing, which are not suitable for emerging applications with the requirement of exact solutions. A natural question is whether and …
An Ensemble Of Epoch-Wise Empirical Bayes For Few-Shot Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun
An Ensemble Of Epoch-Wise Empirical Bayes For Few-Shot Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun
Research Collection School Of Computing and Information Systems
Few-shot learning aims to train efficient predictive models with a few examples. The lack of training data leads to poor models that perform high-variance or low-confidence predictions. In this paper, we propose to meta-learn the ensemble of epoch-wise empirical Bayes models (E3BM) to achieve robust predictions. “Epoch-wise'' means that each training epoch has a Bayes model whose parameters are specifically learned and deployed. ”Empirical'' means that the hyperparameters, e.g., used for learning and ensembling the epoch-wise models, are generated by hyperprior learners conditional on task-specific data. We introduce four kinds of hyperprior learners by considering inductive vs. transductive, and epoch-dependent …
Interface Design Of Web-Based Educational Platforms For Young Students, Lurong He, Fiona Fui-Hoon Nah
Interface Design Of Web-Based Educational Platforms For Young Students, Lurong He, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
With the outbreak of the Covid-19 pandemic, almost all the school programs in the United States are closed. Most educational programs have moved online. Both teachers and students are facing challenges adapting to this new teaching and learning mode. This paper will focus on the interface design of webbased educational platforms for students and teachers from elementary and middle schools. The age of students from elementary and middle schools typically ranges from 5 to 13 years old. Their computer literacy level is still preliminary. So traditional online teaching platforms may not be appropriate for them. The design of learning systems …
A Generalised Bound For The Wiener Attack On Rsa, Willy Susilo, Joseph Tonien, Guomin Yang
A Generalised Bound For The Wiener Attack On Rsa, Willy Susilo, Joseph Tonien, Guomin Yang
Research Collection School Of Computing and Information Systems
Since Wiener pointed out that the RSA can be broken if the private exponent d is relatively small compared to the modulus N, it has been a general belief that the Wiener attack works for d
Love A Restaurant? Swipe Right On Foodrecce, Hady W. Lauw, Smu Office Of Research
Love A Restaurant? Swipe Right On Foodrecce, Hady W. Lauw, Smu Office Of Research
Research@SMU Infographics
A bunch of your friends wants to meet for dinner, but nobody can agree on where and what to eat? FoodRecce can help! FoodRecce is an app, developed under the Preferred.AI initiative, that provides recommendations on restaurants based on users' locations and past preferences.
Specialization: Do Your Job Well Helping Students Who Are Considering A Career In Programming Know How To Invest Their Time., Scott Pulley
Specialization: Do Your Job Well Helping Students Who Are Considering A Career In Programming Know How To Invest Their Time., Scott Pulley
Marriott Student Review
The article examines the effects of specialization on the hiring process for undergraduates studying programming whether in information systems or computer science.
Novel Technique To Analyze The Effects Of Cognitive And Non-Cognitive Predictors On Students Course Withdrawal In College, Mohammed Ali
Novel Technique To Analyze The Effects Of Cognitive And Non-Cognitive Predictors On Students Course Withdrawal In College, Mohammed Ali
Technology Faculty Publications and Presentations
A novel technique was applied to a college student database to identify the cognitive and non-cognitive factors that predict college students’ course withdrawal behaviors. Predictors such as high school grade point average (HSGPA), standardized test scores (ACT–American College Test or SAT-Scholastic Aptitude Test), number of credit hours enrolled, and age were analyzed in this study. Data mining software algorithms were used to study information about undergraduate students at a west-south-central state university in the United States. The study results revealed that two factors, number of enrolled credit hours, and a student’s age have the most effect on collegiate course withdrawal …
Lulling Waters: A Poetry Reading For Real-Time Music Generation Through Emotion Mapping, Ashley Muniz, Toshihisa Tsuruoka
Lulling Waters: A Poetry Reading For Real-Time Music Generation Through Emotion Mapping, Ashley Muniz, Toshihisa Tsuruoka
Electronic Literature Organization Conference 2020
Through a poetic narrative, “Lulling Waters” tells the story of a whale overcoming the loss of his mother, who passed away from ingesting plastic, as he attempts to escape from the polluted oceanic world. The live performance of this poem utilizes a software system called Soundwriter, which was developed with the goal of enriching the oral storytelling experience through music. This video demonstrates how Soundwriter’s real-time hybrid system was able to analyze “Lulling Waters” through its lexical and auditory features. Emotionally salient words were given ratings based on arousal, valence, and dominance while the emotionally charged prosodic features of the …
Patterns Of Population Displacement During Mega-Fires In California Detected Using Facebook Disaster Maps, Shenyue Jia, Seung Hee Kim, Son V. Nghiem, Paul Doherty, Menas Kafatos
Patterns Of Population Displacement During Mega-Fires In California Detected Using Facebook Disaster Maps, Shenyue Jia, Seung Hee Kim, Son V. Nghiem, Paul Doherty, Menas Kafatos
Mathematics, Physics, and Computer Science Faculty Articles and Research
The Facebook Disaster Maps (FBDM) work presented here is the first time this platform has been used to provide analysis-ready population change products derived from crowdsourced data targeting disaster relief practices. We evaluate the representativeness of FBDM data using the Mann-Kendall test and emerging hot and cold spots in an anomaly analysis to reveal the trend, magnitude, and agglommeration of population displacement during the Mendocino Complex and Woolsey fires in California, USA. Our results show that the distribution of FBDM pre-crisis users fits well with the total population from different sources. Due to usage habits, the elder population is underrepresented …
Deep Learning For Real-World Object Detection, Xiongwei Wu
Deep Learning For Real-World Object Detection, Xiongwei Wu
Dissertations and Theses Collection (Open Access)
Despite achieving significant progresses, most existing detectors are designed to detect objects in academic contexts but consider little in real-world scenarios. In real-world applications, the scale variance of objects can be significantly higher than objects in academic contexts; In addition, existing methods are designed for achieving localization with relatively low precision, however more precise localization is demanded in real-world scenarios; Existing methods are optimized with huge amount of annotated data, but in certain real-world scenarios, only a few samples are available. In this dissertation, we aim to explore novel techniques to address these research challenges to make object detection algorithms …
Tree-Augmented Cross-Modal Encoding For Complex-Query Video Retrieval, Xun Yang, Jianfeng Dong, Yixin Cao, Xun Wang, Meng Wang, Tat-Seng Chua
Tree-Augmented Cross-Modal Encoding For Complex-Query Video Retrieval, Xun Yang, Jianfeng Dong, Yixin Cao, Xun Wang, Meng Wang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
The rapid growth of user-generated videos on the Internet has intensified the need for text-based video retrieval systems. Traditional methods mainly favor the concept-based paradigm on retrieval with simple queries, which are usually ineffective for complex queries that carry far more complex semantics. Recently, embedding-based paradigm has emerged as a popular approach. It aims to map the queries and videos into a shared embedding space where semantically-similar texts and videos are much closer to each other. Despite its simplicity, it forgoes the exploitation of the syntactic structure of text queries, making it suboptimal to model the complex queries. To facilitate …
Improving Event Detection Via Open-Domain Event Trigger Knowledge, Meihan Tong, Bin Xu, Shuai Wang, Yixin Cao, Lei Hou, Juanzi Li, Jun Xie
Improving Event Detection Via Open-Domain Event Trigger Knowledge, Meihan Tong, Bin Xu, Shuai Wang, Yixin Cao, Lei Hou, Juanzi Li, Jun Xie
Research Collection School Of Computing and Information Systems
Event Detection (ED) is a fundamental task in automatically structuring texts. Due to the small scale of training data, previous methods perform poorly on unseen/sparsely labeled trigger words and are prone to overfitting densely labeled trigger words. To address the issue, we propose a novel Enrichment Knowledge Distillation (EKD) model to leverage external open-domain trigger knowledge to reduce the in-built biases to frequent trigger words in annotations. Experiments on benchmark ACE2005 show that our model outperforms nine strong baselines, is especially effective for unseen/sparsely labeled trigger words. The source code is released on https://github.com/shuaiwa16/ekd.git.
A Review On Eye-Tracking Metrics For Sleepiness, Debasis Roy, Fiona Fui-Hoon Nah
A Review On Eye-Tracking Metrics For Sleepiness, Debasis Roy, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Sleepiness that can arise from sleep deprivation can increase human errors in task performance and create workplace hazards and accidents. Hence, it is critical to detect sleepiness to minimize hazards and human errors. This paper provides a review of the literature on eye tracking metrics that can be used to detect sleepiness. These metrics include blink duration, blink frequency, saccade latency, saccade peak velocity, saccade accuracy, smooth pursuit velocity gain, fixation rate, pupil size, and latency to pupil constriction.
Expertise Style Transfer: A New Task Towards Better Communication Between Experts And Laymen, Yixin Cao, Ruihao Shui, Liangming Pan, Min-Yen Kan, Zhiyuan Lu, Tat-Seng Chua
Expertise Style Transfer: A New Task Towards Better Communication Between Experts And Laymen, Yixin Cao, Ruihao Shui, Liangming Pan, Min-Yen Kan, Zhiyuan Lu, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
The curse of knowledge can impede communication between experts and laymen. We propose a new task of expertise style transfer and contribute a manually annotated dataset with the goal of alleviating such cognitive biases. Solving this task not only simplifies the professional language, but also improves the accuracy and expertise level of laymen descriptions using simple words. This is a challenging task, unaddressed in previous work, as it requires the models to have expert intelligence in order to modify text with a deep understanding of domain knowledge and structures. We establish the benchmark performance of five state-of-the-art models for style …
Covid-19 Calls For Remote Reskilling And Retraining, C. Zou, W. Zhao, Keng Siau
Covid-19 Calls For Remote Reskilling And Retraining, C. Zou, W. Zhao, Keng Siau
Research Collection School Of Computing and Information Systems
Cui Zou, Wangchuchu Zhao, and Keng Siau respond directly to COVID-19 by framing the skills and training necessary to survive crises. The authors focus on the importance of helping organizations prepare beyond the current pandemic by teaching everyone how to use the technology tools -- and exploit the processes -- around remote working.
Interactive Entity Linking Using Entity-Word Representations, Pei Chi Lo, Ee-Peng Lim
Interactive Entity Linking Using Entity-Word Representations, Pei Chi Lo, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
To leverage on entity and word semantics in entity linking, embedding models have been developed to represent entities, words and their context such that candidate entities for each mention can be determined and ranked accurately using their embeddings. To leverage on entity and word semantics in entity linking, embedding models have been developed to represent entities, words and their context such that candidate entities for each mention can be determined and ranked accurately using their embeddings. In this paper, we leverage on human intelligence for embedding-based interactive entity linking. We adopt an active learning approach to select mentions for human …
Graph-To-Tree Learning For Solving Math Word Problems, Jipeng Zhang, Lei Wang, Roy Ka-Wei Lee, Yi Bin, Yan Wang, Jie Shao, Ee-Peng Lim
Graph-To-Tree Learning For Solving Math Word Problems, Jipeng Zhang, Lei Wang, Roy Ka-Wei Lee, Yi Bin, Yan Wang, Jie Shao, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
While the recent tree-based neural models have demonstrated promising results in generating solution expression for the math word problem (MWP), most of these models do not capture the relationships and order information among the quantities well. This results in poor quantity representations and incorrect solution expressions. In this paper, we propose Graph2Tree, a novel deep learning architecture that combines the merits of the graph-based encoder and tree-based decoder to generate better solution expressions. Included in our Graph2Tree framework are two graphs, namely the Quantity Cell Graph and Quantity Comparison Graph, which are designed to address limitations of existing methods by …
Trajectory Similarity Learning With Auxiliary Supervision And Optimal Matching, Hanyuan Zhang, Xingyu Zhang, Qize Jiang, Baihua Zheng, Zhenbang Sun, Weiwei Sun, Changhu Wang
Trajectory Similarity Learning With Auxiliary Supervision And Optimal Matching, Hanyuan Zhang, Xingyu Zhang, Qize Jiang, Baihua Zheng, Zhenbang Sun, Weiwei Sun, Changhu Wang
Research Collection School Of Computing and Information Systems
Trajectory similarity computation is a core problem in the field of trajectory data queries. However, the high time complexity of calculating the trajectory similarity has always been a bottleneck in real-world applications. Learning-based methods can map trajectories into a uniform embedding space to calculate the similarity of two trajectories with embeddings in constant time. In this paper, we propose a novel trajectory representation learning framework Traj2SimVec that performs scalable and robust trajectory similarity computation. We use a simple and fast trajectory simplification and indexing approach to obtain triplet training samples efficiently. We make the framework more robust via taking full …
Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church
Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church
Research Collection School Of Computing and Information Systems
Spatial optimization represents a set of powerful spatial analysis techniques that can be used to identify optimal solution(s) and even generate a large number of competitive alternatives. The formulation of such problems involves maximizing or minimizing one or more objectives while satisfying a number of constraints. Solution techniques range from exact models solved with such approaches as linear programming and integer programming, or heuristic algorithms, i.e. Tabu Search, Simulated Annealing, and Genetic Algorithms. Spatial optimization techniques have been utilized in numerous planning applications, such as location-allocation modeling/site selection, land use planning, school districting, regionalization, routing, and urban design. These methods …
Keen2act: Activity Recommendation In Online Social Collaborative Platforms, Roy Ka-Wei Lee, Thong Hoang, Richard J. Oentaryo, David Lo
Keen2act: Activity Recommendation In Online Social Collaborative Platforms, Roy Ka-Wei Lee, Thong Hoang, Richard J. Oentaryo, David Lo
Research Collection School Of Computing and Information Systems
Social collaborative platforms such as GitHub and Stack Overflow have been increasingly used to improve work productivity via collaborative efforts. To improve user experiences in these platforms, it is desirable to have a recommender system that can suggest not only items (e.g., a GitHub repository) to a user, but also activities to be performed on the suggested items (e.g., forking a repository). To this end, we propose a new approach dubbed Keen2Act, which decomposes the recommendation problem into two stages: the Keen and Act steps. The Keen step identifies, for a given user, a (sub)set of items in which he/she …
Geoprune: Efficiently Matching Trips In Ride-Sharing Through Geometric Properties, Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic
Geoprune: Efficiently Matching Trips In Ride-Sharing Through Geometric Properties, Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic
Research Collection School Of Computing and Information Systems
On-demand ride-sharing is rapidly growing. Matching trip requests to vehicles efficiently is critical for the service quality of ride-sharing. To match trip requests with vehicles, a prune-And-select scheme is commonly used. The pruning stage identifies feasible vehicles that can satisfy the trip constraints (e.g., trip time). The selection stage selects the optimal one(s) from the feasible vehicles. The pruning stage is crucial to lowering the complexity of the selection stage and to achieve efficient matching. We propose an effective and efficient pruning algorithm called GeoPrune. GeoPrune represents the time constraints of trip requests using circles and ellipses, which can be …
Acceleration For Compressed Gradient Descent In Distributed And Federated Optimization, Zhize Li, Dmitry Kovalev, Xun Qian, Peter Richtarik
Acceleration For Compressed Gradient Descent In Distributed And Federated Optimization, Zhize Li, Dmitry Kovalev, Xun Qian, Peter Richtarik
Research Collection School Of Computing and Information Systems
Due to the high communication cost in distributed and federated learning problems, methods relying on compression of communicated messages are becoming increasingly popular. While in other contexts the best performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of iterations, there are no methods which combine the benefits of both gradient compression and acceleration. In this paper, we remedy this situation and propose the first accelerated compressed gradient descent (ACGD) methods. In the single machine regime, we prove that ACGD enjoys the rate $O\Big((1+\omega)\sqrt{\frac{L}{\mu}}\log \frac{1}{\epsilon}\Big)$ for $\mu$-strongly convex problems and $O\Big((1+\omega)\sqrt{\frac{L}{\epsilon}}\Big)$ for convex problems, respectively, …
Recent Advances In Deep Learning For Object Detection, Xiongwei Wu, Doyen Sahoo, Steven C. H. Hoi
Recent Advances In Deep Learning For Object Detection, Xiongwei Wu, Doyen Sahoo, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Object detection is a fundamental visual recognition problem in computer vision and has been widely studied in the past decades. Visual object detection aims to find objects of certain target classes with precise localization in a given image and assign each object instance a corresponding class label. Due to the tremendous successes of deep learning based image classification, object detection techniques using deep learning have been actively studied in recent years. In this paper, we give a comprehensive survey of recent advances in visual object detection with deep learning. By reviewing a large body of recent related work in literature, …
Probabilistic Value Selection For Space Efficient Model, Gunarto Sindoro Njoo, Baihua Zheng, Kuo-Wei Hsu, Wen-Chih Peng
Probabilistic Value Selection For Space Efficient Model, Gunarto Sindoro Njoo, Baihua Zheng, Kuo-Wei Hsu, Wen-Chih Peng
Research Collection School Of Computing and Information Systems
An alternative to current mainstream preprocessing methods is proposed: Value Selection (VS). Unlike the existing methods such as feature selection that removes features and instance selection that eliminates instances, value selection eliminates the values (with respect to each feature) in the dataset with two purposes: reducing the model size and preserving its accuracy. Two probabilistic methods based on information theory's metric are proposed: PVS and P + VS. Extensive experiments on the benchmark datasets with various sizes are elaborated. Those results are compared with the existing preprocessing methods such as feature selection, feature transformation, and instance selection methods. Experiment results …
Next-Term Grade Prediction: A Machine Learning Approach, Audrey Tedja Widjaja, Lei Wang, Nghia Truong Trong, Aldy Gunawan, Ee-Peng Lim
Next-Term Grade Prediction: A Machine Learning Approach, Audrey Tedja Widjaja, Lei Wang, Nghia Truong Trong, Aldy Gunawan, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
As students progress in their university programs, they have to face many course choices. It is important for them to receive guidance based on not only their interest, but also the "predicted" course performance so as to improve learning experience and optimise academic performance. In this paper, we propose the next-term grade prediction task as a useful course selection guidance. We propose a machine learning framework to predict course grades in a specific program term using the historical student-course data. In this framework, we develop the prediction model using Factorization Machine (FM) and Long Short Term Memory combined with FM …