Sciweavers

374 search results - page 57 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
15 years 3 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni
DKE
2008
124views more  DKE 2008»
14 years 9 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
15 years 2 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 16 days ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
ICIP
2002
IEEE
15 years 11 months ago
A recognition algorithm for Chinese characters in diverse fonts
This paper proposes an algorithm for recognizing Chinese characters in many diverse fonts including Song, Fang, Kai, Hei, Yuan, Lishu, Weibei, and Xingkai. The algorithm is based ...
Xianli Wu, Min Wu