article

Key roles of closed sets and minimal generators in concise representations of frequent patterns

Author:

Tarek HamrouniAuthors Info & Claims

Intelligent Data Analysis, Volume 16, Issue 4

Pages 581 - 631

Published: 01 July 2012 Publication History

Abstract

The last years witnessed an explosive progress in networking, storage, and processing technologies resulting in an unprecedented amount of digitalization of data. Hence, there has been a considerable need for tools or techniques to delve and efficiently discover valuable, non-obvious information from large databases. In this situation, data mining is an important research field which offers efficient solutions for such an extraction. Much research in data mining from large databases have focused on the discovery of frequent patterns which are then used to identify relationships between sets of items in a database, through for example association rule derivation. In practice, however, the number of frequently occurring patterns is very large, hampering their effective exploitation by the end-users. In this situation, many works have been interested in defining manageably-sized sets of patterns, called concise representations, from which redundant patterns can be regenerated. In this paper, we concentrate on exact concise representations of frequent patterns. Thus, we describe their close relation with important concepts like the framework of ε-adequate representation and the minimum description length principle. Based on the mathematical settings of Formal Concept Analysis, we also show the complementarity between minimal generators and closed itemsets. Then, we focus on the key role played by these patterns for solving several problem associated to various pattern classes. In this respect, we classify concise representations of frequent itemsets according to their common characteristics. Then, we analyze a representative of each class and show its close link with minimal generators. Finally, we carry out a critical study of concise representations with respect to several aspects and comparative criteria which proves the importance of considering closed sets and minimal generators.

References

[1]

R. Agrawal, T. Imielinski and A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the ACM-SIGMOD International Conference on Management of Data (SIGMOD 1993), Washington D.C., USA, May 1993, pp. 207-216.

Digital Library

[2]

R. Agrawal and R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), Santiago, Chile, 1994, pp. 478-499.

[3]

G. Aguilera, P. Cordero, M. Enciso, A. Mora and I.P. de Guzmán, A non-explosive treatment of functional dependencies using rewriting logic, in: Proceedings of 17th Brazilian Symposium on Artificial Intelligence (SBIA 2004), LNCS, volume 3171, Springer-Verlag, São Luis, Maranhão, Brazil, 2004, pp. 31-40.

[4]

M. Al Hasan, Summarization in pattern mining, Encyclopedia of Data Warehousing and Mining, IGI Global, 2009, pp. 1877-1883.

[5]

R. Alves, D.S. Rodriguez-Baena and J.S. AguilarRuiz, Gene association analysis: A survey of frequent pattern mining from gene expression data, Briefings in Bioinformatics 11(2) (2010), 210-224.

[6]

M.Z. Ashrafi, D. Taniar and K. Smith, Redundant association rules reduction techniques, International Journal Business Intelligence and Data Mining 2(1) (2007), 29-63.

Digital Library

[7]

J. Baixeries, Lattice characterization of armstrong and symmetric dependencies, Thesis, University Politècnica de Catalunya, Catalunya, Spain, 2007.

[8]

J.L. Balcázar, Redundancy, deduction schemes and minimum-size bases for association rules, Logical Methods in Computer Science 6(2-3) (2010), 1-33.

[9]

J.L. Balcázar, A. Bifet and A. Lozano, Mining frequent closed unordered trees through natural representations, in: Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), LNCS, Volume 4604, Springer-Verlag, Sheffield, UK, 2007, pp. 347-359.

Digital Library

[10]

J.L. Balcázar and G. Casas-Garriga, Horn axiomatizations for sequential data, Theoretical Computer Science 371(3) (2007), 247-264.

Digital Library

[11]

E. Baralis and S. Chiusano, Essential classification rule sets, ACM Transactions on Database Systems 29(4) (2004), 635-674.

Digital Library

[12]

E. Baralis, S. Chiusano, R. Dutto and L. Mantellini, Compact representations of sequential classification rules, Data Mining: Foundations and Practice, Studies in Computational Intelligence, Volume 118, Springer, 2008, pp. 1-30.

[13]

M. Barbut and B. Monjardet, Ordre et classification. Algèbre et Combinatoire, Hachette, Tome II, 1970.

[14]

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme and L. Lakhal, Mining minimal non-redundant association rules using frequent closed itemsets, in: Proceedings of the 1st International Conference on Computational Logic (DOOD 2000), LNAI, Volume 1861, Springer-Verlag, London, UK, 2000, pp. 972-986.

Digital Library

[15]

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme and L. Lakhal, Mining frequent patterns with counting inference, ACM-SIGKDD Explorations 2(2), (2000), 66-75.

Digital Library

[16]

