Sciweavers

136 search results - page 19 / 28
» Finding Approximate Repeating Patterns from Sequence Data
Sort
View
AIA
2007
13 years 9 months ago
A stability index for feature selection
Sequential forward selection (SFS) is one of the most widely used feature selection procedures. It starts with an empty set and adds one feature at each step. The estimate of the ...
Ludmila I. Kuncheva
ICPR
2008
IEEE
14 years 9 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
BMCBI
2007
156views more  BMCBI 2007»
13 years 8 months ago
Accuracy of structure-based sequence alignment of automatic methods
Background: Accurate sequence alignments are essential for homology searches and for building three-dimensional structural models of proteins. Since structure is better conserved ...
Changhoon Kim, Byungkook Lee
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 8 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
ROCAI
2004
Springer
14 years 1 months ago
Learning Mixtures of Localized Rules by Maximizing the Area Under the ROC Curve
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
Tobias Sing, Niko Beerenwinkel, Thomas Lengauer