64,365 Hits in 4.8 sec

Comparing performance of algorithms for generating concept lattices

Sergei O. Kuznetsov, Sergei A. Obiedkov
2002 Journal of experimental and theoretical artificial intelligence (Print)  
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed.  ...  Conditions of preferable use of some algorithms are given in terms of density/sparseness of underlying formal contexts. Principles of comparing practical performance of algorithms are discussed.  ...  The problem of comparing performance of algorithms for constructing concept lattices and their diagram graphs is a challenging and multifaceted one.  ... 
doi:10.1080/09528130210164170 fatcat:gqbvypu35fc2zfsqtin2rmrib4

AddIntent: A New Incremental Algorithm for Constructing Concept Lattices [chapter]

Dean van der Merwe, Sergei Obiedkov, Derrick Kourie
2004 Lecture Notes in Computer Science  
An incremental concept lattice construction algorithm, called AddIntent, is proposed.  ...  The current best estimate for the algorithm's upper bound complexity to construct a concept lattice L whose context has a set of objects G, each of which possesses at most max(|g |) attributes, is O(|L  ...  In fact, our results indicate that the fastest algorithm on such contexts is [15] , but the performance of AddIntent is comparable to the performance of [15] .  ... 
doi:10.1007/978-3-540-24651-0_31 fatcat:adsbl2vz5vaorg764qbemyxhri

A Lattice-Based Model for Recommender Systems

Shriram Narayanaswamy, Raj Bhatnagar
2008 2008 20th IEEE International Conference on Tools with Artificial Intelligence  
The algorithms convert user ratings into concepts; organize concepts into coherent lattices by imposing constraints based on collaborative filtering, and enable fast querying of lattices for generating  ...  In our lattice-based approach, we present a generic framework and algorithms for building recommender systems.  ...  Another strength of this approach is that the model-building time and real-time performance are acceptable for any modern application.  ... 
doi:10.1109/ictai.2008.64 dblp:conf/ictai/NarayanaswamyB08 fatcat:7gjqd27zvbhbnbnt6gpdqlm3ce

Algorithms for the Construction of Concept Lattices and Their Diagram Graphs [chapter]

Sergei O. Kuznetsov, Sergei A. Obiedkov
2001 Lecture Notes in Computer Science  
Several algorithms that generate the set of all formal concepts and graphs of line (Hasse) diagrams of concept lattices are considered. Some modifications of well-known algorithms are proposed.  ...  Conditions of preferable use of some algorithms are given in terms of density/sparsity of underlying formal contexts.  ...  Conclusion In this work, we attempted to compare some well-known algorithms for constructing concept lattices and their diagram graphs.  ... 
doi:10.1007/3-540-44794-6_24 fatcat:ogpiz2nsvngn7a55vgcx6qbowq

A lattice-free concept lattice update algorithm

Jan Outrata
2015 International Journal of General Systems  
We describe the algorithm and present an experimental evaluation of its performance and a comparison with AddIntent incremental algorithm for computing concept lattice.  ...  Updating a concept lattice when introducing new objects to input data can be done by any of the so-called incremental algorithms for computing concept lattice of the data.  ...  and that the second algorithm is performance comparable to incremental algorithms for computing concept lattice.  ... 
doi:10.1080/03081079.2015.1072928 fatcat:apwpvkh77zggldw52iplqegovu

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  ...  As figure 6 shown, select a different support (20%, 15%, 10%, 5%, 1%) to compare performance of two algorithms.  ... 
doi:10.1109/iccsit.2010.5563596 fatcat:q7so2uu77fdgvmegxgnu2bby3i


