Sciweavers

1061 search results - page 135 / 213
» An Experimental Study of Data Migration Algorithms
Sort
View
IS
2008
15 years 3 months ago
Efficient mining of frequent episodes from complex sequences
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
Kuo-Yu Huang, Chia-Hui Chang
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
15 years 2 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
ISSTA
2004
ACM
15 years 9 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
15 years 10 months ago
Stream Sequential Pattern Mining with Precise Error Bounds
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
Luiz F. Mendes, Bolin Ding, Jiawei Han
RECOMB
2009
Springer
16 years 4 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....