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

Probabilistic Graph Pattern Matching via Tumor knowledge Graph

ACM Transactions on Probabilistic Machine Learning 1000年

作者： Lei Li Houdie Tu Zhenchao Tao Chenyang Bu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei 230601 China and School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China School of Data Science University of Science and Technology of China Hefei 230052 China and West District of the First Affiliated Hospital of University of Science and Technology of China Hefei 230031 China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei 230601 China

Graph Pattern Matching (GPM) entails the identification of subgraphs within a larger graph structure that either precisely mirror or closely parallel a predefined pattern graph. Despite the fact that research on GPM in large-scale graph data has been largely centered on social network analysis or enhancing the precision and efficiency of matching algorithms for expeditious subgraph retrieval, there is a noticeable absence of studies committed to probing GPM in medical domains. To rectify this shortcoming and probe the potential of GPM in clinical contexts, particularly in aiding patients with the selection of optimal tumor treatment plans, this paper introduces the concept of probabilistic graph pattern matching specifically modified for the Tumor knowledge Graph (TKG). We propose a multi-constraint graph pattern matching algorithm, hereinafter designated as TKG-McGPM, customized for the Tumor knowledge Graph. Through experimental verification, we establish that TKG-McGPM can facilitate more efficient and informed decision-making in tumor treatment planning.

关键词： Graph Pattern Matching Probabilistic Graph Pattern Matching Tumor knowledge Graph Monte Carlo Method

来源：评论

学校读者我要写书评

暂无评论

Controlled modulation of spin transport through an asymmetric ring with spin-orbit interaction

Controlled modulation of spin transport through an asymmetri...

引用

作者： Xing, M.-J. Jalil, M.B.A. Tan, S.G. Jiang, Y. State Key Laboratory for Advanced Metals and Materials School of Materials Science and Engineering University of Science and Technology Beijing 100083 China Information Storage Materials Laboratory Electronic and Computer Engineering Department National University of Singapore Singapore 117576 Singapore Computational Nanoelectronics and Nano-Device Laboratory Electronic and Computer Engineering Department National University of Singapore Singapore 117576 Singapore Data Storage Institute National University of Singapore Singapore 117608 Singapore

We present a theoretical study of spin transport through an asymmetry ring in which the Rashba spin-orbit interaction (RSOI) is the dominant spin-splitting mechanism. The left part and the right part of the asymmetry ring have different RSOI coefficients α1 and α2. Using Griffith's boundary conditions, we investigate the influence of RSOI coefficients on the conductance and spin polarization. For typical range of RSOI coefficients, the transmitted conductance is much more strongly dependent on α2 than α1. While the transmitted spin polarization is strongly influenced by the RSOI strengths of both arms, i.e., α1 and α2, this dependence is distinct from that observed in a symmetric ring. By considering both the conductance and spin polarization, we can optimize the RSOI parameters in the ring for different sensor applications. For instance, one can change the spin polarization almost from the full range of 0 to 1, whilst keeping the conductance constant (since α1 has little effect on conductance). On the other hand, by varying α2, one can tune the RSOI strengths such that a large change in both conductance and spin polarization can be achieved. © 2006 IEEE.

关键词： Spin polarization

来源：评论

学校读者我要写书评

暂无评论

Conceptual Modeling for Advanced Application Domains 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Shan Wang Katsumi Tanaka Shuigeng Zhou Tok-Wang Ling Jihong Guan Dong-qing Yang Fabio Grandi Eleni E. Mangina Il-Yeol Song Heinrich C. Mayr

来源：评论

学校读者我要写书评

暂无评论

Interpreting Deep Forest through Feature Contribution and MDI Feature Importance

引用

ACM Transactions on knowledge Discovery from data 1000年

作者： Yi-Xiao He Shen-Huan Lyu Yuan Jiang National Key Laboratory for Novel Software Technology and School of Artificial Intelligence Nanjing University China Key Laboratory of Water Big Data Technology of Ministry of Water Resources and College of Computer Science and Software Engineering Hohai University China

