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

arXiv 2022年

作者： Xiang, Yuexin Lei, Yuchen Bao, Ding Ren, Wei Li, Tiantian Yang, Qingqing Liu, Wenmao Zhu, Tianqing Choo, Kim-Kwang Raymond School of Computer Science China University of Geosciences Wuhan430074 China Hubei Key Laboratory of Intelligent Geo-Information Processing Wuhan430074 China NSFOCUS Technologies Group Co. Ltd China Henan Key Laboratory of Network Cryptography Technology Zhengzhou450001 China School of Computer Science University of Technology Sydney Sydney Australia Department of Information Systems and Cyber Security University of Texas at San Antonio San AntonioTX78249-0631 United States

Cryptocurrencies are no longer just the preferred option for cybercriminal activities on darknets, due to the increasing adoption in mainstream applications. This is partly due to the transparency associated with the underpinning ledgers, where any individual can access the record of a transaction record on the public ledger. In this paper, we build a dataset comprising Bitcoin transactions between 12 July 2019 and 26 May 2021. This dataset (hereafter referred to as BABD-13) contains 13 types of Bitcoin addresses, 5 categories of indicators with 148 features, and 544,462 labeled data, which is the largest labeled Bitcoin address behavior dataset publicly available to our knowledge. We then use our proposed dataset on common machine learning models, namely: k-nearest neighbors algorithm, decision tree, random forest, multilayer perceptron, and XGBoost. The results show that the accuracy rates of these machine learning models for the multi-classification task on our proposed dataset are between 93.24% and 97.13%. We also analyze the proposed features and their relationships from the experiments, and propose a k-hop subgraph generation algorithm to extract a k-hop subgraph from the entire Bitcoin transaction graph constructed by the directed heterogeneous multigraph starting from a specific Bitcoin address node (e.g., a known transaction associated with a criminal investigation). Besides, we initially analyze the behavior patterns of different types of Bitcoin addresses according to the extracted *** Codes 68-11 Copyright © 2022, The Authors. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

An integratable verifiable secret sharing mechanism

引用

International Journal of Network Security 2016年第4期18卷 617-624页

作者： Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No. 111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No. 500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No. 100 Wenhwa Rd Seatwen Taichung413 Taiwan

Threshold secret sharing (SS), also denoted as (t, n) SS, has been used extensively in the area of information se- curity, such as for group authentication, cloud storage schemes, secure parallel communication and wireless mul- tipath routing protocols. However, a (t, n) SS cannot de- tect any deceptions among the dealer and shareholders. Veriable secret sharing (VSS) overcomes the weakness of (t, n) SS in such a way that it is able to detect cheaters by verifying the validity of shares or the correctness of the recovered secret under the condition that both shares and the secret are not compromised. Recently, two non- interactive VSSs based on Asmuth-Bloom's SS were pro- posed by Harn et al. and Liu et al., respectively. Both VSSs require shareholders to examine the range of values of some integers related to the secret before recovering the secret, which is a time-consuming operation. In this paper, we propose a novel integratable VSS mechanism that integrates the concepts of the generalized Chinese remainder theorem (GCRT), Shamir's SS and Asmuth- Bloom's SS. Our proposed VSS can verify that the secret reconstructed by any t or more shareholders is the same as the one that the dealer has generated. Analysis shows that our proposed VSS can provide perfect secrecy and better efficiency.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Medical Image Segmentation via Single-Source Domain Generalization with Random Amplitude Spectrum Synthesis

arXiv

引用

arXiv 2024年

作者： Qiao, Qiang Wang, Wenyu Qu, Meixia Su, Kun Jiang, Bin Guo, Qiang School of Mechanical Electrical & Information Engineering Shandong University Weihai China Shenzhen Research Institute Shandong University Shenzhen China School of Computer Science and Technology Shandong University of Finance and Economics Jinan China Shandong Provincial Key Laboratory of Digital Media Technology Jinan China

