22 Hits in 5.0 sec

Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory

Petko Valtchev, Rokia Missaoui, Robert Godin, Mohamed Meridji
2002 Journal of experimental and theoretical artificial intelligence (Print)  
Á× Ñ Ý ÓÑ Ö ÕÙ ÒØ Û Ð ×ÓÑ Á× Ñ Ý ÓÑ Ò Ö ÕÙ ÒØ ÐÓ× Ø Ñ× Ø׺ ÅÓÖ ÓÚ Ö¸ × Ö Ò ×ÓÑ Á× Ø Ò × ÒØ ÒØ× Ó Ò Ö ØÓÖ ÓÒ ÔØ× Û ÐÐ Ð ØÓ ×Ö Ö Ò Ø Ö ÓÖÖ ×ÔÓÒ Ò Ò Û ÓÒ ÔØ׺ × Ò ÐÐÙ×ØÖ Ø ÓÒ¸Ð Ø³× ××ÙÑ Ø Ø ÌÖ Ò× Ø ÓÒ× ½¼  ...  Ò ½½ Ö ØÓ ´× Ì Ð ½µ Û Ø Ø Ñ× Ø× Ò Ö ×Ô Ø Ú Ðݺ ÁÒ Ø Ø × ¸×ÓÑ Á× ×Ù × ¸ ¸ Û ÐÐ ÓÑ Ò Ö ÕÙ ÒØ Á×´¾ ±µ Û Ð Û ÐÐ ØÙÖÒ Ö ÕÙ ÒØ Ø Ñ× Ǿ ¿ ±µº Á Ú Ö × × Ö ÙÖ Ò Ø ÙÔ Ø ÔÖÓ ×× × ÑÔÐÝ Ù× Ø × Ò Ò Ö ÕÙ ÒØ´¾¾±µ Á¸Ø  ... 
doi:10.1080/09528130210164198 fatcat:7s2y3qobw5cy7hkcrkzetzud3u

A framework for incremental generation of closed itemsets