R.J. Bayardo, Efficiently mining long patterns from databases, in: Proceedings of the International Conference on Management of Data (SIGMOD 1998), Seattle, Washington, USA, May 1998, pp. 85-93.

Digital Library

[17]

R.J. Bayardo, B. Goethals and M.J. Zaki, Frequent itemset mining implementations repository, Available at http://fimi. cs.helsinki.fi/, accessed on June 24th, 2011.

[18]

S. Ben Yahia, G. Gasmi and E. Mephu Nguifo, A new generic basis of factual and implicative association rules, Intelligent Data Analysis 13(4) (2009), 633-656.

[19]

S.B. Yahia, T. Hamrouni and E.M. Nguifo, Frequent closed itemset based algorithms: A thorough structural and analytical survey, ACM-SIGKDD Explorations 8(1) (2006), 93-104.

Digital Library

[20]

C. Berge, Hypergraphs, North Holland, Amsterdam, 1989.

[21]

M.J.A. Berry and G.S. Linoff, Data Mining Techniques: For Marketing, Sales and Customer Relationship Management, Second Edition. Wiley Publishing, 2004.

[22]

J. Besson, C. Robardet, J.F. Boulicaut and S. Rome, Constraint-based concept mining and its application to microarray data analysis, Intelligent Data Analysis 9(1) (2005), 59-82.

[23]

F. Bonchi and C. Lucchese, On condensed representations of constrained frequent patterns, Knowledge and Information Systems 9(2) (2006), 180-201.

Digital Library

[24]

J.F. Boulicaut, Inductive databases and multiple uses of frequent itemsets: The cInQ approach, in: Database Support for Data Mining Applications, LNCS, Volume 2682, Springer-Verlag, 2004, pp. 1-23.

[25]

J.F. Boulicaut, A. Bykowski and C. Rigotti, Free-sets: A condensed representation of Boolean data for the approximation of frequency queries, Data Mining and Knowledge Discovery 7(1) (2003), 5-22.

[26]

J.F. Boulicaut and B. Jeudy, Mining free itemsets under constraints, in: Proceedings of the International Database Engineering and Application Symposium (IDEAS 2001), Grenoble, France, 2001, pp. 322-329.

[27]

T. Brijs, G. Swinnen, K. Vanhoof and G. Wets, Using association rules for product assortment decisions: A case study, in: Proceedings of the 6th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 1999), San Diego, CA, USA, 1999, pp. 254-260.

Digital Library

[28]

A. Bykowski and C. Rigotti, A condensed representation to find frequent patterns, in: Proceedings of the 12th Symposium on Principles Of Database Systems (PODS 2001), ACM Press, Santa Barbara, CA, USA, May 2001, pp. 267-273.

[29]

A. Bykowski and C. Rigotti, DBC: A condensed representation of frequent patterns for efficient mining, Information Systems 28(8) (2003), 949-977.

Digital Library

[30]

T. Calders, Deducing bounds on the support of itemsets, in: Database Support for Data Mining Applications: Discovering Knowledge with Inductive Queries, LNCS, Volume 2682, Springer-Verlag, 2004, pp. 214-233.

[31]

T. Calders and B. Goethals, Mining all non-derivable frequent itemsets, in: Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2002), LNAI, Volume 2431, Springer-Verlag, Helsinki, Finland, 2002, pp. 74-85.

[32]

T. Calders and B. Goethals, Minimal k-free representations of frequent sets, in: Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2003), LNAI, Volume 2838, Springer-Verlag, Cavtat-Dubrovnik, Croatia, 2003, pp. 71-82.

[33]

T. Calders and B. Goethals, Depth-first non-derivable itemset mining, in: Proceedings of the 5th SIAM International Conference on Data Mining (SDM 2005), Newport Beach, CA, USA, 2005, pp. 250-261.

[34]

T. Calders and B. Goethals, Non-derivable itemset mining, Data Mining and Knowledge Discovery 14(1) (2007), 171-206.

Digital Library

[35]

T. Calders, C. Rigotti and J.F. Boulicaut, A survey on condensed representations for frequent sets, in: Constraint Based Mining and Inductive Databases, LNAI, Volume 3848, Springer-Verlag, 2005, pp. 64-80.

[36]

A. Casali, R. Cicchetti and L. Lakhal, Essential patterns: A perfect cover of frequent patterns, in: Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005), LNCS, Volume 3589, Springer-Verlag, Copenhagen, Denmark, 2005, pp. 428-437.

Digital Library

[37]

A. Casali, R. Cicchetti, L. Lakhal and S. Lopes, Couvertures parfaites des motifs fréquents, Revue d'Ingénierie des Systèmes d'Information (ISI), Hermès-Lavoisier 10(2) (2005), 117-138.

[38]

