obdurate
发表于 2025-3-21 16:12:57
书目名称Ontologies and Concepts in Mind and Machine影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0701698<br><br> <br><br>书目名称Ontologies and Concepts in Mind and Machine读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0701698<br><br> <br><br>
lipids
发表于 2025-3-22 00:12:35
http://reply.papertrans.cn/71/7017/701698/701698_2.png
myalgia
发表于 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
STERN
发表于 2025-3-22 07:44:08
http://reply.papertrans.cn/71/7017/701698/701698_4.png
拉开这车床
发表于 2025-3-22 11:47:05
http://reply.papertrans.cn/71/7017/701698/701698_5.png
织物
发表于 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
GORGE
发表于 2025-3-22 17:14:35
http://reply.papertrans.cn/71/7017/701698/701698_7.png
Ischemia
发表于 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
http://reply.papertrans.cn/71/7017/701698/701698_9.png
有组织
发表于 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.