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

arXiv 2024年

作者： Shao, Pengyang Yang, Yonghui Gao, Chen Chen, Lei Zhang, Kun Zhuang, Chenyi Wu, Le Li, Yong Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Anhui Hefei China BNRist Tsinghua University Beijing China Department of Electronic Engineering BNRist Tsinghua University Beijing China Ant Group Zhejiang Hangzhou China

Graph-based Cognitive Diagnosis (CD) has attracted much research interest due to its strong ability on inferring students’ proficiency levels on knowledge concepts. While graph-based CD models have demonstrated remarkable performance, we contend that they still cannot achieve optimal performance due to the neglect of edge heterogeneity and uncertainty. Edges involve both correct and incorrect response logs, indicating heterogeneity. Meanwhile, a response log can have uncertain semantic meanings, e.g., a correct log can indicate true mastery or fortunate guessing, and a wrong log can indicate a lack of understanding or a careless mistake. In this paper, we propose an Informative Semantic-aware Graph-based Cognitive Diagnosis model (ISG-CD), which focuses on how to utilize the heterogeneous graph in CD and minimize effects of uncertain edges. Specifically, to explore heterogeneity, we propose a semantic-aware graph neural networks based CD model. To minimize effects of edge uncertainty, we propose an Informative Edge Differentiation layer from an information bottleneck perspective, which suggests keeping a minimal yet sufficient reliable graph for CD in an unsupervised way. We formulate this process as maximizing mutual information between the reliable graph and response logs, while minimizing mutual information between the reliable graph and the original graph. After that, we prove that mutual information maximization can be theoretically converted to the classic binary cross entropy loss function, while minimizing mutual information can be realized by the Hilbert-Schmidt Independence Criterion. Finally, we adopt an alternating training strategy for optimizing learnable parameters of both the semantic-aware graph neural networks based CD model and the edge differentiation layer. Extensive experiments on three real-world datasets have demonstrated the effectiveness of ISG-CD. © 2024, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Glioblastoma Tumor Segmentation using an Ensemble of Vision Transformers

arXiv

引用

arXiv 2023年

作者： Liu, Huafeng Dowdell, Benjamin Engelder, Todd Pulmano, Zarah Osa, Nicolas Barman, Arko Department of Computer Science Rice University United States Data to Knowledge Lab Department of Electrical and Computer Engineering Rice University United States

Glioblastoma is one of the most aggressive and deadliest types of brain cancer, with low survival rates compared to other types of cancer. Analysis of Magnetic Resonance Imaging (MRI) scans is one of the most effective methods for the diagnosis and treatment of brain cancers such as glioblastoma. Accurate tumor segmentation in MRI images is often required for treatment planning and risk assessment of treatment methods. Here, we propose a novel pipeline, Brain Radiology Aided by Intelligent Neural NETworks (BRAINNET), which leverages MaskFormer, a vision transformer model, and generates robust tumor segmentation maks. We use an ensemble of nine predictions from three models separately trained on each of the three orthogonal 2D slice directions (axial, sagittal, and coronal) of a 3D brain MRI volume. We train and test our models on the publicly available UPenn-GBM dataset, consisting of 3D multi-parametric MRI (mpMRI) scans from 611 subjects. Using Dice coefficient (DC) and 95% Hausdorff distance (HD) for evaluation, our models achieved state-of-the-art results in segmenting all three different tumor regions – tumor core (DC = 0.894, HD = 2.308), whole tumor (DC = 0.891, HD = 3.552), and enhancing tumor (DC = 0.812, HD = 1.608). © 2023, CC BY-SA.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

BDLR:lncRNA identification using ensemble learning

引用

BIOCELL 2022年第4期46卷 951-960页

作者： LEJUN GONG SHEHAI ZHOU JINGMEI CHEN YONGMIN LI LI ZHANG ZHIHONG GAO Jiangsu Key Lab of Big Data Security&Intelligent Processing School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing210046China Smart Health Big Data Analysis and Location Services Engineering Laboratory of Jiangsu Province Nanjing210046China Zhejiang Engineering Research Center of Intelligent Medicine Wenzhou325035China College of Computer Science and Technology Nanjing Forestry UniversityNanjing210037China

