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

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security 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 School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A Web-Geographical Information System for Real Time Monitoring of Arachthos River, Greece

引用

IFAC-PapersOnLine 2018年第30期51卷 384-389页

作者： Athanasiou, Thomas Salmas, Dimitrios Karvelis, Petros Angelis, Ioannis Andrea, Veronika Schismenos, Paraskeuas Styliou, Maria Stylios, Chrysostomos Laboratory of Knowledge and Intelligent Computing Department of Computer Engineering Technological Educational Institute of Epirus Arta Greece

The scope of this work is to present a Web-GIS that will monitor the broader area of Arachthos River in order to serve as an online mechanism for early warning and mapping of flood events. It describes briefly the main technologies for developing a web-based GIS system i.e. mapping technologies, developing databases and web applications. The advent of client-side web mapping has provided all the necessary tools to develop platforms for creating Web based Geographical Information Systems (Web-GIS). The information system combines data deriving from different sources such meteorological, geographical and water level data that are visualizing within the Web-GIS platform. The design and operation of the system aims to enhance the local government and relative stakeholders’ knowledge in order to improve decision making processes and efficient crisis management, in case of a flood event; while, another scope is also to keep the general public informed for the case of emergency situation. © 2016

关键词： Geographic information systems Artificial intelligence Decision making Decision support systems Floods Hazards Information systems Information use Mapping Monitoring Rivers Water levels Websites Crisis management Decision making process Design and operations Emergency situation Real time monitoring Web based geographical information systems Web geographical information system Web GIS

来源：评论

学校读者我要写书评

暂无评论

MFE-Net: A Novel Multi-scale Feature Enhancement Network for SAR Ship Instance Segmentation

引用

IEEE Geoscience and Remote Sensing Letters 2025年

作者： Liu, Li Zhang, Shuo Hu, Mingtao North China Electric Power University Hebei Key Laboratory of Knowledge Computing for Energy and Power Department of Computer Baoding071000 China Ministry of Education Engineering Research Center of Intelligent Computing for Complex Energy Systems Department of Computer North China Electric Power University Baoding071000 China University of Chinese Academy of Sciences Aerospace Information Research Institute Chinese Academy of Sciences Beijing100190 China

Deep learning has achieved significant progress in ship instance segmentation for synthetic aperture radar (SAR) im-ages. However, due to the challenges posed by inshore scenes, such as dense clustering, arbitrary arrangement orientation, and multi-scale targets, the performance of existing methods still falls short of expectations. To overcome the dilemma, we propose MFE-Net, a one-stage instance segmentation network based on oriented bounding box (OBB). First, we design an Orientation-aware Seg-mentation Head (OSeg Head) to enhance the network's perception of directional features while mitigating interference from complex background. Additionally, a Feature Aggregation Diffusion Pyra-mid (FADP) is proposed, consisting of the Multi-level Feature Alignment Module (MAM) and the Multi-scale Feature Enhance-ment Module (MFEM). The FADP aggregates global semantic and detailed information, and effectively enhances the feature repre-sentations of both deep and shallow layers through multi-scale fea-ture extraction. Experimental results on two public benchmark datasets (HRSID, SSDD) and a self-built dataset (HRSID_IS) demonstrate that MFE-Net achieves an ideal trade-off between ac-curacy and efficiency, respectively reaching 58.9%, 63.0%, and 46.9% AP with parameters of 12.36M. © 2004-2012 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

A meta-inspired termite queen algorithm for global optimization and engineering design problems

引用

Engineering Applications of Artificial Intelligence 2022年 111卷

作者： Peng Chen Shihua Zhou Qiang Zhang Nikola Kasabov Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian University Dalian 116622 China School of Computer Science and Technology Dalian University of Technology Dalian 116024 China Knowledge Engineering and Discovery Research Institute Auckland University of Technology Auckland 1010 New Zealand Intelligent Systems Research Center Ulster University Londonderry BT52 1SA UK

