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

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Sun, Weimin Xu, Jieping Yang, Gang Key Lab of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783030678319

Although zero-shot learning (ZSL) has achieved success in recognizing unseen classes images, most previous studies focus on feature projection from one domain to another, neglecting the domain shift problem caused by differences in classes. In this paper, we propose two novel methods in terms of attributes and features for ZSL problem. The first is Sample-Level Attribute Generation via GAN (SLA-GAN) that generates sample-level attributes. Considering the influence of lighting, environment, weather and other factors, the description based on class-level attributes will be biased. SLA-GAN generates sample-level attributes to describe each sample. Specially, we train a conditional Wasserstein GAN in which the generator synthesizes sample-level attributes from features and the discriminator distinguishes the sample-level from class-level attributes. Apart from that, we propose a novel method Fine-Grained Sample Generation via GAN (FGS-GAN) which can generate the unseen samples from the most similar samples of seen classes. Finally, we replace the class-level attributes with sample-level attributes in FGS-GAN and analyze the effects of sample-level attributes on synthesized features. Experiments on five benchmark data set show that our models outperform state-of-the-art methods in ZSL. © 2021, Springer Nature Switzerland AG.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

UniSleepPos: Sleep Posture Identification System Utilizing Millimeter-wave Radar

UniSleepPos: Sleep Posture Identification System Utilizing M...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Kun Li, Min He, Chu Tian, Xu Mao, Junbin Zeng, Min Liu, Jin Xinjiang University Xinjiang Engineering Research Center of Big Data and Intelligent Software School of Software Urumqi China Central South University Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Changsha China

ISBN: (纸本)9798350386226

Sleep posture identification is crucial for accurately assessing sleep quality and diagnosing related diseases. In the realm of non-intrusive sleep monitoring, non-contact technologies are becoming increasingly mainstream. Millimeter-wave radar is frequently utilized in sleep posture identification due to its high resolution, strong penetration, and excellent sensitivity. However, traditional radar-based methods for sleep posture identification often struggle with reliability when dealing with diverse individuals and complex sleep environments. To address these challenges, we propose UniSleepPos, which designs a novel dual-view fusion mechanism to integrate depression and elevation angle signals obtained from radar, thus accurately capturing the posture information of the monitored subject in three-dimensional space. Furthermore, we combine sleep posture identification with individual characteristics, utilizing existing individual labels as prior knowledge to assist in sleep posture identification. The integration of prior knowledge provides a valuable information source for the model, helping to enhance its understanding of the data and improve its performance. We collected sleep posture data from eight volunteers using millimeter-wave radar devices under various environmental conditions. Leave-one-subject-out experiments were conducted to validate the effectiveness of UniSleepPos. The results indicated that UniSleepPos significantly outperforms existing methods, demonstrating its potential for practical applications. © 2024 IEEE.

关键词： Sleep research

来源：评论

学校读者我要写书评

暂无评论

Superclass Learning with Representation Enhancement

Superclass Learning with Representation Enhancement

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Zeyu Gan Suyun Zhao Jinlong Kang Liyuan Shang Hong Chen Cuiping Li Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing China Renmin University of China Beijing China

In many real scenarios, data are often divided into a handful of artificial super categories in terms of expert knowledge rather than the representations of images. Concretely, a superclass may contain massive and various raw categories, such as refuse sorting. Due to the lack of common semantic features, the existing classification techniques are intractable to recognize superclass without raw class labels, thus they suffer severe performance damage or require huge annotation costs. To narrow this gap, this paper proposes a superclass learning framework, called SuperClass Learning with Representation Enhancement(SCLRE), to recognize super categories by leveraging enhanced representation. Specifically, by exploiting the self-attention technique across the batch, SCLRE collapses the boundaries of those raw categories and enhances the representation of each superclass. On the enhanced representation space, a superclassaware decision boundary is then reconstructed. Theoretically, we prove that by leveraging attention techniques the generalization error of SCLRE can be bounded under superclass scenarios. Experimentally, extensive results demonstrate that SCLRE outperforms the baseline and other contrastive-based methods on CIFAR-100 datasets and four high-resolution datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

KAN v.s. MLP for Offline Reinforcement Learning

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Guo, Haihong Li, Fengxin Li, Jiao Liu, Hongyan School of Information Renmin University of China China Institute of Medical Information Medical Library Chinese Academy of Medical Sciences Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (纸本)9798350368741

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative to the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP-based conservative Q-learning (CQL) on the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This allows us to choose the base networks according to the offline RL task requirements. © 2025 IEEE.

关键词： KAN Kolmogorov-Arnold networks MLP multilayer perceptrons offline reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Semantic Type Identification for Relational Attributes

引用

Journal of Computer Science & Technology 2023年第4期38卷 927-946页

作者：丁玥郭雨荷卢卫李海翔张美慧李晖潘安群杜小勇 Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing 100872China School of Information Renmin University of ChinaBeijing 100872China Tencent(Beijing)Technology Company Limited Beijing 100080China School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China College of Computer Science and Technology Guizhou UniversityGuiyang 550025China Tencent(Shenzhen)Technology Company Limited Shenzhen 518057China

