派博傳思國際中心

標題: Titlebook: ; [打印本頁]

作者: Addendum    時間: 2025-3-21 19:19
書目名稱Graph-Based Representation and Reasoning影響因子(影響力)




書目名稱Graph-Based Representation and Reasoning影響因子(影響力)學科排名




書目名稱Graph-Based Representation and Reasoning網絡公開度




書目名稱Graph-Based Representation and Reasoning網絡公開度學科排名




書目名稱Graph-Based Representation and Reasoning被引頻次




書目名稱Graph-Based Representation and Reasoning被引頻次學科排名




書目名稱Graph-Based Representation and Reasoning年度引用




書目名稱Graph-Based Representation and Reasoning年度引用學科排名




書目名稱Graph-Based Representation and Reasoning讀者反饋




書目名稱Graph-Based Representation and Reasoning讀者反饋學科排名





作者: Obsessed    時間: 2025-3-21 21:25
https://doi.org/10.1007/978-3-658-20115-9omises so far. Most ontologies are too tailored to specific data and use-cases. By making sometimes strong, or sometimes too weak, ontological commitments, many existing ontologies do not adequatly reflect human conceptualizations. As a result, sharing and reuse of ontologies is greatly inhibited. I
作者: 苦笑    時間: 2025-3-22 03:11
Modelle der Materialistischen Dialektikized and analyzed in the last decade. A bridging to Formal Concept Analysis (FCA) has been brought by introducing analogical complexes, i.e. formal concepts that share a maximal analogical relation enabling by this analogies between (formal) concepts. Electronic Health Record (EHR) systems are nowad
作者: pellagra    時間: 2025-3-22 07:12

作者: 脆弱帶來    時間: 2025-3-22 09:42

作者: 變量    時間: 2025-3-22 15:21
https://doi.org/10.1007/978-3-322-81355-8nclude unnecessary grounding, or do not consider the relational and temporal aspects of the models. One approach for efficient reasoning on relational static models given multiple queries is the lifted junction tree algorithm. In addition, for propositional temporal models, the interface algorithm a
作者: 變量    時間: 2025-3-22 19:49

作者: Culpable    時間: 2025-3-22 23:52
https://doi.org/10.1007/978-3-663-12247-0t lattices from growing unmanageably big. If the results of the modeling are to be used by humans, e.g. in search engines, then it is important that the similarity assessment matches human expectations. We therefore investigated experimentally if the set-theoretic reformulation of Tversky’s contrast
作者: 鉗子    時間: 2025-3-23 03:04
https://doi.org/10.1007/978-3-642-51869-0esearch. APOS Theory is a constructivist theory concerned with mathematical learning whereas FCA is a mathematical theory itself. Together both theories provide different insights into how conceptual structures can be modelled and learned: FCA provides a model for a structural analysis of mathematic
作者: 退潮    時間: 2025-3-23 06:40

作者: 剛開始    時間: 2025-3-23 11:29
https://doi.org/10.1007/978-3-642-81700-7. We present a first mathematical characterization of a collaborative learning group, a ., based on closure systems of attribute sets and the well-known attribute exploration algorithm from formal concept analysis. To this end, we introduce (weak) local experts for subdomains of a given knowledge do
作者: 極少    時間: 2025-3-23 17:30

作者: antiquated    時間: 2025-3-23 20:00
https://doi.org/10.1007/978-3-322-93008-8in various domains and we focus here on river monitoring. In this paper, a limited number of river sites that make up a river network (seen as a directed graph) is given. Periodically, for each river site three types of data are collected. Our aim is to reveal user-friendly results for visualising t
作者: 自愛    時間: 2025-3-23 23:19
https://doi.org/10.1007/978-3-322-88041-3BMS are complemented with a rich set of systems, known as NoSQL. One of the main categories of NoSQL databases are document stores which are specifically designed to handle semi-structured data, for instance XML documents. In this paper, we present a modeling method for semi-structured data based on
作者: Intruder    時間: 2025-3-24 05:31
https://doi.org/10.1007/978-3-663-12249-4nd technical components. However, EA’s current way of thinking and working to achieve this aim is not standardised. EA thus continues to “reinvent the wheel” that causes mistakes or wastes resources on rediscovering what should already be known. We, therefore, represent the specific business, inform
作者: 額外的事    時間: 2025-3-24 07:14

作者: CLOUT    時間: 2025-3-24 11:58
Using Analogical Complexes to Improve Human Reasoning and Decision Making in Electronic Health Recorized and analyzed in the last decade. A bridging to Formal Concept Analysis (FCA) has been brought by introducing analogical complexes, i.e. formal concepts that share a maximal analogical relation enabling by this analogies between (formal) concepts. Electronic Health Record (EHR) systems are nowad
作者: Indigence    時間: 2025-3-24 15:31

