In today’s era, smartphones are used in daily lives because they are ubiquitous and can be customized by installing third-party apps. As a result, the menaces because of these apps, which are potentially risky for u...
详细信息
This study examines the use of experimental designs, specifically full and fractional factorial designs, for predicting Alzheimer’s disease with fewer variables. The full factorial design systematically investigates ...
详细信息
Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inher...
详细信息
Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.
Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical...
详细信息
Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.
Effective management of electricity consumption (EC) in smart buildings (SBs) is crucial for optimizing operational efficiency, cost savings, and ensuring sustainable resource utilization. Accurate EC prediction enabl...
详细信息
The paper addresses the critical problem of application workflow offloading in a fog environment. Resource constrained mobile and Internet of Things devices may not possess specialized hardware to run complex workflow...
详细信息
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention...
详细信息
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.
Integrated sensing and communication (ISAC) is a promising technique to increase spectral efficiency and support various emerging applications by sharing the spectrum and hardware between these functionalities. Howeve...
详细信息
Integrated sensing and communication (ISAC) is a promising technique to increase spectral efficiency and support various emerging applications by sharing the spectrum and hardware between these functionalities. However, the traditional ISAC schemes are highly dependent on the accurate mathematical model and suffer from the challenges of high complexity and poor performance in practical scenarios. Recently, artificial intelligence (AI) has emerged as a viable technique to address these issues due to its powerful learning capabilities, satisfactory generalization capability, fast inference speed, and high adaptability for dynamic environments, facilitating a system design shift from model-driven to data-driven. Intelligent ISAC, which integrates AI into ISAC, has been a hot topic that has attracted many researchers to investigate. In this paper, we provide a comprehensive overview of intelligent ISAC, including its motivation, typical applications, recent trends, and challenges. In particular, we first introduce the basic principle of ISAC, followed by its key techniques. Then, an overview of AI and a comparison between model-based and AI-based methods for ISAC are provided. Furthermore, the typical applications of AI in ISAC and the recent trends for AI-enabled ISAC are reviewed. Finally, the future research issues and challenges of intelligent ISAC are discussed.
The behavior of users on online life service platforms like Meituan and Yelp often occurs within specific finegrained spatiotemporal contexts(i.e., when and where). Recommender systems, designed to serve millions of u...
详细信息
The behavior of users on online life service platforms like Meituan and Yelp often occurs within specific finegrained spatiotemporal contexts(i.e., when and where). Recommender systems, designed to serve millions of users, typically operate in a fully server-based manner, requiring on-device users to upload their behavioral data, including fine-grained spatiotemporal contexts, to the server, which has sparked public concern regarding privacy. Consequently, user devices only upload coarse-grained spatiotemporal contexts for user privacy protection. However, previous research mostly focuses on modeling fine-grained spatiotemporal contexts using knowledge graph convolutional models, which are not applicable to coarse-grained spatiotemporal contexts in privacy-constrained recommender systems. In this paper, we investigate privacy-preserving recommendation by leveraging coarse-grained spatiotemporal contexts. We propose the coarse-grained spatiotemporal knowledge graph for privacy-preserving recommendation(CSKG), which explicitly models spatiotemporal co-occurrences using common-sense knowledge from coarse-grained contexts. Specifically, we begin by constructing a spatiotemporal knowledge graph tailored to coarse-grained spatiotemporal contexts. Then we employ a learnable metagraph network that integrates common-sense information to filter and extract co-occurrences. CSKG evaluates the impact of coarsegrained spatiotemporal contexts on user behavior through the use of a knowledge graph convolutional network. Finally, we introduce joint learning to effectively learn representations. By conducting experiments on two real large-scale datasets,we achieve an average improvement of about 11.0% on two ranking metrics. The results clearly demonstrate that CSKG outperforms state-of-the-art baselines.
State-of-the-art recommender systems are increasingly focused on optimizing implementation efficiency, such as enabling on-device recommendations under memory constraints. Current methods commonly use lightweight embe...
详细信息
State-of-the-art recommender systems are increasingly focused on optimizing implementation efficiency, such as enabling on-device recommendations under memory constraints. Current methods commonly use lightweight embeddings for users and items or employ compact embeddings to enhance reusability and reduce memory usage. However, these approaches consider only the coarse-grained aspects of embeddings, overlooking subtle semantic nuances. This limitation results in an adversarial degradation of meta-embedding performance, impeding the system's ability to capture intricate relationships between users and items, leading to suboptimal recommendations. To address this, we propose a novel approach to efficiently learn meta-embeddings with varying grained and apply fine-grained meta-embeddings to strengthen the representation of their coarse-grained counterparts. Specifically, we introduce a recommender system based on a graph neural network, where each user and item is represented as a node. These nodes are directly connected to coarse-grained virtual nodes and indirectly linked to fine-grained virtual nodes, facilitating learning of multi-grained semantics. Fine-grained semantics are captured through sparse meta-embeddings, which dynamically balance embedding uniqueness and memory constraints. To ensure their sparseness, we rely on initialization methods such as sparse principal component analysis combined with a soft thresholding activation function. Moreover, we propose a weight-bridging update strategy that aligns coarse-grained meta-embedding with several fine-grained meta-embeddings based on the underlying semantic properties of users and items. Comprehensive experiments demonstrate that our method outperforms existing baselines. The code of our proposal is available at https://***/htyjers/C2F-MetaEmbed.
暂无评论