IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i2p159-d204646.html
   My bibliography  Save this article

Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices

Author

Listed:
  • Yafeng Yang

    (College of Science, North China University of Science and Technology, 21 Bohai Road, Tangshan 063210, China)

  • Ru Zhang

    (Department of mathematics and information sciences, Tangshan Normal University, No. 156 Jianshe North Road, Tangshan 063009, China)

  • Baoxiang Liu

    (College of Science, North China University of Science and Technology, 21 Bohai Road, Tangshan 063210, China)

Abstract

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.

Suggested Citation

  • Yafeng Yang & Ru Zhang & Baoxiang Liu, 2019. "Dynamic Horizontal Union Algorithm for Multiple Interval Concept Lattices," Mathematics, MDPI, vol. 7(2), pages 1-11, February.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:2:p:159-:d:204646
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/2/159/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/2/159/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2019:i:2:p:159-:d:204646. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.