Deep forest is a non-differentiable deep model that has achieved impressive empirical success across a wide variety of applications, especially on categorical/symbolic or mixed modeling tasks. Many of the application fields prefer explainable models, such as random forests with feature contributions that can provide a local explanation for each prediction, and Mean Decrease Impurity (MDI) that can provide global feature importance. However, deep forest, as a cascade of random forests, possesses interpretability only at the first layer. From the second layer on, many of the tree splits occur on the new features generated by the previous layer, which makes existing explaining tools for random forests inapplicable. To disclose the impact of the original features in the deep layers, we design a calculation method with an estimation step followed by a calibration step for each layer, and propose our feature contribution and MDI feature importance calculation tools for deep forest. Experimental results on both simulated data and real-world data verify the effectiveness of our methods.

关键词： deep forest feature importance interpretability

来源：评论

学校读者我要写书评

暂无评论

Feature Disentanglement Based Heterogeneous Defect Prediction

引用

ACM Transactions on Software engineering and Methodology 1000年

作者： Xu Yu Jiaqi Yan Qinqin Gao Qinglong Peng Bin Yu Junwei Du Ying Xing Dunwei Gong Qingdao Institute of Software China University of Petroleum East China) Qingdao China College of Computer Science and Technology China University of Petroleum East China) Qingdao China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software China University of Petroleum East China) Qingdao China School of Data Science Qingdao University of Science and Technology Qingdao China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun China School of Data Science Qingdao University of Science and Technology Qingdao China School of Computer and Information Technology Beijing Jiaotong University Beijing China School of Data Science Qingdao University of Science and TechnologyQingdao China School of Artificial Intelligence Beijing University of Posts and Telecommunications Beijing China Yunnan Key Laboratory of Software Engineering Kunming China College of Automation and Electronic Engineering Qingdao University of Science and Technology Qingdao China

Cross-project defect prediction (CPDP) utilizes the existing labeled data in the source project to assist with the prediction of unlabeled projects in the target dataset, which effectively improves the prediction performance and has become a research hotspot in software engineering. At present, CPDP can be categorized into homogeneous cross-project defect prediction and heterogeneous cross-project defect prediction (HDP), in which HDP doesn’t require that the source project and the target project have the same feature space, thus, it is more widely used in the actual CPDP. Most of current HDP methods map the original features to the latent feature space and reduce the inter-project variation by transferring domain-independent features, but the transferring process ignores the use of domain-related features, which affects the prediction performance of the model. Moreover, the mapped latent features are not conducive to the model’s interpretability. Based on these, this paper proposes a heterogeneous defect prediction method based on feature disentanglement (FD-HDP). We disentangle the features using domain-related and domain-independent feature extractors, respectively, to improve the interpretability of the model by maximizing the domain adversarial loss during training and guiding the feature extractors to produce accurate domain-related and domain-independent features. The weighted sum of the prediction results from domain-related and domain-independent predictors is used as the final prediction result of the project during the prediction process, which realizes the combination of domain-independent and domain-related features and effectively improves the prediction performance. In this paper, we conducted experiments using four publicly available defect datasets to construct heterogeneous scenarios. The results demonstrate that the FD-HDP model shows significant advantages over state-of-the-art methods in six metrics.

关键词： Heterogeneous Defect Prediction Feature Disentanglement Domain-related Features Domain-independent Features

来源：评论

学校读者我要写书评

暂无评论

A Relation-Constraint Link Prediction Model for Dynamic knowledge Graphs with Entity Drift

引用

ACM Transactions on knowledge Discovery from data 1000年

作者： Xiulin Zheng Peipei Li Zan Zhang Jia Wu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China and School of Computer Science and Information Engineering Hefei University of Technology China School of Computing Faculty of Science and Engineering Macquarie University Australia

knowledge Graphs (KGs) often suffer from incompleteness and this issue motivates the task of knowledge Graph Completion (KGC). Traditional KGC models mainly concentrate on static KGs with a fixed set of entities and relations, or dynamic KGs with temporal characteristics, faltering in their generalization to constantly evolving KGs with possible irregular entity drift. Thus, in this paper, we propose a novel link prediction model based on the embedding representation to handle the incompleteness of KGs with entity drift, termed as DCEL. Unlike traditional link prediction, DCEL could generate precise embeddings for drifted entity without imposing any regular temporal characteristic. The drifted entity is added into the KG with its links to the existing entity predicted in an incremental fashion with no requirement to retrain the whole KG for computational efficiency. In terms of DCEL model, it fully takes advantages of unstructured textual description, and is composed of four modules, namely MRC (Machine Reading Comprehension), RCAA (Relation Constraint Attentive Aggregator), RSA (Relation Specific Alignment) and RCEO (Relation Constraint Embedding Optimization). Specifically, the MRC module is first employed to extract short texts from long and redundant descriptions. Then, RCAA is used to aggregate the embeddings of textual description of drifted entity and the pre-trained word embeddings learned from corpus to a single text-based entity embedding while shielding the impact of noise and irrelevant information. After that, RSA is applied to align the text-based entity embedding to graph-based space to obtain the corresponding graph-based entity embedding, and then the learned embeddings are fed into the gate structure to be optimized based on the RCEO to improve the accuracy of representation learning. Finally, the graph-based model TransE is used to perform link prediction for drifted entity. Extensive experiments conducted on benchmark datasets in terms of evaluat

