scholarly journals Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 159 ◽  
Author(s):  
Yafeng Yang ◽  
Ru Zhang ◽  
Baoxiang Liu
Keyword(s):  
Big Data ◽  
Real Time ◽  
Association Rules ◽  
Lattice Structure ◽  
Concept Lattice ◽  
Concept Lattices ◽  
Generation Algorithm ◽  
Mining Association Rules ◽  
Necessary And Sufficient

In the era of big data, the data is updating in real-time. How to prepare the data accurately and efficiently is the key to mining association rules. In view of the above questions, this paper proposes a dynamic horizontal union algorithm of multiple interval concept lattices under the same background of the different attribute set and object set. First, in order to ensure the integrity of the lattice structure, the interval concept lattice incremental generation algorithm was improved, and then interval concept was divided into existing concept, redundancy concept and empty concept. Secondly, combining the characteristics of the interval concept lattice, the concept of consistency of interval concept lattice was defined and it is necessary and sufficient for the horizontal union of the lattice structure. Further, the interval concepts united were discussed, and the principle of horizontal unions was given. Finally, the sequence was scanned by the traversal method. This method increased the efficiency of horizontal union. A case study shows the feasibility and efficiency of the proposed algorithm.

scholarly journals Attribute Extended Algorithm of Lattice-Valued Concept Lattice Based on Congener Formal Context

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Li Yang ◽  
Yang Xu
Keyword(s):  
Parallel Processing ◽  
Distributed Storage ◽  
Concept Lattice ◽  
Research Work ◽  
Sufficient Conditions ◽  
Formal Context ◽  
Concept Lattices ◽  
Lattice Implication Algebra ◽  
Implication Algebra ◽  
Necessary And Sufficient

This paper is the continuation of our research work about lattice-valued concept lattice based on lattice implication algebra. For a better application of lattice-valued concept lattice into data distributed storage and parallel processing, it is necessary to research attribute extended algorithm based on congener formal context. The definitions of attribute extended formal context and congener formal context are proposed. On condition that the extent set stays invariable when the new attribute is increased, the necessary and sufficient conditions of forming attribute values are researched. Based on these conditions, the algorithms of generating lattice-valued congener formal context and establishing concept lattice are given, by which we can provide a useful basis for union algorithm and constructing algorithm of lattice-valued concept lattices in distributed and parallel system.

scholarly journals Dynamic Parallel Mining Algorithm of Association Rules Based on Interval Concept Lattice

Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 647
Author(s):  
Yafeng Yang ◽  
Ru Zhang ◽  
Baoxiang Liu
Keyword(s):  
Association Rules ◽  
Time Complexity ◽  
Concept Lattice ◽  
Massive Data ◽  
Minimal Cost ◽  
Classical Concept ◽  
Mining Algorithm ◽  
Parallel Mining ◽  
Expansion Form

An interval concept lattice is an expansion form of a classical concept lattice and a rough concept lattice. It is a conceptual hierarchy consisting of a set of objects with a certain number or proportion of intent attributes. Interval concept lattices refine the proportion of intent containing extent to get a certain degree of object set, and then mine association rules, so as to achieve minimal cost and maximal return. Faced with massive data, the structure of an interval concept lattice is more complex. Even if the lattice structures have been united first, the time complexity of mining interval association rules is higher. In this paper, the principle of mining association rules with parameters is studied, and the principle of a vertical union algorithm of interval association rules is proposed. On this basis, a dynamic mining algorithm of interval association rules is designed to achieve rule aggregation and maintain the diversity of interval association rules. Finally, the rationality and efficiency of the algorithm are verified by a case study.

scholarly journals ARCA: An Algorithm for Mining Association Rules Based Concept Lattice

2008 ◽  
Author(s):  
Qing Xia ◽  
Sujing Wang ◽  
Zhen Chen ◽  
Tao Lv ◽  
Dongjing Wang
Keyword(s):  
Association Rules ◽  
Concept Lattice ◽  
Mining Association Rules

Mining association rules on Big Data through MapReduce genetic programming

2017 ◽  
Vol 25 (1) ◽  
pp. 31-48 ◽  
Author(s):  
F. Padillo ◽  
J.M. Luna ◽  
F. Herrera ◽  
S. Ventura
Keyword(s):  
Big Data ◽  
Genetic Programming ◽  
Association Rules ◽  
Mining Association Rules

scholarly journals Mining Association Rules in Big Data for E-healthcare Information System

2014 ◽  
Vol 8 (8) ◽  
pp. 1002-1008 ◽  
Author(s):  
N. Rajkumar ◽  
R. Vimal Karthick ◽  
M. Nathiya ◽  
K. Silambarasan
Keyword(s):  
Information System ◽  
Big Data ◽  
Association Rules ◽  
Healthcare Information ◽  
Healthcare Information System ◽  
Mining Association Rules
Sign in / Sign up

Export Citation Format

Share Document