Long non-coding RNAs(lncRNAs)play an important role in many life activities such as epigenetic material regulation,cell cycle regulation,dosage compensation and cell differentiation regulation,and are associated with many human *** are many limitations in identifying and annotating lncRNAs using traditional biological experimental *** the development of high-throughput sequencing technology,it is of great practical significance to identify the lncRNAs from massive RNA sequence data using machine learning *** on the Bagging method and Decision Tree algorithm in ensemble learning,this paper proposes a method of lncRNAs gene sequence identification called *** identification results of this classification method are compared with the identification results of several models including Byes,Support Vector Machine,Logical Regression,Decision Tree and Random *** experimental results show that the lncRNAs identification method named BDLR proposed in this paper has an accuracy of 86.61%in the human test set and 90.34%in the mouse for lncRNAs,which is more than the identification results of the other ***,the proposed method offers a reference for researchers to identify lncRNAs using the ensemble learning.

关键词： lncRNAs High-throughput sequencing Ensemble learning Bagging Decision Tree

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities 24

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

44th ACM/IEEE International Conference on Software engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

STGAT: A Spatio-Temporal Graph Attention Network for Travel Demand Prediction

STGAT: A Spatio-Temporal Graph Attention Network for Travel ...

引用

2023 International Conference on Networking and Network Applications, NaNA 2023

作者： Zhang, Tao Yi Wang, YuBo Wei, ZhiCheng Key Lab of Network and Information Security China College of Computer and Cyberspace Security China Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics & Security Hebei Normal University Hebei Province Shijiazhuang China

ISBN: (纸本)9798350327380

Forecasting travel demand is a challenging task due to the complex spatial dependencies and dynamic temporal correlation of the traffic data. Furthermore, a limited representation of the given spatial graph structure may restrict the model's ability to effectively learn spatial-temporal dependencies. To extract latent semantic features from traffic data, this paper proposes a method to construct a traffic graph using the Markov cluster algorithm. The traffic semantic correlation matrix is constructed based on a traffic graph to obtain the deep semantic information. Specifically, this study proposes a Spatio-Temporal Graph Attention Network(STGAT) for travel demand prediction. STGAT uses a graph attention layer based on the Node2Vec graph embedding algorithm, two convolutional layers based on the Markov cluster algorithm, and a long short-term memory network to capture spatial-temporal dependencies. Experimental results on the NYC Taxi dataset and the Chengdu online car dataset demonstrate that STGAT achieved state-of-the-art performance compared to other baseline models. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Distilling Dynamic Spatial Relation Network for Human Pose Estimation 32

Distilling Dynamic Spatial Relation Network for Human Pose E...

引用

32nd British Machine Vision Conference, BMVC 2021

作者： Wu, Kewei Wang, Tao Xie, Zhao Guo, Dan Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Human pose estimation is a challenging task that requires the comprehension of the pose structure. This work can refer to spatial relation inference in a pose structure model;how to model the dynamic spatial relation against various unreliable joints is critical. To this end, we propose a Distilling Dynamic Spatial Relation network (DDSR), which builds pose-based graph representation by exploiting the feature of spatial relation from the location distribution of joints. We use a dynamic message propagation mechanism to update the spatial relation on edges. Specifically, to filter out the noisy predictions, we select the joints with high confidence;to enhance the spatial relation in a large receptive field, we propagate multi-stage messages among joints. Besides, to reduce the computation cost of the multi-stage message propagation, we design a cross-resolution distillation framework. We use a new spatial distillation loss to verify the spatial relation between the teacher model and the student model. Experimental results on COCO and MPII datasets show that our method is superior to the state-of-the-art methods. The visualization results further verify the interpretability of our spatial relation. © 2021. The copyright of this document resides with its authors.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