关键词： dynamic knowledge graph entity drift link prediction relation constraint

来源：评论

学校读者我要写书评

暂无评论

MAINet: Modality-Aware Interaction Network for Medical Image Fusion

引用

ACM Transactions on Multimedia Computing, Communications, and Applications 1000年

作者： Lisi Wei Libo Zhao Xiaoli Zhang College of Computer Science and Technology Jilin University China College of Artificial Intelligence and Big Data Hulunbuir University China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Jilin University China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

Due to the limitations of imaging sensors, obtaining a medical image that simultaneously captures both functional metabolic data and structural tissue details remains a significant challenge in clinical diagnosis. To address this, Multimodal Medical Image Fusion (MMIF) has emerged as an effective technique for integrating complementary information from multimodal source images, such as CT, PET, and SPECT, which is critical for providing a comprehensive understanding of both anatomical and functional aspects of the human body. One of the key challenges in MMIF is how to exchange and aggregate this multimodal information. This paper rethinks MMIF by addressing the harmony of modality gaps and proposes a novel Modality-Aware Interaction Network (MAINet), which leverages cross-modal feature interaction and progressively fuses multiple features in graph space. Specifically, we introduce two key modules: the Cascade Modality Interaction (CMI) module and the Dual-Graph Learning (DGL) module. The CMI module, integrated within a multi-scale encoder with triple branches, facilitates complementary multimodal feature learning and provides beneficial feedback to enhance discriminative feature learning across modalities. In the decoding process, the DGL module aggregates hierarchical features in two distinct graph spaces, enabling global feature interactions. Moreover, the DGL module incorporates a bottom-up guidance mechanism, where deeper semantic features guide the learning of shallower detail features, thus improving the fusion process by enhancing both scale diversity and modality awareness for visual fidelity results. Experimental results on medical image datasets demonstrate the superiority of the proposed method over existing fusion approaches in both subjective and objective evaluations. We also validated the performance of the proposed method in applications such as infrared-visible image fusion and medical image segmentation.

关键词： Multimodal fusion Medical image fusion Cascade modality interaction Modality-awareness Graph convolutional network

来源：评论

学校读者我要写书评

暂无评论

Automate Legibility through Inverse Reinforcement Learning

引用

ACM Transactions on Autonomous and Adaptive Systems 1000年

作者： Buxin Zeng Yinghui Pan Jing Tang Yifeng Zeng Department of Computer and Information Sciences Northumbria University UK School of Artificial Intelligence & National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Newcastle Business School Northumbria University UK

When intelligent agents act in a stochastic environment, the principle of maximizing expected rewards is used to optimize their policies. The rationality of the maximum rewards becomes a single objective when agents’ decision problems are solved in most cases. This sometimes leads to the agents’ behaviors (the optimal policies for solving the decision problems) that are not legible. In other words, it is difficult for users (or other agents and even humans) to understand the agents’ intentions when they are executing the optimal policies. Hence, it becomes pertinent to consider the legibility of agents’ decision problems. The key challenge lies in formulating a proper legibility function in the problems. Using domain experts’ inputs leans to be subjective and inconsistent in specifying legibility values, and the manual approach quickly becomes infeasible in a complex problem domain. In this article, we aim to learn such a legibility function parallel to developing a (conventional) reward function. We adopt inverse reinforcement learning techniques to automate a legibility function in agents’ decision problems. We first demonstrate the effectiveness of the inverse reinforcement learning technique when legibility is solely considered in a decision problem. Things become complicated when both the reward and legibility functions are to be found. We develop a multi-objective inverse reinforcement learning method to automate the two functions in a good balance simultaneously. We vary problem domains in the performance study and provide empirical results in support.

