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

knowledge Representation and Reasoning for Complex Time Expression in Clinical Text

data Intelligence 2022年第3期4卷 573-598页

作者： Danyang Hu Meng Wang Feng Gao Fangfang Xu Jinguang Gu School of Computer Science and Technology Wuhan University of Science and TechnologyWuhan 430065China Key Laboratory of Rich-Media Knowledge Organization and Service of Digital Publishing Content National Press and Publication Administration of the People’s Republic of ChinaBeijing 10038China Institute of Big Data Science and Engineering Wuhan University of Science and TechnologyWuhan 430065China

Temporal information is pervasive and crucial in medical records and other clinical text,as it formulates the development process of medical conditions and is vital for clinical decision ***,providing a holistic knowledge representation and reasoning framework for various time expressions in the clinical text is *** order to capture complex temporal semantics in clinical text,we propose a novel Clinical Time Ontology(CTO)as an extension from OWL *** specifically,we identified eight timerelated problems in clinical text and created 11 core temporal classes to conceptualize the fuzzy time,cyclic time,irregular time,negations and other complex aspects of clinical ***,we extended Allen’s and TEO’s temporal relations and defined the relation concept description between complex and simple ***,we provided a formulaic and graphical presentation of complex time and complex time *** carried out empirical study on the expressiveness and usability of CTO using real-world healthcare ***,experiment results demonstrate that CTO could faithfully represent and reason over 93%of the temporal expressions,and it can cover a wider range of time-related classes in clinical domain.

关键词： Clinical text Temporal ontology Temporal relations OWL Negation of temporal relation

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Performance to Detecting Topic Shift of Large Language Models: A Study 9

Evaluating the Performance to Detecting Topic Shift of Large...

引用

9th International Conference on Intelligent Computing and Signal Processing, ICSP 2024

作者： Tian, Pingfang Liu, Deting Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Institute of Scientific and Technical Information of China The Key Laboratory of the Rich Media Knowledge Organisation and Service of Digital Publishing Content Beijing100038 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Wuhan430065 China

ISBN: (纸本)9798350376548

Topic shift detection aims to identify whether there is a change in the current topic of conversation or if a change is needed. The study found previous work did not evaluate the performance of large language models like ChatGPT on the task of topic shift. Therefore, this paper's main task and innovation lie in analyzing ChatGPT's performance on topic shift detection. To provide a more comprehensive evaluation, we conducted topic shift detection tasks on ChatGPT from three aspects: single utterances, adjacent utterances, and contextual levels. Additionally, to gauge the performance of large language models, we conducted experiments on multiple small-scale models and compared the results of the two models. Experimental results on the publicly available English TIAGE dataset showed that small-scale models exhibited lower recall in all three aspects, while ChatGPT performed better in the recall. This suggests that compared to small-scale models, large models are more capable of accurately detecting topic shifts. However, large models also exhibited lower precision, indicating that while ChatGPT can recognize content differences in utterances, its judgment on whether these different contents belong to the same topic is poor. © 2024 IEEE.

关键词： adjacent utterances level ChatGPT contextual level single utterances level topic shift detection

来源：评论

学校读者我要写书评

暂无评论

Which Companies are Likely to Invest: knowledge-graph-based Recommendation for Investment Promotion

Which Companies are Likely to Invest: Knowledge-graph-based ...

引用

IEEE International Conference on data Mining (ICDM)

作者： Chenyang Bu Jiawei Zhang Xingchen Yu Le Wu Xindong Wu 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 China and Institute of Big Knowledge Science Hefei University of Technology Hefei China

Investment promotion refers to the process by which the government uses disposable resources to attract investors to the region for production and business activities. The existing basic mode of attracting investment is to collect information about enterprises and entrepreneurs through manual methods, determine the target enterprise from the list of enterprises, and then attract investment through visits, negotiations, and other methods. As contacting and visiting companies one by one requires huge amounts of manpower and time, the choice of target companies is critical for attracting investments. However, to the best of our knowledge, no study has conducted research from the perspective of knowledge-graph-based recommendation. In this study, we define the problem of target company recommendation in the process of investment promotion, and analyze the characteristics of the problem and the challenges it faces based on the background of the actual problem. Then, a two-tier model for solving this problem is provided from the perspective of knowledge graph reasoning. Aiming at the problem that the knowledge graph will frequently change, the model is designed based on the idea of combining the advantages of global and local link prediction. The experimental results on real-world data demonstrate the effectiveness of the proposed model.