A. Casali, S. Nedjar, R. Cicchetti, L. Lakhal and N. Novelli, Lossless reduction of datacubes using partitions, International Journal of Data Warehousing and Mining, IGI Global Publisher 5(1) (2009), 18-35.

[39]

A. Ceglar and J.F. Roddick, Association mining, ACM Computing Surveys 38(2) (2006), 1-42.

Digital Library

[40]

V. Chandola, A. Banerjee and V. Kumar, Anomaly detection: A survey, ACM Computing Surveys 41(3) (2009), 1-72.

Digital Library

[41]

W.C. Chen, S.S. Tseng and C.Y. Wang, A novel manufacturing defect detection method using association rule mining techniques, Expert Systems with Applications 29 (2005), 807-815.

Digital Library

[42]

H. Cheng, P.S. Yu and J. Han, Approximate frequent itemset mining in the presence of random noise, in: the Book on Soft Computing for Knowledge Discovery and Data Mining, Springer, 2008, pp. 363-389.

[43]

J. Cheng, Y. Ke and W. Ng, ¿-tolerance closed frequent itemsets, in: Proceedings of the 6th International Conference on Data Mining (ICDM 2006), Hong Kong, China, 2006, pp. 139-148.

Digital Library

[44]

Y. Chi, Y. Xia, Y. Yang and R.R. Muntz, Mining closed and maximal frequent subtrees from databases of labeled rooted trees, IEEE Transactions on Knowledge and Data Engineering 17(2) (2005), 190-202.

Digital Library

[45]

P. Colomb and L. Nourine, About keys of formal context and conformal hypergraph, in: Proceedings of the 6th International Conference on Formal Concept Analysis (ICFCA 2008), LNAI, Volume 4933, Springer-Verlag, Montréal, Canada, 2008, pp. 140-149.

[46]

N. Dexter and T. Calders, Theoretical bounds on the size of condensed representations, in: Proceedings of the 3rd International Workshop on Knowledge Discovery in Inductive Databases (KDID 2004), LNCS, Volume 3377, Springer-Verlag, Pisa, Italy, 2004, pp. 46-65.

[47]

G. Dong, C. Jiang, J. Pei, J. Li and L. Wong, Mining succinct systems of minimal generators of formal concepts, in: Proceedings of the 10th International Conference on Database Systems for Advanced Applications (DASFAA 2005), LNCS, Volume 3453, Springer-Verlag, Beijing, China, 2005, pp. 175-187.

Digital Library

[48]

U.M. Fayyad, G. Piatetsky-Shapiro and P. Smyth, From data mining to knowledge discovery in database, Artificial Intelligence Magazine 17(3) (1996) 37-54.

[49]

F. Flouvat, Experimental study of frequent itemsets datasets, Technical report, LIMOS, Blaise Pascal University - Clermont II, Clermont-Ferrand, France, June 2005. Available at http://pages.univ-nc.nc/flouvat/~papers/rr05- ExpStudyDatasets.pdf, accessed on June 24th, 2011.

[50]

W.J. Frawley, G. Piatetsky-Shapiro and C.J. Matheus, Knowledge discovery in databases: An overview, Artificial Intelligence Magazine 13(3) (1992), 57-70.

Digital Library

[51]

J. Galambos and I. Simonelli, Bonferroni-type Inequalities with Applications, Springer, 2000.

[52]

B. Ganter and R. Wille, Formal Concept Analysis, Springer, 1999.

[53]

C. Gao and J. Wang, Efficient itemset generator discovery over a stream sliding window, in: Proceedings of the 18th ACM Conference on Information and Knowledge Management (CIKM 2009), ACM Press, Hong Kong, China, 2009, pp. 355-364.

[54]

C. Gao, J. Wang, Y. He and L. Zhou, Efficient mining of frequent sequence generators, in: Proceedings of the 17th International Conference on World Wide Web (WWW 2008), ACM Press, Beijing, China, 2008, pp. 1051-1052.

Digital Library

[55]

G.C. Garriga, Formal methods for mining structured objects, Thesis, University Politècnica de Catalunya, Catalunya, Spain, 2006.

[56]

G.C. Garriga, P. Kralj and N. Lavrac, Closed sets for labeled data, Journal of Machine Learning Research 9 (2008), 559-580.

Digital Library

[57]

D. Gay, N. Selmaoui and J.F. Boulicaut, Feature construction based on closedness properties is not that simple, in: Proceedings of the 12th Pacific-Asia Conference on Knowledge Data Discovery (PAKDD 2008), LNCS, Volume 5012, Springer-Verlag, Osaka, Japan, 2008, pp. 112-123.

[58]

L. Geng and H.J. Hamilton, Interestingness measures for data mining: A survey, ACM Computing Surveys 38 (2006), 1-31.

