DocumentCode
3419544
Title
Mining weak rules
Author
Liu, Huan ; Lu, Hongjun
Author_Institution
Sch. of Comput., Nat. Univ. of Singapore, Singapore
fYear
1999
fDate
1999
Firstpage
309
Lastpage
310
Abstract
Finding patterns from data sets is a fundamental task of data mining. If we categorize all patterns into strong, weak, and random, conventional data mining techniques are designed only to find strong patterns, which hold for numerous objects and are usually consistent with the expectations of experts. We address the problem of finding weak patterns (i.e., reliable exceptions) from databases. They are valid for a small number of objects. A simple approach is proposed which uses deviation analysis to identify interesting exceptions and explore reliable ones. It is also flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a benchmark data set
Keywords
data mining; pattern recognition; very large databases; benchmark data set; data mining techniques; deviation analysis; objective exceptions; reliable exceptions; strong patterns; weak patterns; weak rules; Association rules; Computer science; Data mining; Decision trees; Machine learning; Machine learning algorithms; Rails; Testing; Windows;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1999. COMPSAC '99. Proceedings. The Twenty-Third Annual International
Conference_Location
Phoenix, AZ
ISSN
0730-3157
Print_ISBN
0-7695-0368-3
Type
conf
DOI
10.1109/CMPSAC.1999.812723
Filename
812723
Link To Document