Identifying semantic types for attributes in relations,known as attribute semantic type(AST)identification,plays an important role in many data analysis tasks,such as data cleaning,schema matching,and keyword search in ***,due to a lack of unified naming standards across prevalent information systems(*** islands),AST identification still remains as an open *** tackle this problem,we propose a context-aware method to figure out the ASTs for relations in this *** transform the AST identification into a multi-class classification problem and propose a schema context aware(SCA)model to learn the representation from a collection of relations associated with attribute values and schema *** on the learned representation,we predict the AST for a given attribute from an underlying relation,wherein the predicted AST is mapped to one of the labeled *** improve the performance for AST identification,especially for the case that the predicted semantic types of attributes are not included in the labeled ASTs,we then introduce knowledge base embeddings(***)to enhance the above representation and construct a schema context aware model with knowledge base enhanced(SCA-KB)to get a stable and robust *** experiments based on real datasets demonstrate that our context-aware method outperforms the state-of-the-art approaches by a large margin,up to 6.14%and 25.17%in terms of macro average F1 score,and up to 0.28%and 9.56%in terms of weighted F1 score over high-quality and low-quality datasets respectively.

关键词： attribute semantic type(AST)identification context-aware semantic embedding knowledge base embedding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Mining Bytecode Features of Smart Contracts to Detect PonziScheme on Blockchain

引用

Computer Modeling in engineering & Sciences 2021年第6期127卷 1069-1085页

作者： Xiajiong Shen Shuaimin Jiang Lei Zhang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng47500China Institute of Data and Knowledge Engineering Henan UniversityKaifeng47500China School of Computer and Information Engineering Henan UniversityKaifeng47500China

The emergence of smart contracts has increased the attention of industry and academia to blockchain technology,which is tamper-proofing,decentralized,autonomous,and enables decentralized applications to operate in untrustworthy ***,these features of this technology are also easily exploited by unscrupulous individuals,a typical example of which is the Ponzi scheme in *** negative effect of unscrupulous individuals writing Ponzi scheme-type smart contracts in Ethereum and then using these contracts to scam large amounts of money has been *** solve this problem,we propose a detection model for detecting Ponzi schemes in smart contracts using *** this model,our innovation is shown in two aspects:We first propose to use two bytes as one characteristic,which can quickly transform the bytecode into a high-dimensional matrix,and this matrix contains all the implied characteristics in the ***,We innovatively transformed the Ponzi schemes detection into an anomaly detection ***,an anomaly detection algorithm is used to identify Ponzi schemes in smart *** results show that the proposed detection model can greatly improve the accuracy of the detection of the Ponzi scheme ***,the F1-score of this model can reach 0.88,which is far better than those of other traditional detection models.

关键词： Ponzi scheme blockchain security smart contracts anomaly detection

来源：评论

学校读者我要写书评

暂无评论

P-TECS: An Energy Balance Algorithm for Opportunistic Networks Integrating Multiple Node Attributes 5th

P-TECS: An Energy Balance Algorithm for Opportunistic Netwo...

引用

5th International Conference on Security and Privacy in New Computing Environments, SPNCE 2022

作者： Xu, Gang Yang, Xiaoying Chen, Jingjian Huang, Baoqi College of Computer Science Inner Mongolia University Hohhot010021 China Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering Inner Mongolia University Hohhot010021 China

ISBN: (纸本)9783031306228

This paper proposes an energy balance opportunistic networks routing algorithm P-TECS. The P-TECS solves the problems of energy consumption of key nodes in existing opportunistic routing algorithms. This paper defines the relay degree of communication between nodes, and designs a P-TECS opportunistic routing algorithm integrating dynamic attributes of multiple nodes. Simulation results show that in resource-constrained opportunistic networks, P-TECS significantly improves the message delivery rate and average remaining energy of nodes, and significantly reduces the routing overhead rate. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Efficient Customized Blockchain System for Inter-Organizational Processes

An Efficient Customized Blockchain System for Inter-Organiza...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Wang, Puwei Sun, Zhouxing Li, Rui Chen, Jinchuan Gong, Ping Du, Xiaoyong Renmin University of China School of Information China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China Renmin University of China School of Mathematics China Fujian Normal University College of Computer and Cyber Security China

ISBN: (纸本)9798350304855

Blockchain technologies pave a promising way for implementing the inter-organizational processes. Most of the current research works translate the execution logic in the process models into the smart contracts, which can run independently on the blockchain without the outside process engine. However, the works usually suffer from the execution and storage costs, since the translation needs to be done when the processes are deployed. In this paper, we customize a process engine for executing the inter-organizational business processes via a blockchain-style procedure, i.e., checking the validity of transactions, adding the valid transactions into the blockchain through the consensus mechanism, and then updating the process states according to the committed transactions. And then, we build a blockchain system by embedding the customized process engine into the blockchain nodes. Moreover, in order to realize the interactions between the inter-organizational processes running on blockchain and the services outside blockchain, we propose a blockchain-based approach for service registration, binding and invocation, and design a lease-based concurrency control protocol to logically isolate transactions from each other when invoking the services simultaneously. Finally, we implement a prototype system based on a permissioned blockchain platform Hyperledger Fabric and a process engine Activiti. The experimental results show the proposed blockchain system can execute the inter-organizational processes correctly and efficiently. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：