检索结果-内蒙古大学图书馆

7th International Conference on Advanced Algorithms and Control engineering, ICAACE 2024

作者： Wang, Shengwei Lyu, Jianhua Zhang, Baili School Of Software Southeast University Nanjing China College Of Computer Science And Engineering Southeast University Nanjing China

ISBN: (纸本)9798350361445

As a significant field within data mining, association rule mining plays a pivotal role in unveiling relationships between items within a dataset. Existing approaches in multivariate time series (MTS) association rule mining primarily emphasize the generation of association rules by combining features from different variables, but neglect to adequately consider the temporal relationship between these features and ignore the trend information of variables, resulting in an incomplete capture of the essential characteristics inherent in MTS data. In this paper, we introduce a novel framework for association rule mining in multivariate time series. First, we discretize the multivariate time series into the symbolic sequence using trend-based symbolic aggregate approximation(TSAX). Then, a rule mining method is introduced to discover association rules that consider the temporal relationship among symbols of different variables. The results of experiments demonstrate the discovery of significant rules within the 'Weather&Traffic' dataset which gives the traffic conditions in France depending on the weather. Further, we also provide the outcomes of the sensitivity analysis conducted on our method, illustrating that significant rules can be mined by adjusting the parameters of TSAX to different settings. The experimental results highlight the utility of our proposed framework in discovering temporal association rules within multivariate time series datasets. © 2024 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Motivating Users to Atend to Privacy: A Theory-Driven Design Study

Motivating Users to Atend to Privacy: A Theory-Driven Design...

引用

2024 ACM Designing Interactive Systems Conference, DIS 2024

作者： Shiri, Varun Xiong, Maggie Cheng, Jinghui Guo, Jin L.C. Department of Computer and Software Engineering Polytechnique Montreal MontrealQC Canada School of Computer Science McGill University MontrealQC Canada

ISBN: (纸本)9798400705830

In modern technology environments, raising users’ privacy awareness is crucial. Existing eforts largely focused on privacy policy presentation and failed to systematically address a radical challenge of user motivation for initiating privacy awareness. Leveraging the Protection Motivation Theory (PMT), we proposed design ideas and categories dedicated to motivating users to engage with privacy-related information. Using these design ideas, we created a conceptual prototype, enhancing the current App Store product page. Results from an online experiment and follow-up interviews showed that our design efectively motivated participants to attend to privacy issues, raising both the threat appraisal and coping appraisal, two main factors in PMT. Our work indicated that efective design should consider combining PMT components, calibrating information content, and integrating other design elements, such as visual cues and user familiarity. Overall, our study contributes valuable design considerations driven by the PMT to amplify the motivational aspect of privacy communication. © 2024 Copyright held by the owner/author(s).

关键词： Motivation

来源：评论

学校读者我要写书评

暂无评论

A survey for light field super-resolution

引用

High-Confidence Computing 2024年第1期4卷 118-129页

作者： Mingyuan Zhao Hao Sheng Da Yang Sizhe Wang Ruixuan Cong Zhenglong Cui Rongshan Chen Tun Wang Shuai Wang Yang Huang Jiahao Shen State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Key Laboratory of Data Science and Intelligent Computing International Innovation InstituteBeihang UniversityHangzhou 311115China State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China

Compared to 2D imaging data,the 4D light field(LF)data retains richer scene’s structure information,which can significantly improve the computer’s perception capability,including depth estimation,semantic segmentation,and LF ***,there is a contradiction between spatial and angular resolution during the LF image acquisition *** overcome the above problem,researchers have gradually focused on the light field super-resolution(LFSR).In the traditional solutions,researchers achieved the LFSR based on various optimization frameworks,such as Bayesian and Gaussian *** learning-based methods are more popular than conventional methods because they have better performance and more robust generalization *** this paper,the present approach can mainly divided into conventional methods and deep learning-based *** discuss these two branches in light field spatial super-resolution(LFSSR),light field angular super-resolution(LFASR),and light field spatial and angular super-resolution(LFSASR),***,this paper also introduces the primary public datasets and analyzes the performance of the prevalent approaches on these ***,we discuss the potential innovations of the LFSR to propose the progress of our research field.

