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

arXiv 2020年

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Oliver The School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China The Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Real data often appear in the form of multiple incomplete views. Incomplete multi-view clustering is an effective method to integrate these incomplete views. Previous methods only learn the consistent information between different views and ignore the unique information of each view, which limits their clustering performance and generalizations. To overcome this limitation, we propose a novel View Variation and View Heredity approach (V3H). Inspired by the variation and the heredity in genetics, V3H first decomposes each subspace into a variation matrix for the corresponding view and a heredity matrix for all the views to represent the unique information and the consistent information respectively. Then, by aligning different views based on their cluster indicator matrices, V3H integrates the unique information from different views to improve the clustering performance. Finally, with the help of the adjustable low-rank representation based on the heredity matrix, V3H recovers the underlying true data structure to reduce the influence of the large incompleteness. More importantly, V3H presents possibly the first work to introduce genetics to clustering algorithms for learning simultaneously the consistent information and the unique information from incomplete multi-view data. Extensive experimental results on fifteen benchmark datasets validate its superiority over other state-of-the-arts. Impact Statement—Incomplete multi-view clustering is a popular technology to cluster incomplete datasets from multiple sources. The technology is becoming more significant due to the absence of the expensive requirement of labeling these datasets. However, previous algorithms cannot fully learn the information of each view. Inspired by variation and heredity in genetics, our proposed algorithm V3H fully learns the information of each view. Compared with the state-of-the-art algorithms, V3H improves clustering performance by more than 20% in representative cases. With the large impr

关键词： Chromosomes

来源：评论

学校读者我要写书评

暂无评论

Message Authentication with a New Quantum Hash Function

引用

computers, Materials & Continua 2019年第5期59卷 635-648页

作者： Yalan Wang Yuling Chen Haseeb Ahmad Zhanhong Wei GuiZhou University State Key Laboratory of Public Big DataGuiZhou Guiyang550025China Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijing100876China Department of Computer Science National Textile University Faisalabad37610Pakistan College of Information Engineering Beijing Institute of Petrochemical TechnologyBeijing102617China

To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various ***,with the computing power improving,the existing encryption and authentication schemes are being faced with big *** take the message authentication as an example into a careful ***,we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication ***,the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values,which ensures that the initial message can resist eavesdropping ***,utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties,such as one-wayness,resisting different collisions and easy *** on these two points,the message authentication scheme can be much more secure than previous ***,it is a new way to design the message authentication scheme,which provides a new thought for other researchers in the *** works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future.

关键词： Message authentication symmetric encryption quantum Hash function quantum walk

来源：评论

学校读者我要写书评

暂无评论

Correction to: Framework for automatically suggesting remedial actions to help students at risk based on explainable ML and rulebased models

引用

International Journal of Educational Technology in Higher Education 2022年第1期19卷 1-1页

作者： Albreiki, Balqis Habuza, Tetiana Zaki, Nazar Department of Computer Science and Software Engineering College of Information Technology UAE University Al Ain UAE Office of Institutional Effectiveness UAE University Al Ain UAE Big Data Analytics Center (BIDAC) UAE University Al Ain UAE

来源：评论

学校读者我要写书评

暂无评论

Weighted Linear Multiple Kernel Learning for Saliency Detection 2nd

Weighted Linear Multiple Kernel Learning for Saliency Detect...

引用

2nd EAI International Conference on Robotic Sensor Networks, ROSENET 2018

作者： Zhou, Quan Wu, Jinwen Fan, Yawen Zhang, Suofei Wu, Xiaofu Zheng, Baoyu Jin, Xin Lu, Huimin Latecki, Longin Jan National Engineering Research Center of Communications and Networking Nanjing University of Posts and Telecommunications Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Information Engineering China University of Geosciences Wuhan China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing China National Engineering Research Center of Communications and Networking Nanjing University of Posts and Telecommunications Nanjing China Department of Cyber Security Beijing Electronic Science and Technology Institute Beijing China CETC Big Data Research Institute Co. Ltd. Guizhou Guiyang China Department of Mechanical and Control Engineering Kyushu Institute of Technology Kitakyushu Japan Department of Computer and Information Sciences Temple University PhiladelphiaPA United States

ISBN: (纸本)9783030177621

This paper presents a novel saliency detection method based on weighted linear multiple kernel learning (WLMKL), which is able to adaptively combine different contrast measurements in a supervised manner. Three commonly used bottom-up visual saliency operations are first introduced, including corner-surround contrast (CSC), center-surround contrast (CESC), and global contrast (GC). Then these contrast measures are fed into our WLMKL framework to produce the final saliency map. We show that the assigned weights for each contrast feature maps are always normalized in our WLMKL formulation. In addition, the proposed approach benefits from the advantages of the contribution of each individual contrast operation, and thus produces more robust and accurate saliency maps. The extensive experimental results show the effectiveness of the proposed model, and demonstrate the combination is superior to individual subcomponent. © 2020, Springer Science and Business Media Deutschland GmbH. All rights reserved.