Digital Library

[59]

A. Giacometti, D. Laurent and C.T. Diop, Condensed representations for sets of mining queries, Database Technologies for Data Mining: Discovering Knowledge with Inductive Queries, LNCS, Volume 2682, Springer-Verlag, 2004, pp. 250-269.

[60]

B. Goethals, J. Muhonen and H. Toivonen, Mining non-derivable association rules, in: Proceedings of the 5th SIAM International Conference on Data Mining (SDM 2005), Newport Beach, CA, USA, 2005, pp. 239-249.

[61]

B. Goethals and M.J. Zaki, Advances in frequent itemset mining implementations: Report on FIMI'03, ACM-SIGKDD Explorations 6(1) (2004), 109-117.

Digital Library

[62]

A. Grissa-Touzi, M. Sassi and H. Ounelli, Using formal concept analysis for flexible querying optimization, in: Proceedings of the ISCA 23rd International Conference on Computers and Their Applications (CATA 2008), Cancun, Mexico, 2008, pp. 39-46.

[63]

P.D. Grunwald, The Minimum Description Length Principle, MIT Press, 2007.

[64]

J.L. Guigues and V. Duquenne, Familles minimales d'implications informatives résultant d'un tableau de données binaires, Mathématiques et Sciences Humaines 24 (1986), 5-18.

[65]

F. Guillet and H.J. Hamilton, Quality Measures in Data Mining, Studies in Computational Intelligence, Volume 43, Springer, 2007.

Digital Library

[66]

P. Hájek and T. Havránek, Mechanizing Hypothesis Formation: Mathematical Foundations for a General Theory, Springer-Verlag, 1978.

[67]

P. Hajek, M. Holena and J. Rauch, The GUHA method and its meaning for data mining, Journal of Computer and System Sciences 76 (2010), 34-48.

Digital Library

[68]

T. Hamrouni, S.B. Yahia and E.M. Nguifo, Succinct minimal generators: Theoretical foundations and applications, International Journal of Foundations of Computer Sciences, World Scientific Publishing Company 19(2) (2008), 271-296.

[69]

T. Hamrouni, S.B. Yahia and E.M. Nguifo, Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets, Data & Knowledge Engineering 68(10) (2009), 1091-1111.

Digital Library

[70]

T. Hamrouni, S.B. Yahia and E.M. Nguifo, Generalization of association rules through disjunction, Annals of Mathematics and Artificial Intelligence 59(2) (2010), 201-222.

Digital Library

[71]

T. Hamrouni, S.B. Yahia and E.M. Nguifo, Optimized mining of a concise representation for frequent patterns based on disjunctions rather than conjunctions, in: Proceedings of the 23rd International Florida Artificial Intelligence Research Society Conference (FLAIRS 2010), AAAI Press, Daytona Beach, Florida, USA, 2010, pp. 422-427.

[72]

T. Hamrouni, S.B. Yahia and Y. Slimani, Prince: An algorithm for generating rule bases without closure computations, in: Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005), LNCS, Volume 3589, Springer-Verlag, Copenhagen, Denmark, 2005, pp. 346-355.

Digital Library

[73]

T. Hamrouni, I. Denden, S.B. Yahia and E.M. Nguifo, An experimental study of concise representations for frequent patterns, Technical report, URPAH, Faculty of Sciences of Tunis, Tunis, Tunisia, February 2008. Available at http://www.cril.univ-artois.fr/spip/publications/Hamrouni_et_al_TechRep_February_2008.pdf, accessed on June 24th, 2011.

[74]

T. Hamrouni, P. Valtchev, S.B. Yahia and E.M. Nguifo, About the lossless reduction of the minimal generator family of a context, in: Proceedings of the 5th International Conference on Formal Concept Analysis (ICFCA 2007), LNAI, Springer-Verlag, Volume 4390, Clermont-Ferrand, France, 2007, pp. 130-150.

Digital Library

[75]

J. Han, H. Cheng, D. Xin and X. Yan, Frequent pattern mining: current status and future directions, Data Mining and Knowledge Discovery 15(1) (2007), 55-86.

Digital Library

[76]

J. Han and M. Kamber, Data Mining: Concepts and Techniques, Second edition, Morgan Kaufmann Publishers, 2006.

[77]

J. Han, J. Pei, Y. Yin and R. Mao, Mining frequent patterns without candidate generation: A frequent-pattern tree approach, Data Mining and Knowledge Discovery 8(1) (2004), 53-87.

Digital Library

[78]

L. Hattori, G. dos Santos, F. Cardoso and M. Sampaio, Mining software repositories for software change impact analysis: A case study, in: Proceedings of the 23rd Brasilian Symposium on Database (SBBD 2008), Campinas, Brazil, 2008.

