Mining weak rules

Huan Liu, Hongjun Lu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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. In this paper, 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. Besides, it is flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a benchmark data set.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software and Applications Conference
PublisherIEEE
Pages309-310
Number of pages2
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 23rd Annual International Computer Software and Applications Conference (COMPSAC '99) - Phoenix, AZ, USA
Duration: Oct 27 1999Oct 29 1999

Other

OtherProceedings of the 1999 23rd Annual International Computer Software and Applications Conference (COMPSAC '99)
CityPhoenix, AZ, USA
Period10/27/9910/29/99

Fingerprint

Data mining

ASJC Scopus subject areas

  • Software

Cite this

Liu, H., & Lu, H. (1999). Mining weak rules. In Proceedings - IEEE Computer Society's International Computer Software and Applications Conference (pp. 309-310). IEEE.

Mining weak rules. / Liu, Huan; Lu, Hongjun.

Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE, 1999. p. 309-310.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, H & Lu, H 1999, Mining weak rules. in Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE, pp. 309-310, Proceedings of the 1999 23rd Annual International Computer Software and Applications Conference (COMPSAC '99), Phoenix, AZ, USA, 10/27/99.
Liu H, Lu H. Mining weak rules. In Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE. 1999. p. 309-310
Liu, Huan ; Lu, Hongjun. / Mining weak rules. Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE, 1999. pp. 309-310
@inproceedings{b07a581ab0d44f5db95abfb3b8eb1403,
title = "Mining weak rules",
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. In this paper, 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. Besides, it is flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a benchmark data set.",
author = "Huan Liu and Hongjun Lu",
year = "1999",
language = "English (US)",
pages = "309--310",
booktitle = "Proceedings - IEEE Computer Society's International Computer Software and Applications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Mining weak rules

AU - Liu, Huan

AU - Lu, Hongjun

PY - 1999

Y1 - 1999

N2 - 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. In this paper, 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. Besides, it is flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a benchmark data set.

AB - 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. In this paper, 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. Besides, it is flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a benchmark data set.

UR - http://www.scopus.com/inward/record.url?scp=0033326398&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033326398&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033326398

SP - 309

EP - 310

BT - Proceedings - IEEE Computer Society's International Computer Software and Applications Conference

PB - IEEE

ER -