The field of medical image segmentation is challenged by domain generalization (DG) due to domain shifts in clinical datasets. The DG challenge is exacerbated by the scarcity of medical data and privacy concerns. Traditional single-source domain generalization (SSDG) methods primarily rely on stacking data augmentation techniques to minimize domain discrepancies. In this paper, we propose Random Amplitude Spectrum Synthesis (RASS) as a training augmentation for medical images. RASS enhances model generalization by simulating distribution changes from a frequency perspective. This strategy introduces variability by applying amplitude-dependent perturbations to ensure broad coverage of potential domain variations. Furthermore, we propose random mask shuffle and reconstruction components, which can enhance the ability of the backbone to process structural information and increase resilience intra- and cross-domain changes. The proposed Random Amplitude Spectrum Synthesis for Single-Source Domain Generalization (RAS4DG) is validated on 3D fetal brain images and 2D fundus photography, and achieves an improved DG segmentation performance compared to other SSDG models. The source code is available at: https://***/qintianjian-lab/RAS4DG. © 2024, CC BY.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Generating Personalized Imputations for Patient Health Status Prediction in Electronic Health Records

Generating Personalized Imputations for Patient Health Statu...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yang Liu Weiyu Zhang Jiasheng Si Zhao Li Xueping Peng Wenpeng Lu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Evay Info Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Electronic health records (EHRs) play a crucial role in the development of personalized treatment plans for patients. However, EHRs are often highly incomplete, posing significant challenges for predictive modeling. While existing deep learning models employ various imputation techniques to reconstruct missing values, they often fail to represent missing data in a personalized manner and do not learn from the missingness patterns in EHRs data. This limitation reduces their effectiveness in practical personalized healthcare applications. To address this issue, we propose SPIME, a self-supervised model that generates personalized imputations in EHRs data for patient health status prediction. We introduce a personalized missing mask (PMM) based on the frequency of feature measurements. Additionally, we incorporate a masked imputation task (MIT) loss that minimizes the loss of artificially introduced missing values, thereby enhancing the model’s capability to handle missing data. SPIME adopts self-supervised pretraining to learn representations from personalized missing patterns and reconstructs missing data in the latent space. To further enhance representation learning, two independent attention mechanisms are applied separately across the feature and temporal dimensions. Experimental results on two real-world EHRs datasets show that SPIME outperforms existing state-of-the-art methods in predicting in-hospital mortality and decompensation, demonstrating its effectiveness in reconstructing missing data and predicting patient health status. The code will be published at https://***/cling6666/SPIME.

关键词： Training Representation learning Biological system modeling Mortality Predictive models Biomedical measurement Imputation Data models Frequency measurement Electronic medical records

来源：评论

学校读者我要写书评

暂无评论

5G ENTERING INTO A NEW ERA

引用

China Communications 2017年第12期14卷 I0002-I0004页

作者： Feifei Gao Changle Li Jun Fang Kaizhi Huang Zhi Quan Chengwen Xing Jianhua Zhang Zhongshan Zhang Liqiang Zhao Yulong Zou Department of Automation Tsinqhua UniversityBeiiingChina the State Key Laboratory of Integrated Services Networks Xidian University china communications ieee communications magazine ieee signal processing letters national digital switching system engineering&technological research center the college of information engineering shenzhen university the school of information and electronics beijing institute of technology bupt itu-r imt-2020 channel model ieee comm the school of computer and communication engineering in the university of science and technology beijing(ustb) state key lab.of integrated ser vice networks xidian university the nanjing university of posts and telecommunications(nupt)

The ever increasing wireless data services, such asimaging, video, audio, multimedia, etc., have de-mands for the very high speed wireless communicationsand network, which are unfortunately a bottleneck whencombining with the wireline core network. Users＇ arenow expecting high quality of experience with low-costdevices, ubiquitous connectivity, energy efficiency, highreliability, or even ultra-low latency if a vehicle terminalis applied.

关键词： 5G ENTERING A NEW ERA

来源：评论

学校读者我要写书评

暂无评论

