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

Databases and Information Systems Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 271 - 300 of 3555

Full-Text Articles in Databases and Information Systems

Understanding And Fighting Scams: Media, Language, Appeals And Effects, Shuhua Zhou, Xiao Fan Liu, Fiona Fui-Hoon Nah, S. Harrison, X. Zhang, S. Zhen, D. Yeung, J. Hsiao, R. Lc, A. Chan, X. Wang, C. Jiang, F. Lin, J. Li, A. Wong, L. Chan, B. George, P. Li Jul 2024

Understanding And Fighting Scams: Media, Language, Appeals And Effects, Shuhua Zhou, Xiao Fan Liu, Fiona Fui-Hoon Nah, S. Harrison, X. Zhang, S. Zhen, D. Yeung, J. Hsiao, R. Lc, A. Chan, X. Wang, C. Jiang, F. Lin, J. Li, A. Wong, L. Chan, B. George, P. Li

Research Collection School Of Computing and Information Systems

Scams are fraudulent activities aiming to deceive individuals into relinquishing money, property, or rights, and they have proliferated in the context of widespread misinformation and disinformation. In this paper, we propose strategies and a research plan to address key questions about the exploitation of new communication technologies by scammers, the prevalence and nature of different scam types, and the language characteristics and appeals used in scamming content. We aim to develop a comprehensive taxonomy of scams and identify factors that contribute to their persuasiveness. Additionally, we propose the use of advanced technologies, including artificial intelligence, physiological measures, and brain mapping, …

Go to article

Anomaly Heterogeneity Learning For Open-Set Supervised Anomaly Detection, Jiawen Zhu, Choubo Ding, Yu Tian, Guansong Pang Jun 2024

Anomaly Heterogeneity Learning For Open-Set Supervised Anomaly Detection, Jiawen Zhu, Choubo Ding, Yu Tian, Guansong Pang

Research Collection School Of Computing and Information Systems

Open-set supervised anomaly detection (OSAD) - a recently emerging anomaly detection area - aims at utilizing a few samples of anomaly classes seen during training to detect unseen anomalies (i.e., samples from open-set anomaly classes), while effectively identifying the seen anomalies. Benefiting from the prior knowledge illustrated by the seen anomalies, current OSAD methods can often largely reduce false positive errors. However, these methods are trained in a closed-set setting and treat the anomaly examples as from a homogeneous distribution, rendering them less effective in generalizing to unseen anomalies that can be drawn from any distribution. This paper proposes to …

Go to article

Zero-Shot Out-Of-Distribution Detection With Outlier Label Exposure, Choubo Ding, Guansong Pang Jun 2024

Zero-Shot Out-Of-Distribution Detection With Outlier Label Exposure, Choubo Ding, Guansong Pang

Research Collection School Of Computing and Information Systems

As vision-language models like CLIP are widely applied to zero-shot tasks and gain remarkable performance on in-distribution (ID) data, detecting and rejecting out-of-distribution (OOD) inputs in the zero-shot setting have become crucial for ensuring the safety of using such models on the fly. Most existing zero-shot OOD detectors rely on ID class label-based prompts to guide CLIP in classifying ID images and rejecting OOD images. In this work we instead propose to leverage a large set of diverse auxiliary outlier class labels as pseudo OOD class text prompts to CLIP for enhancing zero-shot OOD detection, an approach we called Outlier …

Go to article

Applicability And Challenges Of Indoor Localization Using One-Sided Round Trip Time Measurements, Quang Hai Truong, Xi Kai Justin Lam, Guru Anand Anish, Rajesh Krishna Balan Jun 2024

Applicability And Challenges Of Indoor Localization Using One-Sided Round Trip Time Measurements, Quang Hai Truong, Xi Kai Justin Lam, Guru Anand Anish, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Radio Frequency fingerprinting, based on WiFi or cellular signals, has been a popular approach for localization. However, adoptions in real-world applications have confronted with challenges due to low accuracy, especially in crowded environments. The received signal strength (RSS) could be easily interfered by a large number of other devices or strictly depends on physical surrounding environments, which may cause localization errors of a few meters. On the other hand, the fine time measurement (FTM) round-trip time (RTT) has shown compelling improvement in indoor localization with ~1-2 meter accuracy in both 2D and 3D environments [13]. This method relies on the …

