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

SSRN 2024年

作者： Wu, Yilin Chen, Zhaoliang Zou, Ying Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Department of Computer Science Hong Kong Baptist University Hong Kong

Graph convolutional network has emerged as a focal point in machine learning because of its robust graph processing capability. Most existing graph convolutional network-based approaches are designed for single-view data, yet in many practical scenarios, data is represented through multiple views. Although the ability of graph convolutional network is undeniable, the quality of graph directly affects its performance. Moreover, the process of graph generation with traditional nearest neighbor in traditional multi-view learning actually amplifies the influence of different information on performance across these views. To tackle the aforementioned challenges, this paper proposes a multi-scale graph generation deep learning framework, called multi-scale semi-supervised graph generation based multi-view classification, consisting of two modules: edge sampling and path sampling. The former aims to generate an adjacency graph by selecting edges based on the maximum likelihood among graphs from different views. Meanwhile, the latter seeks to construct adjacency graphs according to the characteristics of paths within the graphs. Extensive experimental results robustly demonstrate the superior performance of our proposed framework, compared to other state-of-the-art multi-view semi-supervised approaches. © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Tongue image segmentation via color decomposition and thresholding

Tongue image segmentation via color decomposition and thresh...

引用

作者： Li, Zuoyong Yu, Zhaochai Liu, Weixia Xu, Yong Zhang, Daoqiang Cheng, Yong Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350121 China The Fujian College's Research Base of Humanities and Social Science for Internet Innovation Research Center Minjiang University Fuzhou350121 China Straits Institute Minjiang University Fuzhou350121 China Bio-Computing Research Center Shenzhen Graduate School Harbin Institute of Technology Shenzhen518055 China Department of Computer Science and Engineering Nanjing University of Aeronautics and Astronautics Nanjing210016 China School of Communication Engineering Nanjing Institute of Technology Nanjing211167 China

Tongue image segmentation is a crucial step in developing an automatic tongue diagnosis system. After exploring characteristics of image thresholding in different color spaces, we propose a simple and effective tongue image segmentation method. Specifically, the proposed method first extracts an initial tongue body region by performing image thresholding on the transformed hue component in HSI (Hue, Saturation, and Intensity) color space. Then, one of two image thresholding results on the red component of an original tongue image is adaptively selected to find the gap region between the tongue body root and the upper lip. Finally, the initial tongue body region is refined by removing fake object regions such as the upper lip to obtain final tongue image segmentation result. Experimental results on a tongue image dataset containing 200 subjects demonstrate the effectiveness of the proposed method. © 2018 John Wiley & Sons, Ltd.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

SPESC: A Specification Language for Smart Contracts

SPESC: A Specification Language for Smart Contracts

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Xiao He Bohan Qin Yan Zhu Xing Chen Yi Liu School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China National Computer Network Emergency Response Technical Team Coordination Center of China

ISBN: (纸本)9781538626672

The smart contract is an interdisciplinary concept that concerns business, finance, contract law and information technology. Designing and developing a smart contract may require the close cooperation of many experts coming from different fields. How to support such collaborative development is a challenging problem in blockchain-oriented software engineering. This paper proposes SPESC, a specification language for smart contracts, which can define the specification of a smart contract for the purpose of collaborative design. SPESC can specify a smart contract in a similar form to real-world contracts using a natural-language-like grammar, in which the obligations and rights of parties and the transaction rules of cryptocurrencies are clearly defined. The preliminary study results demonstrated that SPESC can be easily learned and understood by both IT and non-IT users and thus has greater potential to facilitate collaborative smart contract development.

关键词： Contracts Cryptography Contract law Syntactics Collaboration Software

来源：评论

学校读者我要写书评

暂无评论

Label Distribution Learning with Correlation information

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Lin, Yaojin Guo, Wenzhong Ding, Weiping College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Zhangzhou363000 China School of Information Science and Technology Nantong University Nantong226019 China

