Databases and Information Systems Commons^™

Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)

Library Philosophy and Practice (e-journal)

Abstract

Purpose: The purpose of this research paper is to explore ChatGPT’s potential as an innovative designer tool for the future development of artificial intelligence. Specifically, this conceptual investigation aims to analyze ChatGPT’s capabilities as a tool for designing and developing near about human intelligent systems for futuristic used and developed in the field of Artificial Intelligence (AI). Also with the helps of this paper, researchers are analyzed the strengths and weaknesses of ChatGPT as a tool, and identify possible areas for improvement in its development and implementation. This investigation focused on the various features and functions of ChatGPT that …

A Study Of The Impact Of Data Intelligence On Software Delivery Performance, Yongdong Dong

Dissertations and Theses Collection (Open Access)

With the rise of big data and artificial intelligence, data intelligence has gradually become the focus of academia and industry. Data intelligence has two obvious characteristics: big data drive and application scene drive. More and more enterprises extract valuable patterns contained in data with prediction and decision analysis methods and technologies such as large-scale data mining, machine learning and deep learning and use them to improve the management and decision in complex practice, so as to promote changes of new business modes, organizational structures and even business strategies, and improve the operational efficiency of organizations. However, there are few studies …

Creating The Capacity For Digital Government, Cheow Hoe Chan, Steven M. Miller

Asian Management Insights

This article explains how a well-thought-out data policy, supported by a tech stack and cloud infrastructure, an agile way of working, and coordinated whole-of-government leadership, are fundamental to successful government digital transformation efforts, as exemplified by the Singapore government’s digital journey. As part of explaining how to create the capacity for digital government, the main sections of this article cover:

• The origins of GovTech
• How thinking big, starting small and acting fast is a practical strategy for organisational learning
• The importance of horizontal platforms and other enablers of a horizontal approach
• Data architecture and policy
• “Shifting left” with internal technology …

Topic Recommendation For Github Repositories: How Far Can Extreme Multi-Label Learning Go?, Ratnadira Widyasari, Zhipeng Zhao, Thanh Le Cong, Hong Jin Kang, David Lo

Research Collection School Of Computing and Information Systems

GitHub is one of the most popular platforms forversion control and collaboration. In GitHub, developers are ableto assign related topics to their repositories, which is helpfulfor finding similar repositories. The topics that are assigned torepositories are varied and provide salient descriptions of therepository; some topics describe the technology employed in aproject, while others describe functionality of the project, itsgoals, and its features. Topics are part of the metadata of arepository and are useful for the organization and discoverabilityof the repository. However, the number of topics is large andthis makes it challenging to assign a relevant set of topics to arepository. …

Spatio-Temporal Heterogeneity In The International Trade Resilience During Covid-19, Wei Luo, Lingfeng He, Zihui Yang, Shirui Zhang, Yong Wang, Dianbo Liu, Sheng Hu, Li He, Jizhe Xia, Min Chen

Research Collection School Of Computing and Information Systems

The COVID-19 pandemic and subsequent lockdowns have created immeasurable health and economic crises, leading to unprecedented disruptions to world trade. The COVID-19 pandemic shows diverse impacts on different economies that suffer and recover at different rates and degrees. This research aims to evaluate the spatio-temporal heterogeneity of international trade network vulnerabilities in the current crisis to understand the global production resilience and prepare for the future crisis. We applied a series of complex network analysis approaches to the monthly international trade networks at the world, regional, and country scales for the pre- and post- COVID-19 outbreak period. The spatio-temporal patterns …

Investment And Risk Management With Online News And Heterogeneous Networks, Meng Kiat Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Stock price movements in financial markets are influenced by large volumes of news from diverse sources on the web, e.g., online news outlets, blogs, social media. Extracting useful information from online news for financial tasks, e.g., forecasting stock returns or risks, is, however, challenging due to the low signal-to-noise ratios of such online information. Assessing the relevance of each news article to the price movements of individual stocks is also difficult, even for human experts. In this article, we propose the Guided Global-Local Attention-based Multimodal Heterogeneous Network (GLAM) model, which comprises novel attention-based mechanisms for multimodal sequential and graph encoding, …

