Sciweavers

17760 search results - page 1 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
13 years 6 months ago
A Generalization of the Massey-Ding Algorithm
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
Joachim Althaler, Arne Dür
JCST
2008
119views more  JCST 2008»
13 years 7 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
13 years 12 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
ILP
2004
Springer
14 years 9 days ago
Generalization Algorithms for Second-Order Terms
In this paper, we study the generalization algorithms for second-order terms, which are treated as first-order terms with function variables, under an instantiation order denoted ...
Kouichi Hirata, Takeshi Ogawa, Masateru Harao