关键词： Economics knowledge acquisition Government Companies Production Manuals Predictive models

来源：评论

学校读者我要写书评

暂无评论

Personalized Recommendation Based on Entity Attributes and Graph Features 12

Personalized Recommendation Based on Entity Attributes and G...

引用

12th IEEE International Conference on big knowledge, ICBK 2021

作者： Zhu, Yi Dong, Bingbing Sha, Zhiqing Yangzhou University School of Information Engineering Yangzhou China Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Institute of Big Knowledge Science Hefei University of Technology Hefei China

ISBN: (纸本)9781665438582

With the rapid increase in the amount of website data, it has been a more difficult task for users to get the infor-mation they are interested in. Personalized recommendation is an important bridge to find the information which users really need on the website. Many recent studies have introduced additional attribute information about users and/or items to the rating matrix for alleviating the problem of data sparsity. In order to make full use of the attribute information and scoring matrix, deep learning based recommendation methods are proposed, especially the autoencoder model has attracted much attention because of its strong ability to learn hidden features. However, most of the existing autoencoder- based models require that the dimension of the input layer is equal to the dimension of the output layer, which may increase model complexity and certain information loss when using attribute information. In addition, as users' awareness of privacy protection increases, user attribute information is difficult to obtain. To address the above problems, in this paper, we propose a hybrid personalized recommendation model, which uses a semi-autoencoder to jointly embed the item's score vector and internal graph features (short for Co-Agpre). Specifically, we regard the user-item historical interaction matrix as a bipartite graph, and the Laplacian of the user-item co-occurrence graph is utilized to obtain the graph features of the item for solving the problem of sparse attributes. Then a semi-autoencoder is introduced to learn the hidden features of the item and perform rating prediction. The proposed model can flexibly use information from different sources to reduce the complexity of the model. Experiments on two real-world datasets demonstrate the effectiveness of the proposed Co-Agpre compared with state-of-the-art methods. © 2021 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation Techniques 38

Suppress Content Shift: Better Diffusion Features via Off-th...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features 38

Not All Diffusion Model Activations Have Been Evaluated as D...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Federated Causally Invariant Feature Learning 39

Federated Causally Invariant Feature Learning

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Guo, Xianjie Yu, Kui Cui, Lizhen Yu, Han Li, Xiaoxiao School of Computer Science and Information Engineering Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education China School of Software Shandong University China College of Computing and Data Science Nanyang Technological University Singapore Department of Electrical and Computer Engineering The University of British Columbia Canada Vector Institute Canada

ISBN: (纸本)157735897X

Federated feature selection (FFS) is a promising field for selecting informative features while preserving data privacy in federated learning (FL) settings. Existing FFS methods focus on capturing the correlations between features and labels. They struggle to achieve satisfactory performance in the face of data distribution heterogeneity among FL clients, and cannot address the out-of-distribution (OOD) problem that arises when a significant portion of clients do not actively participate in FL training. To address these limitations, we propose Federated Causally Invariant Feature Learning (FedCIFL), a novel approach for learning causally invariant features in a privacy-preserving manner. We design a sample reweighting strategy to eliminate spurious correlations introduced by selection bias and iteratively estimate the federated causal effect between each feature and the labels (with the remaining features initially treated as confounders). By iteratively refining the confounding feature set to identify the true confounders, FedCIFL mitigates the impact of limited local data on the accuracy of federated causal effect estimation. Theoretical analysis proves the correctness of FedCIFL under reasonable assumptions. Extensive experiments on synthetic and real-world datasets demonstrate the superiority of FedCIFL against eight state-of-the-art baselines, beating the best-performing approach by 3.19%, 9.07% and 2.65% in terms of average test Accuracy, RMSE and F1 score, respectively. It is a first-of-its-kind FFS approach capable of handling Non-IID and OOD data simultaneously. The source code is available at https://***/Xianjie-Guo/FedCIFL. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Counterfactual Faithful data Generation Based on Disentangled Representation for Compound Fault Diagnosis of Rolling Bearings 3

Counterfactual Faithful Data Generation Based on Disentangle...

引用

3rd International Conference on Sensing, Measurement and data Analytics in the Era of Artificial Intelligence, ICSMD 2022

作者： Ding, Xu Zhu, Qiang Wang, Song Zhang, Yiqi Wang, Hui Xu, Juan Institute of Industry and Equipment Technology Hefei University of Technology Hefei China School of Mechanical Engineering Hefei University of Technology Hefei China Bengbu Triumph Engineering Technology Co. Ltd Bengbu China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei China

