Next Article in Journal
A Subclass of Bi-Univalent Functions Based on the Faber Polynomial Expansions and the Fibonacci Numbers
Next Article in Special Issue
What Can We Learn from Multi-Objective Meta-Optimization of Evolutionary Algorithms in Continuous Domains?
Previous Article in Journal
Some New Applications of Weakly ℋ-Embedded Subgroups of Finite Groups
Previous Article in Special Issue
A Multi-Objective Particle Swarm Optimization Algorithm Based on Gaussian Mutation and an Improved Learning Strategy
Article Menu
Issue 2 (February) cover image

Export Article

Open AccessArticle
Mathematics 2019, 7(2), 159;

Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices

College of Science, North China University of Science and Technology, 21 Bohai Road, Tangshan 063210, China
Department of mathematics and information sciences, Tangshan Normal University, No. 156 Jianshe North Road, Tangshan 063009, China
Author to whom correspondence should be addressed.
Received: 3 January 2019 / Revised: 28 January 2019 / Accepted: 29 January 2019 / Published: 10 February 2019
(This article belongs to the Special Issue Evolutionary Algorithms in Intelligent Systems)
Full-Text   |   PDF [1066 KB, uploaded 22 February 2019]   |  


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. View Full-Text
Keywords: big data; interval concept lattice; horizontal union; sequence traversal big data; interval concept lattice; horizontal union; sequence traversal

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Yang, Y.; Zhang, R.; Liu, B. Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices. Mathematics 2019, 7, 159.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Mathematics EISSN 2227-7390 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top