Condensed representations for data mining - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2005

Condensed representations for data mining

Résumé

Condensed representations have been proposed in Mannila and Toivonen (1996) as a useful concept for the optimization of typical data-mining tasks. It appears as a key concept within the inductive database framework (Boulicaut et al., 1999; de Raedt, 2002; Imielinski & Mannila, 1996), and this article introduces this research domain, its achievements in the context of frequent itemset mining (FIM) from transactional data, and its future trends.

Dates et versions

hal-01596072 , version 1 (27-09-2017)

Identifiants

Citer

Jean-François Boulicaut. Condensed representations for data mining. J. Wang. Encyclopedia of Data Warehousing and Mining, pp.207-211, 2005, ⟨10.4018/978-1-59140-557-3.ch040⟩. ⟨hal-01596072⟩
48 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More