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

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Shaojing Sheng Peng Zhou Key Laboratory of Knowledge Engineering with Big Data (Heifei Unversity of Technology) Ministry of Education Heifei China School of Compuster Science and Technology Anhui University Heifei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

As a widely used data structure, graphs are good at characterizing data with internal associations, such as social and biological data. Tree structured data are special and are widely used in many real-world applications, such as organizational structure analysis and genealogical knowledge graph reasoning. For example, in kinship knowledge graph analysis, when a genealogical tree is particularly large (more than 25 levels and 45,000 nodes), it is a great challenge to partition this large tree into a specified number of subtrees with succinct logic and a balanced number of nodes. Therefore, in this paper, we propose the TPA (tree partitioning algorithm) algorithm to achieve a balanced and succinct logic partition of large-scale tree structured data. TPA first extracts all related nodes from a massive graph database and then constructs the convergent subgraph into a complete tree with a specified root node. Specifically, several virtual nodes are supplemented for generation-skipping connected nodes to achieve correct node numbering and partitioning. Finally, a graph partitioning algorithm is executed on the complete tree to obtain a specified number of subtrees with succinct logic and balanced node scales. Experiments conducted on four real-world datasets verify the effectiveness of our TPA algorithm.

关键词： Partitioning algorithms data visualization Convergence data analysis Distributed databases Big data

来源：评论

学校读者我要写书评

暂无评论

Which One Is Better, Simple or Complex Metrics?

引用

Journal of Computer and Communications 2015年第11期3卷 52-57页

作者： Fangjun Wu School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China High Level Engineering Research Center of Electronic-Commerce Jiangxi Provincial Colleges and Universities Nanchang China

At the early stage of software lifecycle, the complexity measurement of UML class diagrams plays an important role in software development, testing and maintenance, and provides guidance for developing high quality software. In order to study which one is better, simple or complex metrics, this paper analyzes and compares four typical metrics of UML class diagrams from experimental software engineering view points. Understandability, analyzability and maintainability were classified and predicted for 27 class diagrams related to a banking system by means of algorithm C5.0 within the famous toolkit Weka. Results suggest that the performance of simple metrics is not inferior to that of complex metrics, in some cases even better than that of complex metrics.

关键词： Software Measurement UML Class Diagram Empirical Validation Classification

来源：评论

学校读者我要写书评

暂无评论

Multi-source Multi-label Feature Selection

Multi-source Multi-label Feature Selection

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiulan Yuan Xuegang Hu Peipei Li Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei City China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei City China

Feature selection for multi-source multi-label data has attracted much attention, because there are a lot of scenarios that produce multiple source data with multi-labels in the real-world applications, which aggravates the problems of dimensional disaster and the label skewness. However, most of existing multi-source feature selection methods miss the multi-label issue while existing multi-label feature selection methods can not select the optimal feature set in the multi-source environment. Motivated by this, we propose a novel feature selection method, called MSMLFS. To be specific, the Inf-FS algorithm is firstly introduced to handle multi-label feature selection for each data source, which considers the label weight in the feature selection. Secondly, the over-sampling mechanism and the inter-source feature fusion method are used to handle the label skewness of multi-label data and the feature selection in multiple sources respectively. Finally, extensive experiments conducted on synthetic and real-world multi-source multi-label data sets demonstrate that the proposed method outperforms several state-of-the-art multi-source or multi-label feature selection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Chinese Lexical Simplification

引用

IEEE/ACM Transactions on Audio Speech and Language Processing 2021年 29卷 1819-1828页

作者： Qiang, Jipeng Lu, Xinyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China

Lexical simplification has attracted much attention in many languages, which is the process of replacing complex words in a given sentence with simpler alternatives of equivalent meaning. Although the richness of vocabulary in Chinese makes the text very difficult to read for children and non-native speakers, there is no research work for the Chinese lexical simplification (CLS) task. To circumvent difficulties in acquiring annotations, we manually create the first benchmark dataset for CLS, which can be used for evaluating the lexical simplification systems automatically. To acquire a more thorough comparison, we present five different types of methods as baselines to generate substitute candidates for the complex word that includes synonym-based approach, word embedding-based approach, BERT-based approach, sememe-based approach, and a hybrid approach. Finally, we design the experimental evaluation of these baselines and discuss their advantages and disadvantages. To our best knowledge, this is the first study for CLS task. © 2014 IEEE.

关键词： BERT Lexical simplification pretrained language model unsupervised

来源：评论

学校读者我要写书评

暂无评论

Emotion-Cause Pair Extraction Based on knowledge-Transfer 21

Emotion-Cause Pair Extraction Based on Knowledge-Transfer

引用

21st Chinese National Conference on Computational Linguistic, CCL 2022

作者： Fengyuan, Zhao Dexi, Liu Qizhi, Wan Changxuan, Wan Xiping, Liu Guoqiong, Liao School of Information Management Jiangxi University of Finance and Economics Jiangxi Nanchang China Jiangxi University of Finance and Economics Key Laboratory of Data and Knowledge Engineering Jiangxi Nanchang China

