Skip to Main content Skip to Navigation
Conference papers

Heuristic for Finding the Tuning Number in Data Mining

Abstract : While faster and faster algorithms have been presented for finding frequent patterns, but, the memory issue is almost always neglected. To study this problem, this paper presents our heuristic that maps the input data set onto a smaller one. The essential idea is to determine the right choice of the tuning number by the reward measure introduced in this work. The tuning number helps us to find the maximal number of repeats in the input data set. Experiments done on several large data sets show the benefit of our method in data mining.
Document type :
Conference papers
Complete list of metadata
Contributor : Sébastien van Luchene Connect in order to contact the contributor
Submitted on : Friday, December 20, 2013 - 4:06:35 PM
Last modification on : Tuesday, December 15, 2020 - 3:03:21 AM


  • HAL Id : hal-00921573, version 1



Abolfazl Fatholahzadeh. Heuristic for Finding the Tuning Number in Data Mining. ICAI'11, Jul 2011, Las Vegas, Nevada, United States. pp.914-917. ⟨hal-00921573⟩



Les métriques sont temporairement indisponibles