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

2006 International Workshop on Description Logics, DL 2006

作者： Che, Haiyan Sun, Jigui Yu, Haibo College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with rigor advocates a DL method to map the specification of MAS into a DL TBox. Thus, we can use the existing DL reasoners and systems to verify and validate some system's properties.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

An embedded vertical‐federated feature selection algorithm based on particle swarm optimisation

引用

CAAI Transactions on Intelligence Technology 2023年第3期8卷 734-754页

作者： Yong Zhang Ying Hu Xiaozhi Gao Dunwei Gong Yinan Guo Kaizhou Gao Wanqiu Zhang School of Information and Control Engineering China University of Mining and TechnologyXuzhouChina The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunChina School of Computing University of Eastern FinlandKuopioFinland The Macao Institute of Systems Engineering Macao University of Science and TechnologyTaipaChina

In real life,a large amount of data describing the same learning task may be stored in different institutions(called participants),and these data cannot be shared among par-ticipants due to privacy *** case that different attributes/features of the same instance are stored in different institutions is called vertically distributed *** pur-pose of vertical‐federated feature selection(FS)is to reduce the feature dimension of vertical distributed data jointly without sharing local original data so that the feature subset obtained has the same or better performance as the original feature *** solve this problem,in the paper,an embedded vertical‐federated FS algorithm based on particle swarm optimisation(PSO‐EVFFS)is proposed by incorporating evolutionary FS into the SecureBoost framework for the first *** optimising both hyper‐parameters of the XGBoost model and feature subsets,PSO‐EVFFS can obtain a feature subset,which makes the XGBoost model more *** the same time,since different participants only share insensitive parameters such as model loss function,PSO‐EVFFS can effec-tively ensure the privacy of participants'***,an ensemble ranking strategy of feature importance based on the XGBoost tree model is developed to effectively remove irrelevant features on each ***,the proposed algorithm is applied to 10 test datasets and compared with three typical vertical‐federated learning frameworks and two variants of the proposed algorithm with different initialisation ***-mental results show that the proposed algorithm can significantly improve the classifi-cation performance of selected feature subsets while fully protecting the data privacy of all participants.

关键词： Evolutionary optimization feature selection privacy protection vertical‐federated learning

来源：评论

学校读者我要写书评

暂无评论

Interval-valued Fuzzy Description Logic IFALCN-Preliminary Results

Interval-valued Fuzzy Description Logic IFALCN-Preliminary R...

引用

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

作者： Linlin Huo Jihong Ouyang Dayou Liu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College o Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of

To represent and reason with interval-value information of applications in description logic, based on interval-fuzzy set the classical description logic *** is extended to the fuzzy description logic IFALCN. Its' syntax, semantics and fuzzy tableau algorithm are presented in detail. Our work enhances the expressiveness and reasoning ability of ALCN. IFALCN is the generalization of fuzzy ALCN based on single value and more expressive than the latter and can conform to human cognition better.

关键词： description logic interval-value fuzzy set fuzzy tableau algotithm

来源：评论

学校读者我要写书评

暂无评论

Reasoning and predicting POMDP planning complexity via covering numbers

引用

Frontiers of Computer Science 2016年第4期10卷 726-740页

作者： Zongzhang ZHANG Qiming FU Xiaofang ZHANG Quan LIU School of Computer Science and Technology Soochow University Suzhou 215000 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210000 China School of Electronic and Information Engineering Suzhou University of Science and Technology Suzhou 215000 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Partially observable Markov decision processes （POMDPs） provide a rich mathematical framework for planning tasks in partially observable stochastic environments. The notion of the covering number, a metric of capturing the search space size of a POMDP planning problem, has been proposed as a complexity measure of approximate POMDP planning. Existing theoretical results are based on POMDPs with finite and discrete state spaces and measured in the l1- metric space. When considering heuristics, they are assumed to be always admissible. This paper extends the theoretical results on the covering numbers of different search spaces, including the newly defined space reachable under inadmissible heuristics, to the ln-metric spaces. We provide a simple but scalable algorithm for estimating covering numbers. Experimentally, we provide estimated covering numbers of the search spaces reachable by following different policies on several benchmark problems, and analyze their abilities to predict the runtime of POMDP planning algorithms.

关键词： POMDP planning complexity theory covering number search space

来源：评论

学校读者我要写书评

暂无评论

TS-Net: Two-stage deformable medical image registration network based on new smooth constraints

引用

Magnetic Resonance Imaging 2023年第1期99卷 26-33页

作者： Song, Lei Ma, Mingrui Liu, Guixia College of Computer Science and Technology Jilin University Jilin Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China

Medical image registration can establish the spatial consistency of the corresponding anatomical structures between different medical images, which is important in medical image analysis. In recent years, with the rapid development of deep learning, the image registration methods based on deep learning greatly improve the speed, accuracy, and robustness of registration. Regrettably, these methods typically do not work well for large deformations and complex deformations in the image, and neglect to preserve the topological properties of the image during deformation. Aiming at these problems, we propose a new network TS-Net that learns deformation from coarse to fine and transmits information of different scales in the two stages. Two-stage network learning deformation from coarse to fine can gradually learn the large and complex deformations in images. In the second stage, the feature maps downsampled in the first stage for skip connection can expand the local receptive field and obtain more local information. The smooth constraints function used in the past is to impose the same restriction on the global, which is not targeted. In this paper, we propose a new smooth constraints function for each voxel deformation, which can better ensure the smoothness of the transformation and maintain the topological properties of the image. The experiments on brain datasets with complex deformations and heart datasets with large deformations show that our proposed method achieves better results while maintaining the topological properties of deformations compared to existing deep learning-based registration methods. © 2023 Elsevier Inc.