关键词： Light field super-resolution Convolutional neural network Transformer Sub-aperture image Epipolar-plane image

来源：评论

学校读者我要写书评

暂无评论

Group Signature with Time-Bound Keys for Secure E-health Record Sharing

Group Signature with Time-Bound Keys for Secure E-health Rec...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Lu, Junze Hu, Chunqiang Ruan, Conghao Cai, Bin Xiang, Tao Chongqing University School of Big Data & Software Engineering China Chongqing University College of Computer Science China

ISBN: (纸本)9798350386226

With the advent of various mobile IoT devices, a large amount of e-health record (EHR) data has been generated. This data has great potential to improve medical research. However, there are many challenges regarding the sharing of medical data. Firstly, users are more inclined to interact anonymously. Secondly, verifying the validity of certificates in the case of anonymous interactions is challenging. In addition, it is necessary to uncover the identities of the actual interacting parties in the event of malicious behavior. Therefore, we address the above challenges and propose group signatures with time constraints to support anonymous and traceable EHR data sharing. First, we propose a group signature scheme that supports traceability. Second, to address the issue of validating anonymous certificates, we propose group signatures with time constraints that enable dynamic updates to validity. Through this, we can dynamically revoke group members. Lastly, security proofs and efficiency analyses demonstrate that our scheme is both secure and efficient. © 2024 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Unified Approach Integrating Machine Learning Algorithms for Detection of e-Mail Phishing Attacks 1

Unified Approach Integrating Machine Learning Algorithms for...

引用

1st International Conference on Computing, sciences and Communications, ICCSC 2024

作者： Mathur, Abeer Dubey, Abhinav Sudhakar Mahara, Pranav Singh Gandhi, Usha Devi School of Computer Science & Engineering Vellore Institute of Technology Department of Software Systems Vellore India School of Computer Science Engineering & Information Systems Vellore Institute of Technology Department of Information Technology Vellore India

ISBN: (纸本)9798350353648

With the ever-rising risk of phishing attacks, which capitalize on vulnerable human behavior in the contemporary digital space, requires new cybersecurity methods. This literary work contributes to the solution by novel incorporation of three techniques: Support Vector Machine (SVM), Natural Language Processing (NLP) and Random Forest (RF). Utilizing NLP for deep analysis of text in phishing e-mails, SVM for strong categorization and Random Forest's decision making by group helps in improving detection. This combination of language and pattern analysis along with group learning builds a fortified system. This approach differs from prior work on a variety of factors such as reliability, security, integrity, scalability, interpretability, transparency, and robustness. Thorough evaluation on a reliable dataset aimed to demonstrate the method's effectiveness, which resulted in 98.7 % of accuracy in detection. This majorly aims at showcasing the potential of ensemble techniques to combat against cyber-attacks like phishing for laying a strong foundation for a secure digital environment. © 2024 IEEE.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

Enhancing Topic Interpretability for Neural Topic Modeling Through Topic-Wise Contrastive Learning 40

Enhancing Topic Interpretability for Neural Topic Modeling T...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Gao, Xin Lin, Yang Li, Ruiqing Wang, Yasha Chu, Xu Ma, Xinyu Yu, Hailong Software Engineering Institution School of Computer Science Peking University Beijing China Key Lab of High Confidence Software Technologies Ministry of Education Beijing China Peking University National Engineering Research Center of Software Engineering Beijing China School of Computer Science Center on Frontiers of Computing Studies Peking University China

ISBN: (纸本)9798350317152

