Sciweavers

847 search results - page 43 / 170
» Approximation algorithms for projective clustering
Sort
View
BMCBI
2008
138views more  BMCBI 2008»
15 years 21 days ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 18 days ago
The Haar Wavelet Transform of a Dendrogram
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
Fionn Murtagh
98
Voted
ICPR
2008
IEEE
16 years 1 months ago
Feature selection focused within error clusters
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
Henry S. Baird, Sui-Yu Wang
IV
2005
IEEE
136views Visualization» more  IV 2005»
15 years 6 months ago
Improved Visual Clustering of Large Multi-dimensional Data Sets
Lowering computational cost of data analysis and visualization techniques is an essential step towards including the user in the visualization. In this paper we present an improve...
Eduardo Tejada, Rosane Minghim
125
Voted
CORR
2011
Springer
214views Education» more  CORR 2011»
14 years 4 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price