Learning And Understanding User Interface Semantics From Heterogeneous Networks With Multimodal And Positional Attributes, Meng Kiat Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

User interfaces (UI) of desktop, web, and mobile applications involve a hierarchy of objects (e.g., applications, screens, view class, and other types of design objects) with multimodal (e.g., textual and visual) and positional (e.g., spatial location, sequence order, and hierarchy level) attributes. We can therefore represent a set of application UIs as a heterogeneous network with multimodal and positional attributes. Such a network not only represents how users understand the visual layout of UIs but also influences how users would interact with applications through these UIs. To model the UI semantics well for different UI annotation, search, and evaluation tasks, …

Green Data Analytics Of Supercomputing From Massive Sensor Networks: Does Workload Distribution Matter?, Zhiling Guo, Jin Li, Ram Ramesh

Research Collection School Of Computing and Information Systems

Energy costs represent a significant share of the total cost of ownership in high performance computing (HPC) systems. Using a unique data set collected by massive sensor networks in a peta scale national supercomputing center, we first present an explanatory model to identify key factors that affect energy consumption in supercomputing. Our analytic results show that, not only does computing node utilization significantly affect energy consumption, workload distribution among the nodes also has significant effects and could effectively be leveraged to improve energy efficiency. Next, we establish the high model performance using in-sample and out-of-sample analyses. We then develop prescriptive …

Machine Learning Techniques For Stock Price Prediction And Graphic Signal Recognition, Junde Chen, Yuxin Wen, Y. A. Nanehkaran, M. D. Suzauddola, Weirong Chen, Defu Zhang

Engineering Faculty Articles and Research

Stock market analysis is extremely important for investors because knowing the future trend and grasping the changing characteristics of stock prices will decrease the risk of investing capital for profit. Thereupon, the prediction of stock prices and identifying the graphic signals of candlestick charts, which are two crucial tasks in stock price analysis, attract much attention from investors owing to the returns and risks that coexist in financial markets. To introduce a reliable approach for addressing these challenges, this paper proposes the modeling strategies based on machine learning (ML) techniques. A vector autoregression (VAR)-based rolling prediction model is proposed for …

Concept-Oriented Transformers For Visual Sentiment Analysis, Quoc Tuan Truong, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

In the richly multimedia Web, detecting sentiment signals expressed in images would support multiple applications, e.g., measuring customer satisfaction from online reviews, analyzing trends and opinions from social media. Given an image, visual sentiment analysis aims at recognizing positive or negative sentiment, and occasionally neutral sentiment as well. A nascent yet promising direction is Transformer-based models applied to image data, whereby Vision Transformer (ViT) establishes remarkable performance on largescale vision benchmarks. In addition to investigating the fitness of ViT for visual sentiment analysis, we further incorporate concept orientation into the self-attention mechanism, which is the core component of Transformer. The …

Generalizing Graph Neural Network Across Graphs And Time, Zhihao Wen

Research Collection School Of Computing and Information Systems

Graph-structured data widely exist in diverse real-world scenarios, analysis of these graphs can uncover valuable insights about their respective application domains. However, most previous works focused on learning node representation from a single fixed graph, while many real-world scenarios require representations to be quickly generated for unseen nodes, new edges, or entirely new graphs. This inductive ability is essential for high-throughtput machine learning systems. However, this inductive graph representation problem is quite difficult, compared to the transductive setting, for that generalizing to unseen nodes requires new subgraphs containing the new nodes to be aligned to the neural network trained already. …

Improving Rumor Detection By Promoting Information Campaigns With Transformer-Based Generative Adversarial Learning, Jing Ma, Jun Li, Wei Gao, Yang Yang, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Rumors can cause devastating consequences to individuals and our society. Analysis shows that the widespread of rumors typically results from deliberate promotion of information aiming to shape the collective public opinions on the concerned event. In this paper, we combat such chaotic phenomenon with a countermeasure by mirroring against how such chaos is created to make rumor detection more robust and effective. Our idea is inspired by adversarial learning method originated from Generative Adversarial Networks (GAN). We propose a GAN-style approach, where a generator is designed to produce uncertain or conflicting voices, further polarizing the original conversational threads to boost …