Data mining and knowledge discovery are essential aspects of extracting valuable insights from vast datasets. Neural topic models (NTMs) have emerged as a valuable unsupervised tool in this field. However, the predominant objective in NTMs, which aims to discover topics maximizing data likelihood, often lacks alignment with the central goals of data mining and knowledge discovery which is to reveal interpretable insights from large data repositories. Overemphasizing likelihood maximization without incorporating topic regularization can lead to an overly expansive latent space for topic modeling. In this paper, we present an innovative approach to NTMs that addresses this misalignment by introducing contrastive learning measures to assess topic interpretability. We propose a novel NTM framework, named ContraTopic, that integrates a differentiable regularizer capable of evaluating multiple facets of topic interpretability throughout the training process. Our regularizer adopts a unique topic-wise contrastive methodology, fostering both internal coherence within topics and clear external distinctions among them. Comprehensive experiments conducted on three diverse datasets demonstrate that our approach consistently produces topics with superior interpretability compared to state-of-the-art NTMs. © 2024 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Ma, Wenqiang Hau, Yaqing Yu, Hua Tong, Xiangrong Zhu, Zexuan Zhang, Qiang School of Computer Science and Technology Dalian University of Technology Dalian116024 China School of Computer and Control Engineering Yantai University Yantai264005 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

ISBN: (纸本)9798350308365

Deep neural networks are powerful and popular learning models;however, recent studies have shown that deep neural network-based policies are susceptible to deception by adversarial attacks. A minimalistic attack is a specialized form of adversarial attack that aims to accomplish successful attacks at the lowest possible cost. Recently, transfer optimization algorithms have been applied to deceive previously trained policies by acquiring knowledge from previously solved tasks. Experiments indicate that the transfer optimization algorithms perform well compared to traditional optimization algorithms. However, current transfer algorithms for addressing minimalistic attacks not only select a single source task for knowledge transfer but also tend to overly rely on identified appropriate source tasks. To address this issue, this paper introduces a similar locality based transfer evolutionary optimization algorithm. It can adaptively select multiple source tasks and extract valuable knowledge from these source tasks. Moreover, by leveraging the concept of similar locality, the algorithm alleviates its excessive dependence on familiar tasks, thereby providing fresh knowledge for the optimization of the target task. On this basis, the algorithm can mine more valuable knowledge from the large source task space to achieve a successful attack in a shorter period. The algorithm is tested on three Atari games-BeamRider, Qbert, and Seaquest-demonstrating its ability and potential to outperform other transfer optimization algorithms currently available in solving this problem. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Optimiser Training for GANs Based on Evolutionary Computation 13

Multi-Optimiser Training for GANs Based on Evolutionary Comp...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Zhang, Yixia Xue, Yu Neri, Ferrante School of Software Nanjing University of Information Science and Technology Nanjing China School of Computer Science and Electronic Engineering University of Surrey Guildford United Kingdom

ISBN: (纸本)9798350308365

Generative adversarial networks (GANs) are widely recognized for their impressive ability to generate realistic data. Despite the popularity of GANs, training them poses challenges such as mode collapse and instability. To address these issues, many variants enhance GAN performance through improvements in network architecture, modifications to loss functions, and the inclusion of regularization techniques. However, a limited number of methods focuses on optimising GAN performance from the optimiser's perspective, despite the distinct roles different optimisers play in training. Existing GANs typically employ a single optimiser throughout, with Adam being the default choice for GAN training. Approaches using multiple optimisers have shown improved performance but are often task-specific. This paper introduces a novel, portable approach that lever-ages the strengths of multiple training methods, with an evolutionary supervisor coordinating the training of different sections of the network. Initially, real-number-encoded vectors representing the optimiser for each sub-parameter layer undergo pro-gressive enhancement using a standard evolutionary algorithm (SGA). Through the evolutionary process, optimal optimiser combinations are retained based on the performance of the trained GAN. The proposed method, SGA-GANs, is validated on the CIFAR10 dataset by integrating the steps into five benchmark GAN models: GAN, DCGAN, BEGAN, WGAN, and WGAN-GP. Experimental results demonstrate that SGA-GANs outperforms single optimiser training methods, achieving superior evaluation results and generating higher-quality images. Source code can be found at https://***/lizzhang-spec/SGA-GANs. © 2024 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Region-adaptive Concept Aggregation for Few-shot Visual Recognition

