Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts

Information Sciences

Volumn 222, Issue , 2013, Pages 343-361

  Hamrouni, T ^a   Ben Yahia, S ^a   Mephu Nguifo, E ^b,c  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

^c UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Closed itemset; Extraction context; Formal concept analysis; Minimal generator; Sparseness measure; Succinct system of minimal generators

Indexed keywords

CONCISE REPRESENTATIONS; DATA MINING TECHNIQUES; GALOIS CLOSURE OPERATORS; HYPER GRAPH; ITEMSET; MINIMAL GENERATORS; MINING ALGORITHMS; PATTERN CLASS; SPARSENESS MEASURE; STRUCTURAL CHARACTERIZATION;

ALGORITHMS; EQUIVALENCE CLASSES; FORMAL CONCEPT ANALYSIS;

DATA MINING;

EID: 84870058936     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2012.08.005     Document Type: Article

References (68)

1. C.C. Aggarwal, and P.S. Yu An effective and efficient algorithm for high-dimensional outlier detection International Journal on Very Large Data Bases 14 2 2005 211 221
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo Fast discovery of association rules Proceedings of Advances in Knowledge Discovery and Data Mining 1996 AAAI Press Menlo Park, CA, USA 307 328
3. M.Z. Ashrafi, D. Taniar, and K. Smith Redundant association rules reduction techniques International Journal of Business Intelligence and Data Mining 2 1 2007 29 63
4. S. Ayubi, M.K. Muyeba, A. Baraani-Dastjerdi, and J.A. Keane An algorithm to mine general association rules from tabular data Information Sciences 179 20 2009 3520 3539
5. J.L. Balcázar, A. Bifet, and A. Lozano Mining frequent closed unordered trees through natural representations Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007) LNCS vol. 4604 2007 Springer-Verlag Sheffield, UK 347 359
6. E. Baralis, and S. Chiusano Essential classification rule sets ACM Transactions on Database Systems 29 4 2004 635 674
7. E. Baralis, S. Chiusano, and P. Garza On support thresholds in associative classification Proceedings of the 20th Symposium on Applied Computing (SAC 2004) 2004 ACM Press Nicosia, Cyprus 553 558
8. 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
9. R.J. Bayardo, R. Agrawal, and D. Gunopulos Constraint-based rule mining in large, dense databases Data Mining and Knowledge Discovery 4 2-3 2000 217 240
10. R.J. Bayardo, B. Goethals, M.J. Zaki, Frequent itemset mining implementations repository, 2004. < http://fimi.cs.helsinki.fi/ > (accessed 18.01.12).
11. S. Ben Yahia, T. Hamrouni, and E. Mephu Nguifo Frequent closed itemset based algorithms: a thorough structural and analytical survey ACM-SIGKDD Explorations 8 1 2006 93 104
12. A. Berrado, and G.C. Runger Using metarules to organize and group discovered association rules Data Mining and Knowledge Discovery 14 3 2007 409 431
13. E. Boros, V. Gurvich, L. Khachiyan, and K. Makino On maximal frequent and minimal infrequent sets in binary matrices Annals of Mathematics and Artificial Intelligence 39 3 2003 211 221
14. 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
15. T. Calders, C. Rigotti, and J.F. Boulicaut A survey on condensed representations for frequent sets Proceedings of Constraint Based Mining and Inductive Databases LNAI vol. 3848 2005 Springer-Verlag 64 80
16. A. Casali, R. Cicchetti, and L. Lakhal Essential patterns: a perfect cover of frequent patterns Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005) LNCS vol. 3589 2005 Springer-Verlag Copenhagen, Denmark 428 437
17. A. Ceglar, and J.F. Roddick Association mining ACM Computing Surveys 38 2 2006 1 42
18. V.T. Chakaravarthy, V. Pandit, and Y. Sabharwal Analysis of sampling techniques for association rule mining Proceedings of the 12th International Conference on Database Theory (ICDT 2009) 2009 ACM Press St. Petersburg, Russia 276 283
19. Y.-L. Chen, S.-Y. Wu, and Y.-C. Wang Discovering multi-label temporal patterns in sequence databases Information Sciences 181 3 2011 398 418
20. F. Coenen, and P. Leng The effect of threshold values on association rule based classification accuracy Data & Knowledge Engineering 60 2 2007 345 360
21. G. Dong, C. Jiang, J. Pei, J. Li, and L. Wong Mining succinct systems of minimal generators of formal concepts Proceedings of the 10th International Conference on Database Systems for Advanced Applications (DASFAA 2005) LNCS vol. 3453 2005 Springer-Verlag Beijing, China 175 187
22. T. Eiter, and G. Gottlob Identifying the minimal transversals of a hypergraph and related problems SIAM Journal on Computing 24 6 1995 1278 1304
23. R. Emilion, and G. Lévy Size of random Galois lattices and number of closed frequent itemsets Discrete Applied Mathematics 157 13 2009 2945 2957
24. M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial data sets with noise, in: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, USA, 1996, pp. 226-231.
25. F. Flouvat, F.D. Marchi, and J.-M. Petit A new classification of datasets for frequent itemsets Journal of Intelligent Information Systems 34 1 2010 1 19
26. B. Ganter, and R. Wille Formal Concept Analysis 1999 Springer
27. F. Geerts, B. Goethals, and J.V. den Bussche A tight upper bound on the number of candidate patterns Proceedings of the International Conference on Data Mining (ICDM 2001) 2001 IEEE Computer Society Press San Jose, CA, USA 155 162
28. R. Godin, R. Missaoui, and H. Alaoui Learning algorithms using a Galois lattice structure Proceedings of the 3rd International Conference on Tools with Artificial Intelligence (ICTAI 1991) 1991 IEEE Computer Society Press San Jose, CA, USA 22 29
29. B. Goethals, and M.J. Zaki Advances in frequent itemset mining implementations: report on FIMI'03 ACM-SIGKDD Explorations 6 1 2004 109 117
30. K. Gouda, and M.J. Zaki Efficiently mining maximal frequent itemsets Proceedings of the 1st International Conference on Data Mining (ICDM 2001) 2001 IEEE Computer Society Press San Jose, USA 163 170
31. G. Grahne, J. Zhu, Efficiently using prefix-trees in mining frequent itemsets, in: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2003), CEUR Workshop Proceedings, vol. 90, Melbourne, Florida, USA, 2003.
32. T. Hamrouni, S. Ben Yahia, and E. Mephu Nguifo Towards a finer assessment of extraction contexts sparseness Proceedings of the 1st International Workshop on Advances in Conceptual Knowledge Engineering (ACKE 2007) co-located with the 18th International Conference DEXA 2007 2007 IEEE Computer Society Press Resenburg, Germany 504 508
33. T. Hamrouni, S. Ben Yahia, and E. Mephu Nguifo Succinct minimal generators: theoretical foundations and applications International Journal of Foundations of Computer Sciences 19 2 2008 271 296
34. T. Hamrouni, S. Ben Yahia, and E. Mephu Nguifo Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets Data & Knowledge Engineering 68 10 2009 1091 1111
35. T. Hamrouni, S. Ben Yahia, and E. Mephu Nguifo Generalization of association rules through disjunction Annals of Mathematics and Artificial Intelligence 59 2 2010 201 222
36. T. Hamrouni, S. Ben Yahia, Y. Slimani, Avoiding the itemset closure computation "pitfall", in: Proceedings of the 3rd International Conference on Concept Lattices and their Applications (CLA 2005), Olomouc, Czech Republic, 2005, pp. 46-59.
37. T. Hamrouni, S. Ben Yahia, and Y. Slimani Prince: an algorithm for generating rule bases without closure computations Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005) LNCS vol. 3589 2005 Springer-Verlag Copenhagen, Denmark 346 355
38. 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
39. C. Hébert, A. Bretto, and B. Crémilleux A data mining formalization to improve hypergraph minimal transversal computation Fundamenta Informaticae 80 4 2007 1 19
40. Y. Huang, H. Xiong, W. Wu, P. Deng, and Z. Zhang Mining maximal hyperclique pattern: a hybrid search strategy Information Sciences 177 3 2007 703 721
41. R.E. Jamison, and J.L. Pfaltz Closure spaces that are not uniquely generated Discrete Applied Mathematics 147 1 2005 69 79
42. S.O. Kuznetsov On stability of a formal concept Annals of Mathematics and Artificial Intelligence 49 1-4 2007 101 115
43. S.O. Kuznetsov, and S.A. Obiedkov Comparing performance of algorithms for generating concept lattices Journal of Experimental and Theoretical Artificial Intelligence 14 2-3 2002 189 216
44. L. Lhote, F. Rioult, and A. Soulet Average number of frequent (closed) patterns in Bernouilli and Markovian databases Proceedings of the 5th International Conference on Data Mining (ICDM 2005) 2005 IEEE Computer Society Press New Orleans, USA 713 716
45. J. Li On optimal rule discovery IEEE Transactions on Knowledge and Data Engineering 18 4 2006 460 471
46. J. Li, and J. Jones Using multiple and negative target rules to make classifiers more understandable Knowledge Based Systems 19 6 2006 438 444
47. J. Li, G. Liu, and L. Wong Mining statistically important equivalence classes and delta-discriminative emerging patterns Proceedings of the 13th International Conference on Knowledge Discovery and Data Mining (KDD 2007) 2007 ACM Press San Jose, CA, USA 430 439
48. W. Lian, D.W. Cheung, and S.M. Yiu An efficient algorithm for finding dense regions for mining quantitative association rules Computers and Mathematics with Applications 50 2005 471 490
49. 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
50. H. Liu, Y. Lin, and J. Han Methods for mining frequent items in data streams: an overview Knowledge and Information Systems 26 1 2011 1 30
51. H. Liu, X. Wang, J. He, J. Han, D. Xin, and Z. Shao Top-down mining of frequent closed patterns from very high dimensional data Information Sciences 179 7 2009 899 924
52. H. Mannila, and H. Toivonen Levelwise search and borders of theories in knowledge discovery Data Mining and Knowledge Discovery 3 1 1997 241 258
53. G. Mansingh, K.-M. Osei-Bryson, and H. Reichgelt Using ontologies to facilitate post-processing of association rules by domain experts Information Sciences 181 3 2011 419 434
54. E. Mephu Nguifo Galois lattice: a framework for concept learning, design, evaluation and refinement Proceedings of the 6th International Conference on Tools with Artificial Intelligence (ICTAI 1994) 1994 IEEE Computer Society Press New-Orleans, USA 461 467
55. P. Palmerini, S. Orlando, and R. Perego On statistical properties of transactional datasets Proceedings of the 20th Symposium on Applied Computing (SAC 2004) 2004 ACM Press Nicosia, Cyprus 515 519
56. N. Pasquier Frequent closed itemset based condensed representations for association rules Book on Post-Mining of Association Rules: Techniques for Effective Knowledge Extraction 2009 IGI Global Publisher 248 273
57. G. Ramesh, M.J. Zaki, and W. Maniatty Distribution-based synthetic database generation techniques for itemset mining Proceedings of the 9th International Database Engineering and Applications Symposium (IDEAS 2005) 2005 IEEE Computer Society Press Montréal, Canada 307 316
58. A. Salleb-Aouissi, and C. Vrain A contribution to the use of decision diagrams for loading and mining transaction databases Fundamenta Informaticae 78 4 2007 575 594
59. A. Soulet, and B. Crémilleux Adequate condensed representations of patterns Data Mining and Knowledge Discovery 17 1 2008 94 110
60. M. Steinbach, P. Tan, and V. Kumar Support envelopes: a technique for exploring the structure of association patterns Proceedings of the 10th International Conference on Knowledge Discovery and Data Mining (KDD 2004) 2004 ACM Press Seattle, Washington, USA 296 305
61. 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
62. S.K. Tanbeer, C.F. Ahmed, B.-S. Jeong, and Y.-K. Lee Sliding window-based frequent pattern mining over data streams Information Sciences 179 22 2009 3843 3865
63. H. Toivonen, Sampling large databases for association rules, in: Proceedings of the 22th International Conference on Very Large Data Bases (VLDB 1996), Bombay, India, 1996, pp. 134-145.
64. 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
65. 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
66. Z. Xie, and Z. Liu From intent reducts for attribute implications to approximate intent reducts for association rules Proceedings of the 5th International Conference on Computer and Information Technology (CIT 2005) 2005 IEEE Computer Society Press Shanghai, China 162 169
67. H. Yan, K. Chen, L. Liu, and Z. Yi SCALE: a scalable framework for efficiently clustering transactional data Data Mining and Knowledge Discovery 20 1 2010 1 27
68. X. Yan, and J. Han CloseGraph: mining closed frequent graph patterns Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining (KDD 2003) 2003 ACM Press Washington, DC, USA 286 295