Effective Graph Kernels For Evolving Functional Brain Networks, Xinlei Wang, Jinyi Chen, Bing Tian Dai, Junchang Xin, Yu Gu, Ge Yu

Research Collection School Of Computing and Information Systems

The graph kernel of the functional brain network is an effective method in the field of neuropsychiatric disease diagnosis like Alzheimer's Disease (AD). The traditional static brain networks cannot reflect dynamic changes of brain activities, but evolving brain networks, which are a series of brain networks over time, are able to seize such dynamic changes. As far as we know, the graph kernel method is effective for calculating the differences among networks. Therefore, it has a great potential to understand the dynamic changes of evolving brain networks, which are a series of chronological differences. However, if the conventional graph kernel …

Analysis And Optimization Of Contract Data Schema, Franklin Sun

Theses and Dissertations

agement, development, and growth of U.S Air Force assets demand extensive organizational communication and structuring. These interactions yield substantial amounts of contracting and administrative information. Over 4 million such contracts as a means towards obtaining valuable insights on Department of Defense resource usage. This set of contracting data is largely not optimized for backend service in an analytics environment. To this end, the following research evaluates the efficiency and performance of various data structuring methods. Evaluated designs include a baseline unstructured schema, a Data Mart schema, and a snowflake schema. Overall design success metrics include ease of use by end …

A Parameter Discovery Process For The Data Washing Machine Created For Unsupervised Data Curation, Kris E. Anderson

Theses and Dissertations

The Data Washing Machine (DWM) is a known and documented open-source Python Jupyter Notebook project that is the foundation for an Unsupervised Data Curation process. The DWM ingests reference data without a prior data cleansing activity and ultimately runs Entity Resolution (ER) on acceptable entity data to cluster duplicate references within the dataset. The DWM currently has 17 modifiable parameters that are used to help tokenize, cleanse, organize, link and cluster like references. With such a large number of parameters, some type of beginning settings as optimal as possible are needed for the DWM process for it to be useful …

Online Hyperparameter Optimization For Class-Incremental Learning, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Class-incremental learning (CIL) aims to train a classification model while the number of classes increases phase-by-phase. An inherent challenge of CIL is the stability-plasticity tradeoff, i.e., CIL models should keep stable to retain old knowledge and keep plastic to absorb new knowledge. However, none of the existing CIL models can achieve the optimal tradeoff in different data-receiving settings—where typically the training-from-half (TFH) setting needs more stability, but the training-from-scratch (TFS) needs more plasticity. To this end, we design an online learning method that can adaptively optimize the tradeoff without knowing the setting as a priori. Specifically, we first introduce the …

Flexible Job-Shop Scheduling Via Graph Neural Network And Deep Reinforcement Learning, Wen Song, Xinyang Chen, Qiqiang Li, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Recently, deep reinforcement learning (DRL) has been applied to learn priority dispatching rules (PDRs) for solving complex scheduling problems. However, the existing works face challenges in dealing with flexibility, which allows an operation to be scheduled on one out of multiple machines and is often required in practice. Such one-to-many relationship brings additional complexity in both decision making and state representation. This article considers the well-known flexible job-shop scheduling problem and addresses these issues by proposing a novel DRL method to learn high-quality PDRs end to end. The operation selection and the machine assignment are combined as a composite decision. …

Learning Comprehensive Global Features In Person Re-Identification: Ensuring Discriminativeness Of More Local Regions, Jiali Xia, Jianqiang Huang, Shibao Zheng, Qin Zhou, Bernt Schiele, Xian-Sheng Hua, Qianru Sun

Research Collection School Of Computing and Information Systems

Person re-identification (Re-ID) aims to retrieve person images from a large gallery given a query image of a person of interest. Global information and fine-grained local features are both essential for the representation. However, global embedding learned by naive classification model tends to be trapped in the most discriminative local region, leading to poor evaluation performance. To address the issue, we propose a novel baseline network that learns strong global feature termed as Comprehensive Global Embedding (CGE), ensuring more local regions of global feature maps to be discriminative. In this work, two key modules are proposed including Non-parameterized Local Classifier …

