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

8th IEEE International Conference on Computer and Communications, ICCC 2022

作者： Zheng, Dawen Wang, Lusheng Kai, Caihong Peng, Min Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781665450515

Service robots play an increasingly important role in people's daily life. The density of pedestrians is large and the movement is irregular in pedestrian-robot mixed traffic flows. Robots are prone to collision with pedestrians, and the tasks to be offloaded are closely related to pedestrians. How to analyze the tasks of robots and select the appropriate roadside unit is an important issue. In this paper, the social force model is used to predict the positions of pedestrians and robots, taking into account the influence of various forces to avoid collisions. A task offloading resource optimization algorithm with position prediction is proposed. According to the predicted information, the size and position distribution of all tasks in the scenario are obtained, and then the neural network trained beforehand based on deep Q-Iearning is used to generate a task offloading strategy. The simulation results show that the running time of the proposed algorithm is very short, and the resource allocation required for task offloading is completed in advance based on the predicted information before robots arriving the corresponding positions. Besides, the algorithm significantly reduces the task offloading delay. © 2022 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Skeleton-Based Action Recognition Using Graph Convolutional Network with Pose Correction and Channel Topology Refinement

引用

Computers, Materials & Continua 2025年第4期83卷 701-718页

作者： Yuxin Gao Xiaodong Duan Qiguo Dai School of Engineering Guangzhou College of Technology and BusinessFoshan528138China School of Computer Science and Engineering Dalian Minzu UniversityDalian116000China SEAC key Laboratory of Big Data Applied Technology Dalian Minzu UniversityDalian116000China

Graph convolutional network(GCN)as an essential tool in human action recognition tasks have achieved excellent performance in previous ***,most current skeleton-based action recognition using GCN methods use a shared topology,which cannot flexibly adapt to the diverse correlations between joints under different motion *** video-shooting angle or the occlusion of the body parts may bring about errors when extracting the human pose coordinates with estimation *** this work,we propose a novel graph convolutional learning framework,called PCCTR-GCN,which integrates pose correction and channel topology refinement for skeleton-based human action ***,a pose correction module(PCM)is introduced,which corrects the pose coordinates of the input network to reduce the error in pose feature ***,channel topology refinement graph convolution(CTR-GC)is employed,which can dynamically learn the topology features and aggregate joint features in different channel dimensions so as to enhance the performance of graph convolution networks in feature ***,considering that the joint stream and bone stream of skeleton data and their dynamic information are also important for distinguishing different actions,we employ a multi-stream data fusion approach to improve the network’s recognition *** evaluate the model using top-1 and top-5 classification *** the benchmark datasets iMiGUE and Kinetics,the top-1 classification accuracy reaches 55.08%and 36.5%,respectively,while the top-5 classification accuracy reaches 89.98%and 59.2%,*** the NTU dataset,for the two benchmark RGB+Dsettings(X-Sub and X-View),the classification accuracy achieves 89.7%and 95.4%,respectively.

关键词： Pose correction multi-stream fusion GCN action recognition

来源：评论

学校读者我要写书评

暂无评论

Partial Label Feature Selection: An Adaptive Approach

引用

IEEE Transactions on knowledge and data engineering 2024年第8期36卷 4178-4191页

作者： Zan Zhang Jialu Yao Lin Liu Jiuyong Li Lei Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei Anhui China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei Anhui China UniSA STEM University of South Australia Adelaide SA Australia Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei Anhui China

As an emerging weakly supervised learning framework, partial label learning aims to induce a multi-class classifier from ambiguous supervision information where each training example is associated with a set of candidate labels, among which only one is the true label. Traditional feature selection methods, either for single label and multiple label problems, are not applicable to partial label learning as the ambiguous information contained in the label space obfuscates the importance of features and misleads the selection process. This makes the selection of a proper feature subset from partial label examples particularly challenging, and therefore has rarely been investigated. In this paper, we propose a novel feature selection algorithm for partial label learning, named PLFS, which considers not only the relationships between features and labels, but also exploits the relationships between instances to select the most informative and important features to enhance the performance of partial label learning. PLFS constructs an adaptive weighted graph to exploit the similarity information among instances, differentiate the label space and weight the feature space, which leads to the selection of a proper feature subset. Extensive experiments over a broad range of benchmark data sets clearly validate the effectiveness of our proposed feature selection approach.

