Shin-Mu Vincent Tseng

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-99-1089
1999

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1999/CSD-99-1089.pdf

Most existing studies on association rules discovery focused on finding the association rules between all items in a large database that satisfy user-specified minimum confidence and support. In practice, users are often interested in finding association rules involving only some specified items. Meanwhile, based on the search results in former queries, users tend to change the minimal confidence and support requirements to obtain suitable number of rules. Under these constraints, the existing mining algorithms can not perform efficiently due to high and repeated disk access overhead. In this research, we present a novel mining algorithm that can efficiently discover the association rules between the user-specified items or categories via feature extraction approach. At most one scan of the database is needed for each query; hence, the disk access overhead can be reduced substantially and the query be responded quickly.

BibTeX citation:

@techreport{Tseng:CSD-99-1089,
    Author = {Tseng, Shin-Mu Vincent},
    Title = {An Efficient Method for Mining Association Rules with Item Constraints},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1999},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1999/6037.html},
    Number = {UCB/CSD-99-1089},
    Abstract = {Most existing studies on association rules discovery focused on finding the association rules between all items in a large database that satisfy user-specified minimum confidence and support. In practice, users are often interested in finding association rules involving only some specified items. Meanwhile, based on the search results in former queries, users tend to change the minimal confidence and support requirements to obtain suitable number of rules. Under these constraints, the existing mining algorithms can not perform efficiently due to high and repeated disk access overhead. In this research, we present a novel mining algorithm that can efficiently discover the association rules between the user-specified items or categories via feature extraction approach. At most one scan of the database is needed for each query; hence, the disk access overhead can be reduced substantially and the query be responded quickly.}
}

EndNote citation:

%0 Report
%A Tseng, Shin-Mu Vincent
%T An Efficient Method for Mining Association Rules with Item Constraints
%I EECS Department, University of California, Berkeley
%D 1999
%@ UCB/CSD-99-1089
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1999/6037.html
%F Tseng:CSD-99-1089