[79]

C. Hébert, A. Bretto and B. Crémilleux, A data mining formalization to improve hypergraph minimal transversal computation, Fundamenta Informaticae, IOS Press 80(4) (2007), 1-19.

[80]

M. Hermann and B. Sertkaya, On the complexity of computing generators of closed sets, in: Proceedings of the 6th International Conference on Formal Concept Analysis (ICFCA 2008), LNAI, Volume 4933, Springer-Verlag, Montréal, Canada, 2008, pp. 158-168.

[81]

R.E. Jamison and J.L. Pfaltz, Closure spaces that are not uniquely generated, Discrete Applied Mathematics 147(1) (2005), 69-79.

Digital Library

[82]

Y.S. Koh and N. Rountree, Finding sporadic rules using apriori-inverse, in: Proceedings of the 9th Pacific-Asia Conference on Knowledge Data Discovery (PAKDD 2005), LNAI, Volume 3518, Springer-Verlag, Hanoi, Vietnam, 2005, pp. 97-106.

Digital Library

[83]

Y.S. Koh and N. Rountree, Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection, IGI Global Publisher, 2010.

[84]

R. Kohavi and F. Provost, Applications of data mining to electronic commerce, Data Mining and Knowledge Discovery 5(1-2) (2001), 5-10.

[85]

M. Kryszkiewicz, Concise representations of frequent patterns and association rules, Habilitation dissertation, Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland, 2002.

[86]

M. Kryszkiewicz, Upper bound on the length of generalized disjunction-free patterns, in: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), IEEE Computer Society Press, Santorini Island, Greece, 2004, pp. 31-40.

[87]

M. Kryszkiewicz, Closures of downward closed representations of frequent patterns, in: Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems (HAIS 2009), LNCS, Volume 5572, Springer-Verlag, Salamanca, Spain, 2009, pp. 104-112.

Digital Library

[88]

M. Kryszkiewicz, Compressed disjunction-free pattern representation versus essential pattern representation, in: Proceedings of the 10th International Conference Intelligent Data Engineering and Automated Learning (IDEAL 2009), LNCS, Volume 5788, Springer-Verlag, Burgos, Spain, 2009, pp. 350-358.

[89]

C. Latiri, K. Smaïli, C. Lavecchia and D. Langlois, Mining monolingual and bilingual corpora, Intelligent Data Analysis 14(6) (2010), 663-682.

Digital Library

[90]

A.J.T. Lee, W.C. Lin and C.S. Wang, Mining association rules with multi-dimensional constraints, The Journal of Systems and Software 79(1) (2006), 79-92.

Digital Library

[91]

H. Li and H. Chen, Mining non-derivable frequent itemsets over data stream, Data & Knowledge Engineering 68(5) (2009), 481-498.

Digital Library

[92]

H. Li, J. Li, L. Wong, M. Feng and Y. Tan, Relative risk and odds ratio: a data mining perspective, in: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on Principles Of Database Systems (PODS 2005), ACM Press, Baltimore, Maryland, USA, 2005, pp. 368-377.

Digital Library

[93]

J. Li, On optimal rule discovery, IEEE Transactions on Knowledge and Data Engineering 18(4) (2006), 460-471.

Digital Library

[94]

J. Li and J. Jones, Using multiple and negative target rules to make classifiers more understandable, Knowledge Based Systems 19(6) (2006), 438-444.

Digital Library

[95]

J. Li, H. Li, L. Wong, J. Pei and G. Dong, Minimum description length principle: Generators are preferable to closed patterns, in: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), Boston, Massachusetts, USA, 2006, pp. 409-414.

Digital Library

[96]

J. Li, G. Liu and L. Wong, Mining statistically important equivalence classes and delta-discriminative emerging patterns, in: Proceedings of the 13th International Conference on Knowledge Discovery and Data Mining (KDD 2007), ACM Press, San Jose, CA, USA, 2007, pp. 430-439.

Digital Library

[97]

J. Li and Q. Yang, Strong compound-risk factors: Efficient discovery through emerging patterns and contrast sets, IEEE Transactions on Information Technology in Biomedicine 11(5) (2007), 544-552.

Digital Library

[98]

T. Li, D. Ruan, T. Huang and Y. Xu, On a mathematical relationship between the fixed point and the closed itemset in association rule mining, in: Proceedings of the 18th Australian Joint Conference on Artificial Intelligence (AI 2005), LNCS, Volume 3809, Springer-Verlag, Sydney, Australia, 2005, pp. 989-992.

Digital Library

[99]

Z. Li and Y. Zhou, PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code, in: Proceedings of the 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE 2005), ACM Press, Lisbon, Portugal, 2005, pp. 306-315.

