Finding Exception for Association Rules Via SQL Queries

dc.contributor.author	Dumitru, Luminiţa
dc.date.accessioned	2015-12-09T14:06:56Z
dc.date.available	2015-12-09T14:06:56Z
dc.date.issued	2000
dc.identifier.issn	1221-454X
dc.identifier.uri	http://10.11.10.50/xmlui/handle/123456789/3710
dc.description	The Annals of "Dunarea de Jos" University of Galati Fascicle III, 2000	en_US
dc.description.abstract	Finding association rules is mainly based on generating larger and larger frequent set candidates, starting from frequent attributes in the database. The frequent sets can be organised as a part of a lattice of concepts according to the Formal Concept Analysis approach. Since the lattice construction is database contents-dependent, the pseudo-intents (see Formal Concept Analysis) are avoided. Association rules between concept intents (closed sets) A=>B are partial implication rules, meaning that there is some data supporting A and (not B); fully explaining the data requires finding exceptions for the association rules. The approach applies to Oracle databases, via SQL queries.	en_US
dc.language.iso	en	en_US
dc.publisher	"Dunarea de Jos" University Galati	en_US
dc.subject	data mining	en_US
dc.subject	association rules	en_US
dc.subject	exceptions	en_US
dc.title	Finding Exception for Association Rules Via SQL Queries	en_US
dc.type	Article	en_US