Sciweavers

2563 search results - page 254 / 513
» Parallel matrix algorithms and applications
Sort
View
BMCBI
2008
166views more  BMCBI 2008»
15 years 6 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
ICCV
2007
IEEE
16 years 8 months ago
Fast Pixel/Part Selection with Sparse Eigenvectors
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
Bernard Moghaddam, Yair Weiss, Shai Avidan
ICML
2009
IEEE
16 years 7 months ago
Geometry-aware metric learning
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
16 years 1 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
KES
2005
Springer
16 years 4 days ago
Feature Generation by Simple FLD
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
Minoru Fukumi, Yasue Mitsukura