This paper proposes a novel bio-inspired termite queen algorithm (TQA) to solve optimization problems by simulating the division of labor in termite populations under a queen’s rule. TQA is benchmarked on a set of 23 functions to test its performance at solving global optimization problems, and applied to six real-world engineering design problems to verify its reliability and effectiveness. Comparative simulation studies with other algorithms are conducted, from whose results it is observed that TQA satisfactorily solves global optimization problems and engineering design problems.

关键词： Termite queen algorithm Benchmarked functions Loss minimization Metaheuristic technique Engineering design problems

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Secrets Behind Advanced Artificial Intelligence Language Models in Deidentifying Chinese-English Mixed Clinical Text: Development and Validation Study

引用

Journal of Medical Internet Research 2024年第1期26卷 e48443页

作者： Lee, You-Qian Chen, Ching-Tai Chen, Chien-Chang Lee, Chung-Hong Chen, Peitsz Wu, Chi-Shin Dai, Hong-Jie Dialogue System Technical Department Asustek Computer Inc Taipei Taiwan Intelligent System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Bioinformatics and Medical Engineering Asia University Taichung Taiwan Center for Precision Health Research Asia University Taichung Taiwan Electromagnetic Sensing Control and AI Computing System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Knowledge Discovery and Data Mining Lab Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Chemical Engineering Feng Chia University Taichung Taiwan National Center for Geriatrics and Welfare Research National Health Research Institutes Zhunan Taiwan National Institute of Cancer Research National Health Research Institutes Tainan Taiwan School of Post-Baccalaureate Medicine College of Medicine Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan

Background: The widespread use of electronic health records in the clinical and biomedical fields makes the removal of protected health information (PHI) essential to maintain privacy. However, a significant portion of information is recorded in unstructured textual forms, posing a challenge for deidentification. In multilingual countries, medical records could be written in a mixture of more than one language, referred to as code mixing. Most current clinical natural language processing techniques are designed for monolingual text, and there is a need to address the deidentification of code-mixed text. Objective: The aim of this study was to investigate the effectiveness and underlying mechanism of fine-tuned pretrained language models (PLMs) in identifying PHI in the code-mixed context. Additionally, we aimed to evaluate the potential of prompting large language models (LLMs) for recognizing PHI in a zero-shot manner. Methods: We compiled the first clinical code-mixed deidentification data set consisting of text written in Chinese and English. We explored the effectiveness of fine-tuned PLMs for recognizing PHI in code-mixed content, with a focus on whether PLMs exploit naming regularity and mention coverage to achieve superior performance, by probing the developed models’ outputs to examine their decision-making process. Furthermore, we investigated the potential of prompt-based in-context learning of LLMs for recognizing PHI in code-mixed text. Results: The developed methods were evaluated on a code-mixed deidentification corpus of 1700 discharge summaries. We observed that different PHI types had preferences in their occurrences within the different types of language-mixed sentences, and PLMs could effectively recognize PHI by exploiting the learned name regularity. However, the models may exhibit suboptimal results when regularity is weak or mentions contain unknown words that the representations cannot generate well. We also found that the availability of cod

关键词： ChatGPT code mixing deidentification electronic health record large language model pretrained language model

来源：评论

学校读者我要写书评

暂无评论

Evaluating associative classification algorithms for Big Data

引用

Big Data Analytics 2019年第1期4卷 1-27页

作者： Padillo, Francisco Luna, José María Ventura, Sebastián Department of Computer Science and Numerical Analysis University of Cordoba Cordoba Spain Knowledge Discovery and Intelligent Systems in Biomedicine Laboratory Maimonides Biomedical Research Institute of Cordoba Cordoba Spain Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia

