On the Computation of Concept Stability Based on Maximal Non-Generator for Social Networking Servicesopen access
- Authors
- Gao, Jie; Hao, Fei; Park, Doo-Soon
- Issue Date
- Dec-2020
- Publisher
- MDPI
- Keywords
- social networks; formal concept analysis; concept stability; maximal non-generator
- Citation
- Applied Sciences-basel, v.10, no.23
- Journal Title
- Applied Sciences-basel
- Volume
- 10
- Number
- 23
- URI
- https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/2275
- DOI
- 10.3390/app10238618
- ISSN
- 2076-3417
- Abstract
- The concept stability measure under the Formal Concept Analysis (FCA) theory is useful for improving the accuracy of structure identification of social networks. Nevertheless, the stability calculation is an NP-complete task which is the primary challenges in practical. Most existing studies have focused on the approximate estimate to calculate the stability. Therefore, we focus on introducing the Maximal Non-Generator-based Stability Calculation (MNG-SC) algorithm that directly deals with accurate stability calculation to pave the way for FCA's application in structures identification of social networks. Specifically, a novel perspective of stability calculation by linking it to Maximal Non-Generator (MNG) is first provided. Then, the equivalence between maximal non-generator and lower neighbor concept is first proved, which greatly improves scalability and reduces computational complexity. The performed experiments show that the MNG-SC outperforms the pioneering approaches of the literature. Furthermore, a case study of identifying abnormal users in social networks is presented, which demonstrates the effectiveness and potential application of our algorithm.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Department of Computer Software Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/2275)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.