Go to article

Locality-Aware Tail Node Embeddings On Homogeneous And Heterogeneous Networks, Zemin Liu, Yuan Fang, Wentao Zhang, Xinming Zhang, Steven C. H. Hoi Jun 2024

Locality-Aware Tail Node Embeddings On Homogeneous And Heterogeneous Networks, Zemin Liu, Yuan Fang, Wentao Zhang, Xinming Zhang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

While the state-of-the-art network embedding approaches often learn high-quality embeddings for high-degree nodes with abundant structural connectivity, the quality of the embeddings for low-degree or nodes is often suboptimal due to their limited structural connectivity. While many real-world networks are long-tailed, to date little effort has been devoted to tail node embeddings. In this article, we formulate the goal of learning tail node embeddings as a problem, given the few links on each tail node. In particular, since each node resides in its own local context, we personalize the regression model for each tail node. To reduce overfitting in the …

Go to article

The Next 'Deep' Thing In X To Z Marketing: An Artificial Intelligence Driven Approach, Vincent Charles, Nripendra Rana, Ilias O. Pappas, Morten Kamphaug, Keng Siau, Kenth Engo-Monsen Jun 2024

The Next 'Deep' Thing In X To Z Marketing: An Artificial Intelligence Driven Approach, Vincent Charles, Nripendra Rana, Ilias O. Pappas, Morten Kamphaug, Keng Siau, Kenth Engo-Monsen

Research Collection School Of Computing and Information Systems

The existing body of literature indicates a growing interest in research pertaining to the influence of artificial intelligence (AI) on marketing strategies, processes, and practices. However, further studies are required to fully unravel its complete potential and the implications it holds for practical application. The aim of this special issue on “The Next ‘Deep’ Thing in X to Z Marketing: An Artificial Intelligence-Driven Approach” is to explore the next frontiers and delve into the various facets of AI-driven marketing, shedding light on cutting-edge research and practical insights that can shape the future of the field. It also focuses on novel …

Go to article

Pkt-Sin: A Secure Communication Protocol For Space Information Networks With Periodic K-Time Anonymous Authentication, Yang Yang, Wenyi Xue, Jianfei Sun, Guomin Yang, Yingjiu Li, Hwee Hwa Pang, Robert H. Deng Jun 2024

Pkt-Sin: A Secure Communication Protocol For Space Information Networks With Periodic K-Time Anonymous Authentication, Yang Yang, Wenyi Xue, Jianfei Sun, Guomin Yang, Yingjiu Li, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Space Information Network (SIN) enables universal Internet connectivity for any object, even in remote and extreme environments where deploying a cellular network is difficult. Access authentication is crucial for ensuring user access control in SIN and preventing unauthorized entities from gaining access to network services. However, due to the complex communication environment in SIN, including exposed links and higher signal delay, designing a secure and efficient authentication scheme presents a significant challenge. In this paper, we propose a secure communication protocol for SIN with periodic k-time anonymous authentication (named PkT-SIN) that allows satellite users to anonymously authenticate to ground stations …

Go to article

Fully Automated Selfish Mining Analysis In Efficient Proof Systems Blockchains, Krishnendu Chatterjee, Amirali Ebrahimzadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic Jun 2024

Fully Automated Selfish Mining Analysis In Efficient Proof Systems Blockchains, Krishnendu Chatterjee, Amirali Ebrahimzadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic

Research Collection School Of Computing and Information Systems

We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems - like proofs of stake or proofs of space - and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an ϵ-tight lower bound on the optimal expected …

Go to article

How Is Our Mobility Affected As We Age? Findings From A 934 Users Field Study Of Older Adults Conducted In An Urban Asian City, Yi Zhen Tan, Ngoc Doan Thu Tran, Sapphire Lin, Fang Zhao, Yee Sien Ng, Dong Ma, Jeonggil Ko, Rajesh Krishna Balan Jun 2024