Label distribution learning quantifies the label space for each instance and has widely applicability in different fields. However, most existing works primarily focus on label correlation, but they still have a limitation in capturing instance correlation. Meanwhile, traditional label distribution learning operates on individual labels sequentially, leading to limitation in applying common features. Therefore, in this paper, we propose a novel approach for label distribution learning with correlation information i.e. instance correlation and label correlation. Specifically, the instance correlation and label correlation are identified by an optimization function and Pearson correlation coefficient, respectively. Besides, we conduct $\ell_{2,1}-$norm regularization to exploit common features. Comprehensive experiments manifest the superiority of our proposed approach against other well-established label distribution learning algorithms. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on high-accuracy gait recognition technique based on parallel genetic algorithm

引用

Journal of information Hiding and Multimedia Signal Processing 2018年第1期9卷 244-255页

作者： Lin, Xiao Jia Zhang, Fu Quan Xu, Lin Department of Computing and Information Technology Fujian Business University No. 19 Huang Pu Road Gulou District Fuzhou350012 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University School of Software Beijing Institute of Technology Room A9. 301 Juyuan Jinshan Jiyuan Fuzhou350008 China Innovative Information Industry Research Institute Fujian Normal University Fuqing Brunch of Fujian Normal University Campus County 1. Longjiang Road Fuqing Fuzhou350300 China

In the field of sports science, gait recognition has a wide range of applications. However, compared to other biometric technologies, it has the problem of low recognition accuracy. Therefore, a technique combining the parallel genetic algorithm based on hierarchical fair competition with neural network ensemble is proposed to be applied in gait recognition. First, parallel genetic algorithm is adopted to increase individual diversity, and only appropriate features are selected to train each neural network candidate. Then, a set of individual neural networks are selected to complete the neural network ensemble so as to minimize the generalization error and maximize the negative correlation. Experiments on the CASIA gait database demonstrate the effectiveness of the proposed gait recognition method. The results show that the proposed method has a higher recognition rate than the existing methods. © 2018, Ubiquitous International. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

dugMatting: Decomposed-Uncertainty-Guided Matting

arXiv

引用

arXiv 2023年

作者： Wu, Jiawei Zhang, Changqing Li, Zuoyong Fu, Huazhu Peng, Xi Zhou, Joey Tianyi College of Mechanical and Electrical Engineering Fujian Agriculture and Forestry University Fuzhou China College of Intelligence and Computing Tianjin University Tianjin China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China Institute of High Performance Computing Agency for Science Technology and Research Singapore College of Computer Science Sichuan University Chengdu China Singapore

Cutting out an object and estimating its opacity mask, known as image matting, is a key task in image and video editing. Due to the highly ill-posed issue, additional inputs, typically user-defined trimaps or scribbles, are usually needed to reduce the uncertainty. Although effective, it is either time consuming or only suitable for experienced users who know where to place the strokes. In this work, we propose a decomposed-uncertainty-guided matting (dugMatting) algorithm, which explores the explicitly decomposed uncertainties to efficiently and effectively improve the results. Basing on the characteristic of these uncertainties, the epistemic uncertainty is reduced in the process of guiding interaction (which introduces prior knowledge), while the aleatoric uncertainty is reduced in modeling data distribution (which introduces statistics for both data and possible noise). The proposed matting framework relieves the requirement for users to determine the interaction areas by using simple and efficient labeling. Extensively quantitative and qualitative results validate that the proposed method significantly improves the original matting algorithms in terms of both efficiency and efficacy. Copyright © 2023, The Authors. All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Attributed Multi-order Graph Convolutional Network for Heterogeneous Graphs

arXiv

引用

arXiv 2023年

作者： Chen, Zhaoliang Wu, Zhihao Zhong, Luying Plant, Claudia Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Faculty of Computer Science University of Vienna Vienna1090 Austria ds:UniVie Vienna1090 Austria