Generalization Bounds For Inductive Matrix Completion In Low-Noise Settings, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur, Marius Kloft

Research Collection School Of Computing and Information Systems

We study inductive matrix completion (matrix completion with side information) under an i.i.d. subgaussian noise assumption at a low noise regime, with uniform sampling of the entries. We obtain for the first time generalization bounds with the following three properties: (1) they scale like the standard deviation of the noise and in particular approach zero in the exact recovery case; (2) even in the presence of noise, they converge to zero when the sample size approaches infinity; and (3) for a fixed dimension of the side information, they only have a logarithmic dependence on the size of the matrix. Differently …

Contrastive Learning Approach To Word-In-Context Task For Low-Resource Languages, Pei-Chi Lo, Yang-Yin Lee, Hsien-Hao Chen, Agus Trisnajaya Kwee, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Word in context (WiC) task aims to determine whether a target word’s occurrences in two sentences share the same sense. In this paper, we propose a Contrastive Learning WiC (CLWiC) framework to improve the learning of sentence/word representations and classification of target word senses in the sentence pair when performing WiC on lowresource languages. In representation learning, CLWiC trains a pre-trained language model’s ability to cope with lowresource languages using both unsupervised and supervised contrastive learning. The WiC classifier learning further finetunes the language model with WiC classification loss under two classifier architecture options, SGBERT and WiSBERT, which use single-encoder …

Cross-Domain Graph Anomaly Detection Via Anomaly-Aware Contrastive Alignment, Qizhou Wang, Guansong Pang, Mahsa Salehi, Wray Buntine, Christopher Leckie

Research Collection School Of Computing and Information Systems

Cross-domain graph anomaly detection (CD-GAD) describes the problem of detecting anomalous nodes in an unlabelled target graph using auxiliary, related source graphs with labelled anomalous and normal nodes. Although it presents a promising approach to address the notoriously high false positive issue in anomaly detection, little work has been done in this line of research. There are numerous domain adaptation methods in the literature, but it is difficult to adapt them for GAD due to the unknown distributions of the anomalies and the complex node relations embedded in graph data. To this end, we introduce a novel domain adaptation approach, …

On Generalized Degree Fairness In Graph Neural Networks, Zemin Liu, Trung Kien Nguyen, Yuan Fang

Research Collection School Of Computing and Information Systems

Conventional graph neural networks (GNNs) are often confronted with fairness issues that may stem from their input, including node attributes and neighbors surrounding a node. While several recent approaches have been proposed to eliminate the bias rooted in sensitive attributes, they ignore the other key input of GNNs, namely the neighbors of a node, which can introduce bias since GNNs hinge on neighborhood structures to generate node representations. In particular, the varying neighborhood structures across nodes, manifesting themselves in drastically different node degrees, give rise to the diverse behaviors of nodes and biased outcomes. In this paper, we first define …

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurram, Akshat Kumar

Research Collection School Of Computing and Information Systems

The k-center clustering algorithm, introduced over 35 years ago, is known to be robust to class imbalance prevalent in many clustering problems and has various applications such as data summarization, document clustering, and facility location determination. Unfortunately, existing k-center algorithms provide highly suboptimal solutions that can limit their practical application, reproducibility, and clustering quality. In this paper, we provide a novel scalable and globally optimal solution to a popular variant of the k-center problem known as generalized L1 k-center clustering that uses L1 distance and allows the selection of arbitrary vectors as cluster centers. We show that this clustering objective …

Learning Relation Prototype From Unlabeled Texts For Long-Tail Relation Extraction, Yixin Cao, Jun Kuang, Ming Gao, Aoying Zhou, Yonggang Wen, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Relation Extraction (RE) is a vital step to complete Knowledge Graph (KG) by extracting entity relations from texts. However, it usually suffers from the long-tail issue. The training data mainly concentrates on a few types of relations, leading to the lack of sufficient annotations for the remaining types of relations. In this paper, we propose a general approach to learn relation prototypes from unlabeled texts, to facilitate the long-tail relation extraction by transferring knowledge from the relation types with sufficient training data. We learn relation prototypes as an implicit factor between entities, which reflects the meanings of relations as well …