关键词： center-surround contrast Corner-surround contrast Global contrast Multiple kernel learning Saliency detection

来源：评论

学校读者我要写书评

暂无评论

The role of usability on e-learning user interactions and satisfaction: a literature review

引用

Journal of Systems and Information Technology 2019年第3期21卷 368-394页

作者： Gunesekera, Asela Indunil Bao, Yukun Kibelloh, Mboni Center for Modern Information Managment Huazhong University of Science and Technology Wuhan China Center for Big Data Analytics Jiangxi University of Engineering Xinyu China Faculty of Arts and Social Science Tumaini University Makumira – Dar es Salaam College Dar es Salaam Tanzania United Republic of Department of Computer Science General Sir John Kotelawala Defence University Ratmalana Sri Lanka

Purpose: The purpose of this study is to review the effect of usability factors on e-learning user relationships, namely, student–student interaction (SSI), student–instructor interaction (SII) and student–content interaction (SCI), in the existing e-learning literature. Further, this study intended to identify whether usability contributes to the satisfaction of e-learners. Design/methodology/approach: This study has undertaken a systematic review using the PRISMA methodology to filter the literature in the domain of e-learning with respect to usability concerns using six databases. An analytical framework has been formulated to evaluate the literature against different dimensions of interactions and usability. Findings: Results reveal that while SSI has grabbed 71.4 per cent research attention with respect to usability factors of e-learning systems, SCI has been given the least focus, i.e. 26.6 per cent. According to the results, e-learning systems’ usability issues influence the user relationships and affect the user satisfaction, which will lead to lack of user continuity. Practical implications: The findings of this review will provide insights to instructional designers to construct more satisfied learning content for the users. The analysis framework of this study will encourage researchers to drive future research in e-learning along with the concern of usability. Originality/value: This research emphasizes on the importance of SCI to focus future e-learning research on a different angle, in addition to SSI and SII. The analysis framework of this study will provide different dimensions, specifically for the empirical research in the domain of e-learning. © 2019, Emerald Publishing Limited.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Dynamical multiple polynomial-based neural networks classifier realized with the aid of dropfilter and dual statistical selection

引用

engineering Applications of Artificial Intelligence 2025年 157卷

作者： Zhen Wang Sung-Kwun Oh Zunwei Fu Seok-Beom Roh Witold Pedrycz Research Center for Big Data and Artificial Intelligence Linyi University Linyi 276005 China School of Automation and Electrical Engineering Linyi University Linyi 276005 Shandong China School of Electrical & Electronic Engineering The University of Suwon 17 Wauan-gil Bongdam-eup Hwaseong-si Gyeonggi-do 18323 South Korea Department of Electronic Engineering Seokyeong University Seoul 02713 South Korea Department of Computer Science The University of Suwon 17 Wauan-gil Bongdam-eup Hwaseong-si Gyeonggi-do 18323 South Korea Department of Electrical and Computer Engineering University of Alberta Edmonton AB T6G 2R3 Canada Systems Research Institute Polish Academy of Sciences 00-901 Warsaw Poland Department of Computer Engineering Faculty of Engineering and Natural Sciences Istinye University Sariyer Istanbul Turkiye

Polynomial neural networks (PNN) have emerged as an effective regression modeling methodology in computational intelligence, relying on its interpretable polynomial nodes to fit complex nonlinear data relationships and the adaptive nature of self-organizing networks. To break the bottleneck of PNN structure in the field of multi-classification, this study designs a dynamical multiple polynomial-based neural networks (DMPNN) classifier, focusing on developing a flexible polynomial network classification methodology that enhances predictive capabilities without sacrificing the advantages of PNN structures. Our approach effectively addresses the challenges of multi-class classification with uncertain class boundaries and reduces computational complexity, which is achieved through the synergy of several proposed techniques. Three key issues underpin the proposed DMPNN: (a) The integration of PNN regression models using the one-against-all strategy can provide effective and scalable solutions to multi-class classification problems, especially for uncertain class boundary issues. (b) The dual statistical selection (DSS) approach aims to eliminate redundant inputs during data processing, reduce the computational burden, and increase the variety of neural network nodes in the model neuron selection stage. (c) The synergy of regularization methods including the ℓ2 norm-based method (ℓ2-LSM) and the DropFilter, is exploited to mitigate potential overfitting in coefficient estimation and enhance the generalization capabilities of the proposed classifier. A series of ablation experiments and parameter analysis were conducted to demonstrate the stability and reliability of the proposed model. Then, we applied DMPNN to 17 publicly available datasets and two engineering applications: Recycling of black plastic wastes and phased resolved partial discharge. The performance results show that the DMPNN model outperforms five classical classifiers and four state-of-the-art (SOTA) class

关键词：

来源：评论

学校读者我要写书评

暂无评论

On-edge multi-task transfer learning: Model and practice with data-driven task allocation

arXiv

引用

arXiv 2021年