A novel TSK fuzzy system incorporating multiview collaborative transfer learning for personalized epileptic EEG detection

arXiv

引用

arXiv 2021年

作者： Li, Andong Deng, Zhaohong Lou, Qiongdan Choi, Kup-Sze Shen, Hongbin Wang, Shitong School of Artificial Intelligence and Computer Science Jiangnan University Jiangsu Key Laboratory of Digital Design and Software Technology Wuxi214122 China Centre for Smart Health Hong Kong Polytechnic University Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

—In clinical practice, electroencephalography (EEG) plays an important role in the diagnosis of epilepsy. EEG-based computer-aided diagnosis of epilepsy can greatly improve the accuracy of epilepsy detection while reducing the workload of physicians. However, there are many challenges in practical applications for personalized epileptic EEG detection (i.e., training of detection model for a specific person), including the difficulty in extracting effective features from one single view, the undesirable but common scenario of lacking sufficient training data in practice, and the no guarantee of identically distributed training and test data. To solve these problems, we propose a TSK fuzzy system-based epilepsy detection algorithm that integrates multi-view collaborative transfer learning. To address the challenge due to the limitation of single-view features, multi-view learning ensures the diversity of features by extracting them from different views. The lack of training data for building a personalized detection model is tackled by leveraging the knowledge from the source domain (reference scene) to enhance the performance of the target domain (current scene of interest), where mismatch of data distributions between the two domains is resolved with adaption technique based on maximum mean discrepancy. Notably, the transfer learning and multi-view feature extraction are performed at the same time. Furthermore, the fuzzy rules of the TSK fuzzy system equip the model with strong fuzzy logic inference capability. Hence, the proposed method has the potential to detect epileptic EEG signals effectively, which is demonstrated with the positive results from a large number of experiments on the CHB-MIT dataset. © 2021, CC BY-NC-ND.

关键词： Electrophysiology

来源：评论

学校读者我要写书评

暂无评论

Regress Before Construct: Regress Autoencoder for Point Cloud Self-supervised Learning

arXiv

引用

arXiv 2023年

作者： Liu, Yang Chen, Chen Wang, Can King, Xulin Liu, Mengyuan College of Computer Science Sichuan University China Center for Research in Computer Vision University of Central Florida United States Laboratory on Multimedia Information Processing The Department of Computer Science Kiel University Hangzhou Linxrobot Company China Hangzhou GOTHEN Technology Co. Ltd China Key Laboratory of Machine Perception Shenzhen Graduate School Peking University China

Masked Autoencoders (MAE) have demonstrated promising performance in self-supervised learning for both 2D and 3D computer vision. Nevertheless, existing MAE-based methods still have certain drawbacks. Firstly, the functional decoupling between the encoder and decoder is incomplete, which limits the encoder’s representation learning ability. Secondly, downstream tasks solely utilize the encoder, failing to fully leverage the knowledge acquired through the encoder-decoder architecture in the pre-text task. In this paper, we propose Point Regress AutoEncoder (Point-RAE), a new scheme for regressive autoencoders for point cloud self-supervised learning. The proposed method decouples functions between the decoder and the encoder by introducing a mask regressor, which predicts the masked patch representation from the visible patch representation encoded by the encoder and the decoder reconstructs the target from the predicted masked patch representation. By doing so, we minimize the impact of decoder updates on the representation space of the encoder. Moreover, we introduce an alignment constraint to ensure that the representations for masked patches, predicted from the encoded representations of visible patches, are aligned with the masked patch presentations computed from the encoder. To make full use of the knowledge learned in the pre-training stage, we design a new finetune mode for the proposed Point-RAE. Extensive experiments demonstrate that our approach is efficient during pre-training and generalizes well on various downstream tasks. Specifically, our pretrained models achieve a high accuracy of 90.28% on the ScanObjectNN hardest split and 94.1% accuracy on ModelNet40, surpassing all the other self-supervised learning methods. Our code and pretrained model are public available at: https://***/liuyyy111/ Point-RAE. Copyright © 2023, The Authors. All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

