794 Hits in 2.6 sec

Mining FCI of incremental attribute in Iceberg concept lattice

Anrong Xue, Fuqiang Wang, Mingcai Zhang, Ming Li
2010 2010 3rd International Conference on Computer Science and Information Technology  
This paper, based on Iceberg concept lattice model, presents a frequent closed itemsets mining algorithm FCI-AI in the Iceberg concept lattice.  ...  Adding an attribute to database, our algorithm can use the original Iceberg concept lattice for mining the frequent closed itemsets incrementally without having to mine all frequent closed itemsets from  ...  De¿nition 3 The set of all frequent concepts of a formal context T together with the partial order relation forms a so-called Iceberg concept lattice IL(T).  ... 
doi:10.1109/iccsit.2010.5563596 fatcat:q7so2uu77fdgvmegxgnu2bby3i

Alpha Galois Lattices: An Overview [chapter]

Véronique Ventos, Henry Soldano
2005 Lecture Notes in Computer Science  
We also discuss the related implication rules defined as inclusion of such α-extents and show that Iceberg concept lattices are Alpha Galois lattices where the partition is reduced to one single class.  ...  By redefining the notion of extent of a term in order to cope, to a certain degree (denoted as α), with this partition, we define a particular family of Galois lattices denoted as Alpha Galois lattices  ...  rules are extracted from Iceberg concept lattices.  ... 
doi:10.1007/978-3-540-32262-7_21 fatcat:gfqbkudoonc3pbassttrvvu7nm

Constructing Iceberg Lattices from Frequent Closures Using Generators [chapter]

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin
2008 Lecture Notes in Computer Science  
Although their joint computation has been studied in concept analysis, no scalable algorithm exists for the task at present.  ...  The resulting order computation algorithm proves to be highly efficient, benefiting from peculiarities of generator families in typical mining datasets.  ...  Fig. 1 . 1 Concept lattices of dataset D. (a) The entire concept lattice. (b) An iceberg part of (a) by min_supp = 3 (indicated by a dashed rectangle).  ... 
doi:10.1007/978-3-540-88411-8_15 fatcat:2wekdcdr4ncqxnhwdpun75lwpi

Formal Concept Analysis of Rodent Carriers of Zoonotic Disease [article]

Roman Ilin, Barbara A. Han
2016 arXiv   pre-print
The technique of Formal Concept Analysis is applied to a dataset describing the traits of rodents, with the goal of identifying zoonotic disease carriers,or those species carrying infections that can spillover  ...  The concepts identified among these species together provide rules-of-thumb about the intrinsic biological features of rodents that carry zoonotic diseases, and offer utility for better targeting field  ...  We computed the Iceberg lattice with minimum support of 18%. The diagram is shown in Fig. 2 .  ... 
arXiv:1608.07241v1 fatcat:lct5ntjsyrdflakvuxspicbstq

Computing iceberg concept lattices with Titanic

Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
2002 Data & Knowledge Engineering  
We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach.  ...  Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery.  ...  We demonstrate the TITANIC algorithm by two examples: computing a concept lattice, and computing an iceberg concept lattice.  ... 
doi:10.1016/s0169-023x(02)00057-5 fatcat:7tufj7dgnvfrfhltilyiqolmri

Improvement of Searching for Appropriate Textual Information Sources Using Association Rules and FCA [chapter]

Marek Menšík, Adam Albert, Vojtěch Patschka, Miroslav Pajr
2022 Frontiers in Artificial Intelligence and Applications  
Therefore we are applying the 'Iceberg Concepts', which significantly prune output data space and thus accelerate the whole process of the calculation.  ...  This paper deals with an optimization of methods for recommending relevant text sources.  ...  Iceberg Concept Lattices Iceberg Concept Lattices [11] consist only of the top-most concepts of the concept lattice.  ... 
doi:10.3233/faia210487 fatcat:niqsp5fb6bfpnkorzmruw5wxym

Computing Full and Iceberg Datacubes Using Partitions [chapter]

Marc Laporte, Noël Novelli, Rosine Cicchetti, Lotfi Lakhal
2002 Lecture Notes in Computer Science  
In this paper, we propose a sound approach and an algorithm 1 for computing a condensed representation of either full or iceberg datacubes.  ...  It enforces a lecticwise and recursive traverse of the dimension set lattice and takes into account the critical problem of memory limitation.  ...  It is called lecticwise and recursive traverse of the dimensional lattice, offers a sound basis for our computing strategy, and applies for computing full or iceberg datacubes.  ... 
doi:10.1007/3-540-48050-1_28 fatcat:fl3bt4grkfa7plzwi7gzfwjxua

Multiway Pruning for Efficient Iceberg Cubing [chapter]

Xiuzhen Zhang, Pauline Lienhua Chou
2006 Lecture Notes in Computer Science  
Effective pruning is essential for efficient iceberg cube computation.  ...  We propose the multiway pruning strategy combining exclusive, inclusive and anti-pruning with bounding aggregate functions in iceberg cube computation.  ...  Algorithm 1 The MBPC Algorithm // Assume that an n-dimensional G-tree T with aggregate function F is constructed. // The iceberg cube is computed by calling MBPC(T (A1, ..., An), φ).  ... 
doi:10.1007/11827405_20 fatcat:rk42sia5wnh2ro7b2atindjtxq

