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

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Xuan Wang, Di Wen, Lijie Xiao, Yubin Wu, Chunguo Wu, Yuesong Yu, Chaoyu Maskell, Douglas L. Zhou, You The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin university Changchun130012 China The Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore The School of Software Tsinghua University Beijing100084 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing surveys did not cover the state-of-the-art (SOTA) NCO solvers emerged recently. More importantly, to provide a comprehensive taxonomy of NCO solvers with up-to-date coverage, based on our thorough review of relevant publications and preprints, we divide all NCO solvers into four distinct categories, namely Learning to Construct, Learning to Improve, Learning to Predict-Once, and Learning to Predict-Multiplicity solvers. Subsequently, we present the inadequacies of the SOTA solvers, including poor generalization, incapability to solve large-scale VRPs, inability to address most types of VRP variants simultaneously, and difficulty in comparing these NCO solvers with the conventional Operations Research algorithms. Simultaneously, we propose promising and viable directions to overcome these inadequacies. In addition, we compare the performance of representative NCO solvers from the Reinforcement, Supervised, and Unsupervised Learning paradigms across both small- and large-scale VRPs. Finally, following the proposed taxonomy, we provide an accompanying web page as a live repository for NCO solvers. Through this survey and the live repository, we hope to make the research community of NCO solvers for VRPs more thriving. Copyright © 2024, The Authors. All rights reserved.

关键词： Taxonomies

Retracted: Measurement and analysis of Chinese journal discriminative capacity

学校读者我要写书评

暂无评论

Journal of Informetrics 2021年第1期15卷

作者： Baolong Zhang Hao Wang Sanhong Deng Xinning Su School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing 210023 China

Disentangled Representation Learning with Transmitted Information Bottleneck

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Dang, Zhuohang Luo, Minnan Jia, Chengyou Dai, Guang Wang, Jihong Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi’an710049 China The SGIT AI Laboratory Xi’an710048 China The State Grid Shaanxi Electric Power Company Ltd. State Grid Corporation of China Xi’an710048 China The School of Information Science and Technology University of Science and Technology of China Hefei230026 China Abu Dhabi United Arab Emirates Baidu Inc Beijing100085 China

Encoding only the task-related information from the raw data, i.e., disentangled representation learning, can greatly contribute to the robustness and generalizability of models. Although significant advances have been made by regularizing the information in representations with information theory, two major challenges remain: 1) the representation compression inevitably leads to performance drop;2) the disentanglement constraints on representations are in complicated optimization. To these issues, we introduce Bayesian networks with transmitted information to formulate the interaction among input and representations during disentanglement. Building upon this framework, we propose DisTIB (Transmitted Information Bottleneck for Disentangled representation learning), a novel objective that navigates the balance between information compression and preservation. We employ variational inference to derive a tractable estimation for DisTIB. This estimation can be simply optimized via standard gradient descent with a reparameterization trick. Moreover, we theoretically prove that DisTIB can achieve optimal disentanglement, underscoring its superior efficacy. To solidify our claims, we conduct extensive experiments on various downstream tasks to demonstrate the appealing efficacy of DisTIB and validate our theoretical analyses. Copyright © 2023, The Authors. All rights reserved.

关键词： Information theory

Digital personal health libraries: A systematic literature review

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Ding, Huitong Zhang, Chi An, Ning Zhang, Lingling Xie, Ning Alterovitz, Gil School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China Department of Computer Science University of California Davis CA United States College of Nursing and Health Sciences University of Massachusetts Boston BostonMA United States Biomedical Cybernetics Laboratory Division of General Internal Medicine and Primary Care Department of Medicine Brigham and Women's Hospital BostonMA United States Department of Medicine Harvard Medical School BostonMA United States

Objective: This paper gives context on recent literature regarding the development of digital personal health libraries (PHL) and provides insights into the potential application of consumer health informatics in diverse clinical specialties. Materials and Methods: A systematic literature review was conducted following the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) statement. Here, 2,850 records were retrieved from PubMed and EMBASE in March 2020 using search terms: personal, health, and library. Information related to the health topic, target population, study purpose, library function, data source, data science method, evaluation measure, and status were extracted from each eligible study. In addition, knowledge discovery methods, including co-occurrence analysis and multiple correspondence analysis, were used to explore research trends of PHL. Results: After screening, this systematic review focused on a dozen articles related to PHL. These encompassed health topics such as infectious diseases, congestive heart failure, electronic prescribing. data science methods included relational database, information retrieval technology, ontology construction technology. Evaluation measures were heterogeneous regarding PHL functions and settings. At the time of writing, only one of the PHLs described in these articles is available for the public while the others are either prototypes or in the pilot stage. Discussion: Although PHL researches have used different methods to address problems in diverse health domains, there is a lack of an effective PHL to meet the needs of older adults. Conclusion: The development of PHLs may create an unprecedented opportunity for promoting the health of older consumers by providing diverse health information. Copyright © 2020, The Authors. All rights reserved.

关键词： Population statistics

Single Object Tracking for Dynamic Programming based on Fine-grained Network

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2020年第1期1576卷

