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

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

Author

Listed:
  • Yafeng Yang

    (College of Science, North China University of Science and Technology, 21 Bohai Road, Tangshan 063210, China
    Hebei Key Laboratory of Data Science and Application, 21 Bohai Road, Tangshan 063210, China
    Tangshan Key Laboratory of Engineering Computing, 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
    Hebei Key Laboratory of Data Science and Application, 21 Bohai Road, Tangshan 063210, China)

Abstract

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.

Suggested Citation

  • Yafeng Yang & Ru Zhang & Baoxiang Liu, 2019. "Dynamic Parallel Mining Algorithm of Association Rules Based on Interval Concept Lattice," Mathematics, MDPI, vol. 7(7), pages 1-12, July.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:7:p:647-:d:249862
    as

    Download full text from publisher

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

    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:7:p:647-:d:249862. 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.