Sciweavers

3894 search results - page 4 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
14 years 3 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
14 years 7 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
COCOA
2009
Springer
14 years 1 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
CIBB
2008
13 years 11 months ago
Stability and Performances in Biclustering Algorithms
Abstract. Stability is an important property of machine learning algorithms. Stability in clustering may be related to clustering quality or ensemble diversity, and therefore used ...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
IADIS
2008
13 years 11 months ago
Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...
Neelima Gupta, Seema Aggarwal