The existing emotion cause pair extraction models do not improve the performance of emotion cause pair extraction by incorporating external knowledge. In this work, we propose an emotion-cause pair extraction model based on knowledge transfer (ECPE-KT), in which knowledge is utilized to obtain explicit knowledge encoding of text. Subsequently, the implicit knowledge encoding of clauses is obtained by the transfer of external sentiment classification corpus. Moreover, conduct filtering via adding the relative position and prediction probability to the representation of clause semantic features. Transformer with window mechanism is used to optimize the calculation pressure. Experimental results show that the proposed method outperforms the state-of-the-art method, i.e., ECPE-2D. © 2022 China National Conference on Computational Linguistics Published under Creative Commons Attribution 4.0 International License.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

knowledge Enhanced Coreference Resolution via Gated Attention

Knowledge Enhanced Coreference Resolution via Gated Attentio...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Kai He Bing Mao Xiangyu Zhou Yufei Li Tieliang Gong Chen Li Jialun Wu School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Coreference resolution aims at linking all mentions that refer to the same entity, which are widely adopted in many biomedical and bioinformatics tasks, such as biomedical knowledge graph construction and metabolic pathway integration. Many recent studies focus on improving neural model structures. However, we argue that a practical method that integrates commonsense knowledge can further improve coreference resolution performance, because commonsense delivers extra prior knowledge for reasoning and can enhance related representations, rather than naive mention-context occurrence modeling. In this work, we propose an effective method to integrate external commonsense knowledge into a neural coreference resolution model. Specially, a gated attention mechanism is employed in our method to leverage commonsense according to different contexts. By using ConceptNet as the knowledge base in three span-ranking backbone models, the models can yield significant performance gains on used datasets. We also achieve improvements in tasks of long-term mention detection and cross-sentence coreferences after incorporating knowledge.

关键词： Biological system modeling knowledge based systems Logic gates Performance gain Task analysis Bioinformatics Commonsense reasoning

来源：评论

学校读者我要写书评

暂无评论

A knowledge Graph Completion Model with Path-Specific Learning

A Knowledge Graph Completion Model with Path-Specific Learni...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xiulin Zheng Zan Zhang Rui Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) and also with the School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Inspur Academy of Science and Technology Shandong China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

knowledge graphs (KGs) play an increasingly im-portant role in many knowledge-aware tasks. However, existing KGs are struggle with incompleteness, which motivates knowledge graph completion (KGC), that is, predicting the lost links between entities based on observed triples. Reasoning over relation paths in incomplete KGs is popular. Nonetheless, some significant issues are still remained to be addressed, such as path noise and ambiguity of inferred relation. To address these problems, we propose a novel path augmented _Reasoning model with avoidance of Path noise and Disambiguation of inferred relation in this paper, referred to as RPD. In this model, we calculate the sum of resource allocation for each relation path to measure its reliability to avoid the inference of path noise. To address the ambiguity of an inferred relation, we introduce position embedding to denote the relation position along the path when learning path representation. Extensive experiments conducted on benchmark datasets demonstrate the effectiveness of our proposal RPD model in the handling of KGC tasks compared to SOTAs.

关键词： Heavily-tailed distribution Noise knowledge graphs Benchmark testing Transformers Cognition Reliability Resource management Proposals Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Personalized Recommendation Based On Entity Attributes and Graph Features

Personalized Recommendation Based On Entity Attributes and G...

引用

IEEE International Conference on Big knowledge (ICBK)

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

ISBN: (纸本)9781665438599

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.

关键词： Deep learning Privacy Laplace equations Conferences Predictive models Feature extraction Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-guided Mutual Consistency Training for Semi-supervised Biomedical Relation Extraction

Uncertainty-guided Mutual Consistency Training for Semi-supe...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Bing Mao Chang Jia Yucheng Huang Kai He Jialun Wu Tieliang Gong Chen Li School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Biomedical relation extraction seeks to automatically extract biomedical relations from biomedical text, which plays an important role in biomedical studies. However, constructing high-quality biomedical annotation data is not only time-consuming but also requires a high level of knowledge in the biomedical field. To alleviate this problem, Semi-supervised Biomedical Relation Extraction aims to extract relation facts from the limited labeled data and the more readily available unlabeled samples. Existing works can be roughly categorized as self-training methods and self-ensembling methods. The former aims to generate pseudo labels, which may lead to the gradual drift problem. The latter aims to encourage the output of one model to be consistent with the other model, where the acquisition of the model is tedious. To alleviate these issues, we propose a novel Uncertainty-Guided Mutual Consistency Training framework(UG-MCT) for semi-supervised Biomedical relation extraction. Specifically, our framework consists of two models with the same structure, which differ only when updating their weights, and then an intersecting pseudo-label mechanism is designed to convert the prediction discrepancies of the two models into mutual consistency training loss, thus promoting the consistency of model predictions. In addition, we utilize uncertainty as guided information to assist the model in focusing on the confident pseudo labels and mitigate the noise of inaccurate pseudo labeling during training. Thus, our model is very simple and efficient while mitigating the noise introduced by pseudo-labels. UG-MCT is evaluated on multiple datasets in different settings and the experimental results demonstrate that our method is highly effective in semi-supervised biomedical relation extraction compared to the state-of-the-art.

关键词： Training Adaptation models Uncertainty Annotations Biological system modeling Focusing Predictive models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：