Heterogeneous graph neural networks aim to discover discriminative node embeddings and relations from multi-relational networks. One challenge of heterogeneous graph learning is the design of learnable meta-paths, which significantly influences the quality of learned embeddings. Thus, in this paper, we propose an Attributed Multi-Order Graph Convolutional Network (AMOGCN), which automatically studies meta-paths containing multi-hop neighbors from an adaptive aggregation of multi-order adjacency matrices. The proposed model first builds different orders of adjacency matrices from manually designed node connections. After that, an intact multi-order adjacency matrix is attached from the automatic fusion of various orders of adjacency matrices. This process is supervised by the node semantic information, which is extracted from the node homophily evaluated by attributes. Eventually, we utilize a one-layer simplifying graph convolutional network with the learned multi-order adjacency matrix, which is equivalent to the cross-hop node information propagation with multi-layer graph neural networks. Substantial experiments reveal that AMOGCN gains superior semi-supervised classification performance compared with state-of-the-art competitors. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Identification and Prediction of key Nucleotide Sites Using Machine Learning in Bioinformatics: A Brief Overview

Identification and Prediction of Key Nucleotide Sites Using ...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Jianhua Cai Leyi Wei Kun Zeng Guobao Xiao Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou P.R. China College of Mathematics and Computer Science Fuzhou University Fuzhou P.R. China College of Intelligence and Computing Tianjin University Tianjin P.R. China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Nowadays, the burgeon of machine learning has promoted its wide application in various fields. In Bioinformatics, machine learning computational method has become an indispensable part. Its efficiency and simplicity break the expensive and inefficient barriers of previous experimental methods. This article briefly reviews the application and development of machine learning in identifying and predicting key nucleotide sites (such as 6mA, 5mC, 4mC, etc.) in DNA or RNA. Among them, supervised learning is one of the main methods to this work. Its wide application has provided great convenience for the development of identification and prediction of key nucleotides in Bioinformatics.

关键词： Bioinformatics Feature extraction Machine learning Predictive models Computational modeling DNA Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

DQPS: An intelligent Multi-Hop Computation Offloading Scheme for Workflow Applications in Vehicular Edge computing Networks

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Lin, Bing Chen, Qiaoxin Chen, Xing Jia, Wen-Kang Lu, Yu Xiong, Neal N. Fujian Normal University College of Physics and Energy Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China Peking University School of Computer Science 100871 China Xiamen University Department of Informatics and Communication Engineering Xiamen361005 China Fuzhou University College of Computer and Data Science Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China Fujian Normal University College of Photonic and Electronic Engineering Fuzhou350117 China Fujian Normal University Concord University College Fuzhou350117 China Sul Ross State University Department of Computer Mathematical and Physical Sciences AlpineTX79830 United States

Vehicular Edge computing (VEC) is a feasible solution for autonomous driving as it can offload latency-sensitive and computation-intensive tasks from vehicle terminals to roadside units (RSUs) for real-time processing. Due to the high computational resource the workflow applications (i.e., autonomous driving) required, the small vehicle-to-RSUs communication range, and the scarce available resources for each vehicle, it might be difficult to accomplish complex workflow applications through the single-hop offloading paradigm in the Internet of Vehicles (IoV). In this paper, we propose a reinforcement learning (RL) based multi-hop computation offloading scheme for workflow applications to reduce their execution latency in the VEC networks, which considers the data dependency in workflow applications as well as the trust relationship and communication interference among RSUs. Firstly, a preprocessing method is employed to merge the cut-edges in a workflow to reduce the offloading scale of tasks and compress the encoding dimension of offloading solutions. Then, a Deep Q-network algorithm using Phase-optimal State update (DQPS) is proposed to update the offloading policy distribution, in which the deviation of the phase-optimal state from the current state is estimated as the reward of RL to promote the algorithm's convergence to adapt the dynamic VEC networks. Simulation results show that DQPS has the best performance compared to other benchmark schemes. Moreover, the latency of the identical applications can be reduced by 2.5%-25.3% through our offloading scheme with a multi-hop model compared to that with the single-hop paradigm in IoV. © 1975-2011 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：