BiFree: An Efficient Biclustering Technique for Gene Expression Data Using Two Layer Free Weighted Bipartite Graph Crossing Minimization
نویسندگان
چکیده
Conventional clustering technique for gene expression data provides a global view of the data. In the biological prospective, a local view is essential for better analysis of gene expression data with simultaneous grouping of genes and conditions. Several biclustering techniques have been proposed in the literature based on different problem formulation. Therefore, it is difficult to compare these techniques with respect to their biological significance, effectiveness and accuracy. In this paper, we have proposed a biclustering technique based on two layer free weighted crossing minimization of a bipartite graph. Using this technique, we can mine different types of biclusters amid noise and it works well in practice for real and synthetic gene expression data. The experimental evaluation reveals the accuracy and effectiveness of this technique with respect to noise handling and execution time in comparison to other biclustering approaches. Keywords— Bipartite Graph, Crossing Minimization, Clustering, Biclustering, Gene Expression Data, Microarray.
منابع مشابه
BiCross : A Biclustering Technique for Gene Expression Data using One Layer Fixed Weighted Bipartite Graph Crossing Minimization
Biclustering has become an important data mining technique for microarray gene expression analysis and profiling, as it provides a local view of the hidden relationships in data, unlike a global view provided by conventional clustering techniques. This technique, in contrast to the conventional clustering techniques, helps in identifying a subset of the genes and a subset of the experimental co...
متن کاملcHawk: An Efficient Biclustering Algorithm based on Bipartite Graph Crossing Minimization
Biclustering is a very useful data mining technique for gene expression analysis and profiling. It helps identify patterns where different genes are co-related based on a subset of conditions. Bipartite Spectral partitioning is a powerful technique to achieve biclustering but its computation complexity is prohibitive for applications dealing with large input data. We provide a connection betwee...
متن کاملSPHier: Scalable Parallel Biclustering Using Weighted Bigraph Crossing Minimization
Biclustering is used for discovering correlations among subsets of attributes with subsets of transactions in a transaction database. It has an extensive set of applications ranging from Gene co-regulation analysis[4], documentkeyword clustering[12] and collaborative filtering for online recommendation systems[13]. In this paper, we propose optimal biclustering problem as maximal crossing numbe...
متن کاملBiRange:An Efficient Framework for Biclustering of Gene Expression Data Using Range Bipartite Graph
Biclustering is a vital data mining tool which is commonly employed on microarray data sets for analysis task in bioinformat ics research and medical applications. There has been extensive research on biclustering of gene expression data arising from microarray experiment. This technique is an important analysis tool in gene expression measurement, when some genes have multip le functions and e...
متن کامل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 collaborative filtering. Due to requirements for high performance in large scale data processing applications such as Collaborative filtering in E-commerce systems and large scale genome-wide gene expression analysis in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011