关键词： Feature extraction Supervised learning Training knowledge engineering Labeling Classification algorithms big data

来源：评论

学校读者我要写书评

暂无评论

Combining permissioned blockchain and Bayesian best-worst method for transparent supplier selection in supply chain management

引用

Science China(Technological Sciences) 2024年第8期67卷 2579-2593页

作者： LIU JiaJun ZHANG Jie LENG JieWu Shanghai Engineering Research Center of Industrial Big Data and Intelligent System Institute of Artificial IntelligenceDonghua UniversityShanghai 201620China State Key Laboratory of Precision Electronic Manufacturing Technology and Equipment Guangdong University of TechnologyGuangzhou 510006China

Supplier selection is an important business activity in order to realize the purchasing function in supply chain *** supplier selection process includes four stages,i.e.,bidding inviting,bidding,group decision-making,and results disclosure,involving the participation of manufacturing service demanders(MSDs),manufacturing service suppliers(MSSs),and ***,all the participants have raised concerns about the increased transparency in supplier ***,this study proposes a transparent supplier selection method by considering the engagement of *** this method,the Bayesian best-worst method(Bayesian BWM)is used to aggregate decision-makers'preferences into the overall optimal weights of the alternative MSSs,and the MSS with the largest weight is considered the suitable MSS for ***,blockchain is introduced to record the decision-making process information about supplier selection through a customized smart contract,where MSSs act as supervisors to supervise the decision-making process through the distributed consensus mechanism rather than directly participate in the decision-making ***,a case study of supplier selection in purchasing vibration acceleration sensors is *** result shows that the proposed method can support MSDs in selecting suitable MSS from alternative MSSs by aggregating decision-makers'preferences,and blockchain can provide credible information about the supplier selection process for MSSs,MSDs,and *** this way,the transparency of supplier selection is enhanced.

关键词： blockchain supplier selection supply chain transparency Bayesian BWM group decision-making

来源：评论

学校读者我要写书评

暂无评论

Accelerating local SGD for non-IID data using variance reduction

引用

Frontiers of Computer Science 2023年第2期17卷 73-89页

作者： Xianfeng LIANG Shuheng SHEN Enhong CHEN Jinchang LIU Qi LIU Yifei CHENG Zhen PAN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230027China Ant Financial Services Group Hangzhou 310000China Department of Computer Science and Engineering Hong Kong University of Science and TechnologyHong Kong 999077China

Distributed stochastic gradient descent and its variants have been widely adopted in the training of machine learning models,which apply multiple workers in *** them,local-based algorithms,including Local SGD and FedAvg,have gained much attention due to their superior properties,such as low communication cost and ***,when the data distribution on workers is non-identical,local-based algorithms would encounter a significant degradation in the convergence *** this paper,we propose Variance Reduced Local SGD(VRL-SGD)to deal with the heterogeneous *** extra communication cost,VRL-SGD can reduce the gradient variance among workers caused by the heterogeneous data,and thus it prevents local-based algorithms from slow convergence ***,we present VRL-SGD-W with an effectivewarm-up mechanism for the scenarios,where the data among workers are quite *** from eliminating the impact of such heterogeneous data,we theoretically prove that VRL-SGD achieves a linear iteration speedup with lower communication complexity even if workers access non-identical *** conduct experiments on three machine learning *** experimental results demonstrate that VRL-SGD performs impressively better than Local SGD for the heterogeneous data and VRL-SGD-W is much robust under high data variance among workers.

关键词： distributed optimization variance reduction local SGD federated learning non-IID data

来源：评论

学校读者我要写书评

暂无评论

Short Text Topic Modeling Techniques, Applications, and Performance: A Survey

引用

IEEE Transactions on knowledge and data engineering 2022年第3期34卷 1427-1445页

作者： Qiang, Jipeng Qian, Zhenyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou University Jiangsu225009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230026 China Mininglamp Academy of Sciences Minininglamp Beijing China

