書目名稱Graph-Based Representation and Reasoning影響因子(影響力)學(xué)科排名
書目名稱Graph-Based Representation and Reasoning網(wǎng)絡(luò)公開度
書目名稱Graph-Based Representation and Reasoning網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Based Representation and Reasoning被引頻次
書目名稱Graph-Based Representation and Reasoning被引頻次學(xué)科排名
書目名稱Graph-Based Representation and Reasoning年度引用
書目名稱Graph-Based Representation and Reasoning年度引用學(xué)科排名
書目名稱Graph-Based Representation and Reasoning讀者反饋
書目名稱Graph-Based Representation and Reasoning讀者反饋學(xué)科排名
作者: entice 時間: 2025-3-21 23:22 作者: 埋葬 時間: 2025-3-22 02:44
Conceptual Modelling with?Euler,?Diagramsreasonably expressive. Conditions for a translation between Euler.diagrams and logical expressions and some consistency rules are provided. Questions still remain with respect to a detailed explanation of visual reasoning algorithms.作者: Proponent 時間: 2025-3-22 08:27
Ontology Population from?French Classified Adsdependent, as long as a domain ontology is provided. It relies on text-based and knowledge-based analyses, which are fully explained. Experiments performed on French classified advertisements are discussed and provide encouraging results.作者: 不可救藥 時間: 2025-3-22 11:38
On Pseudointents in?Fuzzy Formal Concept Analysiss in the literature, for instance minimal bases, direct bases or direct minimal bases. In this work we are interested in the concept of pseudointent in the fuzzy framework in order to define the Duquenne-Guigues basis in the fuzzy setting.作者: Overdose 時間: 2025-3-22 13:03 作者: Overdose 時間: 2025-3-22 20:00
https://doi.org/10.1007/978-981-10-5583-6s in the literature, for instance minimal bases, direct bases or direct minimal bases. In this work we are interested in the concept of pseudointent in the fuzzy framework in order to define the Duquenne-Guigues basis in the fuzzy setting.作者: 范圍廣 時間: 2025-3-22 23:23
https://doi.org/10.1007/978-3-540-79409-7 put ourselves in the context of conversational Artificial Intelligence software and introduce the setting of postmodern human machine dialogues by focusing on the factual relativism of the human perception of the interaction. We demonstrate the above-mentioned setting in a practical setting via a pedagogical experiment using ChatGPT3.作者: 顯而易見 時間: 2025-3-23 03:32
Piero Manfredi,Alberto D‘Onofriosome interrelations between attributes and can help to solve pending issues within enterprise or science. To illustrate our approach, we include our novel results by analyzing a correlation matrix with 36 variables computed from a real dataset.作者: 諷刺 時間: 2025-3-23 06:59 作者: 阻塞 時間: 2025-3-23 11:41
https://doi.org/10.1007/978-3-642-16026-4ns in the partition lattices with the help of concept lattices and provide the reader with some related heuristic bounds. The results of our computational experiments confirm the known values and are also recorded in the Online Encyclopaedia of Integer Sequences (see .).作者: 致命 時間: 2025-3-23 15:33
Progress in Systems and Control Theorymework to generate relevant concepts, which are then used to select a specific concept for each trace using a distance measure. Considering a trace as a sequence, the proposed method generate concepts based on maximal common sub-sequences. The experimental part shows that our method successfully found the original clusters on a simulated dataset.作者: 戰(zhàn)役 時間: 2025-3-23 21:04 作者: transdermal 時間: 2025-3-23 22:29 作者: 有角 時間: 2025-3-24 04:03 作者: Abnormal 時間: 2025-3-24 10:28 作者: 無脊椎 時間: 2025-3-24 10:46
https://doi.org/10.1007/978-3-642-15447-8me the classical, too restrictive, satisfaction of FDs, it is possible to replace equality with more meaningful binary predicates, and use a coverage measure such as the .-error to estimate the degree to which a FD matches the data. It is known that the .-error can be computed in polynomial time if 作者: 油膏 時間: 2025-3-24 15:09 作者: obsolete 時間: 2025-3-24 21:15
https://doi.org/10.1007/978-3-319-33933-7concept lattice derived from such a table is a representation of the implicit knowledge about this relationship, where each concept corresponds to a bicluster of objects and attributes. FCA has been widely used for knowledge acquisition and representation, conceptual data analysis, information retri作者: 松緊帶 時間: 2025-3-25 01:48 作者: cumber 時間: 2025-3-25 06:25
https://doi.org/10.1007/978-1-4614-1563-3 that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the inci作者: Perineum 時間: 2025-3-25 08:21
https://doi.org/10.1007/978-3-642-16026-4cluding ensemble clustering. Searching for antichains in such lattices is similar to that of in Boolean lattices. Counting the number of antichains in Boolean lattices is known as the Dedekind problem. In spite of the known asymptotic for the latter problem, the behaviour of the number of antichains作者: 圍巾 時間: 2025-3-25 15:14 作者: 無能力之人 時間: 2025-3-25 18:16
https://doi.org/10.1007/978-1-4020-8778-3kes them hard to understand and visualize. Graph summarization techniques can help by abstracting details of the original graph to produce a reduced summary that can more easily be explored. Identifiers often carry latent information which could be used for classification of the entities they repres作者: 智力高 時間: 2025-3-25 20:32
https://doi.org/10.1007/b138710rvices and distributed architectures. Accordingly, approaches to treat data are in constant improvement. An example of this is the Formal Concept Analysis framework that has seen an increase in the methods carried out to increment its capabilities in the mentioned environments. However, on top of th作者: 疼死我了 時間: 2025-3-26 02:16 作者: Antagonism 時間: 2025-3-26 07:04 作者: 舊石器 時間: 2025-3-26 11:15
https://doi.org/10.1007/978-3-319-67168-0Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general noti作者: Callus 時間: 2025-3-26 13:36 作者: 省略 時間: 2025-3-26 18:24 作者: LATER 時間: 2025-3-27 00:32 作者: 諂媚于性 時間: 2025-3-27 04:50 作者: forebear 時間: 2025-3-27 07:35 作者: Adulterate 時間: 2025-3-27 10:39
On Pseudointents in?Fuzzy Formal Concept Analysisdeals with two main structures of knowledge, namely the concept lattice and the basis of attribute implications. There are several sets of implications in the literature, for instance minimal bases, direct bases or direct minimal bases. In this work we are interested in the concept of pseudointent i作者: Allege 時間: 2025-3-27 16:13 作者: indignant 時間: 2025-3-27 18:14 作者: ironic 時間: 2025-3-28 01:51 作者: Dedication 時間: 2025-3-28 05:30
Summarization of?Massive RDF Graphs Using Identifier Classificationkes them hard to understand and visualize. Graph summarization techniques can help by abstracting details of the original graph to produce a reduced summary that can more easily be explored. Identifiers often carry latent information which could be used for classification of the entities they repres作者: Judicious 時間: 2025-3-28 08:45 作者: Liability 時間: 2025-3-28 11:43 作者: 極少 時間: 2025-3-28 15:19
Conceptual Modelling with?Euler,?Diagrams modelling. Instead of the traditional interpretation of Euler diagrams as Boolean logic, Euler.diagrams are considered 3-valued logic diagrams that are interpreted as First Order Logic (FOL) expressions. It is argued that such diagrams have a good usability because they are sufficiently simple yet 作者: 擴音器 時間: 2025-3-28 22:24 作者: Harpoon 時間: 2025-3-28 23:12 作者: 鴕鳥 時間: 2025-3-29 03:10 作者: Left-Atrium 時間: 2025-3-29 08:04 作者: 系列 時間: 2025-3-29 15:11 作者: Fulminate 時間: 2025-3-29 16:44 作者: BIBLE 時間: 2025-3-29 19:54
Summarization of?Massive RDF Graphs Using Identifier Classifications using their namespaces. Producing the summary graph is fast, light on computing resources and requires no previous domain knowledge. The summary graph can be used to analyze the namespace inter-dependencies of the original graph. We also present ., a tool for calculating namespace-based KG summari作者: Ptsd429 時間: 2025-3-30 03:31
Towards a?Flexible and?Scalable Data Stream Algorithm in?FCA. Additionally, the meaning of different scenarios of lattice merge in a particular data stream model is discussed. Finally, a pseudo-algorithm for merging lattices in the case of disjoint objects is presented. The presented work is a preliminary result and, in the future, it is expected to cover th作者: 支架 時間: 2025-3-30 04:16
Automatic Textual Explanations of?Concept Lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.作者: FUSC 時間: 2025-3-30 10:55 作者: 容易懂得 時間: 2025-3-30 14:37 作者: 逃避現(xiàn)實 時間: 2025-3-30 19:42 作者: receptors 時間: 2025-3-30 23:40 作者: Aviary 時間: 2025-3-31 04:34 作者: jaunty 時間: 2025-3-31 06:55
https://doi.org/10.1007/978-3-319-67168-0. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.