Associative Classification, a combination of two important and different fields (classification and association rule mining), aims at building accurate and interpretable classifiers by means of association rules. A major problem in this field is that existing proposals do not scale well when Big Data are considered. In this regard, the aim of this work is to propose adaptations of well-known associative classification algorithms (CBA and CPAR) by considering different Big Data platforms (Spark and Flink). An experimental study has been performed on 40 datasets (30 classical datasets and 10 Big Data datasets). Classical data have been used to find which algorithms perform better sequentially. Big Data dataset have been used to prove the scalability of Big Data proposals. Results have been analyzed by means of non-parametric tests. Results proved that CBA-Spark and CBA-Flink obtained interpretable classifiers but it was more time consuming than CPAR-Spark or CPAR-Flink. In this study, it was demonstrated that the proposals were able to run on Big Data (file sizes up to 200 GBytes). The analysis of different quality metrics revealed that no statistical difference can be found for these two approaches. Finally, three different metrics (speed-up, scale-up and size-up) have also been analyzed to demonstrate that the proposals scale really well on Big Data. The experimental study has revealed that sequential algorithms cannot be used on large quantities of data and approaches such as CBA-Spark, CBA-Flink, CPAR-Spark or CPAR-Flink are required. CBA has proved to be very useful when the main goal is to obtain highly interpretable results. However, when the runtime has to be minimized CPAR should be used. No statistical difference could be found between the two proposals in terms of quality of the results except for the interpretability of the final classifiers, CBA being statistically better than CPAR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Topic recommendation using Doc2Vec

Topic recommendation using Doc2Vec

引用

International Joint Conference on Neural Networks

作者： Petros Karvelis Dimitris Gavrilis George Georgoulas Chrysostomos Stylios Laboratory of Knowledge and Intelligent Computing Technological Educational Institute of Epirus Arta Greece Department of Electrical Engineering and Computer Technology University of Patras Greece Control Engineering Group Luleâ University of Technology Sweden

The ever-increasing number of electronic content stored in digital libraries requires a significant amount of effort in cataloguing and has led to self-deposit solutions where the authors submit and publish their own digital records. Even in self-deposit, going through the abstract and assigning subject terms or keywords is a time consuming and expensive process, yet crucial for the metadata quality of the record that affects retrieval. Therefore, an automatic, or even a semi-automatic process that can recommend topics for a new entry is of huge practical value. A system that can address that has to rely basically on two components, one component for efficiently representing the relevant information of the new document and one component for recommending an appropriate set of topics based on the representation of the previous stage. In this work, different candidate solutions for both components are investigated and compared. For the first stage both distributed Document to Vector (doc2vec) and conventional Bag of Words (BoW) components are employed, while for the latter two different transformation approaches from the field of multi-label classification are compared. For the comparison, a collection of Ph.D. abstracts (～19000 documents) from the MIT Libraries Dspace repository is used suggesting that different combinations can provide high quality solutions.

关键词： Feature extraction Predictive models Libraries Neural networks Classification algorithms Task analysis Training

来源：评论

学校读者我要写书评

暂无评论

Aggregate experts knowledge in Fuzzy Cognitive Maps

Aggregate experts knowledge in Fuzzy Cognitive Maps

引用

IEEE International Conference on Fuzzy Systems

作者： Giovanni Mazzuto Maurizio Bevilacqua Chrysostomos Stylios Voula C. Georgopoulos Dipartimento Ingegneria Industriale e Scienze Matematiche Università Politecnica delle Marche Ancona Italy Laboratory of Knowledge and Intelligent Computing (KIC) Educational Institute of Epirus Arta Greece School Health and Welfare Professions TEI of Western Greece Patras Greece

In the last years, increased attention has been paid to the use of experts' opinions as concerned with the decisionmaking process and problem solving. Several approaches for aggregating them have been analysed but the literature review has highlighted that the experts' credibility in many cases is neglected. Thus, the present study aims at developing a novel approach for Fuzzy Cognitive Maps modelling, described in the literature as the unique methodology able to aggregate individuals knowledge and beliefs, combining a group decisionmaking technique, such as the Aggregation of Individual Evaluations one, and a structured credibility evaluation method according to the expertise areas of each expert. In particular, using a numerical example, the comparison between the traditional outcomes and those of the proposed method, highlights how the second one allows to obtain results more concordant with the single experts judgements than the first one, criticized of smoothing the experts opinion excessively.

关键词： Mathematical model Decision making Fuzzy cognitive maps Analytical models Aggregates Linguistics Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：