作者： Zheng, Zimu Chen, Qiong Hu, Chuang Wang, Dan Liu, Fangming The National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China The Edge Cloud Innovation Lab. Technical Innovation Department Cloud BU Huawei Technologies Co. Ltd. Shenzhen China The Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Hong Kong

On edge devices, data scarcity occurs as a common problem where transfer learning serves as a widely-suggested remedy. Nevertheless, transfer learning imposes heavy computation burden to the resource-constrained edge devices. Existing task allocation works usually assume all submitted tasks are equally important, leading to inefficient resource allocation at a task level when directly applied in Multi-task Transfer Learning (MTL). To address these issues, we first reveal that it is crucial to measure the impact of tasks on overall decision performance improvement and quantify task importance. We then show that task allocation with task importance for MTL (TATIM) is a variant of NP-complete Knapsack problem, where the complicated computation to solve this problem needs to be conducted repeatedly under varying contexts. To solve TATIM with high computational efficiency, we propose a data-driven Cooperative Task Allocation (DCTA) approach. Finally, we evaluate the performance of DCTA by not only a trace-driven simulation, but also a new comprehensive real-world AIOps case study which bridges model and practice via a new architecture and main components design within AIOps system. Extensive experiments show that our DCTA reduces 3.24 times of processing time, and saves 48.4% energy consumption compared with the state-of-the-art when solving TATIM. Copyright © 2021, The Authors. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Adaptive gradient methods with dynamic bound of learning rate 7

Adaptive gradient methods with dynamic bound of learning rat...

引用

7th International Conference on Learning Representations, ICLR 2019

作者： Luo, Liangchen Xiong, Yuanhao Liu, Yan Sun, Xu MOE Key Lab of Computational Linguistics School of EECS Peking University China College of Information Science and Electronic Engineering Zhejiang University China Department of Computer Science University of Southern California United States Center for Data Science Beijing Institute of Big Data Research Peking University China

Adaptive optimization methods such as ADAGRAD, RMSPROP and ADAM have been proposed to achieve a rapid training process with an element-wise scaling term on learning rates. Though prevailing, they are observed to generalize poorly compared with SGD or even fail to converge due to unstable and extreme learning rates. Recent work has put forward some algorithms such as AMSGRAD to tackle this issue but they failed to achieve considerable improvement over existing methods. In our paper, we demonstrate that extreme learning rates can lead to poor performance. We provide new variants of ADAM and AMSGRAD, called ADABOUND and AMSBOUND respectively, which employ dynamic bounds on learning rates to achieve a gradual and smooth transition from adaptive methods to SGD and give a theoretical proof of convergence. We further conduct experiments on various popular tasks and models, which is often insufficient in previous work. Experimental results show that new variants can eliminate the generalization gap between adaptive methods and SGD and maintain higher learning speed early in training at the same time. Moreover, they can bring significant improvement over their prototypes, especially on complex deep networks. The implementation of the algorithm can be found at https://***/Luolc/AdaBound. © 7th International Conference on Learning Representations, ICLR 2019. All Rights Reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

Deep Learning to Improve Heart Disease Risk Prediction 1st

Deep Learning to Improve Heart Disease Risk Prediction

引用

1st International Workshop on Machine Learning and Medical engineering for Cardiovasvular Healthcare, MLMECH 2019, and the 8th International Joint Workshops on Computing and Visualization for Intravascular Imaging and computer Assisted Stenting, CVII-STENT 2019, held in conjunction with 22nd International Conference on Medical Image Computing and computer-Assisted Intervention, MICCAI 2019

作者： Sajeev, Shelda Maeder, Anthony Champion, Stephanie Beleigoli, Alline Ton, Cheng Kong, Xianglong Shu, Minglei Flinders Digital Health Research Centre School of Nursing and Health Sciences Flinders University Adelaide Australia Department of Big Data Engineering Technology Research Center of E-Government JinanShandong China Shandong Computer Science Center Shandong Provincial Key Laboratory of Computer Networks Qilu University of Technology Jinan China

ISBN: (纸本)9783030333263

Disease prediction based on modeling the correlations between compounded indicator factors is a widely used technique in high incidence chronic disease prevention diagnosis. Predictive models based on personal health information have been developed historically by using simple regression fitting over relatively few factors. Regression approaches have been favored in previous prediction modeling approaches because they are simplest and do not assume any non-linearity in the model for contributions of the chosen factors. In practice, many factors are correlated and have underlying non-linear relationships to the predicted outcome. Deep learning offers a means to construct a more complex modeling approach, along with automation and adaptation. The aim of this paper is to assess the ability of a deep learning model to predict the heart disease incidence using a common benchmark dataset (University of California, Irvine (UCI) dataset). The performance of deep learning model has been compared with four popular machine learning models (two linear and two nonlinear) in predicting the incidence of heart disease using data from 567 participants from two cohorts taken from UCI database. The deep learning model was able to achieve the best accuracy of 94% and an AUC score of 0.964 when compared to other models. The performance of deep learning and nonlinear machine learning models was significantly better compared to the linear machine learning models with increase in the dataset size. © 2019, Springer Nature Switzerland AG.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：