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

arXiv 2024年

作者： Wang, Bing Fu, Bo Li, Ximing Pei, Songwen Li, Changchun Wang, Shengsheng College of Computer Science and Technology Jilin University Changchun Jilin China Liaoning Normal University Liaoning Dalian China University of Shanghai for Science and Technology Shanghai China Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education Jilin University China

Various social media platforms, e.g., Twitter and Reddit, allow people to disseminate a plethora of information more efficiently and conveniently. However, they are inevitably full of misinformation, causing damage to diverse aspects of our daily lives. To reduce the negative impact, timely identification of misinformation, namely Misinformation Detection (MD), has become an active research topic receiving widespread attention. As a complex phenomenon, the veracity of an article is influenced by various aspects. In this paper, we are inspired by the opposition of intents between misinformation and real information. Accordingly, we propose to reason the intent of articles and form the corresponding intent features to promote the veracity discrimination of article features. To achieve this, we build a hierarchy of a set of intents for both misinformation and real information by referring to the existing psychological theories, and we apply it to reason the intent of articles by progressively generating binary answers with an encoder-decoder structure. We form the corresponding intent features and integrate it with the token features to achieve more discriminative article features for MD. Upon these ideas, we suggest a novel MD method, namely Detecting Misinformation by Integrating Intent featuRes (Dm-inter). To evaluate the performance of Dm-inter, we conduct extensive experiments on benchmark MD datasets. The experimental results validate that Dm-inter can outperform the existing baseline MD methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Formal Reachability Analysis for Multi-Agent Reinforcement Learning Systems

Formal Reachability Analysis for Multi-Agent Reinforcement L...

引用

作者： Wang, Xiaoyan Peng, Jun Li, Shuqiu Li, Bing College of Computer Science and Technology Jilin University Changchun130012 China Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

Reachability analysis is one of the most basic and challenging problems in verification. We investigate this problem in multi-agent reinforcement learning (MARL) system by transforming the reachability analysis to decision-making problem tackled by mixed integer linear programming (MILP) solver Gurobi. We define syntax and semantics for multi-role strategy logic (mrSL) which is used to describe the reachability specification. The logic mrSL is a variant of SL to express properties, which provide a holistic perspective to describe reachability properties instead of specifying a specific agent reaches a certain state in the MARL system. And the algorithms to translate reachability property into MILP constraints are provided. A tool called MAReachAnalysis is introduced, which uses Gurobi to solve the corresponding reachability problem and evaluate it on the predator-prey task of multi-agent deep deterministic policy gradient (MADDPG) example, discussion of the experimental results obtained on a range of test cases. © 2013 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Discrepancy-Guided Reconstruction Learning for Image Forgery Detection

arXiv

引用

arXiv 2023年

作者： Shi, Zenan Chen, Haipeng Chen, Long Zhang, Dong College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of CSE The Hong Kong University of Science and Technology Hong Kong

In this paper, we propose a novel image forgery detection paradigm for boosting the model learning capacity on both forgery-sensitive and genuine compact visual patterns. Compared to the existing methods that only focus on the discrepant-specific patterns (e.g., noises, textures, and frequencies), our method has a greater generalization. Specifically, we first propose a Discrepancy-Guided Encoder (DisGE) to extract forgery-sensitive visual patterns. DisGE consists of two branches, where the mainstream backbone branch is used to extract general semantic features, and the accessorial discrepant external attention branch is used to extract explicit forgery cues. Besides, a Double-Head Reconstruction (DouHR) module is proposed to enhance genuine compact visual patterns in different granular spaces. Under DouHR, we further introduce a Discrepancy-Aggregation Detector (DisAD) to aggregate these genuine compact visual patterns, such that the forgery detection capability on unknown patterns can be improved. Extensive experimental results on four challenging datasets validate the effectiveness of our proposed method against state-of-the-art competitors. Copyright © 2023, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

END-TO-END ENTITY DETECTION WITH PROPOSER AND REGRESSOR

arXiv

引用

arXiv 2022年

作者： Wen, Xueru Zhou, Changjiang Tang, Haotian Liang, Luguang Jiang, Yu Qi, Hong College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China