FF-KGAT: Feature Fusion Based Knowledge Graph Attention Network for Recommendation 5

FF-KGAT: Feature Fusion Based Knowledge Graph Attention Netw...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Tao, Li Xiaoge, Li Chaodong, Wang Xianliang, Li Shuai, Gao Dan, Han Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China School of Computer Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China Inspur Software Technology Co Ltd Software Development Project Management China Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China School of Communication and Information Engineering Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China

ISBN: (纸本)9781450396899

It is commonly agreed that a recommender system based on knowledge graph (KG) should not only use user-item interactions, but also take side information into account to deal with the problem of data sparsity. However, existing KG-based models present unique challenges that have the shortcoming of cold start and redundant iterations. To address the issue, we propose a Feature Fusion-based Knowledge Graph Attention Network (FF-KGAT) for the recommendation. FF-KGAT handles the cold-start problem through introducing user characteristics to fully explore the information of users. Additionally, FF-KGAT introduces the feature fusion graph, which removes slight nodes to obtain fewer iterations. Experimental results show that the proposed model significantly outperforms baseline methods. Particularly, the ndcg is increased by 9.83% and 10.25% on two public datasets, compared with the best performance of existing methods. © 2022 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Stacked auto encoder based Deep Reinforcement Learning for online resource scheduling in large-scale MEC networks

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom University of Electronic Science and Technology of China Chengdu China

An online resource scheduling framework is proposed for minimizing the sum of weighted task latency for all the mobile users, by optimizing offloading decision, transmission power, and resource allocation in the mobile edge computing (MEC) system. Towards this end, a deep reinforcement learning (DRL) method is proposed to obtain an online resource scheduling policy. Firstly, a related and regularized stacked auto encoder (2r-SAE) with unsupervised learning is proposed to perform data compression and representation for high dimensional channel quality information (CQI) data, which can reduce the state space for DRL. Secondly, we present an adaptive simulated annealing based approach (ASA) as the action search method of DRL, in which an adaptive h-mutation is used to guide the search direction and an adaptive iteration is proposed to enhance the search efficiency during the DRL process. Thirdly, a preserved and prioritized experience replay (2p-ER) is introduced to assist the DRL to train the policy network and find the optimal offloading policy. Numerical results are provided to demonstrate that the proposed algorithm can achieve near-optimal performance while significantly decreasing the computational time compared with existing benchmarks. It also shows that the proposed framework is suitable for resource scheduling problem in large-scale MEC networks, especially in the dynamic environment. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Multiple kernel concept factorization algorithm based on global fusion

arXiv

引用

arXiv 2024年

作者： Li, Fei Du, Liang Ren, Chaohong School of Computer and Information Technology Shanxi University Taiyuan Shanxi030006 China Institute of Big Data Science and Industry Shanxi University Taiyuan Shanxi030006 China Key Laboratory of Computational Intelligence and Chinese Information Processing Ministry of Education Shanxi University Taiyuan Shanxi030006 China

Non-negative Matrix Factorization (NMF) algorithm can only be used to find low rank approximation of original non-negative data while Concept Factorization (CF) algorithm extends matrix factorization to single non-linear kernel space，improving learning ability and adaptability of matrix factorization． In unsupervised environment， to design or select proper kernel function for specific dataset， a new algorithm called Globalized Multiple Kernel CF (GMKCF) was proposed． Multiple candidate kernel functions were input in the same time and learned in the CF framework based on global linear fusion，obtaining a clustering result with high quality and stability and solving the problem of kernel function selection that the CF faced． The convergence of the proposed algorithm was verified by solving the model with alternate iteration． The experimental results on several real databases show that the proposed algorithm outperforms comparison algorithms in data clustering， such as Kernel K-Means (KKM) ， Spectral Clustering (SC) ， Kernel CF (KCF) ， Co-regularized multi-view spectral clustering (Coreg) ， and Ｒobust Multiple KKM (ＲMKKM) ． © 2024, CC BY.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：