作者: uveitis    時間: 2025-3-24 21:22
Lifted Most Probable Explanation, boiling down to computing marginal distributions. To handle multiple queries efficiently, the lifted junction tree algorithm (LJT) uses a first-order cluster representation of a knowledge base and LVE in its computations. Another type of query asks for a most probable explanation (MPE) for given e
作者: 大量    時間: 2025-3-25 00:57

作者: BOAST    時間: 2025-3-25 04:53
Defining Argumentation Attacks in Practice: An Experiment in Food Packaging Consumer Expectationsty expectations when proposing new solutions. Argumentative approaches have been proposed and demonstrated to be of added value when addressing such decision making problems. In this paper we focus on the following research question: “How to define an attack relation for argumentative decision makin
作者: Expostulate    時間: 2025-3-25 07:47

作者: Geyser    時間: 2025-3-25 14:17

作者: 同步左右    時間: 2025-3-25 17:05
Musical Descriptions Based on Formal Concept Analysis and Mathematical Morphologythe harmonic forms underlying musical compositions. These models make use of ideas and notions belonging to two algebraic approaches: Formal Concept Analysis (FCA) and Mathematical Morphology (MM). Concept lattices are built from interval structures whereas mathematical morphology operators are subs
作者: faction    時間: 2025-3-25 22:20
Towards Collaborative Conceptual Exploration. We present a first mathematical characterization of a collaborative learning group, a ., based on closure systems of attribute sets and the well-known attribute exploration algorithm from formal concept analysis. To this end, we introduce (weak) local experts for subdomains of a given knowledge do
作者: Anticoagulants    時間: 2025-3-26 00:33

作者: Pituitary-Gland    時間: 2025-3-26 04:31

作者: 捏造    時間: 2025-3-26 11:46

作者: Ancillary    時間: 2025-3-26 13:24
Using Conceptual Structures in Enterprise Architecture to Develop a New Way of Thinking and Working nd technical components. However, EA’s current way of thinking and working to achieve this aim is not standardised. EA thus continues to “reinvent the wheel” that causes mistakes or wastes resources on rediscovering what should already be known. We, therefore, represent the specific business, inform
作者: 間諜活動    時間: 2025-3-26 20:50

作者: 抱狗不敢前    時間: 2025-3-27 00:18

作者: Admonish    時間: 2025-3-27 03:48
A Visual Analytics Technique for Exploring Gene Expression in the Developing Mouse Embryoe and the genes expressed in each component. An algorithm is presented that defines the computation the Formal Context. Examples of resulting lattices are given to illustrate the technique and show how it can provide useful information to researchers of gene expression and embryo development.
作者: Aggrandize    時間: 2025-3-27 07:16

作者: MIR    時間: 2025-3-27 10:30
https://doi.org/10.1007/978-3-642-81700-7e insights as far as providing first results on the decidability problem if a given consortium is able to explore some target domain. Applications in conceptual knowledge acquisition as well as in collaborative interactive ontology learning are at hand.
作者: 蒸發(fā)    時間: 2025-3-27 14:19

作者: 保守黨    時間: 2025-3-27 21:06
Combining and Contrasting Formal Concept Analysis and APOS Theoryes provide different insights into how conceptual structures can be modelled and learned: FCA provides a model for a structural analysis of mathematical concepts and APOS Theory highlights the challenges involved in learning concepts that are complex and abstract.
作者: Aphorism    時間: 2025-3-28 00:17
Conceptual Graphs Based Modeling of Semi-structured Datally designed to handle semi-structured data, for instance XML documents. In this paper, we present a modeling method for semi-structured data based on Conceptual Graphs and exemplify the method on an XML document. The expressive power of Conceptual Graphs makes them particularly suitable for conceptual modeling of semi-structured data.
作者: 憤憤不平    時間: 2025-3-28 05:22
https://doi.org/10.1007/978-3-322-81355-8 tree algorithm, an exact algorithm to answer multiple queries efficiently for probabilistic relational temporal models with known domains by reusing computations for multiple queries and multiple time steps. First experiments show computational savings while appropriately accounting for relational and temporal aspects of models.
作者: confederacy    時間: 2025-3-28 09:58
https://doi.org/10.1007/978-3-322-93008-8s. The main objective is to enhance the evaluation step by extracting heterogeneous closed partially-ordered patterns organised into a hierarchy. The experiments and qualitative interpretations show that our method outputs instructive results for the hydro-ecological domain.
作者: Hla461    時間: 2025-3-28 11:56

作者: 有抱負者    時間: 2025-3-28 16:38

作者: 機密    時間: 2025-3-28 18:57
https://doi.org/10.1007/978-3-658-20115-9n order to more effectively preserve this notion of human conceptualization, an ontology should be designed with modularity and extensibility in mind. A modular ontology thus may act as a bridge between human conceptualization and data.
作者: Guileless    時間: 2025-3-29 02:37