Named entity recognition is a traditional task in natural language processing. In particular, nested entity recognition receives extensive attention for the widespread existence of the nesting scenario. The latest research migrates the well-established paradigm of set prediction in object detection to cope with entity nesting. However, the manual creation of query vectors, which fail to adapt to the rich semantic information in the context, limits these approaches. An end-to-end entity detection approach with proposer and regressor is presented in this paper to tackle the issues. First, the proposer utilizes the feature pyramid network to generate high-quality entity proposals. Then, the regressor refines the proposals for generating the final prediction. The model adopts encoder-only architecture and thus obtains the advantages of the richness of query semantics, high precision of entity localization, and easiness of model training. Moreover, we introduce the novel spatially modulated attention and progressive refinement for further improvement. Extensive experiments demonstrate that our model achieves advanced performance in flat and nested NER, achieving a new state-of-the-art F1 score of 80.74 on the GENIA dataset and 72.38 on the WeiboNER dataset. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Self-Supervised Learning for Medical Image Segmentation

Multi-Task Self-Supervised Learning for Medical Image Segmen...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Bo Wang Hang Zhao Xiongfei Li Mingjie Tian Bo Huang Feiyang Yang Intelligent Information Processing Laboratory Yanbian University Yanji China College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Artificial Intelligence Jilin University Changchun China

Although medical image segmentation has achieved remarkable results with supervised learning, obtaining labeled data remains challenging and costly. To counteract this, we present the MTSPSeg, a multi-task self-supervised learning framework. We establish the dynamic gradient learning rate (DGLR) strategy and the dynamic multi-task loss weight adjustment method (DWL) to relieve potential early convergence and diverse learning difficulties of self-supervised learning. Our method deeply integrates the prior knowledge inherent in medical images, facilitates collaborative learning among tasks, and delves further into the latent information within the images. Experimental results demonstrate that regardless of the proportion of labeled data, our method outperforms baseline models on the KiTS19 and LiTS datasets, achieving state-of-the-art performance on the KiTS19 dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TYPE-SUPERVISED SEQUENCE LABELING BASED ON THE HETEROGENEOUS STAR GRAPH FOR NAMED ENTITY RECOGNITION

arXiv

引用

arXiv 2022年

Named entity recognition is a fundamental task in natural language processing, identifying the span and category of entities in unstructured texts. The traditional sequence labeling methodology ignores the nested entities, i.e. entities included in other entity mentions. Many approaches attempt to address this scenario, most of which rely on complex structures or have high computation complexity. The representation learning of the heterogeneous star graph containing text nodes and type nodes is investigated in this paper. In addition, we revise the graph attention mechanism into a hybrid form to address its unreasonableness in specific topologies. The model performs the type-supervised sequence labeling after updating nodes in the graph. The annotation scheme is an extension of the single-layer sequence labeling and is able to cope with the vast majority of nested entities. Extensive experiments on public NER datasets reveal the effectiveness of our model in extracting both flat and nested entities. The method achieved state-of-the-art performance on both flat and nested datasets. The significant improvement in accuracy reflects the superiority of the multi-layer labeling strategy. Copyright © 2022, The Authors. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

DeepSelective: Feature Gating and Representation Matching for Interpretable Clinical Prediction

arXiv

引用

arXiv 2025年

作者： Zhang, Ruochi Yang, Qian Wang, Xiaoyang Wu, Haoran Zhou, Qiong Wang, Yu Li, Kewei Wang, Yueying Fan, Yusi Zhang, Jiale Huang, Lan Liu, Chang Zhou, Fengfeng College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Beijing Life Science Academy Beijing102209 China Syneron Technology Guangzhou510700 China

The rapid accumulation of Electronic Health Records (EHRs) has transformed healthcare by providing valuable data that enhance clinical predictions and diagnoses. While conventional machine learning models have proven effective, they often lack robust representation learning and depend heavily on expert-crafted features. Although deep learning offers powerful solutions, it is often criticized for its lack of interpretability. To address these challenges, we propose DeepSelective, a novel end to end deep learning framework for predicting patient prognosis using EHR data, with a strong emphasis on enhancing model interpretability. DeepSelective combines data compression techniques with an innovative feature selection approach, integrating custom-designed modules that work together to improve both accuracy and interpretability. Our experiments demonstrate that DeepSelective not only enhances predictive accuracy but also significantly improves interpretability, making it a valuable tool for clinical decision-making. The source code is freely available at http://***/supp/*** . © 2025, CC BY-NC-ND.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