A Semantic Framework for Chinese Historical Events Based on Linked data and knowledge Graph 16th

A Semantic Framework for Chinese Historical Events Based on ...

引用

16th International Conference on Diversity, Divergence, Dialogue, iConference 2021

作者： Wang, Hao Li, Yueyan Deng, Sanhong School of Information Management Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China

ISBN: (纸本)9783030712914

In the era of big data, data redundancy has become an obstacle to deep reading. The objective of linked data as a new data organization model is to transform data into structured data following unified standards. The lack of Chinese conceptual terms has seriously hindered the semantization and standardization of Chinese domain ontology. Taking Chinese historical events as an example, ontology technology is used in this paper to standardize the definition of concepts and semantic relations in domain knowledge. Moreover, concepts from text resources are extracted through a deep learning algorithm Bi-LSTM-CRFs and combined with an external knowledge base to realize the fusion of related data within various data sets. Ultimately, the knowledge ontology of historical events is displayed in the way of a knowledge graph to further explore the practical application. The results show that the accuracy of the terms extraction of historical events is about 80% indicating the good recognition performance and portability of the model. © 2021, Springer Nature Switzerland AG.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

Marginal Value-Based Edge Resource Pricing and Allocation for Deadline-Sensitive Tasks

Marginal Value-Based Edge Resource Pricing and Allocation fo...

引用

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

作者： Puwei Wang Zhouxing Sun Ying Zhan Haoran Li Xiaoyong Du School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing China Guizhou University of Finance and Economics Guiyang City China

In edge computing (EC), resource allocation is to allocate computing, storage and networking resources on the edge nodes (ENs) efficiently and reasonably to tasks generated by users. Due to the resource-limitation of ENs, the tasks often need to compete for the resources. Pricing mechanisms are widely used to deal with the resource allocation problem, and the valuations of tasks play a critical role in the price mechanisms. However, users naturally are not willing to expose the valuations of their tasks due to conflicts of interests. Current research works usually adopt truthful auctions to motivate the users to report honestly the valuations of their tasks. In this paper, we introduce the marginal value to estimate the valuations of tasks, and propose a marginal value-based pricing mechanism using the incentive theory, which motivates the tasks with higher marginal values to actively request more resources. The EC platform sets the resource prices using the price mechanism, and then the users determine their resource requests relying on the resource prices and the valuations of their tasks. After receiving the deadline-sensitive tasks from the users, the resource allocation can be modeled as a knapsack problem with the deadline constraints. Extensive experimental results demonstrate that our approach is computationally efficient and is promising in enhancing the utility of the EC platform and the tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Electronic Medical Record Sharing System Based on Hyperledger Fabric and InterPlanetary File System 2021

Electronic Medical Record Sharing System Based on Hyperledge...

引用

5th International Conference on Compute and data Analysis, ICCDA 2021

作者： Li, Lei Yue, Zhengxiang Wu, Gongqing Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781450389112

Electronic Medical Records (EMR) and other medical data contain important and sensitive privacy information of patients, which provide important basis and reference for their doctors to diagnose and treat them. With the continuous development of data sharing, big data applications and other technologies, new requirements are proposed for the storage of medical privacy data. At present, medical data have the characteristics of obstructed sharing and exchange, difficult data tracing and data sensitivity, which increases the cost and difficulty of each diagnosis. Moreover, patients lack the right to know and control their own medical data, which is easy to cause data fraud or data leakage. As a decentralized, tamper proof and traceable distributed ledger system, blockchain brings new solutions to these problems. This paper designs a medical data fusion and distributed privacy management system based on the Hyperledger Fabric blockchain development platform and InterPlanetary File System. It can not only solve the problem of mutual distrust in the traditional system, but also realize the safe data storage and the safe sharing of medical record data between medical organizations which is a beneficial attempt to overcome the disadvantages of traditional hospital data separation. At the same time, according to the requirements of different levels and types of medical users or groups for data security and personal privacy protection, the access control technology of users is studied to ensure personal privacy data. © 2021 ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：