-
1
-
-
84867817851
-
Mining minimal non-redundant association rules using frequent closed itemsets
-
Proceedings of the 1st International Conference on Computational Logic DOOD, Springer-Verlag, London, UK
-
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Proceedings of the 1st International Conference on Computational Logic (DOOD 2000), Springer-Verlag, LNAI, volume 1861, London, UK. (2000) 972-986
-
(2000)
LNAI
, vol.1861
, pp. 972-986
-
-
Bastide, Y.1
Pasquier, N.2
Taouil, R.3
Stumme, G.4
Lakhal, L.5
-
2
-
-
26844569541
-
-
Nehme, K., Valtchev, P., Hacene, M.R., Godin, R.: On computing the minimal generator family for concept lattices and Icebergs. In Ganter, B., Godin, R., eds.: Proceedings of the 3rd International Conference on Formal Concept Analysis (ICFCA 2005), Springer-Verlag, LNCS, 3403, Lens, France. (2005) 192-207
-
Nehme, K., Valtchev, P., Hacene, M.R., Godin, R.: On computing the minimal generator family for concept lattices and Icebergs. In Ganter, B., Godin, R., eds.: Proceedings of the 3rd International Conference on Formal Concept Analysis (ICFCA 2005), Springer-Verlag, LNCS, volume 3403, Lens, France. (2005) 192-207
-
-
-
-
3
-
-
0006155366
-
Mining frequent patterns with counting inference
-
Boston, Massachusetts, USA
-
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. In: Proceeding of the 6th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, volume 2(2), Boston, Massachusetts, USA. (2000) 66-75
-
(2000)
Proceeding of the 6th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining
, vol.2
, Issue.2
, pp. 66-75
-
-
Bastide, Y.1
Taouil, R.2
Pasquier, N.3
Stumme, G.4
Lakhal, L.5
-
4
-
-
0033096890
-
Efficient mining of association rules using closed itemset lattices
-
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. J. of Information Systems, volume 24 (1) (1999) 25-46
-
(1999)
J. of Information Systems
, vol.24
, Issue.1
, pp. 25-46
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
5
-
-
0036680784
-
Computing iceberg concept lattices with TITANIC
-
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC. J. on Knowledge and Data Engineering (KDE) 2 (2002) 189-222
-
(2002)
J. on Knowledge and Data Engineering (KDE)
, vol.2
, pp. 189-222
-
-
Stumme, G.1
Taouil, R.2
Bastide, Y.3
Pasquier, N.4
Lakhal, L.5
-
6
-
-
26844514209
-
PRINCE: An algorithm for generating rule bases without closure computations
-
Tjoa, A.M, Trujillo, J, eds, Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery DAWAK 2005, Springer-Verlag, Copenhagen, Denmark
-
Hamrouni, T., Ben Yahia, S., Slimani, Y.: PRINCE: An algorithm for generating rule bases without closure computations. In Tjoa, A.M., Trujillo, J., eds.: Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (DAWAK 2005), Springer-Verlag, LNCS, volume 3589, Copenhagen, Denmark. (2005) 346-355
-
(2005)
LNCS
, vol.3589
, pp. 346-355
-
-
Hamrouni, T.1
Ben Yahia, S.2
Slimani, Y.3
-
7
-
-
0001882616
-
Fast algorithms for mining association rules
-
Bocca, J.B, Jarke, M, Zaniolo, C, eds, Santiago, Chile
-
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In Bocca, J.B., Jarke, M., Zaniolo, C., eds.: Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile. (1994) 478-499
-
(1994)
Proceedings of the 20th International Conference on Very Large Databases
, pp. 478-499
-
-
Agrawal, R.1
Srikant, R.2
-
8
-
-
33750743089
-
Minimum description length principle: Generators are preferable to closed patterns
-
Boston, Massachusetts, USA
-
Li, J., Li, H., Wong, L., Pei, J., Dong, G.: 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) 409-414
-
(2006)
Proceedings of the 21st National Conference on Artificial Intelligence (AAAI
, pp. 409-414
-
-
Li, J.1
Li, H.2
Wong, L.3
Pei, J.4
Dong, G.5
-
9
-
-
38049157771
-
Condensed representations for inductive logic programming
-
Dubois, D, Welty, C, eds, Whistler, Canada
-
De Raedt, L., Ramon, J.: Condensed representations for inductive logic programming. In Dubois, D., Welty, C., eds.: Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), Whistler, Canada. (2004) 438-446
-
(2004)
Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR
, pp. 438-446
-
-
De Raedt, L.1
Ramon, J.2
-
10
-
-
33244461081
-
Relative risk and odds ratio: A data mining perspective
-
Baltimore, Maryland, USA
-
Li, H., Li, J., Wong, L., Feng, M., Tan, Y.: 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), Baltimore, Maryland, USA. (2005) 368-377
-
(2005)
Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on Principles Of Database Systems (PODS
, pp. 368-377
-
-
Li, H.1
Li, J.2
Wong, L.3
Feng, M.4
Tan, Y.5
-
11
-
-
33745145777
-
A survey on condensed representations for frequent sets
-
Constraint Based Mining, Springer-Verlag
-
Calders, T., Rigotti, C., Boulicaut, J.F.: A survey on condensed representations for frequent sets. In: Constraint Based Mining, Springer-Verlag, LNAI, volume 3848. (2006) 64-80
-
(2006)
LNAI
, vol.3848
, pp. 64-80
-
-
Calders, T.1
Rigotti, C.2
Boulicaut, J.F.3
-
14
-
-
24644491430
-
Mining succinct systems of minimal generators of formal concepts
-
Proceedings of the 10th International Conference on Database Systems for Advanced Applications DASFAA, Springer-Verlag, Beijing, China
-
Dong, G., Jiang, C., Pei, J., Li, J., Wong, L.: Mining succinct systems of minimal generators of formal concepts. In: Proceedings of the 10th International Conference on Database Systems for Advanced Applications (DASFAA 2005), Springer-Verlag, LNCS, volume 3453, Beijing, China. (2005) 175-187
-
(2005)
LNCS
, vol.3453
, pp. 175-187
-
-
Dong, G.1
Jiang, C.2
Pei, J.3
Li, J.4
Wong, L.5
-
15
-
-
38049090141
-
Succinct system of minimal generators: A thorough study, limitations and new definitions
-
Hammamet, Tunisia
-
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Succinct system of minimal generators: A thorough study, limitations and new definitions. In: Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA 2006), Hammamet, Tunisia. (2006) 139-153
-
(2006)
Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA
, pp. 139-153
-
-
Hamrouni, T.1
Ben Yahia, S.2
Mephu Nguifo, E.3
-
17
-
-
38049052836
-
Redundancy-free generic bases of association rules
-
France
-
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Redundancy-free generic bases of association rules. In: Proceedings of the 8th French Conference on Machine Learning (CAp 2006), Presses Universitaires de Grenoble, Trégastel, France. (2006) 363-378
-
(2006)
Proceedings of the 8th French Conference on Machine Learning (CAp 2006), Presses Universitaires de Grenoble, Trégastel
, pp. 363-378
-
-
Hamrouni, T.1
Ben Yahia, S.2
Mephu Nguifo, E.3
-
18
-
-
26844438133
-
-
Gély, A., Medina, R., Nourine, L., Renaud, Y.: Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases. In Ganter, B., Godin, R., eds.: Proceedings of the 3rd International Conference on Formal Concept Analysis (ICFCA 2005), Springer-Verlag, LNCS, 3403, Lens, France. (2005) 235-248
-
Gély, A., Medina, R., Nourine, L., Renaud, Y.: Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases. In Ganter, B., Godin, R., eds.: Proceedings of the 3rd International Conference on Formal Concept Analysis (ICFCA 2005), Springer-Verlag, LNCS, volume 3403, Lens, France. (2005) 235-248
-
-
-
-
19
-
-
38049042121
-
Generic association rule bases: Are they so succinct?
-
Hammamet, Tunisia
-
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Generic association rule bases: Are they so succinct? In: Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA 2006), Hammamet, Tunisia. (2006) 155-169
-
(2006)
Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA
, pp. 155-169
-
-
Hamrouni, T.1
Ben Yahia, S.2
Mephu Nguifo, E.3
-
20
-
-
0001454571
-
Dependency structures of database relationships
-
Geneva, Switzerland
-
Armstrong, W.W.: Dependency structures of database relationships. In: Proceedings of IFIP Congress, Geneva, Switzerland. (1974) 580-583
-
(1974)
Proceedings of IFIP Congress
, pp. 580-583
-
-
Armstrong, W.W.1
-
21
-
-
0002819235
-
Families minimales d'implications informatives résultant d'un tableau de données binaires
-
Guigues, J.L., Duquenne, V.: Families minimales d'implications informatives résultant d'un tableau de données binaires. Mathématiques et Sciences Humaines. 24 (1986) 5-18
-
(1986)
Mathématiques et Sciences Humaines
, vol.24
, pp. 5-18
-
-
Guigues, J.L.1
Duquenne, V.2
-
23
-
-
84864832875
-
Mining all non-derivable frequent itemsets
-
Elomaa, T, Mannila, H, Toivonen, H, eds, Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases PKDD 2002, Springer-Verlag, Helsinki, Finland
-
Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In Elomaa, T., Mannila, H., Toivonen, H., eds.: Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2002), Springer-Verlag, LNCS, volume 2431, Helsinki, Finland. (2002) 74-85
-
(2002)
LNCS
, vol.2431
, pp. 74-85
-
-
Calders, T.1
Goethals, B.2
|