Sciweavers

661 search results - page 93 / 133
» Generalized clustering, supervised learning, and data assign...
Sort
View
JMLR
2011
167views more  JMLR 2011»
13 years 3 months ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 29 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
ICA
2012
Springer
12 years 4 months ago
Online PLCA for Real-Time Semi-supervised Source Separation
Non-negative spectrogram factorization algorithms such as probabilistic latent component analysis (PLCA) have been shown to be quite powerful for source separation. When training d...
Zhiyao Duan, Gautham J. Mysore, Paris Smaragdis
BIBE
2005
IEEE
115views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
GOMIT: A Generic and Adaptive Annotation Algorithm Based on Gene Ontology Term Distributions
We address the issue of providing highly informative annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a set of candidate ...
In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 8 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin