Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices
AbstractIn 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. View Full-Text
Share & Cite This Article
Yang, Y.; Zhang, R.; Liu, B. Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices. Mathematics 2019, 7, 159.
Yang Y, Zhang R, Liu B. Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices. Mathematics. 2019; 7(2):159.Chicago/Turabian Style
Yang, Yafeng; Zhang, Ru; Liu, Baoxiang. 2019. "Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices." Mathematics 7, no. 2: 159.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.