How Is Our Mobility Affected As We Age? Findings From A 934 Users Field Study Of Older Adults Conducted In An Urban Asian City, Yi Zhen Tan, Ngoc Doan Thu Tran, Sapphire Lin, Fang Zhao, Yee Sien Ng, Dong Ma, Jeonggil Ko, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

In this paper, we analyze the results of a large study involving 934 older adults living in an urban Asian city that collected their mobility patterns, in the form of logged GPS data, along with a multitude of demographic and health data. We show that mobility, in terms of average distance travelled per day, is greatly affected by age and by employment status. In addition, other factors such as type of day, household size, physical and financial conditions and the onset of retirement also play a significant role in determining the mobility of an individual. These results will have high …

Go to article

Public Data Resources And Total Factor Productivity Of Enterprises: A Quasi-Natural Experiment Based On Local Government Data Opening, Wuping Wu, Qiheng Li, Liuyi Zhang, Yue Zhao Jun 2024

Public Data Resources And Total Factor Productivity Of Enterprises: A Quasi-Natural Experiment Based On Local Government Data Opening, Wuping Wu, Qiheng Li, Liuyi Zhang, Yue Zhao

Research Collection School Of Accountancy

The opening of public data is the government’s major strategic move to release the value of data factor. However, whether these data resources are used by the public to release their value needs to be empirically tested. Therefore, based on the perspective of high-quality development of firms, this paper examines the relation between open public data and firms’ total factor productivity so as to reflect the value of public data resources in driving force of promoting firms’ high-quality development. Taking A-share listed firms from 2010 to 2019 as samples, using a natural experiment based on the launch of the local …

Go to article

To Protect Or To Hide: An Investigation On Corporate Redacted Disclosure Motives Under New Fast Act Regulation, Yan Ma, Qian Mao, Nan Hu Jun 2024

To Protect Or To Hide: An Investigation On Corporate Redacted Disclosure Motives Under New Fast Act Regulation, Yan Ma, Qian Mao, Nan Hu

Research Collection School Of Computing and Information Systems

China adopted amendments allowing companies to redact filings without prior approval in 2016. Leveraging this change as a quasi-nature experiment, we explore whether managers utilize redacted information to withhold bad information in the more lenient regulatory environment. Our investigation uncovers a significant shift in managerial behavior: Since 2016, managers incline to employ redactions to obscure negative news rather than safeguarding proprietary data. Furthermore, we find that the poorer firm performance and a higher cost of equity are associated with the redacted disclosures after 2016, suggesting that investors perceive an increase in firm-specific risk attributed to withholding bad news through redactions.

Go to article

Efficient Cross-Modal Video Retrieval With Meta-Optimized Frames, Ning Han, Xun Yang, Ee-Peng Lim, Hao Chen, Qianru Sun Jun 2024

Efficient Cross-Modal Video Retrieval With Meta-Optimized Frames, Ning Han, Xun Yang, Ee-Peng Lim, Hao Chen, Qianru Sun

Research Collection School Of Computing and Information Systems

Cross-modal video retrieval aims to retrieve semantically relevant videos when given a textual query, and is one of the fundamental multimedia tasks. Most top-performing methods primarily leverage Vision Transformer (ViT) to extract video features [1]-[3]. However, they suffer from the high computational complexity of ViT, especially when encoding long videos. A common and simple solution is to uniformly sample a small number (e.g., 4 or 8) of frames from the target video (instead of using the whole video) as ViT inputs. The number of frames has a strong influence on the performance of ViT, e.g., using 8 frames yields better …

Go to article

Gts: Gpu-Based Tree Index For Fast Similarity Search, Yifan Zhu, Ruiyao Ma, Baihua Zheng, Xiangyu Ke, Lu Chen, Yunjun Gao Jun 2024

Gts: Gpu-Based Tree Index For Fast Similarity Search, Yifan Zhu, Ruiyao Ma, Baihua Zheng, Xiangyu Ke, Lu Chen, Yunjun Gao

