Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

A simple and efficient algorithm for gene selection using sparse logistic regression.

S K Shevade1, S S Keerthi

  • 1Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India.

Bioinformatics (Oxford, England)
|November 25, 2003
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A fast iterative nearest point algorithm for support vector machine classifier design.

IEEE transactions on neural networks·2008
Same author

Improvements to the SMO algorithm for SVM regression.

IEEE transactions on neural networks·2008
Same author

Efficient tuning of SVM hyperparameters using radius/margin bound and iterative algorithms.

IEEE transactions on neural networks·2008
Same author

A stochastic connectionist approach for global optimization with application to pattern clustering.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2008
Same author

Parallel sequential minimal optimization for the training of support vector machines.

IEEE transactions on neural networks·2006
Same author

SMO algorithm for least-squares SVM formulations.

Neural computation·2003
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

A new, efficient algorithm for sparse logistic regression, based on the Gauss-Seidel method, simplifies implementation for tasks like cancer diagnosis biomarker identification. This method is computationally efficient and easy to apply to real-world problems.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Machine Learning

Background:

  • Sparse logistic regression is crucial for high-dimensional data analysis, particularly in genomics.
  • Existing methods often require complex mathematical programming or matrix operations.
  • There is a need for efficient and easily implementable algorithms for sparse logistic regression.

Purpose of the Study:

  • To introduce a novel, efficient algorithm for sparse logistic regression.
  • To provide a simple and easily implementable solution without complex software or matrix operations.
  • To demonstrate the algorithm's applicability in identifying marker genes and building cancer classifiers.

Main Methods:

  • The proposed algorithm utilizes the Gauss-Seidel iterative method.

Related Experiment Videos

  • It is designed for asymptotic convergence.
  • The implementation avoids sophisticated mathematical programming software and matrix operations.

    • Main Results:

    • The algorithm was successfully applied to gene selection using two real-world datasets.
    • Results obtained were consistent with existing literature findings.
    • The method proved effective for identifying marker genes in cancer diagnosis.

    Conclusions:

    • The developed Gauss-Seidel based algorithm offers an efficient and simple approach to sparse logistic regression.
    • Its ease of implementation makes it suitable for various real-world applications, including cancer microarray data analysis.
    • The algorithm provides a valuable tool for biomarker discovery and classification tasks in bioinformatics.