A Formal Concept Analysis Approach to Data Mining: The QuICL Algorithm for Fast Iceberg Lattice Construction

David T. Smith
2013 Computer and Information Science  
An iceberg lattice, on the other hand, is a lattice whose concepts contain only FI sets. This paper presents the development of the Quick Iceberg Concept Lattice (QuICL) algorithm.  ...  An alternative to FI mining can be found in formal concept analysis (FCA). FCA derives a lattice whose concepts identify closed FI sets and connections identify the upper covers.  ...  Bottom -iceberg concept lattice at 40%.  ... 
doi:10.5539/cis.v7n1p10 fatcat:b3hjuhk2uvc2vfjs27ygrng7ry

Formal Concept Analysis and Semantic File Systems [chapter]

Ben Martin
2004 Lecture Notes in Computer Science  
There is an exposure related refinement marked with an "F". . . . . . . . . . . . . . . . . . . 108 6.19 The iceberg concept lattice from Figure 6.16 centered on the Königsalle in Düsseldorf.  ...  Concept number 2 introduces etc t and shadow t, concept 6 introduces var auth t and concept 7 introduces security t. . . . . . . . 124 7.7 Concept lattice of the transitive closure of the digraph of degree  ... 
doi:10.1007/978-3-540-24651-0_9 fatcat:avv7sistozh3pinob4cgyzbm7e

Iceberg Query Lattices for Datalog [chapter]

Gerd Stumme
2004 Lecture Notes in Computer Science  
We combine the notion of frequent datalog queries with iceberg concept lattices (also called closed itemsets) of FCA and introduce two kinds of iceberg query lattices as condensed representations of frequent  ...  This paper continues our work on iceberg concept lattices presented in [35] . It is organized as follows.  ...  From this formal context, one can compute the concept lattice as usual.  ... 
doi:10.1007/978-3-540-27769-9_7 fatcat:56qvdn54pvb2nikyzd65rmko4u

On Enumerating Frequent Closed Patterns with Key in Multi-relational Data [chapter]

Hirohisa Seki, Yuya Honda, Shinya Nagano
2010 Lecture Notes in Computer Science  
, studied in the field of Formal Concept Analysis.  ...  Since the execution times of the merge operations increase with the increase in the number of local databases, we propose some methods for improving the merge operations.  ...  The notion of iceberg query lattices, proposed by Stumme [30] , combines the notions of MRDM and FCA; frequent datalog queries in MRDM correspond to iceberg concept lattices (or frequent closed itemsets  ... 
doi:10.1007/978-3-642-16184-1_6 fatcat:ee5bm56kqvgrboeobh5zuvwntm

TRIAS--An Algorithm for Mining Iceberg Tri-Lattices

Robert Jaschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter, Gerd Stumme
2006 IEEE International Conference on Data Mining. Proceedings  
In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies.  ...  For computing all (frequent) maximal rectangles in a binary relation, one can resort to any algorithm for computing (iceberg) concept lattices. The enumeration can be done in any convenient way.  ...  mining association rules [9, 14, 12] , a new research area emerged around 1999 which became known as closed itemset mining in the data mining community and as iceberg concept lattices in FCA.  ... 
doi:10.1109/icdm.2006.162 dblp:conf/icdm/JaschkeHSGS06 fatcat:4xnq4zzolvdr7drtqyeq5tno3q

A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov
2013 Annals of Mathematics and Artificial Intelligence  
The interplay of these three constructs and their joint computation have been studied within the formal concept analysis (FCA) field yet none of the proposed algorithms is scalable.  ...  Szathmary et al. the new schema in the design of Snow-Touch, a concrete FCI/FG/precedence miner that reuses an existing algorithm, Charm, for mining FCIs, and completes it with two original methods for  ...  Thus, an iceberg lattice is Fig. 1 Concept lattices of dataset D. a The entire concept lattice. b An iceberg part of (a) with min_supp = 3 (indicated by a dashed rectangle). c The concept lattice with  ... 
doi:10.1007/s10472-013-9372-8 fatcat:f54qccrlijaennurk2jw3litem

Formal Concept Analysis in knowledge processing: A survey on models and techniques

Jonas Poelmans, Sergei O. Kuznetsov, Dmitry I. Ignatov, Guido Dedene
2013 Expert systems with applications  
triadic concept analysis and discuss scalability issues.  ...  We also give an overview of the literature on FCA extensions such as pattern structures, logical concept analysis, relational concept analysis, power context families, fuzzy FCA, rough FCA, temporal and  ...  Acknowledgements We are grateful to Paul Elzinga for his help in processing the papers and generating the context files on which the lattices are based.  ... 
doi:10.1016/j.eswa.2013.05.007 fatcat:july7aafprcjrbaely2swksvhi
« Previous Showing results 1 — 15 out of 794 results