检索结果-内蒙古大学图书馆

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2008年第1期7卷 65-79页

作者： Salem, Sameh A. Jack, Lindsay B. Nandi, Asoke K. Univ Liverpool Dept Elect Engn & Elect Signal Proc & Commun Grp Liverpool L69 3GJ Merseyside England

The self-organizing oscillator network (SOON) is a comparatively new clustering algorithm that does not require the knowledge of the number of clusters. The SOON is distance based, and its clustering behavior is different to density-based algorithms in a number of ways. This paper examines the effect of adjusting the control parameters of the SOON with four different datasets;the first is a (communications) modulation dataset representing one modulation scheme under a variety of noise conditions. This allows the assessment of the behavior of the algorithm with data varying between highly separable and nonseparable cases. The main thrust of this paper is to evaluate its efficacy in biological datasets. The second is taken from microarray experiments on the cell cycle of yeast, while the third and the fourth represent two microarray cancer datasets, i.e., the lymphoma and the liver cancer datasets. The paper demonstrates that the SOON is a viable tool to analyze these problems, and can add many useful insights to the biological data that may not always be available using other clustering methods.

关键词： cluster validation data clustering gene expression microarray data unsupervised classification

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Filter/Wrapper Feature Selection Approach Based on Improved Fruit Fly Optimization Algorithm and Chi-square Test for High Dimensional microarray data

引用

CURRENT BIOINFORMATICS 2021年第1期16卷 63-79页

作者： Yan, Chaokun Wu, Bin Ma, Jingjing Zhang, Ge Luo, Junwei Wang, Jianlin Luo, Huimin Henan Univ Sch Comp & Informat Engn Kaifeng Peoples R China China Mobile Online Serv Co Ltd Hong Kong Peoples R China Henan Polytech Univ Coll Comp Sci & Technol Jiaozuo Henan Peoples R China

microarray data is widely utilized for disease analysis and diagnosis. However, it is hard to process them directly and achieve high classification accuracy due to the intrinsic characteristics of high dimensionality and small size samples. As an important data preprocessing technique, feature selection is usually used to reduce the dimensionality of some datasets. Given the limitations of employing filter or wrapper approaches individually for feature selection, in the study, a novel hybrid filter-wrapper approach is proposed for high dimensional datasets. First, the Chi-square Test is utilized to filter out some irrelevant or redundant features. Next, an improved binary Fruit Fly Optimization algorithm is conducted to further search the optimal feature subset without degrading the classification accuracy. Here, the KNN classifier with the 10-fold-CV is utilized to evaluate the classification accuracy. Extensive experimental results on six benchmark biomedical datasets show that our proposed approach can achieve superior performance compared with other state-of-the-art methods.

关键词： Feature selection fruit fly optimization algorithm Chi-square test levy flight gaussian mutation microarray data

来源：评论

学校读者我要写书评

暂无评论

Assessing gene stability and gene affinity in microarray data classification using an extended relieff algorithm

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2023年第15期83卷 45761页

作者： Srivastava, Neha Tayal, Devendra K. Indira Gandhi Delhi Tech Univ Women James ChurchNew Church RdOpp StKashmere Gate New Delhi 110006 Delhi India

microarray data have become an integral part of the clinical and drug discovery process. Due to its voluminous and heterogeneous nature, the question arises of the interpretability and stability of the traditional gene selection method. To enhance the stability of the gene selection method, so that the results are better explicable, an ameliorated Extended ReliefF gene selection algorithm is proposed. It encodes gene affinity information using a new mathematical formula based on Bayes' theorem and Manhattan distance for calculating the nearest neighbor in a pooled sample. It works in four aspects: initializing sample gene weight, improving gene weight, maximizing sample gene weight and finally adopting mutation operation. The proposed method selects the most informative genes which are highly perceptive to the prognosis of the disease. Further, to accomplish the accuracy and stability of the algorithm, soft classification is performed on Relieved_F, STIR, VLS-RelifF, I-RelieF, conventional ReliefF and proposed extended ReliefF algorithms using three classifiers namely Support Vector Machine (SVM), Multilayer Perceptron (MLP) and Random Forest (RF) on ten microarray datasets. According to the findings, MLP training times are much longer than those of RF and SVM. From a network perspective, SVM is much faster at training, whereas MLP excels in terms of accuracy. With a rise in gene similarity among the genes selected from the multiple training sets, the approach becomes more stable. As a result, it can be seen that the recommended gene selection algorithm greatly outperforms the other feature selection methods in terms of accuracy and stability.

关键词： Gene selection Gene affinity information microarray data ReliefF method SVM MLP

来源：评论

学校读者我要写书评

暂无评论

Novel techniques for microarray data analysis: Probabilistic Principal Surfaces and Competitive Evolution on data

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2005年第4期2卷 514-523页

