Scribd
Upload
33 views1 page

On Optimal Rule Discovery

Association bundles are a new pattern for association analysis that were presented by Huang et al. in 2006 as an alternative to association rules. Association bundles can identify meaningful associations that rules cannot and are described across four aspects: structure, measure, threshold setting, and identification algorithms. The document provides an overview of association bundles and compares them to association rules.

Uploaded by

Srinivas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views1 page

On Optimal Rule Discovery

Association bundles are a new pattern for association analysis that were presented by Huang et al. in 2006 as an alternative to association rules. Association bundles can identify meaningful associations that rules cannot and are described across four aspects: structure, measure, threshold setting, and identification algorithms. The document provides an overview of association bundles and compares them to association rules.

Uploaded by

Srinivas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Association Bundle Identification

CONCLUSION Huang, W., Krneta, M., Lin, L. & Wu, J. (2006),


Association bundle – A new pattern for association A
In this article we describe the notion of Association analysis. In Proceedings of the Int’l Conf. on Data
Bundle Identification. Association bundles were pre- Mining - Workshop on Data Mining for Design and
sented by Huang et. al. (Huang, Krneta, Lin & Wu, Marketing.
2006) as a new pattern of association for data mining.
Li, J. (2006). On optimal rule discovery. IEEE Trans-
On applications such as the Market Basket Analysis,
actions on Knowledge and Data Engineering, 18(4),
association bundles can be compared to, but essentially
460-471.
distinguished from the well-established association
rules. Association bundles present meaningful and Liu, B., Hsu, W. & Ma, Y. (1999). Mining association
important associations that association rules unable rules with multiple minimum supports. In Proceedings
to identify. of the 1999 ACM SIGKDD International Conference
We describe association bundles over four aspects on Knowledge Discovery & Data Mining, 337-341.
- association structure, association measure, threshold
Mannila, H. (1998), Database methods for data mining,
setting, and identification algorithms - and try to clarify
KDD-98 tutorial.
these ideas via comparisons between association
bundles and association rules. Omiecinski, E.R.(2003). Alternative interest measures
for mining associations in databases. IEEE Transactions
REFERENCES on Knowledge and Data Engineering, 15(1), 57-69.
Pei, J., Han, J. & Mao, R. (2000). CLOSET: An ef-
Agrawal, R., Imielinski, T. & Swami A. (1993). Min-
ficient algorithm for mining frequent closed itemsets.
ing association rules between sets of items in large
ACM SIGMOD Workshop on Research Issues in Data
databases. In Proceedings of the 1993 ACM SIGMOD
Mining and Knowledge Discovery, 21-30.
International Conference on Management of Data,
207-216. Seno, M. & Karypis, G. (2005). Finding frequent item-
sets using length-decreasing support constraint. Data
Aggarwal, C. C. & Yu, P. S. (1998). A new framework
Mining and Knowledge Discovery, 10, 197-228.
for itemset generation. In Proceedings of the Symposium
on Principles of Database Systems, 18-24. Scheffer, T. (2005). Finding association rules that trade
support optimally against confidence. Intelligent Data
Brin, S., Motwani, R., Ullman, J. D. & Shalom, T. S.
Analysis, 9(4), 381-395.
(1997). Dynamic itemset counting and implication
rules for market basket data. In Proceedings of the Piatetsky-Shapiro, G. (1991). Discovery, Analysis, and
1997 ACM SIGMOD International Conference on Presentation of Strong Rules. Knowledge Discovery in
Management of Data, 255-264. Databases. Cambridge, MA: AAAI/MIT Press.
Bruzzese, D. & Davino, C. (2001). Pruning of dis- Tan, P., Kumar, V. & Srivastava, J. (2004). Selecting
covered association rules. Computational Statistics, the right objective measure for association analysis.
16, 387-398. Information Systems, 29(4), 293-313.
Barber, B. & Hamilton, H. J. (2003). Extracting share Tao, F., Murtagh F. & Farid, M. (2003). Weighted
frequent itemsets with infrequent subsets. Data Mining association rule mining using weighted support and
and Knowledge Discovery, 7, 153-185. significance framework. In Proceedings of the 2003
ACM SIGKDD Conference on Knowledge Discovery
Han, J. & Fu, Y. (1995). Discovery of multiple-level
and Data Mining, 661-666.
association rules from large databases. In Proceed-
ings of 1995 Int’l Conf. on Very Large Data Bases, Zaki, M. J. (2000). Scalable Algorithms for Association
420-431. Mining, IEEE Transactions on Knowledge and Data
Engineering, 12(3), 372-390.
Han, J., Pei, J., Yin, Y. & Mao, R. (2004). Mining
frequent patterns without candidate generation. Data Zaki, M. J. & Hsiao, C. (2002). CHARM: An efficient
Mining and Knowledge Discovery, 8, 53-87. algorithm for closed itemset mining. In Proceedings



You might also like