Mining Frequent Itemsets with Dualistic Constraints

详细信息    查看全文

• 作者：Anh Tran (1) anhtn@dlu.edu.vn
  Hai Duong (1) haidc@dlu.edu.vn
  Tin Truong (1) tintc@dlu.edu.vn
  Bac Le (2) lhbac@fit.hcmus.edu.vn
• 关键词：Closed itemsets – ; frequent itemsets – ; dualistic – ; constraints – ; generators
• 刊名：Lecture Notes in Computer Science
• 出版年：2012
• 出版时间：2012
• 年：2012
• 卷：7458
• 期：1
• 页码：807-813
• 全文大小：1.3 MB
• 参考文献：1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceeding of the 20th International Conference on Very Large Data Bases, pp. 478–499 (1994)
  2. Anh, T., Hai, D., Tin, T., Bac, L.: Efficient Algorithms for Mining Frequent Itemsets with Constraint. In: Proceedings of the Third International Conference on Knowledge and Systems Engineering, pp. 19–25 (2011)
  3. Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint-Based Rule Mining in Large, Dense Databases. Data Mining and Knowledge Discovery 4(2/3), 217–240 (2000)
  4. Cong, G., Liu, B.: Speed-up Iterative Frequent Itemset Mining with Constraint Changes. In: ICDM, pp. 107–114 (2002)
  5. Nguyen, R.T., Lakshmanan, V.S., Han, J., Pang, A.: Exploratory Mining and Pruning Optimizations of Constrained Association Rules. In: Proceedings of the 1998 ACM-SIG-MOD Int’l Conf. on the Management of Data, pp. 13–24 (1998)
  6. Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. of Intelligent Information Systems 24(1), 29–60 (2005)
  7. Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceeding KDD 1997, pp. 67–73 (1997)
  8. Truong, T.C., Tran, A.N.: Structure of Set of Association Rules Based on Concept Lattice. In: Nguyen, N.T., Katarzyniak, R., Chen, S.-M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol. 283, pp. 217–227. Springer, Heidelberg (2010)
  9. Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery (9), 223–248 (2004)
  10. Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 283–296 (1997)
  11. Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowledge and Data Engineering 17(4), 462–478 (2005)
  12. Wille, R.: Concept lattices and conceptual knowledge systems. Computers and Math. with App. 23, 493–515 (1992)
• 作者单位：1. Department of Mathematics and Computer Science, University of Dalat, Dalat, Vietnam2. University of Natural Science Ho Chi Minh, Ho Chi Minh, Vietnam
• ISSN：1611-3349

文摘

Mining frequent itemsets can often generate a large number of frequent itemsets. Recent studies proposed mining itemset with the different types of constraint. The paper is to mine frequent itemsets, where a one: does not contain any item of C ₀ or contains at least one item of C ₀. The set of all those ones is partitioned into equivalence classes. Without loss of generality, we only investigate each class independently. One class is represented by a frequent closed set L and splits into two disjoint sub-classes. The first contains frequent itemsets that do not contain any item of C₀. It is generated from the corresponding generators. The second includes in two subsets of the frequent itemsets coming from the generators containing in C ₀, and the ones obtained by connecting each non-empty subset of L(C ₀ with each element of the first.