找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Ontologies and Concepts in Mind and Machine; 25th International C Mehwish Alam,Tanya Braun,Bruno Yun Conference proceedings 2020 Springer N

[复制链接]
查看: 21524|回复: 51
发表于 2025-3-21 16:12:57 | 显示全部楼层 |阅读模式
书目名称Ontologies and Concepts in Mind and Machine
副标题25th International C
编辑Mehwish Alam,Tanya Braun,Bruno Yun
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Ontologies and Concepts in Mind and Machine; 25th International C Mehwish Alam,Tanya Braun,Bruno Yun Conference proceedings 2020 Springer N
描述.This book constitutes the proceedings of the 25th International Conference on Conceptual Structures, ICCS 2020, held in Bolzano, Italy, in September 2020.*..The 10 full papers, 5 short papers and 1 poster paper presented were carefully reviewed and selected from 24 submissions. The proceedings also include two keynotes and two tutorials. The papers focus on the representation of and reasoning with conceptual structures in a variety of contexts. The topics of this year‘s conference range from formal concept analysis to decision making, from machine learning to natural language processing...*.The conference was held virtually due to the COVID-19 pandemic..
出版日期Conference proceedings 2020
关键词artificial intelligence; computer programming; computer systems; concept lattices; data mining; databases
版次1
doihttps://doi.org/10.1007/978-3-030-57855-8
isbn_softcover978-3-030-57854-1
isbn_ebook978-3-030-57855-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2020
The information of publication is updating

书目名称Ontologies and Concepts in Mind and Machine影响因子(影响力)




书目名称Ontologies and Concepts in Mind and Machine影响因子(影响力)学科排名




书目名称Ontologies and Concepts in Mind and Machine网络公开度




书目名称Ontologies and Concepts in Mind and Machine网络公开度学科排名




书目名称Ontologies and Concepts in Mind and Machine被引频次




书目名称Ontologies and Concepts in Mind and Machine被引频次学科排名




书目名称Ontologies and Concepts in Mind and Machine年度引用




书目名称Ontologies and Concepts in Mind and Machine年度引用学科排名




书目名称Ontologies and Concepts in Mind and Machine读者反馈




书目名称Ontologies and Concepts in Mind and Machine读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:12:35 | 显示全部楼层
发表于 2025-3-22 02:16:31 | 显示全部楼层
An Incremental Algorithm for Computing All Repairs in Inconsistent Knowledge Bases while certain applications need the generation of all repairs. In this paper, we show that the problem of all repair computation is not trivial in practice. To account for a scalable solution, we provide an incremental approach for the computation of all repairs when the conflicts have a cardinalit
发表于 2025-3-22 07:44:08 | 显示全部楼层
发表于 2025-3-22 11:47:05 | 显示全部楼层
发表于 2025-3-22 14:32:41 | 显示全部楼层
Preventing Overlaps in Agglomerative Hierarchical Conceptual Clusteringumed that the result is a tree-like structure with no overlapping clusters, i.e., where clusters are either disjoint or nested. In Hierarchical Conceptual Clustering (HCC), each cluster is provided with a conceptual description which belongs to a predefined set called the .. Depending on the applica
发表于 2025-3-22 17:14:35 | 显示全部楼层
发表于 2025-3-22 23:21:56 | 显示全部楼层
Pruning in Map-Reduce Style CbO Algorithms (shortly, CbO-based algorithms). State-of-the-art CbO-based algorithms, e.g. FCbO, In-Close4, and In-Close5, employ several techniques, which we call pruning, to avoid some unnecessary computations. However, the number of the formal concepts can be exponential w.r.t. dimension of the input data. Th
发表于 2025-3-23 02:20:07 | 显示全部楼层
发表于 2025-3-23 07:36:20 | 显示全部楼层
Characterizing Movie Genres Using Formal Concept Analysists and genres are attribute. The context is then used to find formal concepts organized in a concept lattice. This conceptual structure is useful to measure semantic genre-based similarity of movies, which is important for content-based recommender systems.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-26 00:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表