关键词： Legibility Inverse Reinforcement Learning Decision Making

来源：评论

学校读者我要写书评

暂无评论

Distributed Computation Offloading and Power Control for UAV-Enabled Internet of Medical Things

引用

ACM Transactions on Internet Technology 1000年

作者： Jiakun Gao Xiaolong Xu Lianyong Qi Wanchun Dou Xiaoyu Xia Xiaokang Zhou School of Software Nanjing University of Information Science and Technology NanJing China School of Software Nanjing University of Information Science and Technology NanJing China and Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology (CICAEET) Nanjing University of Information Science and Technology Nanjing China College of Computer Science and Technology China University of Petroleum (East China) QingDao China and State Key Laboratory for Novel Software Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Technology RMIT University Victoria Australia Faculty of Data Science Shiga University Hikone Japan

The advancement of the Internet of Medical Things (IoMT) has led to the emergence of various health and emotion care services, e.g., health monitoring. To cater to increasing computational requirements of IoMT services, Mobile Edge Computing (MEC) has emerged as an indispensable technology in smart health. Benefiting from the cost-effectiveness of deployment, unmanned aerial vehicles (UAVs) equipped with MEC servers in Non-Orthogonal Multiple Access (NOMA) have emerged as a promising solution for providing smart health services in proximity to medical devices (MDs). However, the escalating number of MDs and the limited availability of communication resources of UAVs give rise to a significant increase in transmission latency. Moreover, due to the limited communication range of UAVs, the geographically-distributed MDs lead to workload imbalance of UAVs, which deteriorates the service response delay. To this end, this paper proposes a UAV-enabled Distributed computation Offloading and Power control method with Multi-Agent, named DOPMA, for NOMA-based IoMT environment. Specifically, this paper introduces computation and transmission queue models to analyze the dynamic characteristics of task execution latency and energy consumption. Moreover, a credit assignment scheme-based reward function is designed considering both system-level rewards and rewards tailored to each MD, and an improved multi-agent deep deterministic policy gradient algorithm is developed to derive offloading and power control decisions independently. Extensive simulations demonstrate that the proposed method outperforms existing schemes, achieving \(7.1\%\) reduction in energy consumption and \(16\%\) decrease in average delay.

关键词： Internet of Medical Things (IoMT) Mobile Edge Computing (MEC) Unmanned Aerial Vehicles (UAV) Non-Orthogonal Multiple Access (NOMA)

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Tensorized Multi-View Kernel Subspace Clustering

引用

ACM Transactions on Intelligent Systems and Technology 1000年

作者： Guang-Yu Zhang Dong Huang Chang-Dong Wang College of Mathematics and Informatics South China Agricultural University China School of Computer Science and Engineering Sun Yat-sen University Guangxi Key Laboratory of Digital Infrastructure Guangxi Zhuang Autonomous Region Information Center Guangdong Key Laboratory of Big Data Analysis and Processing Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

The Anchor-based Multi-view Subspace Clustering (AMSC) has turned into a favourable tool for large-scale multi-view clustering. However, there still exist some limitations to the current AMSC approaches. First, they typically recover anchor graph structure in the original linear space, restricting their feasibility for nonlinear scenarios. Second, they usually overlook the potential benefits of jointly capturing the inter-view and intra-view information for enhancing the anchor representation learning. Third, these approaches mostly perform anchor-based subspace learning by a specific matrix norm, neglecting the latent high-order correlation across different views. To overcome these limitations, this paper presents an efficient and effective approach termed Large-scale Tensorized Multi-view Kernel Subspace Clustering (LTKMSC). Different from the existing AMSC approaches, our LTKMSC approach exploits both inter-view and intra-view awareness for anchor-based representation building. Concretely, the low-rank tensor learning is leveraged to capture the high-order correlation (i.e., the inter-view complementary information) among distinct views, upon which the \(l_{1,2}\) norm is imposed to explore the intra-view anchor graph structure in each view. Moreover, the kernel learning technique is leveraged to explore the nonlinear anchor-sample relationships embedded in multiple views. With the unified objective function formulated, an efficient optimization algorithm that enjoys low computational complexity is further designed. Extensive experiments on a variety of multi-view datasets have confirmed the efficiency and effectiveness of our approach when compared with the other competitive approaches.

关键词： data clustering Multi-view clustering Large-scale clustering Tensorized kernel subspace clustering Inter-view and intra-view awareness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：