关键词： CNN Deformable image registration Smooth loss Two stage Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Integrity constraint validation in dl-liter based ontology using rewriting 2nd

Integrity constraint validation in dl-liter based ontology u...

引用

2nd International Conference on Young Computer Scientists, Engineers and Educators, ICYCSEE 2016

作者： Cui, Xianji Ouyang, Dantong He, Jialiang College of Information and Communication Engineering Dalian Minzu University Dalian116600 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9789811020971

With the rapid development of information technology, semantic web data present features of massiveness and complexity. As the data-centric science, social computing have great influence in collecting and analyzing semantic data. In our contribution, we propose an integrity constraint validation for DL-LiteR based ontology in view of data correctness issue in the progress of social computing applications. Firstly, at the basis of translations from integrity constraint axioms into a set of conjunctive queries, integrity constraint validation is converted into the conjunctive query answering over knowledge bases. Moreover, rewriting rules are used for reformulating the integrity constraint axioms using standard axioms. On this account, the integrity constraint validation can be reduced to the query evaluation over the ABox, and use query mechanisms in database management systems to optimize integrity constraint validation. Finally, the experimental result shows that the rewritingbased method greatly improves the efficiency of integrity constraint validation and is more appropriate to scalable data in the semantic web. © Springer Science+Business Media Singapore 2016.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Building trust networks in the absence of trust relations

引用

Frontiers of Information Technology & Electronic engineering 2017年第10期18卷 1591-1600页

作者： Xin WANG Ying WANG Jian-hua GUO College of Computer Science and Technology Jilin University Changchun 130012 China School of Computer Technology and Engineering Changchun Institute of Technology Changchun 130012 China School of Mathematics and Statistics Northeast Normal University Changchun 130024 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin 541004 China

User-specified trust relations are often very sparse and dynamic, making them difficult to accurately predict from online social media. In addition, trust relations are usually unavailable for most social media *** issues pose a great challenge for predicting trust relations and further building trust networks. In this study,we investigate whether we can predict trust relations via a sparse learning model, and propose to build a trust network without trust relations using only pervasively available interaction data and homophily effect in an online world. In particular, we analyze the reliability of predicting trust relations by interaction behaviors, and provide a principled way to mathematically incorporate interaction behaviors and homophily effect in a novel framework,b Trust. Results of experiments on real-world datasets from Epinions and Ciao demonstrated the effectiveness of the proposed framework. Further experiments were conducted to understand the importance of interaction behaviors and homophily effect in building trust networks.

关键词： Trust network Sparse learning Homophily effect Interaction behaviors

来源：评论

学校读者我要写书评

暂无评论

Inversing cardinal direction relations

Inversing cardinal direction relations

引用

International Conference on Frontier of Computer Science and Technology

作者： Chen, Juan Jia, Haiyang Liu, Dayou Zhang, Changhai College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9780769541396

Focusing on the inversing operation of cardinal directions, the current generative method does not always work correctly. According to the given definitions of smallest rectangular direction and original directions, the correlations between cardinal directions and interval algebra are built. Basing on the above analysis, the algorithm to compute the inverse direction and its proof are given. The results show that out of 511*511 possible pairs of basic cardinal directions, there are 757 pairs of inverse relations over simple regions and 1621 pairs over compound regions. Finally the discussion points out the reason why existing generative method works incorrectly and indicates that our method has a quite good dimensional expansibility. © 2010 IEEE.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

A survey of multi-agent coordination

A survey of multi-agent coordination

引用

2006 International Conference on Artificial Intelligence, ICAI'06

作者： Jiang, Li Liu, Da-You College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9781932415988

Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection of coordination mechanisms, new coordination models using swarm intelligence, new methods using varied techniques like case based reasoning, reinforcement learning, distributed logic programming, game theory, etc.. In this paper, we survey these achievement as a general study of coordination, including, the nature of coordination, coordination mechanisms, coordination approaches, relationship among coordination mechanisms and approaches, coordination methodologies, conversational aspects of coordination and software architectures. And along with this survey, we give our view of future research direction of coordination.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

MaxRPC algorithms based on bitwise operations

MaxRPC algorithms based on bitwise operations

引用

Lecture Notes in Computer Science

作者： Guo, Jinsong Li, Zhanshan Zhang, Liang Geng, Xuena Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China

ISBN: (纸本)9783642237850

Max Restricted Path Consistency (maxRPC) is a promising domain filtering consistency for binary constraints. In existing algorithms, the process of searching for PC-witnesses requires most constraint checks. And the computing speed of this process significantly affects the efficiency of the whole algorithm. In this paper, we propose a new method based on bitwise operations to speed up the computations of this process. Two algorithms maxRPCbit and maxRPCbi+rm utilizing this new method are proposed. Both algorithms and their light versions outperform the best ones among existing algorithms by a large margin. Significantly, our experiments, which compare the search algorithms applying light maxRPC with the one maintaining arc consistency, demonstrate that maxRPC is a much more promising filtering technique than what we thought. © 2011 Springer-Verlag.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：