ISBN: (纸本)9781665492812

Recently, deep learning and human-out-of-the-loop methods enjoy their prosperous applications in mechanical fault diagnosis. Nonetheless, the None-IID(independent and identically distributed) issue radicated in acquired data severely limits the stability and accuracy of compound fault diagnosis of rolling bearings. This paper proposes a sample augmentation method for generating simulated signals based on the concept of counterfactuals. Firstly, disentangled representations and counterfactual faithful theory are applied to classify the original signal into two categories of properties. One is the fault semantics encoded from the original vibration signal. And the other is the sample attribute encoded by the encoder of Variational Autoencoders (VAEs). Secondly, the counterfactual faithful pseudo-samples are conjured through the Generative Adversarial Network(GAN) using the seeds of the 'factual' sample attributes and 'counterfactual' fault semantics to compensate for the drawback of distribution shift. Finally, the original samples and pseudo-samples are used as the CNN classifier dataset to realize bearing fault diagnosis. Experiments show that this method can generate counterfactual signals that are highly consistent with the original data distribution and can achieve better classification accuracy after balancing the dataset. © 2022 IEEE.

关键词： counterfactual faithfulness fault diagnosis rolling bearing structural causal model VAEGAN

来源：评论

学校读者我要写书评

暂无评论

An accurate diagnostic model for PNS in children based on random wandering and vector space Constructing research*

An accurate diagnostic model for PNS in children based on ra...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Kui Zhang ShuangGui Tian Yong Xiao ShaoWu Shen ShuSong Mao College of Information Engineering Hubei University of Chinese Medicine Wuhan China Research Institute for Traditional Chinese Medicine Knowledge Engineering and Big Data Hubei University of Chinese Medicine Wuhan China Hubei Provincial Hospital of Traditional Chinese Medicine Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Pediatric nephrotic syndrome (PNS) is a common urological disease in children, and one of the main symptoms of PNS is spleen and kidney yang deficiency. The aim of this study was to construct a 5-layer accurate diagnostic model, adding disease staging and syndromic grouping to the three diagnostic layers of "disease, evidence and symptom". First, we use the random walk method for the topological network of primary symptoms and the feature group similarity calculation method for secondary symptoms to match the optimal staging of cases. Then, we use the cosine similarity between the vector space of each evidence grouping and the case ensemble vector to select the optimal evidence grouping. This approach provides new ideas and methods for clinical individualized treatment in traditional Chinese medicine (TCM).

关键词： Spleen knowledge engineering Pediatrics big data Vectors data models Clinical diagnosis Medical diagnostic imaging Kidney Diseases

来源：评论

学校读者我要写书评

暂无评论

A Review-aware Graph Contrastive Learning Framework for Recommendation

arXiv

引用

arXiv 2022年

作者： Shuai, Jie Sun, Peijie Zhang, Kun Hong, Richang Li, Yong Wu, Le Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center China Beijing National Research Center for Information Science and Technology Department of Electronic Engineering Tsinghua University China

Most modern recommender systems predict users’ preferences with two components: user and item embedding learning, followed by the user-item interaction modeling. By utilizing the auxiliary review information accompanied with user ratings, many of the existing review-based recommendation models enriched user/item embedding learning ability with historical reviews or better modeled user-item interactions with the help of available user-item target reviews. Though significant progress has been made, we argue that current solutions for review-based recommendation suffer from two drawbacks. First, as review-based recommendation can be naturally formed as a user-item bipartite graph with edge features from corresponding user-item reviews, how to better exploit this unique graph structure for recommendation? Second, while most current models suffer from limited user behaviors, can we exploit the unique self-supervised signals in the review-aware graph to guide two recommendation components better? To this end, in this paper, we propose a novel Review-aware Graph Contrastive Learning (RGCL) framework for review-based recommendation. Specifically, we first construct a review-aware user-item graph with feature-enhanced edges from reviews, where each edge feature is composed of both the user-item rating and the corresponding review semantics. This graph with feature-enhanced edges can help attentively learn each neighbor node weight for user and item representation learning. After that, we design two additional contrastive learning tasks (i.e., Node Discrimination and Edge Discrimination) to provide self-supervised signals for the two components in recommendation process. Finally, extensive experiments over five benchmark datasets demonstrate the superiority of our proposed RGCL compared to the state-of-the-art baselines. Copyright © 2022, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：