Mining significant crisp-fuzzy spatial association rules

被引:7
|
作者
Shi, Wenzhong [1 ]
Zhang, Anshu [1 ]
Webb, Geoffrey I. [2 ]
机构
[1] Hong Kong Polytech Univ, Dept Land Surveying & Geoinformat, Kowloon, Hong Kong, Peoples R China
[2] Monash Univ, Fac Informat Technol, Clayton, Vic, Australia
基金
中国国家自然科学基金;
关键词
Spatial association rules; fuzzy sets and logic; quality issues; statistical evaluation; spatial data mining; MODEL;
D O I
10.1080/13658816.2018.1434525
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Spatial association rule mining (SARM) is an important data mining task for understanding implicit and sophisticated interactions in spatial data. The usefulness of SARM results, represented as sets of rules, depends on their reliability: the abundance of rules, control over the risk of spurious rules, and accuracy of rule interestingness measure (RIM) values. This study presents crisp-fuzzy SARM, a novel SARM method that can enhance the reliability of resultant rules. The method firstly prunes dubious rules using statistically sound tests and crisp supports for the patterns involved, and then evaluates RIMs of accepted rules using fuzzy supports. For the RIM evaluation stage, the study also proposes a Gaussian-curve-based fuzzy data discretization model for SARM with improved design for spatial semantics. The proposed techniques were evaluated by both synthetic and real-world data. The synthetic data was generated with predesigned rules and RIM values, thus the reliability of SARM results could be confidently and quantitatively evaluated. The proposed techniques showed high efficacy in enhancing the reliability of SARM results in all three aspects. The abundance of resultant rules was improved by 50% or more compared with using conventional fuzzy SARM. Minimal risk of spurious rules was guaranteed by statistically sound tests. The probability that the entire result contained any spurious rules was below 1%. The RIM values also avoided large positive errors committed by crisp SARM, which typically exceeded 50% for representative RIMs. The real-world case study on New York City points of interest reconfirms the improved reliability of crisp-fuzzy SARM results, and demonstrates that such improvement is critical for practical spatial data analytics and decision support.
引用
收藏
页码:1247 / 1270
页数:24
相关论文
共 50 条
  • [1] Mining significant fuzzy association rules with differential evolution algorithm
    Zhang, Anshu
    Shi, Wenzhong
    [J]. APPLIED SOFT COMPUTING, 2020, 97
  • [2] Crisp-fuzzy representation of Allen's temporal logic
    Manaf, Nor Azlinayati Abdul
    Beikzadeh, M. Reza
    [J]. PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND APPLICATIONS, 2007, : 174 - +
  • [3] Fuzzy set approaches to spatial data mining of association rules
    Ladner, Roy
    Cobb, Maria A.
    Petry, Frederick E.
    [J]. Transactions in GIS, 2003, 7 (01) : 123 - 138
  • [4] Compression and expansion of fuzzy rule bases by using crisp-fuzzy neural networks
    Zhang, YQ
    Kandel, A
    [J]. CYBERNETICS AND SYSTEMS, 1998, 29 (01) : 5 - 34
  • [5] Crisp-Fuzzy Concept Lattice Based on Interval-Valued Fuzzy Sets
    Li, Tong-Jun
    Wang, Yi-Qian
    [J]. ROUGH SETS, IJCRS 2023, 2023, 14481 : 449 - 462
  • [6] Mining spatial association rules
    Bembenik, R
    Protaziuk, G
    [J]. INTELLIGENT INFORMATION PROCESSING AND WEB MINING, 2004, : 3 - 12
  • [7] Mining Fuzzy Association Rules in Databases
    Kuok, Chan Man
    Fu, Ada
    Wong, Man Hon
    [J]. SIGMOD Record (ACM Special Interest Group on Management of Data), 1998, 27 (01): : 41 - 46
  • [8] Mining fuzzy quantitative association rules
    Subramanyam, R. B. V.
    Goswami, A.
    [J]. EXPERT SYSTEMS, 2006, 23 (04) : 212 - 225
  • [9] Mining fuzzy periodic association rules
    Lee, Wan-Jui
    Jiang, Jung-Yi
    Lee, Shie-Jue
    [J]. DATA & KNOWLEDGE ENGINEERING, 2008, 65 (03) : 442 - 462
  • [10] An algorithm for mining fuzzy association rules
    Sheibani, Reza
    Ebrahimzadeh, Amir
    [J]. IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 486 - 490