Petko Valtchev, Rokia Missaoui, Robert Godin
2008 Discrete Applied Mathematics  
Our approach for mining FIs in dynamic databases relies on recent results about lattice incremental restructuring and lattice construction.  ...  Recent approaches for FI mining use the closed itemset paradigm to limit the mining effort to a subset of the entire FI family, the frequent closed itemsets (FCIs).  ...  Incremental generation of FCIs with GALICIA The GALICIA (for GAlois Lattice-based Incremental Closed Itemset Approach) mining approach is presented below together with two high-level methods (low-level  ... 
doi:10.1016/j.dam.2007.08.004 fatcat:adfmqefmo5go5ihfxh5ww34nxy

Formal Concept Analysis Based Association Rules Extraction [article]

Wafa Tebourski Ourida Ben Boubaker Saidi
2012 arXiv   pre-print
In this context, based on the theory of Formal Concept Analysis, we propose to extend the notion of Formal Concept through the generalization of the notion of itemset in order to consider the itemset as  ...  Accordingly, we propose a new approach to extract interesting itemsets through the concept coverage.  ...  In this paper, we introduce a novel approach of association rules mining based on Formal Concept Analysis. The remainder of the paper is organized as follows.  ... 
arXiv:1209.3943v1 fatcat:lawm6okobvhgzakgxvpo7rt22a

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  
In this first part, we zoom in on and give an extensive overview of the papers published between 2003 and 2011 on developing FCAbased methods for knowledge processing.  ...  This is the first part of a large survey paper in which we analyze recent literature on Formal Concept Analysis (FCA) and some closely related disciplines using FCA.  ...  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

Mining Non-Redundant Association Rules

Mohammed J. Zaki
2004 Data mining and knowledge discovery  
We present a new framework for associations based on the concept of closed frequent itemsets.  ...  The number of non-redundant rules produced by the new approach is exponentially (in the length of the longest frequent itemset) smaller than the rule set from the traditional approach.  ...  We present a new framework for association rule mining based on the concept of closed frequent itemsets.  ... 
doi:10.1023/b:dami.0000040429.96086.c7 fatcat:sjgjtlwyvnfj3hlkhrl4wmr4yu

Discovery of the D-basis in binary tables based on hypergraph dualization

K. Adaricheva, J.B. Nation
2017 Theoretical Computer Science  
We introduce a novel approach for the discovery of a specific set of implications, called the D-basis, that provides a representation for a reduced binary table, based on the structure of its Galois lattice  ...  At the core of the method are the D-relation defined in the lattice theory framework, and the hypergraph dualization algorithm that allows us to effectively produce the set of transversals for a given  ...  The Galois lattice L R of the reduced table in shown on Fig.  ... 
doi:10.1016/j.tcs.2015.11.031 fatcat:eh2sjwcy5vbmrkuips5vha5mk4

Association mining

Aaron Ceglar, John F. Roddick
2006 ACM Computing Surveys  
This survey focuses on the fundamental principles of association mining, that is, itemset identification, rule generation, and their generic optimizations.  ...  The authors subsequently designed the FastGenAllRepresentatives algorithm which, given the set of all frequent itemsets (V ) and minconf , will generate R R based on two properties (presented in the following  ...  Free Sets Disjunction free sets are condensed representations based on the theory of disjunction.  ... 
doi:10.1145/1132956.1132958 fatcat:37cmcoy7m5gbxadyzxozkcszea

Introduction to Formal Concept Analysis and Its Applications in Information Retrieval and Related Fields [chapter]

Dmitry I. Ignatov
2015 Communications in Computer and Information Science  
FCA is an applied branch of Lattice Theory, a mathematical discipline which enables formalisation of concepts as basic units of human thinking and analysing data in the object-attribute form.  ...  This paper is a tutorial on Formal Concept Analysis (FCA) and its applications.  ...  The author was partially supported by the Russian Foundation for Basic Research grants no. 13-07-00504 and 14-01-93960 and prepared the tutorial within the project "Data mining based on applied ontologies  ... 
doi:10.1007/978-3-319-25485-2_3 fatcat:m2zad3btkjhkja2mdwmjfbkahi

A scalable association rule learning heuristic for large datasets

Haosong Li, Phillip C.-Y. Sheu
2021 Journal of Big Data  
This paper introduces a heuristic approach based on divide-and-conquer which may exponentially reduce both the time complexity and memory usage to obtain approximate results that are close to the accurate  ...  It is shown from comparative experiments that the proposed heuristic approach can achieve significant speedup over existing algorithms.  ...  The frequent two itemsets are discovered based on the frequent one itemsets.  ... 
doi:10.1186/s40537-021-00473-3 fatcat:ozhotg54jfbkdburkrtyfgnjuu

Mining frequent closed graphs on evolving data streams

Albert Bifet, Geoff Holmes, Bernhard Pfahringer, Ricard Gavaldà
2011 Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '11  
All methods work on coresets of closed subgraphs, compressed representations of graph sets, and maintain these sets in a batch-incremental manner, but use different approaches to address potential concept  ...  To the best of our knowledge this is the first work on mining frequent closed subgraphs in non-stationary data streams.  ...  For trees, the work in [8] shows a general methodology to identify closed patterns in a data stream, using Galois Lattice Theory.  ... 
doi:10.1145/2020408.2020501 dblp:conf/kdd/BifetHPG11 fatcat:iu6venme4ngppodlry6cjovdsy

A Condensed Representation of Itemsets for Analyzing Their Evolution over Time [chapter]

Mirko Boettcher, Martin Spott, Rudolf Kruse
2009 Lecture Notes in Computer Science  
As a solution we propose temporally closed itemsets, a novel approach for a condensed representation of itemsets which is based on removing temporal redundancies.  ...  We investigate how our approach relates to the well-known concept of closed itemsets if the latter would be directly generalized to account for the temporal dimension.  ...  The formal underpinnings of closed itemset algorithms can be found in the theory of lattices and Galois connection closures [9] .  ... 
doi:10.1007/978-3-642-04180-8_28 fatcat:lgkmnclpsrgp3gdecosevnp36m

Case-based reasoning in the health sciences

Isabelle Bichindaritz
2006 Artificial Intelligence in Medicine  
Data mining in CBR focuses greatly on incremental mining for memory structures and organization with the goal of improving performance of retrieval, reuse, revise, and retain steps.  ...  This article locates examples, many from health sciences domains, mapping data mining functionalities to CBR tasks and steps, such as case mining, memory organization, case base reduction, generalized  ...  Another type of memory organization is the formal concept lattice. Dìaz-Agudo and Gonzàlez-Calero (2003) organize through formal concept analysis (FCA) the case base around Galois lattices.  ... 
doi:10.1016/j.artmed.2005.08.001 pmid:16213128 fatcat:qtry6sbw4zczfcs2mddwf6spmm

Contributions to Biclustering of Microarray Data Using Formal Concept Analysis [article]

Amina Houari
2018 arXiv   pre-print
In the second part, we present our proposed biclustering algorithms where we rely on two axes. In the first axis, we initially focus on extracting biclusters of positive correlations.  ...  This thesis is divided into two part: In the first part, we present an overview of the pattern-mining techniques and the biclustering of microarray data.  ...  The leading approach of generating association rules is based on the extraction of frequent patterns.  ... 
arXiv:1811.09562v1 fatcat:koql6oifrvgsnk6j56bpne6jvm

Semi-Supervised Ligand Finding Using Formal Concept Analysis

Mahito Sugiyama, Kentaro Imajo, Keisuke Otaki, Akihiro Yamamoto
2012 IPSJ Online Transactions  
using the lattice structure.  ...  The key to LIFT is to achieve clustering by putting an original dataset on lattices using the data analysis technique of Formal Concept Analysis (FCA), followed by obtaining the preference for each label  ...  In frequent pattern mining, a set of attributes corresponds to an itemset and the lattice is called the closed itemset lattice [22].  ... 
doi:10.2197/ipsjtrans.5.114 fatcat:vvsesqifpzaehdlngg7wf43qea

Knowledge discovery through creating formal contexts

Simon Andrews, Constantinos Orphanides
2012 International Journal of Space-Based and Situated Computing (IJSSC)  
This article is an extended version of the paper with the same name presented at the second International Conference on Intelligent Networking and Collaborative Systems (INCoS) 2010 (Andrews and Orphanides  ...  In-Close is based conceptually on Kuznetsov's Close-By-One algorithm (Kuznetsov, 1999) .  ...  Introduction Formal Concept Analysis (FCA) was introduced in the 1990s by Rudolf Wille and Bernhard Ganter (Ganter and Wille, 1998) , building on applied lattice and order theory developed by Birkhoff  ... 
doi:10.1504/ijssc.2012.047469 fatcat:mx5uyw42frcgljyhhhhqmylhw4
« Previous Showing results 1 — 15 out of 22 results