Research Collection School Of Computing and Information Systems

Similarity search, the task of identifying objects most similar to a given query object under a specific metric, has gathered significant attention due to its practical applications. However, the absence of coordinate information to accelerate similarity search and the high computational cost of measuring object similarity hinder the efficiency of existing CPU-based methods. Additionally, these methods struggle to meet the demand for high throughput data management. To address these challenges, we propose GTS, a GPU-based tree index designed for the parallel processing of similarity search in general metric spaces, where only the distance metric for measuring object similarity is known. …

Go to article

Closest Pairs Search Over Data Stream, Rui Zhu Zhu, Bin Wang, Xiaochun Yang, Baihua Zheng Jun 2024

Closest Pairs Search Over Data Stream, Rui Zhu Zhu, Bin Wang, Xiaochun Yang, Baihua Zheng

Research Collection School Of Computing and Information Systems

��-closest pair (KCP for short) search is a fundamental problem in database research. Given a set of��-dimensional streaming data S, KCP search aims to retrieve �� pairs with the shortest distances between them. While existing works have studied continuous 1-closest pair query (i.e., �� = 1) over dynamic data environments, which allow for object insertions/deletions, they require high computational costs and cannot easily support KCP search with �� > 1. This paper investigates the problem of KCP search over data stream, aiming to incrementally maintain as few pairs as possible to support KCP search with arbitrarily ��. To achieve this, we …

Go to article

Usability Versus Collectibility In Nft: The Case Of Web3 Domain Names, Ping Fan Ke, Yi Meng Lau Jun 2024

Usability Versus Collectibility In Nft: The Case Of Web3 Domain Names, Ping Fan Ke, Yi Meng Lau

Research Collection School Of Computing and Information Systems

This study examines the market’s inclination towards usability and collectibility aspects of Non-Fungible Tokens (NFTs) within Web3 domain name marketplaces, drawing insights from resale records. Our findings reveal a prevailing preference for usability, as evidenced by consistently higher average resale prices observed for Ethereum Name Service (ENS) domains compared to Linagee Name Registrar (LNR) domains. However, domains with diminished usability, such as those containing non-ASCII characters, tend to attract investors due to their enhanced collectibility. Our analysis on the effect from previous resale suggests a potential aversion towards second-hand acquisitions among NFT investors when value derives primarily from usability, while …

Go to article

Poster: Profiling Event Vision Processing On Edge Devices, Ila Nitin Gokarn, Archan Misra Jun 2024

Poster: Profiling Event Vision Processing On Edge Devices, Ila Nitin Gokarn, Archan Misra

Research Collection School Of Computing and Information Systems

As RGB camera resolutions and frame-rates improve, their increased energy requirements make it challenging to deploy fast, efficient, and low-power applications on edge devices. Newer classes of sensors, such as the biologically inspired neuromorphic event-based camera, capture only changes in light intensity per-pixel to achieve operational superiority in sensing latency (O(μs)), energy consumption (O(mW)), high dynamic range (140dB), and task accuracy such as in object tracking, over traditional RGB camera streams. However, highly dynamic scenes can yield an event rate of up to 12MEvents/second, the processing of which could overwhelm …

Go to article

Learning Dynamic Multimodal Network Slot Concepts From The Web For Forecasting Environmental, Social And Governance Ratings, Gary Ang, Ee-Peng Lim Jun 2024

Learning Dynamic Multimodal Network Slot Concepts From The Web For Forecasting Environmental, Social And Governance Ratings, Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Dynamic multimodal networks are networks with node attributes from different modalities where the at- tributes and network relationships evolve across time, i.e., both networks and multimodal attributes are dynamic; for example, dynamic relationship networks between companies that evolve across time due to changes in business strategies and alliances, which are associated with dynamic company attributes from multiple modalities such as textual online news, categorical events, and numerical financial-related data. Such information can be useful in predictive tasks involving companies. Environmental, social, and gov- ernance (ESG) ratings of companies are important for assessing the sustainability risks of companies. The process of …

Go to article

