Sciweavers

73 search results - page 4 / 15
» Modified hierarchical clustering for sparse component analys...
Sort
View
BIBM
2008
IEEE
170views Bioinformatics» more  BIBM 2008»
14 years 1 months ago
Protein Sequence Motif Super-Rule-Tree (SRT) Structure Constructed by Hybrid Hierarchical K-Means Clustering Algorithm
— Protein sequence motifs information is crucial to the analysis of biologically significant regions. The conserved regions have the potential to determine the role of the protei...
Bernard Chen, Jieyue He, Stephen Pellicer, Yi Pan
ICTAI
2008
IEEE
14 years 1 months ago
Classifying Spend Descriptions with Off-the-Shelf Learning Components
Analyzing spend transactions is essential to organizations for understanding their global procurement. Central to this analysis is the automated classification of these transacti...
Saikat Mukherjee, Dmitriy Fradkin, Michael Roth
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
14 years 1 months ago
FEMA: A Fast Expectation Maximization Algorithm based on Grid and PCA
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
Zhiwen Yu, Hau-San Wong
BMVC
2010
13 years 5 months ago
Graph-based Analysis of Textured Images for Hierarchical Segmentation
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
Raffaele Gaetano, Giuseppe Scarpa, Tamás Sz...
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Super-sparse principal component analyses for high-throughput genomic data
Background: Principal component analysis (PCA) has gained popularity as a method for the analysis of highdimensional genomic data. However, it is often difficult to interpret the ...
Donghwan Lee, Woojoo Lee, Youngjo Lee, Yudi Pawita...