1057 search results - page 68 / 212 » Theoretical and Experimental DNA Computation |
189
click to vote
DIS
2006
Springer
15 years 10 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
152
click to vote
DIS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
187
click to vote
ACMSE
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
147
click to vote
ERSHOV
2006
Springer
15 years 8 months ago
2006
Springer
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initi...
170
click to vote
DIS
2008
Springer
15 years 8 months ago
2008
Springer
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...