ON A NOVEL UCP RESULT AND ITS APPLICATION TO INVERSE CONDUCTIVE SCATTERING

arXiv

引用

arXiv 2024年

作者： Diao, Huaian Fei, Xiaoxu Liu, Hongyu School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Mathematics and Statistics Central South University Changsha410083 China Department of Mathematics City University of Hong Kong Kowloon Hong Kong

In this paper, we derive a novel Unique Continuation Principle (UCP) for a system of second-order elliptic PDEs and apply it to investigate inverse problems in conductive scattering. The UCP relaxes the typical assumptions imposed on the domain or boundary with certain interior transmission conditions. This is motivated by the study of the associated inverse scattering problem and enables us to establish several novel unique identifiability results for the determination of generalized conductive scatterers using a single far-field pattern, significantly extending the results in [15, 21]. A key technical advancement in our work is the combination of Complex Geometric Optics (CGO) techniques from [15, 21] with the Fourier expansion method to microlocally analyze corner singularities and their implications for inverse problems. We believe that the methods developed can have broader applications in other contexts. © 2024, CC BY.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Efficient Heuristics for Learning Scalable Bayesian Network Classifier from Labeled and Unlabeled Data

SSRN

引用

SSRN 2023年

作者： Wang, Limin Wang, Junjie Guo, Lu Li, Qilong Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Software Jilin University Changchun130012 China College of Instrumentation and Electrical Engineering Jilin University Changchun130012 China

Naive Bayes (NB) is one of the top ten machine learning algorithms whereas its attribute independence assumption rarely holds in practice. A feasible and efficient approach to improving NB is relaxing the assumption by adding augmented edges to the restricted topology of NB. In this paper we prove theoretically that the generalized topology may be a suboptimal solution to model multivariate probability distributions if its fitness to data cannot be measured. Thus we propose to apply log-likelihood function as the scoring function, then introduce an efficient heuristic search strategy to explore high-dependence relationships, and for each iteration the learned topology will be improved to fit data better. The proposed algorithm, called log-likelihood Bayesian classifier (LLBC), can respectively learn two submodels from labeled training set and individual unlabeled testing instance, and then make them work jointly for classification in the framework of ensemble learning. Our extensive experimental evaluations on 36 UCI benchmark datasets reveal that, LLBC demonstrates excellent classification performance and provides a competitive approach to learn from labeled and unlabeled data. © 2023, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

PLPR: Towards Efficient and Privacy-Preserving LBSNs-Based POI Recommendation in Cloud

PLPR: Towards Efficient and Privacy-Preserving LBSNs-Based P...

引用

IEEE International Conference on Communications (ICC)

作者： Lili Sun Yonggang Zhang Yandong Zheng Rongxing Lu Hui Zhu Key Laboratory of Symbolic Computation and Knowledge Engineer Jilin University Changchun China State Key Laboratory of Integrated Services Networks Xidian University Xi'an China Facuity of Computer Science University of New Brunswick Fredericton Canada

With the popularity of location-based social networks (LBSNs), locations and social relationships have been considered to be important factors in point-of-interest (POI) recommendation services. The boom of cloud computing has driven data owners to outsource the LBSN data and the POI recommendation services to the cloud with powerful computing and storage capabilities. However, as the data usually contains sensitive information, it should be encrypted before being out-sourced, and consequently, the POI recommendation has to be processed over encrypted data. Although several privacy-preserving LBSNs-based POI recommendation schemes have been proposed, they are either inapplicable to the outsourcing scenario or have issues with the recommendation accuracy. Aiming at addressing these issues, in this paper, we propose an efficient and privacy-preserving LBSNs-based POI recommendation scheme (PLPR). Specifically, we first index the users' social relationships with Bloom filters and then organize the user resident location and social relationship dataset into a Vantage Point (VP) tree. Then, we design an efficient LSBNs-based POI recommendation algorithm based on the VP tree. After that, we design a privacy-preserving range determination protocol (PRD) and a privacy-preserving neighbor determination protocol (PND) to respectively protect the privacy of locations and social relationships in the designed algorithm and propose our PLPR scheme. Security analysis shows that our scheme is privacy-preserving, and performance evaluation demonstrates that our scheme is also efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：