IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v8y2016i6p553-d71940.html
   My bibliography  Save this article

Mining λ -Maximal Cliques from a Fuzzy Graph

Author

Listed:
  • Fei Hao

    (Department of Computer Software Engineering, Soonchunhyang University, 22 Soonchunhyang-ro, Shinchang-myeon, Asan 31538, Korea)

  • Doo-Soon Park

    (Department of Computer Software Engineering, Soonchunhyang University, 22 Soonchunhyang-ro, Shinchang-myeon, Asan 31538, Korea)

  • Shuai Li

    (Department of Theoretical and Applied Sciences (DiSTA), University of Insubria, Via Mazzini 5, Varese 21100, Italy)

  • Hwa Min Lee

    (Department of Computer Software Engineering, Soonchunhyang University, 22 Soonchunhyang-ro, Shinchang-myeon, Asan 31538, Korea)

Abstract

The depletion of natural resources in the last century now threatens our planet and the life of future generations. For the sake of sustainable development, this paper pioneers an interesting and practical problem of dense substructure ( i.e. , maximal cliques) mining in a fuzzy graph where the edges are weighted by the degree of membership. For parameter 0 ≤ λ ≤ 1 (also called fuzzy cut in fuzzy logic), a newly defined concept λ -maximal clique is introduced in a fuzzy graph. In order to detect the λ -maximal cliques from a fuzzy graph, an efficient mining algorithm based on Fuzzy Formal Concept Analysis (FFCA) is proposed. Extensive experimental evaluations are conducted for demonstrating the feasibility of the algorithm. In addition, a novel recommendation service based on an λ -maximal clique is provided for illustrating the sustainable usability of the problem addressed.

Suggested Citation

  • Fei Hao & Doo-Soon Park & Shuai Li & Hwa Min Lee, 2016. "Mining λ -Maximal Cliques from a Fuzzy Graph," Sustainability, MDPI, vol. 8(6), pages 1-16, June.
    • Handle: RePEc:gam:jsusta:v:8:y:2016:i:6:p:553-:d:71940
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/8/6/553/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/8/6/553/
    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:jsusta:v:8:y:2016:i:6:p:553-:d:71940. 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.