• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

chawk: An efficient biclustering algorithm based on bipartite graph crossing minimization. (2007)

by W Ahmad
Add To MetaCart

Tools

Sorted by:
Results 1 - 5 of 5

Simultaneous clustering: A survey

by Malika Charrad, Mohamed Ben Ahmed - 4th International Conference on Pattern Recognition and Machine Intelligence , 2011
"... Abstract. Although most of the clustering literature focuses on onesided clustering algorithms, simultaneous clustering has recently gained attention as a powerful tool that allows to circumvent some limitations of classical clustering approach. Simultaneous clustering methods perform clustering in ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. Although most of the clustering literature focuses on onesided clustering algorithms, simultaneous clustering has recently gained attention as a powerful tool that allows to circumvent some limitations of classical clustering approach. Simultaneous clustering methods perform clustering in the two dimensions simultaneously. In this paper, we introduce a large number of existing simultaneous clustering approaches applied in bioinformatics as well as in text mining, web mining and information retrieval and classify them in accordance with the methods used to perform the clustering and the target applications.
(Show Context)

Citation Context

... Continuous Spectral [37] Bioinformatique Motif and pattern recognition Continuous IT [13] Text Mining Probabilistic and generative Continuous BSGP [12] Text Mining Bi-partite Graph Categorical cHawk =-=[1]-=- Bioinformatique Bi-partite Graph Continuous [30] Other Probabilistic and generative Categorical Block-EM [16] Other Two-way clustering Continuous binary Block-CEM [16] Other Two-way clustering Contin...

Enhanced Navigation and Focus on TileBars with Barycenter Heuristic-based Reordering

by Vinhtuan Thai, Siegfried Handschuh , 2010
"... The classic TileBars paradigm has been used to show distribution information of query terms in full-text documents. However, when used to show the distribution of a large number of entities of interest to users within a document, it hinders users ’ quick comprehension due to the inherent visual comp ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
The classic TileBars paradigm has been used to show distribution information of query terms in full-text documents. However, when used to show the distribution of a large number of entities of interest to users within a document, it hinders users ’ quick comprehension due to the inherent visual complexity problem. In this paper, we present a novel approach to improve the visual presentation of Tile-Bars, in which barycenter heuristic for bigraph crossing minimization is used to reorder TileBars ’ elements. The reordered TileBars enables users to quickly and easily identify which entities appear in the beginning, end, or throughout a document. A user study has shown that the reordered TileBars can provide users with better focus and navigation while exploring text documents.

A COMPARATIVE STUDY OF CLUSTERING AND BICLUSTERING OF MICROARRAY DATA

by Haifa Ben Saber , Mourad Elloumi
"... ABSTRACT ..."
Abstract - Add to MetaCart
Abstract not found

A NEW SURVEY ON BICLUSTERING OF MICROARRAY DATA

by Haifa Ben Saber, Mourad Elloumi
"... There are subsets of genes that have similar behavior under subsets of conditions, so we say that they coexpress, but behave independently under other subsets of conditions. Discovering such coexpressions can be helpful to uncover genomic knowledge such as gene networks or gene interactions. That is ..."
Abstract - Add to MetaCart
There are subsets of genes that have similar behavior under subsets of conditions, so we say that they coexpress, but behave independently under other subsets of conditions. Discovering such coexpressions can be helpful to uncover genomic knowledge such as gene networks or gene interactions. That is why, it is of utmost importance to make a simultaneous clustering of genes and conditions to identify clusters of genes that are coexpressed under clusters of conditions. This type of clustering is called biclustering. Biclustering is an NP-hard problem. Consequently, heuristic algorithms are typically used to approximate this problem by finding suboptimal solutions. In this paper, we make a new survey on biclustering of gene expression data, also called microarray data.
(Show Context)

Citation Context

...egoricals–sRAP [26] Constant rowsvalues coherentsvaluessOverlapping One a time Continuous –sSAMBAs[17, 22]sCoherentsevolutionsArbitrarilyspositionedsOverlappingsAll at time ContinuoussMDS[36]s–scHawks=-=[37]-=-sConstantsvalues//coherentsEvolutionsOverlapping All at time Categorial –sBBK[33] Constant values – One at timesBinary –sWheresd is the bounded degree of gene vertices in a bipartite graph G whose two...

et Génomique

by De Grenoble, Spécialité Informatique, Syed Fawad Hussain, Directeurs De Thèse, Mirta B. Gordon, Gilles Bisson, M Eric Gaussier (lig, Grenoble Président, M Marco Saerens (iag, M Juan-manuel Torres Moreno (lia, Avignon Examinateur, Mme Mirta B. Gordon (timc, Grenoble Directrice De Thèse, M Gilles Bisson (timc, Grenoble Directeur De Thèse, Syed Fawad Hussain
"... te l-0 ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...-singular sparsessystem of linear equations.sBipartite graph partition based on crossing minimization has also been proposed in the literature (Abdullah andsA. Hussain 2006; Erten and Sozdinler 2009; =-=Ahmad and Khokhar 2007-=-). The basic approach behind these methodssis a fast but approximate biclustering by minimizing the number of edge crossings in a bi-partite graph model. Tosachieve this, several crossing minimization...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University