title: Negative and positive association rules mining from text using frequent and infrequent itemsets.
abstract: Association rule mining research typically focuses on positive association rules (PARs), generated from frequently occurring itemsets. However, in recent years, there has been a significant research focused on finding interesting infrequent itemsets leading to the discovery of negative association rules (NARs). The discovery of infrequent itemsets is far more difficult than their counterparts, that is, frequent itemsets. These problems include infrequent itemsets discovery and generation of accurate NARs, and their huge number as compared with positive association rules. In medical science, for example, one is interested in factors which can either adjudicate the presence of a disease or write-off of its possibility. The vivid positive symptoms are often obvious; however, negative symptoms are subtler and more difficult to recognize and diagnose. In this paper, we propose an algorithm for discovering positive and negative association rules among frequent and infrequent itemsets. We identify associations among medications, symptoms, and laboratory results using state-of-the-art data mining technology.
authors: Department of Computer Science & Engineering, University of Engineering & Technology, Lahore, Pakistan ; Al-Khawarizmi Institute of Computer Sciences, UET, Lahore, Pakistan.
authors: Sajid
authors: S
authors: Mahmood
authors: Department of Computer Science & Engineering, University of Engineering & Technology, Lahore, Pakistan.
authors: Muhammad
authors: M
authors: Shahbaz
authors: Ted Rogers School of Information Technology Management, Ryerson University, Toronto, Canada.
authors: Aziz
authors: A
authors: Guergachi
mesh_terms: D000465:Algorithms; D057225:Data Mining / Q000379:methods*; D016208:Databases, Factual; D016247:Information Storage and Retrieval