Digital Library

[100]

H.C. Lin, L.H. Wang and S.M. Chen, Query expansion for document retrieval by mining additional query terms, Information and Management Sciences 19(1) (2008), 17-30.

[101]

B. Liu, W. Hsu and Y. Ma, Integrating classification and association rule mining, in: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD 1998), AAAI Press, Menlo Park, US, 1998, pp. 80-86.

[102]

B. Liu, W. Hsu and Y. Ma, Mining association rules with multiple minimum supports, in: Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD 1999), ACM Press, San Diego, CA, USA, 1999, pp. 337-341.

Digital Library

[103]

G. Liu, J. Li and L. Wong, A new concise representation of frequent itemsets using generators and a positive border, Knowledge and Information Systems 17(1) (2008), 35-56.

Digital Library

[104]

D. Lo, S.C. Khoo and J. Li, Mining and ranking generators of sequential patterns, in: Proceedings of the 8th SIAM International Conference on Data Mining (SDM 2008), Atlanta, Georgia, USA, 2008, pp. 553-564.

[105]

D. Maier, The theory of Relational Databases, Computer Science Press, 1983.

Digital Library

[106]

H. Mannila and H. Toinoven, Multiple uses of frequent sets and condensed representations, in: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, Oregon, USA, 1996, pp. 189-194.

[107]

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery 3(1) (1997), 241-258.

[108]

A.M. Manning, D.J. Haglin and J.A. Keane, A recursive search algorithm for statistical disclosure assessment, Data Mining and Knowledge Discovery 16(2) (2008), 165-196.

Digital Library

[109]

T. Mielikäinen, Summarization techniques for pattern collections in data mining, Thesis, University of Helsinki, Helsinki, Finland, 2005.

[110]

T. Mielikäinen, P. Panov and S. Dzeroski, Itemset support queries using frequent itemsets and their condensed representations, in: Proceedings of the 9th International Conference Discovery Science (DS 2006), LNCS, Volume 4265, Springer-Verlag, Barcelona, Spain, 2006, pp. 161-172.

Digital Library

[111]

J. Muhonen and H. Toivonen, Closed non-derivable itemsets, in: Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), LNAI, Volume 4213, Springer-Verlag, Berlin, Germany, 2006, pp. 601-608.

[112]

A.A. Nanavati, K.P. Chitrapura, S. Joshi and R. Krishnapuram, Mining generalised disjunctive association rules, in: Proceedings of the 10th International Conference on Information and Knowledge Management (CIKM 2001), Atlanta, Georgia, USA, 2001, pp. 482-489.

Digital Library

[113]

H. Narushima, Principle of inclusion-exclusion on partially order sets, Discrete Mathematics 42 (1982), 243-250.

Digital Library

[114]

K. Nehme, P. Valtchev, M.R. Hacene and R. Godin, On computing the minimal generator family for concept lattices and icebergs, in: Proceedings of the 3rd International Conference on Formal Concept Analysis (ICFCA 2005), LNAI, Springer-Verlag, Volume 3403, Lens, France, 2005, pp. 192-207.

Digital Library

[115]

S.R.M. Oliveira, Privacy-preserving data mining, Encyclopedia of Data Warehousing and Mining, IGI Global, 2009, pp. 1582-1588.

[116]

C. Ordonez, N. Ezquerra and C.A. Santana, Constraining and summarizing association rules in medical data, Knowledge and Information Systems 9(3) (2006), 259-283.

Digital Library

[117]

F. Pan, G. Cong, K.H. Tung, J. Yang and M.J. Zaki, Carpenter: Finding closed patterns in long biological datasets, in: Proceedings of the 9th International conference on Knowledge Discovery and Data Mining (KDD 2003), 2003, pp. 637-642.

Digital Library

[118]

N. Pasquier, Frequent closed itemset based condensed representations for association rules, in: the Book on Post-Mining of Association Rules: Techniques for Effective Knowledge Extraction, IGI Global Publisher, 2009, pp. 248-273.

[119]

N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Discovering frequent closed itemsets for association rules, in: Proceedings of 7th International Conference on Database Theory (ICDT 1999), LNCS, Volume 1540, Springer-Verlag, Jerusalem, Israel, 1999, pp. 398-416.

[120]

N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Efficient mining of association rules using closed itemset lattices, Information Systems 24(1) (1999), 25-46.

Digital Library

[121]

J. Pei, G. Dong, W. Zou and J. Han, Mining condensed frequent-pattern bases, Knowledge and Information Systems 6(5) (2004), 570-594.

Digital Library

[122]