作者： Amato, R Ciaramella, A Del Mondo, C De Vinco, L Donalek, C Longo, G Miele, G Raiconi, G Staiano, A Tagliaferri, R Univ Salerno Dept Math & Informat Fisciano Sa Italy Univ Naples Federico II Dept Phys Sci Naples Italy Univ Naples Federico II Dept Math & Applicat Naples Italy Ist Nazl Fis Nucl Italian Inst Nucl Phys Unit Naples I-80125 Naples Italy INAF Italian Inst Astrophys Naples Italy

microarrays are among the most powerful tools in biological research, but in order to attain its full potentialities, it is imperative to develop techniques capable to effectively exploit the huge quantity of data which they produce. In this paper two machine learning methodologies for microarray data analysis are proposed: (1) Probabilistic Principal Surfaces (PPS), which is a nonlinear latent variable model which offers very appealing visualization and classification abilities and can be effectively employed for clustering purposes. More specifically, the PPS method builds a probability density function of a given data set of patterns, lying in a D-dimensional space (with D >> 3), expressed in terms of a fixed number of latent variables, lying in a Q-dimensional space (Q is usually 2 or 3), which can be used (after a proper manipulation) to visualize, classify and cluster the data;(2) Competitive Evolution on data (CED) is instead an evolutionary system in which the possible solutions (cluster centroids) compete to conquer the largest possible number of resources (data) and thus partition the input data set in clusters. We discuss the application of both methods to the analysis of microarray data obtained for the yeast genome.

关键词： microarray data data mining latent variable models evolutionary algorithms visualization clustering

来源：评论

学校读者我要写书评

暂无评论

MicroCluster: Efficient deterministic biclustering of microarray data

引用

IEEE INTELLIGENT SYSTEMS 2005年第6期20卷 40-+页

作者： Zhao, LZ Zaki, MJ Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA

MicroCluster can mine different types of arbitrarily positioned and overlapping clusters of genetic data to find interesting patterns. Our approach has four key features. First, we mine only the maximal biclusters satisfying certain homogeneity criteria. Second, the clusters can be arbitrarily positioned anywhere in the input data matrix, and they can have arbitrary overlapping regions. Third, MicroCluster uses a flexible definition of a cluster that lets it mine several types of biclusters (which previously were studied independently). Finally, MicroCluster can delete or merge biclusters that have large overlaps. So, it can tolerate some noise in the data set and let users focus on the most important clusters. We\'ve developed a set of metrics to evaluate the clustering quality and have tested MicroCluster\'s effectiveness on several synthetic and real data sets.

关键词： biology computing data mining genetics pattern clustering MicroCluster deterministic biclustering genetic data mining microarray data bicluster bioinformatics clustering gene expression microarrays microarray Genetics Bioinformatics data mining dataset Cluster Analysis biology computing

来源：评论

学校读者我要写书评

暂无评论

Using Generalized Procrustes Analysis (GPA) for normalization of cDNA microarray data

引用

BMC BIOINFORMATICS 2008年第1期9卷 1-13页

作者： Xiong, Huiling Zhang, Dapeng Martyniuk, Christopher J. Trudeau, Vance L. Xia, Xuhua Univ Ottawa Dept Biol CAREG Ottawa ON K1N 6N5 Canada

Background: Normalization is essential in dual-labelled microarray data analysis to remove non-biological variations and systematic biases. Many normalization methods have been used to remove such biases within slides ( Global, Lowess) and across slides ( Scale, Quantile and VSN). However, all these popular approaches have critical assumptions about data distribution, which is often not valid in practice. Results: In this study, we propose a novel assumption-free normalization method based on the Generalized Procrustes Analysis ( GPA) algorithm. Using experimental and simulated normal microarray data and boutique array data, we systemically evaluate the ability of the GPA method in normalization compared with six other popular normalization methods including Global, Lowess, Scale, Quantile, VSN, and one boutique array-specific housekeeping gene method. The assessment of these methods is based on three different empirical criteria: across-slide variability, the Kolmogorov-Smirnov ( K-S) statistic and the mean square error ( MSE). Compared with other methods, the GPA method performs effectively and consistently better in reducing across-slide variability and removing systematic bias. Conclusion: The GPA method is an effective normalization approach for microarray data analysis. In particular, it is free from the statistical and biological assumptions inherent in other normalization methods that are often difficult to validate. Therefore, the GPA method has a major advantage in that it can be applied to diverse types of array sets, especially to the boutique array where the majority of genes may be differentially expressed.

关键词： Mean Square Error microarray data Normalization Method Reference Array Generalize Procrustes Analysis

来源：评论

学校读者我要写书评

暂无评论

Local likelihood regression in generalized linear single-index models with applications to microarray data

引用

COMPUTATIONAL STATISTICS & data ANALYSIS 2006年第3期51卷 2091-2113页

作者： Lambert-Lacroix, Sophie Peyre, Julie IMAG LMC F-38041 Grenoble 9 France