作者： Jianguo Jiang Kaiyuan Jin Jingjing Wu Meibin Qi Qian Wang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China

Single target tracking has always been a key and challenging research field in computer vision. Currently, an increasing number of researchers are focusing on extracting better tracking features and designing the best tracker. This paper proposes a new single target tracking network that uses fine-grained features and dynamic programming (DPFNet). In order to extract superior features, we added an attention module to the regression network enabling us to extract finer-grained and discriminative features to achieve regression. Besides, we did observe that different objects have varying moving rates; for different moving targets, the magnitude of the changes in target position within two adjacent frames is not the same either. Although an area search of 4 times the target's size can be applied to most objects, targets with large position changes may appear in other image areas outside the search area and the target would not be located as a result. Aiming at solving this problem, when designing the tracker, this paper analyzes some of the indicators for predicting the location and uses the analysis results to determine whether the search area is appropriate, so as to dynamically adjust the extent of the search area thereby significantly improving the tracking function. In other words, the size of the search area can be dynamically recalibrated for different images. Subsequent experiments prove that the method put forward in this paper achieves State-of-the-Art results.

关键词：

Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2020年第1期1437卷

作者： Yongzeng Yue Yuhong Zhang Xuegang Hu Peipei Li Key Laboratory of knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei 23061 China

Short text classification methods have achieved significant progress and wide application on text data such as Twitter and Weibo. However, the extremely short chinese texts like tax invoice data are different with traditional short texts in lackness of contextual semantic information, feature sparseness and extremely short length. The existing short text classification methods are difficult to achieve a satisfactory performance in these texts. To address these problems, this paper proposes a text classification method based on bidirectional semantic extension for extremely short texts like Chinese tax invoice data. More specifically, firstly, the Chinese knowledge graph is introduced for extending bidirectional semantic of texts and label data to expand the extremely short texts and ease the problem of feature sparseness; secondly, the hash vectorization is used to avoid the semantic problem caused by the lackness of contextual information. Experimental results conducted the real tax invoice dataset demonstrate the effectiveness of our proposed method.

关键词：

Poisoning attack against estimating from pairwise comparisons

学校读者我要写书评

暂无评论

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 generalized concept-cognitive learning: A machine learning viewpoint

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Mi, Yunlong Shi, Yong Li, Jinhai School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing101408 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha NE68182 United States Faculty of Science Kunming University of Science and Technology Kunming650500 China

Concept-cognitive learning (CCL) is a hot topic in recent years, and it has attracted much attention from the communities of formal concept analysis, granular computing and cognitive computing. However, the relationship among cognitive computing (CC), concept-cognitive computing (CCC), CCL and concept-cognitive learning model (CCLM) is not clearly described. To this end, we first explain the relationship of CC, CCC, CCL and CCLM. Then, we propose a generalized concept-cognitive learning (GCCL) from the point of view of machine learning. Finally, experiments on some data sets are conducted to verify the feasibility of concept formation and concept-cognitive process of GCCL. Copyright © 2018, The Authors. All rights reserved.

关键词： Machine learning

Ontology Revision based on Pre-trained Language Models

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ji, Qiu Zhang, Xiaoping Ye, Yuxin Qi, Guilin Li, Jiaye Li, Site Ren, Jianjie Lu, Songtao School of Modern Posts Institute of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China National Data Center ofTraditional Chinese MedicineChina Academy of ChineseMedical Sciences Beijing100700 China College of Computer Science and Technology Jilin University Changchun130012 China School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China School of Mathematics Southeast University Nanjing China Chien-Shiung Wu College Southeast University Nanjing China

Ontology revision aims to seamlessly incorporate a new ontology into an existing ontology and plays a crucial role in tasks such as ontology evolution, ontology maintenance, and ontology alignment. Similar to repair single ontologies, resolving logical incoherence in the task of ontology revision is also important and meaningful, because incoherence is a main potential factor to cause inconsistency and reasoning with an inconsistent ontology will obtain meaningless answers. To deal with this problem, various ontology revision approaches have been proposed to define revision operators and design ranking strategies for axioms in an ontology. However, they rarely consider axiom semantics which provides important information to differentiate axioms. In addition, pre-trained models can be utilized to encode axiom semantics, and have been widely applied in many natural language processing tasks and ontology-related ones in recent years. Therefore, in this paper, we study how to apply pre-trained models to revise ontologies. We first define four scoring functions to rank axioms based on a pre-trained model by considering various information from an ontology. Based on the functions, an ontology revision algorithm is then proposed to deal with unsatisfiable concepts at once. To improve efficiency, an adapted revision algorithm is designed to deal with unsatisfiable concepts group by group. We conduct experiments over 19 ontology pairs and compare our algorithms and scoring functions with existing ones. According to the experiments, our algorithms could achieve promising performance. The adapted revision algorithm could improve the efficiency largely, and at most about 90% of the time could be saved for some ontology pairs. Some of our scoring functions like reliableOnt cos could help a revision algorithm obtain better results in many cases, especially for those challenging ontology pairs like OM8. We also provide discussion about the overall experimental results and guidelin

关键词： Ontology