Tractable reasoning problems with fully-characterized association rules

The support and confidence of association rules are defined in terms of itemset frequencies. While deciding the satisfiability of a set of itemset frequencies is known to be an NPTIME complete problem when frequencies are specified through rational ranges, this complexity result is too wide. To achi...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Minuto Espil, M.
Formato: SER
Materias:
Complete problems
Complexity results
Item sets
Itemset
Satisfiability
Support and confidence
Tractable reasoning
Algorithms
Information systems
Association rules
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v7503LNCS_n_p282_MinutoEspil
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares