-
2
-
-
11344262990
-
CPAR: Classification based on predictive association rules
-
San Francisco, CA
-
Xiaoxin Yin, J.H,: CPAR: Classification based on Predictive Association Rules. In: Proceedings of the SDM, San Francisco, CA (2003) 369-376
-
(2003)
Proceedings of the SDM
, pp. 369-376
-
-
Xiaoxin Yin, J.H.1
-
5
-
-
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 Intl. Conference on Very Large Databases, Santiago, Chile. (1994) 478-499
-
(1994)
Proceedings of the 20th Intl. Conference on Very Large Databases
, pp. 478-499
-
-
Agrawal, R.1
Srikant, R.2
-
6
-
-
78149313084
-
CMAR: Accurate and efficient classification based on multiple class-association rules
-
San Jose, CA, IEEE Computer Society
-
Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple class-association rules. In: Proceedings of IEEE International Conference on Data Mining (ICDM'01), San Jose, CA, IEEE Computer Society (2001) 369-376
-
(2001)
Proceedings of IEEE International Conference on Data Mining (ICDM'01)
, pp. 369-376
-
-
Li, W.1
Han, J.2
Pei, J.3
-
11
-
-
32044469123
-
-
Phd thesis, Ecole Doctorale Sciences pour l'Ingénieur de Clermont-Ferrand, Université Blaise Pascal, France
-
Bastide, Y.: Data mining: algorithmes par niveau, techniques d'implantation et applications. Phd thesis, Ecole Doctorale Sciences pour l'Ingénieur de Clermont-Ferrand, Université Blaise Pascal, France (2000)
-
(2000)
Data Mining: Algorithmes Par Niveau, Techniques D'implantation et Applications
-
-
Bastide, Y.1
-
12
-
-
84867817851
-
Mining minimal non-redundant association rules using frequent closed itemsets
-
LNAI, Springer-Verlag, London, UK
-
Bastide, Y., Pasquier, N, Taouil, R., Lakhai, L., Stumme, G.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Proceedings of the International Conference DOOD'2000, LNAI, volume 1861, Springer-Verlag, London, UK. (2000) 972-986
-
(2000)
Proceedings of the International Conference DOOD'2000
, vol.1861
, pp. 972-986
-
-
Bastide, Y.1
Pasquier, N.2
Taouil, R.3
Lakhai, L.4
Stumme, G.5
-
13
-
-
26944441257
-
IQB: A new informative generic base of association rules
-
LNAI 3518, Hanoi, Vietnam, Springier-Verlag
-
Gasmi, G., BenYahia, S., Nguifo, E.M., Slimani, Y.: IQB: A new informative generic base of association rules. In: Proceedings of the Intl. Ninth Pacific-Asia Conference on Knowledge Data Discovery (PAKDD'05), LNAI 3518, Hanoi, Vietnam, Springier-Verlag (2005) 81-90
-
(2005)
Proceedings of the Intl. Ninth Pacific-Asia Conference on Knowledge Data Discovery (PAKDD'05)
, pp. 81-90
-
-
Gasmi, G.1
BenYahia, S.2
Nguifo, E.M.3
Slimani, Y.4
-
15
-
-
0033096890
-
Efficient mining of association rules using closed itemset lattices
-
Pasquier, N., Bastide, Y., Taouil, R., Lakhai, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices, Journal of Information Systems 24 (1999) 25-46
-
(1999)
Journal of Information Systems
, vol.24
, pp. 25-46
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhai, L.4
-
16
-
-
84937678360
-
Concise representations of association rules
-
LNAI, Springer-Verlag, London, UK, (2002)
-
Kryszkiewicz, M.: Concise representations of association rules. In: Proceedings of Exploratory Workshop on Pattern Detection and Discovery in Data Mining (ESF), 2002, LNAI, volume 2447, Springer-Verlag, London, UK, (2002) 92-109
-
(2002)
Proceedings of Exploratory Workshop on Pattern Detection and Discovery in Data Mining (ESF)
, vol.2447
, pp. 92-109
-
-
Kryszkiewicz, M.1
-
17
-
-
84947808231
-
Representative association rules and minimum condition maximum consequence association rules
-
LNCS, Springer-Verlag, Nantes, France, (1998)
-
Kryszkiewicz, M.: Representative association rules and minimum condition maximum consequence association rules, In: Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD), 1998, LNCS, volume 1510, Springer-Verlag, Nantes, France, (1998) 361-369
-
(1998)
Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD)
, vol.1510
, pp. 361-369
-
-
Kryszkiewicz, M.1
-
19
-
-
26844514209
-
PRINCE: An algorithm for generating rule bases without closure computations
-
Tjoa, A.M., Trujillo, J., eds.: Springer-Verlag, LNCS 3589, Copenhagen, Denmark
-
Hamrouni, T., BenYahia, S., Slimani, Y.: PRINCE: An algorithm for generating rule bases without closure computations, In Tjoa, A.M., Trujillo, J., eds.: Proceedings of 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005), Springer-Verlag, LNCS 3589, Copenhagen, Denmark. (2005) 346-355
-
(2005)
Proceedings of 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005)
, pp. 346-355
-
-
Hamrouni, T.1
BenYahia, S.2
Slimani, Y.3
|