引用

Machine Intelligence Research 2023年第4期20卷 554-568页

作者： Mengya Han Yibing Zhan Baosheng Yu Yong Luo Han Hu Bo Du Yonggang Wen Dacheng Tao School of Computer Science National Engineering Research Center for Multimedia SoftwareWuhan UniversityWuhan430072China Hubei Luojia Laboratory Wuhan430072China School of Computer Science The University of SydneySydney2006Australia JD Explore Academy Beijing101116China School of Information and Electronics Beijing Institute of TechnologyBeijing100081China School of Computer Science and Engineering Nanyang Technological UniversitySingapore639798Singapore

Few-shot learning (FSL) aims to learn novel concepts from very limited examples. However, most FSL methods suffer from the issue of lacking robustness in concept learning. Specifically, existing FSL methods usually ignore the diversity of region contents that may contain concept-irrelevant information such as the background, which would introduce bias/noise and degrade the performance of conceptual representation learning. To address the above-mentioned issue, we propose a novel metric-based FSL method termed region-adaptive concept aggregation network or RCA-Net. Specifically, we devise a region-adaptive concept aggregator (RCA) to model the relationships of different regions and capture the conceptual information in different regions, which are then integrated in a weighted average manner to obtain the conceptual representation. Consequently, robust concept learning can be achieved by focusing more on the concept-relevant information and less on the conceptual-irrelevant information. We perform extensive experiments on three popular visual recognition benchmarks to demonstrate the superiority of RCA-Net for robust few-shot learning. In particular, on the Caltech-UCSD Birds-200-2011 (CUB200) dataset, the proposed RCA-Net significantly improves 1-shot accuracy from 74.76% to 78.03% and 5-shot accuracy from 86.84% to 89.83% compared with the most competitive counterpart.

关键词： Few-shot learning metric-based meta learning concept learning region-adaptive concept-aggregation

来源：评论

学校读者我要写书评

暂无评论

Applying blockchain-based method to smart contract classification for CPS applications

引用

Digital Communications and Networks 2022年第6期8卷 964-975页

作者： Zigui Jiang Kai Chen Hailin Wen Zibin Zheng School of Software Engineering Sun Yat-Sen UniversityChina School of Mathematics Sun Yat-Sen UniversityChina School of Computer Science and Engineering Sun Yat-Sen UniversityChina

Smart contract has been the core of blockchain systems and other blockchain-based systems since Blockchain *** operations on blockchain are performed through the invocation and execution of smart *** leads to extensive combinations between blockchain,smart contract,Internet of Things(IoT)and Cyber-Physical System(CPS)applications,and then many blockchain-based IoT or CPS applications emerge to provide multiple benefits to the economy and *** this case,obtaining a better understanding of smart contracts will contribute to the easier operation,higher efficiency and stronger security of those blockchain-based systems and *** existing studies on smart contract analysis are based on similarity calculation and smart contract ***,smart contract is a piece of code with special characteristics and most of smart contracts are stored without any category labels,which leads to difficulties of smart contract *** the back end of a blockchain-based Decentralized Application(DApp)is one or several smart contracts,DApps with labeled categories and open source codes are applied to achieve a supervised smart contract classification.A three-phase approach is proposed to categorize DApps based on various data *** this approach,5,659 DApps with smart contract source codes and pre-tagged categories are first obtained based on massive collected DApps and smart contracts from Ethereum,State of the DApps and *** feature extraction and construction methods are designed to form multi-feature vectors that could present the major characteristics of ***,a fused classification model consisting of KNN,XGBoost and random forests is applied to the multi-feature vectors of all DApps for performing DApp *** experimental results show that the method is *** addition,some positive correlations between feature variables and categories,as well as several user behavior patterns of DAp

关键词： Blockchain Blockchain-based application Smart contract DApP classification Solidity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：