Mirror: Mining Implicit Relationships Via Structure-Enhanced Graph Convolutional Networks, Jiaying Liu, Feng Xia, Jing Ren, Bo Xu, Guansong Pang, Lianhua Chi

Research Collection School Of Computing and Information Systems

Data explosion in the information society drives people to develop more effective ways to extract meaningful information. Extracting semantic information and relational information has emerged as a key mining primitive in a wide variety of practical applications. Existing research on relation mining has primarily focused on explicit connections and ignored underlying information, e.g., the latent entity relations. Exploring such information (defined as implicit relationships in this article) provides an opportunity to reveal connotative knowledge and potential rules. In this article, we propose a novel research topic, i.e., how to identify implicit relationships across heterogeneous networks. Specially, we first give a …

Mitigating Popularity Bias For Users And Items With Fairness-Centric Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu

Research Collection School Of Computing and Information Systems

Recommendation systems are popular in many domains. Researchers usually focus on the effectiveness of recommendation (e.g., precision) but neglect the popularity bias that may affect the fairness of the recommendation, which is also an important consideration that could influence the benefits of users and item providers. A few studies have been proposed to deal with the popularity bias, but they often face two limitations. Firstly, most studies only consider fairness for one side - either users or items, without achieving fairness jointly for both. Secondly, existing methods are not sufficiently tailored to each individual user or item to cope with …

Future Aware Pricing And Matching For Sustainable On-Demand Ride Pooling, Xianjie Zhang, Pradeep Varakantham, Hao Jiang

Research Collection School Of Computing and Information Systems

The popularity of on-demand ride pooling is owing to the benefits offered to customers (lower prices), taxi drivers (higher revenue), environment (lower carbon footprint due to fewer vehicles) and aggregation companies like Uber (higher revenue). To achieve these benefits, two key interlinked challenges have to be solved effectively: (a) pricing – setting prices to customer requests for taxis; and (b) matching – assignment of customers (that accepted the prices) to taxis/cars. Traditionally, both these challenges have been studied individually and using myopic approaches (considering only current requests), without considering the impact of current matching on addressing future requests. In this …

Real-Time Hierarchical Map Segmentation For Coordinating Multi-Robot Exploration, Tianze Luo, Zichen Chen, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Coordinating a team of autonomous agents to explore an environment can be done by partitioning the map of the environment into segments and allocating the segments as targets for the individual agents to visit. However, given an unknown environment, map segmentation must be conducted in a continuous and incremental manner. In this paper, we propose a novel real-time hierarchical map segmentation method for supporting multi-agent exploration of indoor environments, wherein clusters of regions of segments are formed hierarchically from randomly sampled points in the environment. Each cluster is then assigned with a cost-utility value based on the minimum cost possible …

Alignment-Enriched Tuning For Patch-Level Pre-Trained Document Image Models, Lei Wang, Jiabang He, Xing Xu, Ning Liu, Hui Liu

Research Collection School Of Computing and Information Systems

Alignment between image and text has shown promising im provements on patch-level pre-trained document image mod els. However, investigating more effective or finer-grained alignment techniques during pre-training requires a large amount of computation cost and time. Thus, a question natu rally arises: Could we fine-tune the pre-trained models adap tive to downstream tasks with alignment objectives and achieve comparable or better performance? In this paper, we pro pose a new model architecture with alignment-enriched tuning (dubbed AETNet) upon pre-trained document image models, to adapt downstream tasks with the joint task-specific super vised and alignment-aware contrastive objective. Specifically, weintroduce an extra …

The Application Of Graph Technology For Improving Entity Resolution Results In The Context Of Group Membership, Md Abdus Salam Siddique

Theses and Dissertations

The main objective of Entity resolution (ER) is to find duplicate records within the same data table from the same source or different data tables from various sources. A traditional pair-wise supervised entity resolution matching depends on pre-built rules for finding matched records. On the other hand, unsupervised or semisupervised also relies on pair-wise matching. In the maximum case, group membership is left behind for consideration. In this dissertation, I have discussed the design, implementation and evaluation of a graph-based entity resolution for group membership to enhance the pair-wise matching ER system. I have designed and implemented a pipeline for …