paper-with-me

홈 › Papers

Verdict Accuracy of Quick Reduct Algorithm using Clustering and Classification Techniques for Gene Expression Data

2013-06-06 · T. Chandrasekhar, K. Thangavel, E. N. Sathishkumar

In most gene expression data, the number of training samples is very small compared to the large number of genes involved in the experiments. However, among the large amount of genes, only a small fraction is effective for performing a certain task. Furthermore, a small subset of genes is desirable in developing gene expression based diagnostic tools for delivering reliable and understandable results. With the gene selection results, the cost of biological experiment and decision can be greatly reduced by analyzing only the marker genes. An important application of gene expression data in functional genomics is to classify samples according to their gene expression profiles. Feature selection (FS) is a process which attempts to select more informative features. It is one of the important steps in knowledge discovery. Conventional supervised FS methods evaluate various feature subsets using an evaluation function or metric to select only those features which are related to the decision classes of the data under consideration. This paper studies a feature selection method based on rough set theory. Further K-Means, Fuzzy C-Means (FCM) algorithm have implemented for the reduced feature set without considering class labels. Then the obtained results are compared with the original class labels. Back Propagation Network (BPN) has also been used for classification. Then the performance of K-Means, FCM, and BPN are analyzed through the confusion matrix. It is found that the BPN is performing well comparatively.

📄 PDF Abstract BibTeX arXiv:1306.1323

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringDiagnosticfeature selectionGeneral Classification

Similar Papers 제목 키워드 기반

A Novel Approach for Single Gene Selection Using Clustering and Dimensionality Reduction

2013-06-10 · E. N. Sathishkumar, K. Thangavel, T. Chandrasekhar

We extend the standard rough set-based approach to deal with huge amounts of numeric attributes versus small amount of available objects. Here, a novel approach of clustering along with dimensionality reduction; Hybrid F…

ClusteringDimensionality Reduction

ExClaim: Explainable Neural Claim Verification Using Rationalization

2023-01-21 · Sai Gurrapu, Lifu Huang, Feras A. Batarseh

With the advent of deep learning, text generation language models have improved dramatically, with text at a similar level as human-written text. This can lead to rampant misinformation because content can now be created…

Claim VerificationDecision MakingExplainable Artificial Intelligence (XAI)Misinformation+1

Short Communication on QUIST: A Quick Clustering Algorithm

2016-06-01 · Sherenaz W. Al-Haj Baddar

In this short communication we introduce the quick clustering algorithm (QUIST), an efficient hierarchical clustering algorithm based on sorting. QUIST is a poly-logarithmic divisive clustering algorithm that does not as…

Clustering

On the Consistency of Quick Shift

2017-10-29 · NeurIPS 2017 12 · Heinrich Jiang

Quick Shift is a popular mode-seeking and clustering algorithm. We present finite sample statistical consistency guarantees for Quick Shift on mode and cluster recovery under mild distributional assumptions. We then appl…

Clusteringregression

Quickshift++: Provably Good Initializations for Sample-Based Mean Shift

2018-05-21 · ICML 2018 7 · Heinrich Jiang, Jennifer Jang, Samory Kpotufe

We provide initial seedings to the Quick Shift clustering algorithm, which approximate the locally high-density regions of the data. Such seedings act as more stable and expressive cluster-cores than the singleton modes …

ClusteringImage SegmentationSemantic Segmentation