Searching for an effective dimension reduction space is an important problem in regression, especially for high-dimensional data such as microarray data. A major characteristic of microarray data consists in the small number of observations n and a very large number of genes p. This "large p, small n" paradigm makes the discriminant analysis for classification difficult. In order to offset this dimensionality problem a solution consists in reducing the dimension. Supervised classification is understood as a regression problem with a small number of observations and a large number of covariates. A new approach for dimension reduction is proposed. This is based on a semi-parametric approach which uses local likelihood estimates for single-index generalized linear models. The asymptotic properties of this procedure are considered and its asymptotic performances are illustrated by simulations. Applications of this method when applied to binary and multiclass classification of the three real data sets Colon, Leukemia and SRBCT are presented. (c) 2006 Elsevier B.V. All rights reserved.

关键词： dimension reduction generalized linear models generalized linear single-index models local likelihood estimates nonparametric regression microarray data

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm based cancerous gene identification from microarray data using ensemble of filter methods

引用

MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING 2019年第1期57卷 159-176页

作者： Ghosh, Manosij Adhikary, Sukdev Ghosh, Kushal Kanti Sardar, Aritra Begum, Shemim Sarkar, Ram Jadavpur Univ Dept Comp Sci & Engn Kolkata India Govt Coll Engn & Text Technol Dept Comp Sci & Engn Berhampur W Bengal India

microarray datasets play a crucial role in cancer detection. But the high dimension of these datasets makes the classification challenging due to the presence of many irrelevant and redundant features. Hence, feature selection becomes irreplaceable in this field because of its ability to remove the unrequired features from the system. As the task of selecting the optimal number of features is an NP-hard problem, hence, some meta-heuristic search technique helps to cope up with this problem. In this paper, we propose a 2-stage model for feature selection in microarray datasets. The ranking of the genes for the different filter methods are quite diverse and effectiveness of rankings is datasets dependent. First, we develop an ensemble of filter methods by considering the union and intersection of the top-n features of ReliefF, chi-square, and symmetrical uncertainty. This ensemble allows us to combine all the information of the three rankings together in a subset. In the next stage, we use genetic algorithm (GA) on the union and intersection to get the fine-tuned results, and union performs better than the latter. Our model has been shown to be classifier independent through the use of three classifiersmulti-layer perceptron (MLP), support vector machine (SVM), and K-nearest neighbor (K-NN). We have tested our model on five cancer datasetscolon, lung, leukemia, SRBCT, and prostate. Experimental results illustrate the superiority of our model in comparison to state-of-the-art methods.

关键词： Wrapper method Filter method Ensemble microarray data Cancer detection

来源：评论

学校读者我要写书评

暂无评论

A gene selection method for microarray data based on risk genes

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第11期38卷 14065-14071页

作者： Wong, Tzu-Tsung Chen, Ding-Qun Natl Cheng Kung Univ Inst Informat Management Tainan 701 Taiwan

Many gene selection methods have been proposed to select a subset of genes that can have a high prediction accuracy for cancer classification, and most set the same preference for all genes. However, many biological reports have pointed out that mutated or flawed genes, named as risk genes, can be one of the major causes of a specific disease. This study proposes a gene selection method based on the risk genes found in biological reports. The information provided by risk genes can reduce the time complexity for gene selection and increase the accuracy of cancer classification. This gene selection method is composed of two stages. Since all risk genes must be chosen, the first stage is to remove the genes that have similar expression levels or functions to risk genes. The next stage is to perform gene selection and gene replacement based on the results of a process that divides the remaining genes into clusters. Based on the test results from four microarray data sets, our gene selection method outperforms those proposed by previous studies, and genes that have the potential to be new risk genes are presented. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Cancer classification Clustering analysis Gene selection microarray data Risk genes

来源：评论

学校读者我要写书评

暂无评论

Analysis of gene microarray data in a soft computing framework

引用

APPLIED SOFT COMPUTING 2011年第6期11卷 4152-4160页

作者： Maulik, Ujjwal Jadavpur Univ Dept Comp Sci & Engn Kolkata 700032 W Bengal India

In this article, the performance of three major components of soft computing viz., genetic algorithm, simulated annealing and differential evolution have been studied for developing fuzzy clustering of microarray gene expression data. microarray technology permits simultaneous monitoring of the expression levels of a large number of genes over different time points. Clustering is an important unsupervised analysis tool in this domain for finding groups of co-expressed genes. In this regard, the performance of the well-known fuzzy c-means algorithm is also studied in addition to the above mentioned soft computing-based approaches. Subsequently, support vector machine, a well-known technique for supervised learning, is utilized to improve the result of the clustering techniques. For this purpose, a fraction of the data points selected from different clusters based on their proximity to the respective centers, is used for training the support vector machine. The cluster assignments of the remaining points are thereafter determined using the trained classifier. Two publicly available benchmark microarray data sets have been used for demonstrating the effectiveness of the proposed approaches. Biological significance tests have been performed to show that the proposed method is able to produce biologically relevant clusters of co-expressed genes. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Biological significance test Differential evolution Fuzzy clustering Genetic algorithm microarray data Simulated annealing Soft computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：