Analyzing short texts infers discriminative and coherent latent topics that is a critical and fundamental task since many real-world applications require semantic understanding of short texts. Traditional long text topic modeling algorithms (e.g., PLSA and LDA) based on word co-occurrences cannot solve this problem very well since only very limited word co-occurrence information is available in short texts. Therefore, short text topic modeling has already attracted much attention from the machine learning research community in recent years, which aims at overcoming the problem of sparseness in short texts. In this survey, we conduct a comprehensive review of various short text topic modeling techniques proposed in the literature. We present three categories of methods based on Dirichlet multinomial mixture, global word co-occurrences, and self-aggregation, with example of representative approaches in each category and analysis of their performance on various tasks. We develop the first comprehensive open-source library, called STTM, for use in Java that integrates all surveyed algorithms within a unified interface, benchmark datasets, to facilitate the expansion of new methods in this research field. Finally, we evaluate these state-of-the-art methods on many real-world datasets and compare their performance against one another and versus long text topic modeling algorithm. © 2020 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Ensemble Learning Based Employment Recommendation Under Interaction Sparsity for College Students 9th

Ensemble Learning Based Employment Recommendation Under Inte...

引用

19th International Conference on Advanced data Mining and Applications, ADMA 2023

作者： Zhu, Haiping Zhao, Yifei Wu, Yuchen Chen, Yan Li, Wenhao Zheng, Qinghua Tian, Feng Department of Computer Science and Technology Xi’an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an China

ISBN: (纸本)9783031466632

Recommendation systems play a crucial role in helping college students find job opportunities. However, the sparsity of interactions in employment recommendation for college students poses a challenge for models based on historical user preferences. To address this issue, we propose a novel model called Ensemble Learning based Employment Recommendation under Interaction Sparsity for College Students (EERIS). The model comprises two components: a similarity information component that uses pooled users to determine the nearest neighbor in user similarity measurement, and a global interaction component that uses interaction vectors of user groups to enhance interactions. To evaluate the missing interactions, we propose a loss function called CellLoss. These components are combined based on ensemble learning to improve the model’s generalization and scalability. Our experiments on two real-world datasets demonstrate the superior performance of the EERIS model. Ablation experiments further confirm that each component positively contributes to the model’s performance. Additionally, we design a revised metric for better model testing. Overall, the proposed EERIS model effectively addresses the interaction sparsity in employment recommendation for college students and provides satisfactory recommendations to students. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

An Extended-Isomap for high-dimensional data accuracy and efficiency: a comprehensive survey

引用

Multimedia Tools and Applications 2024年第38期83卷 85523-85574页

作者： Yousaf, Mahwish Shakoor Khan, Muhammad Saadat Ullah, Shamsher Institute of Intelligence Machine Hefei Institutes of Physical Science Chinese Academy of Sciences Anhui Hefei230027 China Key Laboratory of Materials Physics Institute of Solid-State Physics Chinese Academy of Sciences Anhui Hefei230027 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen518060 China

Manifold learning is a widely adopted nonlinear dimensionality reduction technique employed to discover low-dimensional representations from high-dimensional data and to explore the intrinsic data structure. It encompasses a range of nonlinear techniques, including Isomap, Local Linear Embedding (LLE), Local Tangent Space Alignment (LTSA), and Multidimensional Scaling (MDS), among others. Isomap, as a popular method in manifold learning, has exhibited promising results. However, it encounters several challenges, such as the Topological Stability Problem, Shortest Path Distance, and noise sensitivity, which compromise its accuracy and elevate its computational demands. This survey paper presents three novel existing approaches to address these challenges and enhance the performance of Isomap. Firstly, the FastIsomap method, an existing approach that combines state-of-the-art algorithms like the KD tree and NN-descent to increase graph accuracy while reducing computational cost. Secondly, the FastIsomapVis method, also an existing technique, employs a hierarchical divide-and-conquer strategy employing the KD tree and Dijkstra Buckets Double, which enhances accuracy and reduces computational time in Isomap. Lastly, the NR-Isomap method, another existing approach, used the Local Tangent Space Alignment algorithm to remove noise sensitivity and short-circuit edge problems. The existing methods improve the accuracy of Isomap but also streamline its computational requirements. Furthermore, this survey paper discusses the open issues and future research directions for Isomap and manifold learning methods. It can be a valuable resource for researchers seeking insights across diverse domains. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Fake Face Detection Based on Fusion of Spatial Texture and High-Frequency Noise