J. Pei, Y. Yuan, X. Lin, W. Jin, M. Ester, Q. Liu, W. Wang, Y. Tao, J.X. Yu and Q. Zhang, Towards multidimensional subspace skyline analysis, ACM Transactions on Database Systems 31(4) (2006), 1335-1381.

Digital Library

[123]

V. Phan-Luong, The closed keys base of frequent itemsets, in: Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2002), LNCS, Volume 2454, Springer-Verlag, Aix-en-Provence, France, 2002, pp. 181-190.

[124]

V. Phan-Luong, Classification based on small key itemsets, International Journal of Computational Intelligence Research 5(1) (2009), 22-30.

[125]

L. De Raedt and J. Ramon, Condensed representations for inductive logic programming, in: Proceedings of the 9th International Conference Principles of Knowledge Representation and Reasoning (KR 2004), AAAI Press, Whistler, Canada, 2004, pp. 438-446.

[126]

C. Raïssi, T. Calders and P. Poncelet, Mining conjunctive sequential patterns, Data Mining and Knowledge Discovery 17(1) (2008), 77-93.

Digital Library

[127]

M. Ralbovsky and T. Kuchar, Using disjunctions in association mining, in: Proceedings of the 7th Industrial Conference on Data Mining (ICDM 2007), LNCS, Volume 4597, Springer-Verlag, Leipzig, Germany, 2007, pp. 339-351.

[128]

J. Rissanen, Modeling by shortest data description, Automatica 14 (1978), 465-471.

Digital Library

[129]

C. Roth, S.A. Obiedkov and D.G. Kourie, On succinct representation of knowledge community taxonomies with formal concept analysis, International Journal of Foundations of Computer Sciences, World Scientific Publishing Company 19(2) (2008), 383-404.

[130]

S. She, Feature model mining, Master Thesis, University of Waterloo, Waterloo, Ontario, Canada, August 2008.

[131]

Y. Shima, K. Hirata, M. Harao, S. Yokoyama, K. Matsuoka and T. Izumi, Extracting disjunctive closed rules from MRSA data, in: Proceedings of the 1st International Conference on Complex Medical Engineering (CME 2005), Takamatsu, Japan, 2005, pp. 321-325.

[132]

A. Soulet and B. Crémilleux, Adequate condensed representations of patterns, Data Mining and Knowledge Discovery 17(1) (2008), 94-110.

Digital Library

[133]

R. Srikant and R. Agrawal, Mining generalized association rules, in: Proceedings of the 21th International Conference on Very Large Data Bases (VLDB 1995), Zurich, Switzerland, 1995, pp. 407-419.

[134]

R. Srikant, Q. Vu and R. Agrawal, Mining association rules with item constraints, in: Proceedings of the 3rd International Conference on Knowledge Discovery in Databases and Data Mining (KDD 1997), Newport Beach, CA, USA, August 1997, pp. 67-73.

[135]

M. Steinbach and V. Kumar, Generalizing the notion of confidence, Knowledge and Information Systems 12(3) (August 2007), 279-299.

Digital Library

[136]

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier and L. Lakhal, Computing iceberg concept lattices with titanic, Data & Knowledge Engineering 42(2) (2002), 189-222.

Digital Library

[137]

H. Toivonen, Discovering of frequent patterns in large data collections, Thesis, University of Helsinki, Helsinki, Finland, 1996.

[138]

G. Tzanis and C. Berberidis, Mining for mutually exclusive items in transaction databases, International Journal of Data Warehousing and Mining, IGI Global Publisher 3(3) (2007), 45-59.

[139]

T. Uno, T. Asai, Y. Uchida and H. Arimura, An efficient algorithm for enumerating closed patterns in transaction databases, Proceedings of the 7th International Conference on Discovery Science (DS 2004), Padova, Italy, 2004, pp. 16-31.

[140]

P. Valtchev, R. Missaoui and R. Godin, Formal concept analysis for knowledge discovery and data mining: The new challenges, in: Proceedings of the 2nd International Conference on Formal Concept Analysis (ICFCA 2004), LNCS, Springer-Verlag, Volume 2961, Sydney, Australia, 2004, pp. 352-371.

[141]

J. Wang, J. Han and C. Li, Frequent closed sequence mining without candidate maintenance, IEEE Transactions on Knowledge and Data Engineering 19(8) (2007), 1042-1056.

Digital Library

[142]

J. Wang and G. Karypis, On mining instance-centric classification rules, IEEE Transactions on Knowledge and Data Engineering 18(11) (2006), 1497-1511.

Digital Library

[143]

G.M. Weiss, Mining with rarity: A unifying framework, ACM-SIGKDD Explorations 6(1) (2004), 7-19.

Digital Library

[144]