Improving Interpretable Embeddings For Ad-Hoc Video Search With Generative Captions And Multi-Word Concept Bank, Jiaxin Wu, Chong-Wah Ngo, Wing-Kwong Chan Jun 2024

Improving Interpretable Embeddings For Ad-Hoc Video Search With Generative Captions And Multi-Word Concept Bank, Jiaxin Wu, Chong-Wah Ngo, Wing-Kwong Chan

Research Collection School Of Computing and Information Systems

Aligning a user query and video clips in cross-modal latent space and that with semantic concepts are two mainstream approaches for ad-hoc video search (AVS). However, the effectiveness of existing approaches is bottlenecked by the small sizes of available video-text datasets and the low quality of concept banks, which results in the failures of unseen queries and the out-of-vocabulary problem. This paper addresses these two problems by constructing a new dataset and developing a multi-word concept bank. Specifically, capitalizing on a generative model, we construct a new dataset consisting of 7 million generated text and video pairs for pre-training. To …

Go to article

Generalized Graph Prompt: Toward A Unification Of Pre-Training And Downstream Tasks On Graphs, Xingtong Yu, Zhenghao Liu, Yuan Fang, Et Al. Jun 2024

Generalized Graph Prompt: Toward A Unification Of Pre-Training And Downstream Tasks On Graphs, Xingtong Yu, Zhenghao Liu, Yuan Fang, Et Al.

Research Collection School Of Computing and Information Systems

Graphs can model complex relationships between objects, enabling a myriad of Web applications such as online page/article classification and social recommendation. While graph neural networks (GNNs) have emerged as a powerful tool for graph representation learning, in an end-to-end supervised setting, their performance heavily relies on a large amount of task-specific supervision. To reduce labeling requirement, the 'pre-train, fine-tune' and 'pre-train, prompt' paradigms have become increasingly common. In particular, prompting is a popular alternative to fine-tuning in natural language processing, which is designed to narrow the gap between pre-training and downstream objectives in a task-specific manner. However, existing study of …

Go to article

Try It Together - Qualitative Coding With Atlas.Ti, Danping Dong, Bryan Leow May 2024

Try It Together - Qualitative Coding With Atlas.Ti, Danping Dong, Bryan Leow

2024 AI for Research Week

This hands-on session introduces Atlas.ti, a well-established qualitative data analysis tool for analyzing your transcripts and textual data. The session will cover coding data, extracting insights, creating visualizations, and exploring the tool's latest AI features.

Go to article

Diffusion-Based Negative Sampling On Graphs For Link Prediction, Yuan Fang, Yuan Fang May 2024

Diffusion-Based Negative Sampling On Graphs For Link Prediction, Yuan Fang, Yuan Fang

Research Collection School Of Computing and Information Systems

Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contrastive approach to learn robust node representations, where negative sampling is pivotal. Typical negative sampling methods aim to retrieve hard examples based on either predefined heuristics or automatic adversarial approaches, which might be inflexible or difficult to control. Furthermore, in the context of link prediction, most previous methods sample negative nodes from existing substructures of the graph, missing out on potentially more optimal samples in the latent space. …

Go to article

Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan May 2024

Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan

Research Collection School Of Computing and Information Systems

Graph Neural Networks (GNNs) have emerged as a mainstream technique for graph representation learning. However, their efficacy within an end-to-end supervised framework is significantly tied to the availability of task-specific labels. To mitigate labeling costs and enhance robustness in few-shot settings, pre-training on self-supervised tasks has emerged as a promising method, while prompting has been proposed to further narrow the objective gap between pretext and downstream tasks. Although there has been some initial exploration of prompt-based learning on graphs, they primarily leverage a single pretext task, resulting in a limited subset of general knowledge that could be learned from the …

Go to article

Unraveling The ‘Anomaly’ In Time Series Anomaly Detection: A Self-Supervised Tri-Domain Solution, Yuting Sun, Guansong Pang, Guanhua Ye, Tong Chen, Xia Hu, Hongzhi Yin May 2024