2011 International journal of pattern recognition and artificial intelligence  
Coming from the¯eld of data mining techniques, most literature on the subject using Galois lattices relies on selection-based strategies, which consists of selecting/ choosing the concepts which encode  ...  Opposed to these selection-based strategies are navigation-based approaches which perform the classi¯cation stage by navigating through the complete lattice (similar to the navigation in a classi¯cation  ...  Generation algorithms Numerous generation algorithms for concept lattices have been proposed in the literature. 5, 7, 12, 15, 23, 24, 29, 32 Although all these algorithms generate the same lattice, they  ... 
doi:10.1142/s0218001411008634 fatcat:z6fdegf5drat3cwe2xgnlvadky

Parallel iterative reengineering model of legacy systems

Xing Su, Xiaohu Yang, Juefeng Li, Di Wu
2009 2009 IEEE International Conference on Systems, Man and Cybernetics  
An algorithm named "Bottom-Up", which consists of two parts, is introduced to build the parallel schedule for the reengineering process.  ...  This model shortens the reengineering duration and has been proven to be successful in improving the transition system's performance in a comparative experiment.  ...  Recursive Sorting Algorithm Once the table of concept layer is generated, we will use the Recursive Sorting Algorithm to form ICRT.  ... 
doi:10.1109/icsmc.2009.5346680 dblp:conf/smc/SuYLW09 fatcat:cftxisuukfgmpos2ey6vl4xjae

A New Rapid Incremental Algorithm for Constructing Concept Lattices

Jingpu Zhang, Ronghui Liu, Ligeng Zou, Licheng Zeng
2019 Information  
Formal concept analysis has proven to be a very effective method for data analysis and rule extraction, but how to build formal concept lattices is a difficult and hot topic.  ...  We also present an experimental evaluation of its performance and comparison with AddExtent.  ...  Batch algorithms [5, 28, 29] generally use two methods to construct a concept lattice: one of them is to build a concept lattice from top to bottom and the other is to build a concept lattice from bottom  ... 
doi:10.3390/info10020078 fatcat:powrl3loxncnlfe6ncs3b3ik2u

Lattice-cell : Hybrid approach for text categorization [article]

Hichem Benfriha, Fatiha Barigou, Baghdad Atmani
2013 arXiv   pre-print
We examine, by experiments the performance of the proposed approach and compare it with other algorithms such as Naive Bayes and k nearest neighbors.  ...  In this framework, concept structure are modeled by a Cellular Automaton for Symbolic Induction (CASI). Our objective is to reduce time categorization caused by the Concept Lattice.  ...  Comparative experiments To study the effect of the similarity measure of the performance of LATTICE-CELL, we tested four scenarios.  ... 
arXiv:1311.4151v1 fatcat:rvnklkmsdrdenaforw36watlwu

Incremental Classification Rules Based on Association Rules Using Formal Concept Analysis [chapter]

Anamika Gupta, Naveen Kumar, Vasudha Bhatnagar
2005 Lecture Notes in Computer Science  
and Classification rules using Concept Lattice.  ...  Concept lattice, core structure in Formal Concept Analysis has been used in various fields like software engineering and knowledge discovery.In this paper, we present the integration of Association rules  ...  Building the Lattice This algorithm builds Concept Lattice for all class labels. Each class label has a different lattice.  ... 
doi:10.1007/11510888_2 fatcat:wa63axdotrdohdtgroi54dtn6y

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.  ...  Results demonstrate that QuICL provides performance on the order of FI miners yet additionally derive the upper covers.  ...  The identification of generator concepts can be performed from the bottom up using the lattice structure to navigate to a generator (i.e., a base concept).  ... 
doi:10.5539/cis.v7n1p10 fatcat:b3hjuhk2uvc2vfjs27ygrng7ry


Robert Godin, Rokia Missaoui, Hassan Alaoui
1995 Computational intelligence  
Results of empirical tests are given in order to compare the performance of the incremental algorithms to three other batch algorithms.  ...  The Galois (or concept) lattice produced from a binary relation has been proved useful for many applications.  ...  ACKNOWLEDGMENTS We would like to thank Martin Vanasse for his contribution in the experiments.  ... 
doi:10.1111/j.1467-8640.1995.tb00031.x fatcat:eypfxxl6trci5dpvklcr3iutme

An Algorithm Based on Concept-Matrix for Building Concept Lattice with Hasse

Sujing Wang, Zhen Chen, Dongjing Wang
2007 2007 International Conference on Wireless Communications, Networking and Mobile Computing  
This paper presents an efficient algorithm named CMCG (Concept-Matrix based Concepts Generation) for building concept lattice and corresponding Hasse graph based on conceptmatrix which is a novel notion  ...  The pseudo codes of CMCG Algorithm are given and that performance of CMCG is superior to one of Lattice Algorithm is proved at end.  ...  This paper presents an algorithm of generating concept lattice with Hasse based on conceptmatrix. By experiment the effectiveness of CMCG Algorithm was proved contrasting to Lattice Algorithm.  ... 
doi:10.1109/wicom.2007.1370 fatcat:535upe3v2ngmxbboanefnwztui

Scalable Formal Concept Analysis algorithm for large datasets using Spark [article]

Raghavendra K Chunduri, Aswani Kumar Cherukuri
2018 arXiv   pre-print
Various performance metrics are considered for the evaluation of the proposed work, the results of the evaluation proves that the proposed algorithms are efficient for concept generation and lattice graph  ...  lattice(digraph of the concepts).  ...  Execution time Execution time is one of the performance metrics where we measured the time required for generation of concepts and construction of the concept lattice.  ... 
arXiv:1807.02258v1 fatcat:qarq67qjrfcobhebpt6kbobnda
« Previous Showing results 1 — 15 out of 64,365 results