Sciweavers

268 search results - page 40 / 54
» FIND - A unified framework for neural data analysis
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 9 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
BMCBI
2005
89views more  BMCBI 2005»
13 years 8 months ago
An empirical analysis of training protocols for probabilistic gene finders
Background: Generalized hidden Markov models (GHMMs) appear to be approaching acceptance as a de facto standard for state-of-the-art ab initio gene finding, as evidenced by the re...
William H. Majoros, Steven Salzberg
BMCBI
2010
172views more  BMCBI 2010»
13 years 8 months ago
Comparison of evolutionary algorithms in gene regulatory network model inference
Background: The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineeri...
Alina Sîrbu, Heather J. Ruskin, Martin Crane
ICML
2005
IEEE
14 years 9 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore
PAMI
2008
196views more  PAMI 2008»
13 years 8 months ago
Distance Learning for Similarity Estimation
In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance function...
Jie Yu, Jaume Amores, Nicu Sebe, Petia Radeva, Qi ...