Unraveling The ‘Anomaly’ In Time Series Anomaly Detection: A Self-Supervised Tri-Domain Solution, Yuting Sun, Guansong Pang, Guanhua Ye, Tong Chen, Xia Hu, Hongzhi Yin

Research Collection School Of Computing and Information Systems

The ongoing challenges in time series anomaly detection (TSAD), including the scarcity of anomaly labels and the variability in anomaly lengths and shapes, have led to the need for a more robust and efficient solution. As limited anomaly labels hinder traditional supervised models in anomaly detection, various state-of-the-art (SOTA) deep learning (DL) techniques (e.g., self-supervised learning) are introduced to tackle this issue. However, they encounter difficulties handling variations in anomaly lengths and shapes, limiting their adaptability to diverse anomalies. Additionally, many benchmark datasets suffer from the problem of having explicit anomalies that even random functions can detect. This problem is …

Go to article

Explaining Sequences Of Actions In Multi-Agent Deep Reinforcement Learning Models, Phyo Wai Khaing, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan May 2024

Explaining Sequences Of Actions In Multi-Agent Deep Reinforcement Learning Models, Phyo Wai Khaing, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a method to explain MADRL agents’ behaviors by abstracting their actions into high-level strategies. Particularly, a spatio-temporal neural network model is applied to encode the agents’ sequences of actions as memory episodes wherein an aggregating memory retrieval can generalize them into a concise abstract representation of collective strategies. To assess the effectiveness of our method, we applied it to explain the actions of QMIX MADRL agents playing a StarCraft Multi-agent Challenge (SMAC) video game. A user study on the perceived explainability of the extracted strategies indicates that our method can provide comprehensible explanations at various levels of …

Go to article

Improving The Performance Of Wi-Fi Indoor Localization In Both Dense And Unknown Environments, Quang Truong Hai May 2024

Improving The Performance Of Wi-Fi Indoor Localization In Both Dense And Unknown Environments, Quang Truong Hai

Dissertations and Theses Collection (Open Access)

Indoor localization is important for various pervasive applications, garnering considerable research attention over recent decades. Despite numerous proposed solutions, the practical application of these methods in real-world environments with high applicability remains challenging. One compelling use case for building owners is the ability to track individuals as they navigate through the building, whether for security, customer analytics, space utilization planning, or other management purposes. However, this task becomes exceedingly difficult in environments with hundreds or thousands of people in motion. Conversely, the need to track oneself’s location is also meaningful from the perspective of individuals traversing in crowded spaces. These …

Go to article

Dlvs4audio2sheet: Deep Learning-Based Vocal Separation For Audio Into Music Sheet Conversion, Nicole Teo, Zhaoxia Wang, Ezekiel Ghe, Yee Sen Tan, Kevan Oktavio, Alexander Vincent Lewi, Allyne Zhang, Seng-Beng Ho May 2024

Dlvs4audio2sheet: Deep Learning-Based Vocal Separation For Audio Into Music Sheet Conversion, Nicole Teo, Zhaoxia Wang, Ezekiel Ghe, Yee Sen Tan, Kevan Oktavio, Alexander Vincent Lewi, Allyne Zhang, Seng-Beng Ho

Research Collection School Of Computing and Information Systems

While manual transcription tools exist, music enthusiasts, including amateur singers, still encounter challenges when transcribing performances into sheet music. This paper addresses the complex task of translating music audio into music sheets, particularly challenging in the intricate field of choral arrangements where multiple voices intertwine. We propose DLVS4Audio2Sheet, a novel method leveraging advanced deep learning models, Open-Unmix and Band-Split Recurrent Neural Networks (BSRNN), for vocal separation. DLVS4Audio2Sheet segments choral audio into individual vocal sections and selects the optimal model for further processing, aiming towards audio into music sheet conversion. We evaluate DLVS4Audio2Sheet’s performance using these deep learning algorithms and assess …

Go to article

Time-Controllable Keyword Search Scheme With Efficient Revocation In Mobile E-Health Cloud, Yinbin Miao, Feng Li, Xinghua Li, Zhiquan Liu, Jianting Ning, Hongwei Li, Kim-Kwang Raymond Choo, Deng, Robert H. May 2024

