Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices
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 backgrou...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-02-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/2/159 |
| _version_ | 1811198744544149504 |
|---|---|
| author | Yafeng Yang Ru Zhang Baoxiang Liu |
| author_facet | Yafeng Yang Ru Zhang Baoxiang Liu |
| author_sort | Yafeng Yang |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-12T01:36:26Z |
| format | Article |
| id | doaj.art-a2e751cbbe2b49bb987f1337f55b29b6 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-04-12T01:36:26Z |
| publishDate | 2019-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-a2e751cbbe2b49bb987f1337f55b29b62022-12-22T03:53:18ZengMDPI AGMathematics2227-73902019-02-017215910.3390/math7020159math7020159Dynamic Horizontal Union Algorithm for Multiple Interval Concept LatticesYafeng Yang0Ru Zhang1Baoxiang Liu2College of Science, North China University of Science and Technology, 21 Bohai Road, Tangshan 063210, ChinaDepartment of mathematics and information sciences, Tangshan Normal University, No. 156 Jianshe North Road, Tangshan 063009, ChinaCollege of Science, North China University of Science and Technology, 21 Bohai Road, Tangshan 063210, ChinaIn 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.https://www.mdpi.com/2227-7390/7/2/159big datainterval concept latticehorizontal unionsequence traversal |
| spellingShingle | Yafeng Yang Ru Zhang Baoxiang Liu Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices Mathematics big data interval concept lattice horizontal union sequence traversal |
| title | Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices |
| title_full | Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices |
| title_fullStr | Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices |
| title_full_unstemmed | Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices |
| title_short | Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices |
| title_sort | dynamic horizontal union algorithm for multiple interval concept lattices |
| topic | big data interval concept lattice horizontal union sequence traversal |
| url | https://www.mdpi.com/2227-7390/7/2/159 |
| work_keys_str_mv | AT yafengyang dynamichorizontalunionalgorithmformultipleintervalconceptlattices AT ruzhang dynamichorizontalunionalgorithmformultipleintervalconceptlattices AT baoxiangliu dynamichorizontalunionalgorithmformultipleintervalconceptlattices |