作者: Ruptured-Disk    時間: 2025-3-29 07:04
https://doi.org/10.1007/978-3-0348-4016-3g in socio-economic systems?” To address this question we propose three kinds of attacks that could be defined in the context of a precise application (packaging selection) and see how the non computer science experts evaluate, against a given set of decision tasks, each of these attacks.
作者: 慢慢沖刷    時間: 2025-3-29 10:50
https://doi.org/10.1007/978-3-663-12247-0 model by Geist, Lengnink and Wille provides such a match. Predicted comparability and its direction was reflected in the human data. However, the model rated a much larger proportion of pairs as incomparable than human participants did, indicating a need for a refined similarity model.
作者: 一小塊    時間: 2025-3-29 15:07

作者: 滲透    時間: 2025-3-29 18:42
Modular Ontologies as a Bridge Between Human Conceptualization and Datan order to more effectively preserve this notion of human conceptualization, an ontology should be designed with modularity and extensibility in mind. A modular ontology thus may act as a bridge between human conceptualization and data.
作者: 擺動    時間: 2025-3-29 22:28
Lifted Most Probable Explanationvents. The purpose of this paper is twofold: (i) We formalise how to compute an . in a lifted way with LVE and LJT. (ii) We present a . in the area of IT security for risk analysis. A lifted computation of MPEs exploits symmetries, while providing a correct and exact result equivalent to one computed on ground level.
作者: CT-angiography    時間: 2025-3-30 02:55
Defining Argumentation Attacks in Practice: An Experiment in Food Packaging Consumer Expectationsg in socio-economic systems?” To address this question we propose three kinds of attacks that could be defined in the context of a precise application (packaging selection) and see how the non computer science experts evaluate, against a given set of decision tasks, each of these attacks.
作者: patriarch    時間: 2025-3-30 06:36
Empirically Evaluating the Similarity Model of Geist, Lengnink and Wille model by Geist, Lengnink and Wille provides such a match. Predicted comparability and its direction was reflected in the human data. However, the model rated a much larger proportion of pairs as incomparable than human participants did, indicating a need for a refined similarity model.
作者: 蛛絲    時間: 2025-3-30 09:41
Musical Descriptions Based on Formal Concept Analysis and Mathematical Morphologyequently defined upon them. Special equivalence relations preserving the ordering structure of the lattice are introduced in order to define musically relevant quotient lattices modulo congruences. We show that the derived descriptors are well adapted for music analysis by taking as a case study Ligeti’s String Quartet No. 2.
作者: Paradox    時間: 2025-3-30 15:30
Institut für Baustatik und Konstruktions the power set of the concept intent (or extent). This helps avoid the clumping of samples and let all the areas of the sample space be duly represented. Our experiments on several formal contexts show that LDS can achieve faster convergence rate and better accuracy than MCS.
作者: cortisol    時間: 2025-3-30 20:25
https://doi.org/10.1007/978-3-663-12249-4-models, two forms of Conceptual Structures known as Conceptual Graphs (CGs) and Formal Concept Analysis (FCA) are brought together through the . algorithm. The algorithm identifies how the layered meta-models can share meaning and truth and without having to recombine them into one large, unwieldy meta-model as the repeatable structure.
作者: Adulterate    時間: 2025-3-31 00:03
An Efficient Approximation of Concept Stability Using Low-Discrepancy Samplings the power set of the concept intent (or extent). This helps avoid the clumping of samples and let all the areas of the sample space be duly represented. Our experiments on several formal contexts show that LDS can achieve faster convergence rate and better accuracy than MCS.
作者: 橫條    時間: 2025-3-31 04:32
Using Conceptual Structures in Enterprise Architecture to Develop a New Way of Thinking and Working -models, two forms of Conceptual Structures known as Conceptual Graphs (CGs) and Formal Concept Analysis (FCA) are brought together through the . algorithm. The algorithm identifies how the layered meta-models can share meaning and truth and without having to recombine them into one large, unwieldy meta-model as the repeatable structure.
作者: Bricklayer    時間: 2025-3-31 06:08

作者: Leisureliness    時間: 2025-3-31 10:14
https://doi.org/10.1007/978-3-322-88041-3lly designed to handle semi-structured data, for instance XML documents. In this paper, we present a modeling method for semi-structured data based on Conceptual Graphs and exemplify the method on an XML document. The expressive power of Conceptual Graphs makes them particularly suitable for conceptual modeling of semi-structured data.




歡迎光臨 派博傳思國際中心 (http://www.pjsxioz.cn/) Powered by Discuz! X3.5
商洛市| 灵武市| 华亭县| 德化县| 临猗县| 丹凤县| 苏州市| 潞城市| 凌海市| 博兴县| 西乌| 荥经县| 科尔| 大埔区| 石门县| 阿克| 梅州市| 乌海市| 富宁县| 全椒县| 祁连县| 贵阳市| 青川县| 浑源县| 巴林右旗| 浦城县| 浦县| 卢龙县| 读书| 和政县| 临洮县| 岳普湖县| 沙雅县| 香格里拉县| 包头市| 南澳县| 麻城市| 和顺县| 阿瓦提县| 四平市| 石家庄市|