標(biāo)題: Titlebook: Concept Lattices and Their Applications; Fourth International Sadok Ben Yahia,Engelbert Mephu Nguifo,Radim Beloh Conference proceedings 200 [打印本頁(yè)] 作者: 短暫 時(shí)間: 2025-3-21 20:09
書目名稱Concept Lattices and Their Applications影響因子(影響力)
書目名稱Concept Lattices and Their Applications影響因子(影響力)學(xué)科排名
書目名稱Concept Lattices and Their Applications網(wǎng)絡(luò)公開(kāi)度
書目名稱Concept Lattices and Their Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Concept Lattices and Their Applications被引頻次
書目名稱Concept Lattices and Their Applications被引頻次學(xué)科排名
書目名稱Concept Lattices and Their Applications年度引用
書目名稱Concept Lattices and Their Applications年度引用學(xué)科排名
書目名稱Concept Lattices and Their Applications讀者反饋
書目名稱Concept Lattices and Their Applications讀者反饋學(xué)科排名
作者: 忘恩負(fù)義的人 時(shí)間: 2025-3-21 21:47 作者: 喊叫 時(shí)間: 2025-3-22 03:59
Generic Association Rule Bases: Are They so Succinct?ciation rules. After that, we give a thorough formal study of the related inference mechanisms allowing to derive . association rules starting from succinct ones. Finally, an experimental study shows that our approach makes it possible to eliminate without information loss an important number of . g作者: gentle 時(shí)間: 2025-3-22 07:30 作者: Accomplish 時(shí)間: 2025-3-22 10:51
https://doi.org/10.1007/978-3-642-34437-4troduced the succinct system of minimal generators .. as an attempt to eliminate the redundancy within this set. In this paper, we give a thorough study of the . as formerly defined by Dong .. Then, we show that the latter suffers from some drawbacks. After that, we introduce new definitions allowin作者: 聯(lián)想記憶 時(shí)間: 2025-3-22 12:54
Ettore Majorana International Science Seriesciation rules. After that, we give a thorough formal study of the related inference mechanisms allowing to derive . association rules starting from succinct ones. Finally, an experimental study shows that our approach makes it possible to eliminate without information loss an important number of . g作者: 聯(lián)想記憶 時(shí)間: 2025-3-22 19:28
Sadok Ben Yahia,Engelbert Mephu Nguifo,Radim Beloh作者: Ptsd429 時(shí)間: 2025-3-22 23:16
0302-9743 held in Tunis, Tunisia, October 30-November 1, 2006...The 18 revised full papers together with 3 invited contributions presented were carefully reviewed and selected from 41 submissions. The topics include formal concept analysis, foundations of FCA, mathematical structures related to FCA, relation作者: 混沌 時(shí)間: 2025-3-23 02:04
https://doi.org/10.1007/978-4-431-55136-2ditions under which the complete affine ordered set can be interpreted as the set of congruence classes labeled with the congruence relation they stem from yielding a coordinatization theorem for affine ordered sets.作者: Nmda-Receptor 時(shí)間: 2025-3-23 08:23
David A. Ehst,Kenneth Evans Jr.lid association rules in terms of a closure operator induced by a Galois connection. Thus, these bases can be derived from a Galois lattice, as do well known bases for Confidence-valid association rules.作者: 美食家 時(shí)間: 2025-3-23 11:29
Tokenisierung als Finanzierungsformns present in this formulation, in particular deriving a conceptual pre-ordering of the taxonomy, and constructing a correspondence between the annotations of an ordered set and the closure systems of its filter lattice. We study an example from the Gene Ontology to demonstrate how the introduced technique can be utilized for ontology review.作者: 羞辱 時(shí)間: 2025-3-23 16:26
https://doi.org/10.1007/978-3-642-93275-5mal Concept Analysis techniques can be helpful in the interpretation step of the knowledge discovery in databases process. This combined approach has been successfully used to assist public health managers in designing healthcare networks and planning medical resources.作者: Iatrogenic 時(shí)間: 2025-3-23 18:57
Closure Systems of Equivalence Relations and Their Labeled Class Geometriesditions under which the complete affine ordered set can be interpreted as the set of congruence classes labeled with the congruence relation they stem from yielding a coordinatization theorem for affine ordered sets.作者: 高爾夫 時(shí)間: 2025-3-23 22:32 作者: lesion 時(shí)間: 2025-3-24 05:08 作者: pantomime 時(shí)間: 2025-3-24 09:57
Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Networkmal Concept Analysis techniques can be helpful in the interpretation step of the knowledge discovery in databases process. This combined approach has been successfully used to assist public health managers in designing healthcare networks and planning medical resources.作者: 使迷醉 時(shí)間: 2025-3-24 13:40
Conference proceedings 2008lected from 41 submissions. The topics include formal concept analysis, foundations of FCA, mathematical structures related to FCA, relationship of FCA to other methods of data analysis, visualization of data in FCA, and applications of FCA..作者: 努力趕上 時(shí)間: 2025-3-24 17:06
0302-9743 wed and selected from 41 submissions. The topics include formal concept analysis, foundations of FCA, mathematical structures related to FCA, relationship of FCA to other methods of data analysis, visualization of data in FCA, and applications of FCA..978-3-540-78920-8978-3-540-78921-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Axillary 時(shí)間: 2025-3-24 20:30 作者: EXUDE 時(shí)間: 2025-3-24 23:45
Case Studies and Expert Interviews, which allows the frequent concepts of a formal context with taxonomy to be computed. It works on a non-completed context and uses the taxonomy information when needed. The results avoid the redundancy problem with equivalent performance.作者: 歸功于 時(shí)間: 2025-3-25 05:05 作者: 不如樂(lè)死去 時(shí)間: 2025-3-25 09:41 作者: llibretto 時(shí)間: 2025-3-25 15:14
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy which allows the frequent concepts of a formal context with taxonomy to be computed. It works on a non-completed context and uses the taxonomy information when needed. The results avoid the redundancy problem with equivalent performance.作者: 能得到 時(shí)間: 2025-3-25 18:17 作者: 你不公正 時(shí)間: 2025-3-25 20:29
https://doi.org/10.1007/978-4-431-55136-2 from the refinement step. This paper deals especially with the validation process. Indeed, we propose two validation techniques: the first one is very simple and the second one uses a Galois lattice. A detailed description of these processes is presented in the paper, as well as the experimentation proving the viability of our approach.作者: 憤怒歷史 時(shí)間: 2025-3-26 00:48
Tokolyse beim vorzeitigen Blasensprung?,hile hiding uninteresting and/or superfluous information. The first is a pruning strategy that is based on the notion of concept stability, and the second is a representational improvement based on nested line diagrams. We illustrate the method with a small sample of a community of embryologists.作者: critic 時(shí)間: 2025-3-26 07:13 作者: FOVEA 時(shí)間: 2025-3-26 08:42
Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Means from the refinement step. This paper deals especially with the validation process. Indeed, we propose two validation techniques: the first one is very simple and the second one uses a Galois lattice. A detailed description of these processes is presented in the paper, as well as the experimentation proving the viability of our approach.作者: filial 時(shí)間: 2025-3-26 15:28 作者: 口音在加重 時(shí)間: 2025-3-26 18:57
Modellering van gedragstypologie?no build an improved second generation program – . – but in themselves indicate that image navigation via a concept lattice is a highly successful interface paradigm. Our results provide general insights for interface design using concept lattices that will be of interest to any applied research and development using concept lattices.作者: 吸引人的花招 時(shí)間: 2025-3-26 23:15 作者: 草本植物 時(shí)間: 2025-3-27 02:18
O. Gruber,ASDEX Upgrade Project Groupsed in order to select the best rules during classification of new instances. A detailed description of this method is presented, as well as the experimentation study on 12 benchmark data sets proving that . is highly competitive in terms of accuracy in comparison with popular classification approaches.作者: 我們的面粉 時(shí)間: 2025-3-27 06:58
An Intelligent User Interface for Browsing and Searching MPEG-7 Images Using Concept Latticeso build an improved second generation program – . – but in themselves indicate that image navigation via a concept lattice is a highly successful interface paradigm. Our results provide general insights for interface design using concept lattices that will be of interest to any applied research and development using concept lattices.作者: ALOFT 時(shí)間: 2025-3-27 09:57 作者: FEAS 時(shí)間: 2025-3-27 16:36 作者: Solace 時(shí)間: 2025-3-27 19:50 作者: 創(chuàng)新 時(shí)間: 2025-3-28 02:01
First Elements on Knowledge Discovery Guided by Domain Knowledge (KDDK)bined. The knowledge discovery in databases process (.) consists in processing a huge volume of data for extracting significant and reusable knowledge units. From a knowledge representation perspective, the . process may take advantage of domain knowledge embedded in ontologies relative to the domai作者: GEON 時(shí)間: 2025-3-28 05:59 作者: 鐵塔等 時(shí)間: 2025-3-28 07:04 作者: crescendo 時(shí)間: 2025-3-28 11:56 作者: 胰臟 時(shí)間: 2025-3-28 14:42
Closure Systems of Equivalence Relations and Their Labeled Class Geometriestexts and is categorically equivalent to the notion of a closed system of equivalence relations (SER). This specialization step enables us to give conditions under which the complete affine ordered set can be interpreted as the set of congruence classes labeled with the congruence relation they stem作者: 乞丐 時(shí)間: 2025-3-28 19:47
Generalizations of Approximable Concept Latticezzification of the classical crisp concept lattice. One of them was shown by R. B?lohlávek : concept lattice in fuzzy setting. The second one was given by S. Kraj.i: generalized concept lattice. On the other hand, as a generalization of concept, Zhang, P. Hitzler, Shen defined the notion of approxim作者: 準(zhǔn)則 時(shí)間: 2025-3-29 01:53
Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Meanss a . that is both predictive and descriptive. This meta-classifier is made of a set of classification rules, which can be refined then validated. The refinement step, proposes to remove from the meta-classifier rules that according to their confidence coefficient, computed by statistical means, wou作者: 規(guī)章 時(shí)間: 2025-3-29 05:14
Graded LinClosure and Its Role in Relational Data Analysisns. It can also be used together with graded extension of Ganter’s . algorithm to compute non-redundant bases of data tables with fuzzy attributes. We present foundations, the algorithm, and illustrative examples.作者: 怒目而視 時(shí)間: 2025-3-29 08:38
Yet Another Approach for Completing Missing Valuesy removed during the pre-processing step of the KDD process. Starting from the fact that ”making up this missing data is better than throwing it away”, we present a new approach trying to complete the missing data. The main singularity of the introduced approach is that it sheds light on a fruitful 作者: 乞丐 時(shí)間: 2025-3-29 14:17 作者: 冷漠 時(shí)間: 2025-3-29 18:18
Galois Lattices and Bases for MGK-Valid Association Ruleseasures used in the data mining literature, and which enables to handle negative association rules. On the other hand, we characterize bases for M.-valid association rules in terms of a closure operator induced by a Galois connection. Thus, these bases can be derived from a Galois lattice, as do wel作者: 執(zhí)拗 時(shí)間: 2025-3-29 20:28 作者: STRIA 時(shí)間: 2025-3-30 03:25
Concept Lattice Representations of Annotated Taxonomiestext consistent with a given annotated ordered set, their concept lattice representations are derived. We develop the fundamental mathematical relations present in this formulation, in particular deriving a conceptual pre-ordering of the taxonomy, and constructing a correspondence between the annota作者: Preserve 時(shí)間: 2025-3-30 06:20
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomyxonomy exists, existing techniques produce a completed context with all attributes deduced from the taxonomy. Usual algorithms can then be applied on the completed context for finding frequent concepts, but the results systematically contain redundant information. This article describes an algorithm作者: hurricane 時(shí)間: 2025-3-30 09:30
Unique Factorization Theorem and Formal Concept Analysiss an analogy of the well-known Fundamental Theorem of Arithmetics. The purpose of this paper is to present a new, less complicated, proof of this theorem that is based on Formal Concept Analysis. The method of the proof can be successfully applied even for more general mathematical structures known 作者: aviator 時(shí)間: 2025-3-30 16:06 作者: resuscitation 時(shí)間: 2025-3-30 16:52
Towards an Iterative Classification Based on Concept Latticeent of a new structural signature adapted to noise context. The experimentation is realized on the noised symbols of GREC database [4]. Our experimentation presents a comparison with the two classical numerical classifiers that are the bayesian classifier and the nearest neighbors classifier and som作者: hermetic 時(shí)間: 2025-3-30 20:59
Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Networkerg-lattices to discover and represent flows of patient within a healthcare network. We give examples of analysis of real medical data showing how Formal Concept Analysis techniques can be helpful in the interpretation step of the knowledge discovery in databases process. This combined approach has 作者: Onerous 時(shí)間: 2025-3-31 01:55 作者: dominant 時(shí)間: 2025-3-31 08:25 作者: Radiation 時(shí)間: 2025-3-31 13:02
Casus Alpha: de tandem aan het werkof this paper is to show how successful the lattice-theoretic foundation can be in applying Formal Concept Analysis in a wide range. This is demonstrated in three sections dealing with ., ., and . of conceptual knowledge. Finally, further relationships between abstract Lattice Theory and Formal Conc作者: 滲入 時(shí)間: 2025-3-31 17:10
,?We go for Gold? –Der Traum von WM-Gold,llection of clusters extracted from tabular data. The basic idea of factorization by similarity is to have, instead of a possibly large original fuzzy concept lattice, its factor lattice. The factor lattice contains less clusters than the original concept lattice but, at the same time, represents a 作者: 彎曲的人 時(shí)間: 2025-3-31 17:36 作者: 業(yè)余愛(ài)好者 時(shí)間: 2025-3-31 22:19 作者: conifer 時(shí)間: 2025-4-1 05:03 作者: ferment 時(shí)間: 2025-4-1 08:17 作者: GREG 時(shí)間: 2025-4-1 12:22 作者: abject 時(shí)間: 2025-4-1 16:15
https://doi.org/10.1007/978-1-4757-1889-8y removed during the pre-processing step of the KDD process. Starting from the fact that ”making up this missing data is better than throwing it away”, we present a new approach trying to complete the missing data. The main singularity of the introduced approach is that it sheds light on a fruitful 作者: 討厭 時(shí)間: 2025-4-1 18:59 作者: epidermis 時(shí)間: 2025-4-1 23:18
David A. Ehst,Kenneth Evans Jr.easures used in the data mining literature, and which enables to handle negative association rules. On the other hand, we characterize bases for M.-valid association rules in terms of a closure operator induced by a Galois connection. Thus, these bases can be derived from a Galois lattice, as do wel作者: V洗浴 時(shí)間: 2025-4-2 05:22
Ettore Majorana International Science Seriesne main motivation behind is: tagging a unified framework for drastically reducing large sized sets of association rules. In this context, generic bases of association rules – whose backbone is the conjunction of the concepts of minimal generator .. and closed itemset .. – constituted so far irreduc作者: 斜坡 時(shí)間: 2025-4-2 10:30
Tokenisierung als Finanzierungsformtext consistent with a given annotated ordered set, their concept lattice representations are derived. We develop the fundamental mathematical relations present in this formulation, in particular deriving a conceptual pre-ordering of the taxonomy, and constructing a correspondence between the annota作者: 單獨(dú) 時(shí)間: 2025-4-2 14:37