引用

Chinese Journal of Electronics 2025年第1期34卷 212-221页

作者： Dengyong Zhang Feifan Qi Jiahao Chen Jiaxin Chen Rongrong Gong Yuehong Tian Lebing Zhang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Changsha University of Science and Technology School of Computer and Communication Engineering Changsha University of Science and Technology Changsha Social Work College Changkuangao Beijing Technology Co. Ltd. School of Computer and Artificial Intelligence Huaihua University

The rapid development of the Internet has led to the widespread dissemination of manipulated facial images, significantly impacting people's daily lives. With the continuous advancement of Deepfake technology, the generated counterfeit facial images have become increasingly challenging to distinguish. There is an urgent need for a more robust and convincing detection method. Current detection methods mainly operate in the spatial domain and transform the spatial domain into other domains for analysis. With the emergence of transformers, some researchers have also combined traditional convolutional networks with transformers for detection. This paper explores the artifacts left by Deepfakes in various domains and, based on this exploration, proposes a detection method that utilizes the steganalysis rich model to extract high-frequency noise to complement spatial features. We have designed two main modules to fully leverage the interaction between these two aspects based on traditional convolutional neural networks. The first is the multi-scale mixed feature attention module, which introduces artifacts from high-frequency noise into spatial textures, thereby enhancing the model's learning of spatial texture features. The second is the multi-scale channel attention module, which reduces the impact of background noise by weighting the features. Our proposed method was experimentally evaluated on mainstream datasets, and a significant amount of experimental results demonstrate the effectiveness of our approach in detecting Deepfake forged faces, outperforming the majority of existing methods.

关键词： Deepfakes Adaptation models Attention mechanisms Noise Transforms Transformers Feature extraction Internet Convolutional neural networks Faces

来源：评论

学校读者我要写书评

暂无评论

Bit-mask Robust Contrastive knowledge Distillation for Unsupervised Semantic Hashing 24

Bit-mask Robust Contrastive Knowledge Distillation for Unsup...

引用

33rd ACM Web Conference, WWW 2024

作者： He, Liyang Huang, Zhenya Liu, Jiayu Chen, Enhong Wang, Fei Sha, Jing Wang, Shijin School of Computer Science and Technology University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China School of Data Science University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China State Key Laboratory of Cognitive Intelligence Hefei China

ISBN: (纸本)9798400701719

Unsupervised semantic hashing has emerged as an indispensable technique for fast image search, which aims to convert images into binary hash codes without relying on labels. Recent advancements in the field demonstrate that employing large-scale backbones (e.g., ViT) in unsupervised semantic hashing models can yield substantial improvements. However, the inference delay has become increasingly difficult to overlook. knowledge distillation provides a means for practical model compression to alleviate this delay. Nevertheless, the prevailing knowledge distillation approaches are not explicitly designed for semantic hashing. They ignore the unique search paradigm of semantic hashing, the inherent necessities of the distillation process, and the property of hash codes. In this paper, we propose an innovative Bit-mask Robust Contrastive knowledge Distillation (BRCD) method, specifically devised for the distillation of semantic hashing models. To ensure the effectiveness of two kinds of search paradigms in the context of semantic hashing, BRCD first aligns the semantic spaces between the teacher and student models through a contrastive knowledge distillation objective. Additionally, to eliminate noisy augmentations and ensure robust optimization, a cluster-based method within the knowledge distillation process is introduced. Furthermore, through a bit-level analysis, we uncover the presence of redundancy bits resulting from the bit independence property. To mitigate these effects, we introduce a bit mask mechanism in our knowledge distillation objective. Finally, extensive experiments not only showcase the noteworthy performance of our BRCD method in comparison to other knowledge distillation methods but also substantiate the generality of our methods across diverse semantic hashing models and backbones. The code for BRCD is available at https://***/hly1998/BRCD. © 2024 Owner/Author.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：