Time-Controllable Keyword Search Scheme With Efficient Revocation In Mobile E-Health Cloud, Yinbin Miao, Feng Li, Xinghua Li, Zhiquan Liu, Jianting Ning, Hongwei Li, Kim-Kwang Raymond Choo, Deng, Robert H.

Research Collection School Of Computing and Information Systems

Electronic health (e-health) systems may outsource data such as patient e-health records to mobile cloud servers for efficiency gains (e.g., minimizing local storage and computation costs). However, such a move may result in privacy implications in the presence of semi-honest cloud servers. Searchable Encryption (SE) can potentially facilitate privacy-preserving searches based on keywords for encrypted data stored in the mobile cloud, but most existing SE solutions do not support temporal access control (i.e., a mechanism that grants access permissions to users for specified time ranges). Hence, in this paper we design a time-controllable keyword search scheme by using an attribute-based …

Go to article

Knowledge Enhanced Multi-Intent Transformer Network For Recommendation, Ding Zou, Wei Wei, Feida Zhu, Chuanyu Xu, Tao Zhang, Chengfu Huo May 2024

Knowledge Enhanced Multi-Intent Transformer Network For Recommendation, Ding Zou, Wei Wei, Feida Zhu, Chuanyu Xu, Tao Zhang, Chengfu Huo

Research Collection School Of Computing and Information Systems

Incorporating Knowledge Graphs (KGs) into Recommendation has attracted growing attention in industry, due to the great potential of KG in providing abundant supplementary information and interpretability for the underlying models. However, simply integrating KG into recommendation usually brings in negative feedback in industry, mainly due to the ignorance of the following two factors: i) users' multiple intents, which involve diverse nodes in KG. For example, in e-commerce scenarios, users may exhibit preferences for specific styles, brands, or colors. ii) knowledge noise, which is a prevalent issue in Knowledge Enhanced Recommendation (KGR) and even more severe in industry scenarios. The irrelevant …

Go to article

Scaling Up Cooperative Multi-Agent Reinforcement Learning Systems, Minghong Geng May 2024

Scaling Up Cooperative Multi-Agent Reinforcement Learning Systems, Minghong Geng

Research Collection School Of Computing and Information Systems

Cooperative multi-agent reinforcement learning methods aim to learn effective collaborative behaviours of multiple agents performing complex tasks. However, existing MARL methods are commonly proposed for fairly small-scale multi-agent benchmark problems, wherein both the number of agents and the length of the time horizons are typically restricted. My initial work investigates hierarchical controls of multi-agent systems, where a unified overarching framework coordinates multiple smaller multi-agent subsystems, tackling complex, long-horizon tasks that involve multiple objectives. Addressing another critical need in the field, my research introduces a comprehensive benchmark for evaluating MARL methods in long-horizon, multi-agent, and multi-objective scenarios. This benchmark aims to …

Go to article

Hjg: An Effective Hierarchical Joint Graph For Anns In Multi-Metric Spaces, Yifan Zhu, Lu Chen, Yunjun Gao, Ruiyao Ma, Baihua Zheng, Jingwen Zhao May 2024

Hjg: An Effective Hierarchical Joint Graph For Anns In Multi-Metric Spaces, Yifan Zhu, Lu Chen, Yunjun Gao, Ruiyao Ma, Baihua Zheng, Jingwen Zhao

Research Collection School Of Computing and Information Systems

Owing to the widespread deployment of smartphones and networked devices, massive amount of data in different types are generated every day, including numeric data, locations, text data, images, etc. Nearest neighbour search in multi-metric spaces has attracted much attention, as it can accommodate any type of data and support search on flexible combinations of multiple metrics. However, most existing methods focus on single metric queries, failing to answer multi-metric queries efficiently due to the complex metric combinations. In this paper, for the first time, we study the approximate nearest neighbour search (ANNS) in multi-metric spaces, and propose HJG, a hierarchical …

Go to article

First Prev Next Last