R.C.-W. Wong, A.W.-C. Fu and K. Wang, Data mining for inventory item selection with cross-selling considerations, Data Mining and Knowledge Discovery 11(1) (2007), 81-112.

Digital Library

[145]

X. Wu, C. Zhang and S. Zhang, Efficient mining of both positive and negative association rules, ACM Transactions on Information Systems 22(3) (2004), 381-405.

Digital Library

[146]

Z. Xie, H. Chen and C. Li, MFIS-mining frequent itemsets on data streams, in: Proceedings of the 2nd International Conference on Advanced Data Mining and Applications (ADMA 2006), LNCS, Volume 4093, Springer-Verlag, Xi'an, China, 2006, pp. 1085-1093.

Digital Library

[147]

Z. Xie and Z. Liu, From intent reducts for attribute implications to approximate intent reducts for association rules, in: Proceedings of the 5th International Conference on Computer and Information Technology (CIT 2005), IEEE Computer Society Press, Shanghai, China, 2005, pp. 162-169.

[148]

D. Xin, J. Han, X. Yan and H. Cheng, On compressing frequent patterns, Data & Knowledge Engineering 60(1) (2007), 5-29.

Digital Library

[149]

X. Yan and J. Han, Closegraph: Mining closed frequent graph patterns, in: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington, DC, USA, 2003, pp. 286-295.

[150]

H. Yun, D. Ha, B. Hwang and K. Ryu, Mining association rules on significant rare data using relative support, The Journal of Systems and Software 67 (2003), 181-191.

Digital Library

[151]

M.J. Zaki, Mining non-redundant association rules, Data Mining and Knowledge Discovery 9(3) (2004), 223-248.

Digital Library

[152]

M.J. Zaki and C.-J. Hsiao, Efficient algorithms for mining closed itemsets and their lattice structure, IEEE Transactions on Knowledge and Data Engineering 17(4) (2005), 462-478.

Digital Library

[153]

Z. Zeng, J. Wang, J. Zhang and L. Zhou, FOGGER: An algorithm for graph generator discovery, in: Proceedings of the 12th International Conference on Extending Database Technology (EDBT 2009), ACM Press, Saint Petersburg, Russia, 2009, pp. 517-528.

Digital Library

[154]

L. Zhao, M.J. Zaki and N. Ramakrishnan, BLOSOM: A framework for mining arbitrary Boolean expressions, in: Proceedings of the 12th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006), ACM Press, Philadelphia, PA, USA, 2006, pp. 827-832.

Digital Library

[155]

Z. Zheng, R. Kohavi and L. Mason, Real world performance of association rule algorithms, in: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2001), ACM Press, San Francisco, CA, USA, 2001, pp. 401-406.

Digital Library

Cited By

Song WJiang BQiao Y(2018)Mining multi-relational high utility itemsets from star schemasIntelligent Data Analysis10.3233/IDA-16323122:1(143-165)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/IDA-163231
Tseng VCheng-Wei Wu Fournier-Viger PYu P(2015)Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility ItemsetsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2014.234537727:3(726-739)Online publication date: 3-Feb-2015
https://dl.acm.org/doi/10.1109/TKDE.2014.2345377

Key roles of closed sets and minimal generators in concise representations of frequent patterns
1. Computing methodologies
2. Information systems
  1. Information systems applications

Recommendations

Dataless Transitions Between Concise Representations of Frequent Patterns

For many data mining problems in order to solve them it is required to discover frequent patterns. Frequent itemsets are useful e.g. in the discovery of association and episode rules, sequential patterns and clusters. Nevertheless, the number of ...
Simultaneous mining of frequent closed itemsets and their generators

Closed itemsets and their generators play an important role in frequent itemset and association rule mining. They allow a lossless representation of all frequent itemsets and association rules and facilitate mining. Some recent approaches discover ...
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets

Concise (or condensed) representations of frequent patterns follow the minimum description length (MDL) principle, by providing the shortest description of the whole set of frequent patterns. In this work, we introduce a new exact concise representation ...

Comments

Information & Contributors

Information

Published In

cover image Intelligent Data Analysis

Intelligent Data Analysis Volume 16, Issue 4

July 2012

200 pages

ISSN:1088-467X

Issue’s Table of Contents

Publisher

IOS Press

Netherlands

Publication History

Published: 01 July 2012

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Song WJiang BQiao Y(2018)Mining multi-relational high utility itemsets from star schemasIntelligent Data Analysis10.3233/IDA-16323122:1(143-165)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/IDA-163231
Tseng VCheng-Wei Wu Fournier-Viger PYu P(2015)Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility ItemsetsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2014.234537727:3(726-739)Online publication date: 3-Feb-2015
https://dl.acm.org/doi/10.1109/TKDE.2014.2345377

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents