JICCSE2006-tutorial proposal

At the crossroads of frequent closed itemset based algorithmsand generic bases of association rules: Actual performances andchallengesProposed by: S. Ben YahiaFaculty of Sciences of TunisDepartment of Computer Science,Campus Universitaire, 1060, Tunis, TunisiaPhone: + 216 98 214 650, Fax: + 216 71 885 190e-mail: sadok.benyahia@fst.rnu.tnDescriptionThe last two decades witnessed an explosive progress in networking, storage, and processingtechnologies resulting in an unprecedented amount of digitization of data. As a side effect,classical retrieval tools proved to be unable to go further beyond the top of the Iceberg. Indeed,there was an important need for tools or techniques to delve and efficiently discover valuable,non-obvious information from large databases. Data Mining, with a clear promise to do so, is thediscoveryofhiddeninformationfoundindatabasesandcanbeviewedasastepintheKnowledgeDiscovery in Databases (KDD) process. Much research in Data Mining has focused on thediscovery of association rules from large databases. As a side effect, exploiting and visualizingassociation rules became far from being a trivial task, mostly because of the huge number ofpotentially interesting rules that can be drawn from a dataset. This fact bootstrapped thedevelopment of more acute techniques or methods to reduce the size of the reported rule sets. Inthis context, the battery of results provided by the Formal Concept Analysis (FCA) permitted ...