226 search results - page 32 / 46 » A Practical Algorithm to Find the Best Subsequence Patterns |
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
HCI
2009
13 years 5 months ago
2009
Abstract. We propose a brain-computer interface (BCI) system for evolving images in realtime based on subject feedback derived from electroencephalography (EEG). The goal of this s...
NIPS
2003
13 years 8 months ago
2003
We propose an unsupervised methodology using independent component analysis (ICA) to cluster genes from DNA microarray data. Based on an ICA mixture model of genomic expression pa...
ALMOB
2006
13 years 7 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
BMCBI
2008
13 years 7 months ago
2008
Background: A typical step in the analysis of gene expression data is the determination of clusters of genes that exhibit similar expression patterns. Researchers are confronted w...