找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Conceptual Structures for Discovering Knowledge; 19th International C Simon Andrews,Simon Polovina,Babak Akhgar Conference proceedings 2011

[復(fù)制鏈接]
樓主: vein220
41#
發(fā)表于 2025-3-28 18:20:27 | 只看該作者
42#
發(fā)表于 2025-3-28 21:10:17 | 只看該作者
Utility and Feasibility of Reasoning beyond Decidability in Semantic Technologies of the standardization process of these and other knowledge representation formalisms, decidability of logical entailment has often been advocated as a central design criterion. On the other hand, restricting to decidable formalisms inevitably comes with constraints in terms of modeling power. Ther
43#
發(fā)表于 2025-3-29 02:48:56 | 只看該作者
44#
發(fā)表于 2025-3-29 03:39:35 | 只看該作者
In-Close2, a High Performance Formal Concept Minersed and some new optimisation and data preprocessing techniques are presented. The performance of In-Close2 is favourably compared with another contemporary CbO variant called FCbO. An application of In-Close2 is given, using minimum support to reduce the size and complexity of a large formal contex
45#
發(fā)表于 2025-3-29 09:04:11 | 只看該作者
A Mapping from Conceptual Graphs to Formal Concept Analysisd to those of CGs, in, for example, formally reasoning about a system design. In the mapping, a formal attribute in FCA is formed by combining a CG source concept with its relation. The corresponding formal object in FCA is the corresponding CG target concept. It is described how a CG, represented b
46#
發(fā)表于 2025-3-29 13:25:29 | 只看該作者
Partial Orders and Logical Concept Analysis to Explore Patterns Extracted by Data Mininggeneral, too many resulting patterns for a user to explore them all by hand. Some methods try to reduce the number of patterns without a priori pruning. The number of patterns remains, nevertheless, high. Other approaches, based on a total ranking, propose to show to the user the top-k patterns with
47#
發(fā)表于 2025-3-29 17:39:50 | 只看該作者
A Buzz and E-Reputation Monitoring Tool for Twitter Based on Galois Latticesal networks, by allowing distribution, and therefore broadcasting of information in a almost instantaneous way, also speed up the formation of opinions concerning actuality. Then, these networks are great observatories of opinions and e-reputation. In this e-reputation monitoring task, it is easy to
48#
發(fā)表于 2025-3-29 23:37:19 | 只看該作者
Using Generalization of Syntactic Parse Trees for Taxonomy Capture on the Webn starts from the seed entities and mines the web for new entities associated with them. To form these new entities, machine learning of syntactic parse trees (syntactic generalization) is applied to form commonalities between various search results for existing entities on the web. Taxonomy and syn
49#
發(fā)表于 2025-3-30 00:54:58 | 只看該作者
50#
發(fā)表于 2025-3-30 04:47:27 | 只看該作者
Crowdsourced Knowledge: Peril and Promise for Conceptual Structures Researchrces as a knowledge base. Researchers who develop these systems explicitly assume that what is most often repeated in that knowledge base is the truth. Their assumption implicitly relies on a fallacy in classical logic: “proof by assertion” (or proof by repeated assertion). This paper considers the
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-23 20:30
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
靖边县| 阳江市| 沾化县| 汕尾市| 河源市| 民县| 如东县| 洞口县| 全椒县| 雷州市| 且末县| 芜湖县| 衡阳县| 绍兴县| 红河县| 南华县| 富锦市| 滨海县| 蓝田县| 南京市| 改则县| 吴江市| 泰和县| 轮台县| 嘉定区| 丹棱县| 集安市| 科技| 嘉定区| 宝山区| 罗源县| 清丰县| 独山县| 榆林市| 关岭| 和林格尔县| 阜宁县| 集安市| 宁安市| 佳木斯市| 湖州市|