|
|
|
|
| LEADER |
00000naa a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250311170418.0 |
| 008 |
230201s2010 xx o 000 0 eng d |
| 024 |
8 |
|
|a DIF-M6544
|b 6683
|z DIF005962
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Minuto Espil, Mauricio
|
| 245 |
1 |
0 |
|a An induction-based compaction of sets of association rules among web concepts
|
| 300 |
|
|
|a 1 archivo (702,3 KB)
|
| 500 |
|
|
|a Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
|
| 520 |
|
|
|a Association rules are nowadays regarded as robust vehicles for creating Web recommendations. We present an induction-based technique for creating a compact representation of sets of association rules, particularly intended for publishing the compact representation in the Web. Our technique efficiently induces a defeasible logic program from a set of association rules, in a manner that the complete set of the given associations can be concluded, when integrating the induced compact program within a defeasible logic reasoning framework.
|
| 534 |
|
|
|a International Conference on Research Challenges in Information Science (4ª : 2010 may. 19-21 : Niza, Francia). IEEE, 2010, pp. 311-318
|
| 650 |
|
4 |
|a REGLAS DE ASOCIACIÓN
|
| 650 |
|
4 |
|a ONTOLOGÍAS
|
| 650 |
|
4 |
|a MINERÍA DE DATOS
|
| 650 |
|
4 |
|a PROGRAMACIÓN LÓGICA
|
| 700 |
1 |
|
|a Ale, Juan María
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/RCIS.2010.5507390
|
| 942 |
|
|
|c CP
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 A0309
|7 3
|8 BD
|9 80913
|a DIF
|b DIF
|d 2025-03-11
|l 0
|o A0309
|r 2025-03-11 17:04:18
|u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=568
|w 2025-03-11
|y CP
|
| 999 |
|
|
|c 55744
|d 55744
|
