Mining flexible multiple-level association rules in all concept hierarchies

Li Shen, Hong Shen

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

6 Citations (Scopus)

Abstract

We introduce the problem of mining FML (flexible multiplelevel) association rules in all concept hierarchies related to a set of user interested database attributes, as interesting association rules among data items may occur at multiple levels of multiple relevant concept hierarchies. We present a complete classification of all FML rules and show that direct application of previous research can find only a small part of strong FML rules. We propose an efficient method to generate all strong FML rules in all concept hierarchies.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages786-795
Number of pages10
Volume1460
ISBN (Print)3540649506, 9783540649502
StatePublished - 1998
Externally publishedYes
Event9th International Conference on Database and Expert Systems Applications, DEXA 1998 - Vienna, Austria
Duration: Aug 24 1998Aug 28 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1460
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other9th International Conference on Database and Expert Systems Applications, DEXA 1998
CountryAustria
CityVienna
Period8/24/988/28/98

Fingerprint

Concept Hierarchy
Association rules
Association Rules
Mining
Attribute

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Shen, L., & Shen, H. (1998). Mining flexible multiple-level association rules in all concept hierarchies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1460, pp. 786-795). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1460). Springer Verlag.

Mining flexible multiple-level association rules in all concept hierarchies. / Shen, Li; Shen, Hong.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1460 Springer Verlag, 1998. p. 786-795 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1460).

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

Shen, L & Shen, H 1998, Mining flexible multiple-level association rules in all concept hierarchies. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1460, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1460, Springer Verlag, pp. 786-795, 9th International Conference on Database and Expert Systems Applications, DEXA 1998, Vienna, Austria, 8/24/98.
Shen L, Shen H. Mining flexible multiple-level association rules in all concept hierarchies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1460. Springer Verlag. 1998. p. 786-795. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Shen, Li ; Shen, Hong. / Mining flexible multiple-level association rules in all concept hierarchies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1460 Springer Verlag, 1998. pp. 786-795 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a8de20e9877843a6a8c8a3bfee93739d,
title = "Mining flexible multiple-level association rules in all concept hierarchies",
abstract = "We introduce the problem of mining FML (flexible multiplelevel) association rules in all concept hierarchies related to a set of user interested database attributes, as interesting association rules among data items may occur at multiple levels of multiple relevant concept hierarchies. We present a complete classification of all FML rules and show that direct application of previous research can find only a small part of strong FML rules. We propose an efficient method to generate all strong FML rules in all concept hierarchies.",
author = "Li Shen and Hong Shen",
year = "1998",
language = "English (US)",
isbn = "3540649506",
volume = "1460",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "786--795",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Mining flexible multiple-level association rules in all concept hierarchies

AU - Shen, Li

AU - Shen, Hong

PY - 1998

Y1 - 1998

N2 - We introduce the problem of mining FML (flexible multiplelevel) association rules in all concept hierarchies related to a set of user interested database attributes, as interesting association rules among data items may occur at multiple levels of multiple relevant concept hierarchies. We present a complete classification of all FML rules and show that direct application of previous research can find only a small part of strong FML rules. We propose an efficient method to generate all strong FML rules in all concept hierarchies.

AB - We introduce the problem of mining FML (flexible multiplelevel) association rules in all concept hierarchies related to a set of user interested database attributes, as interesting association rules among data items may occur at multiple levels of multiple relevant concept hierarchies. We present a complete classification of all FML rules and show that direct application of previous research can find only a small part of strong FML rules. We propose an efficient method to generate all strong FML rules in all concept hierarchies.

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

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

M3 - Conference contribution

AN - SCOPUS:84949189243

SN - 3540649506

SN - 9783540649502

VL - 1460

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 786

EP - 795

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -