This article presents 19 practical Sklearn functions—ranging from outlier detection to hyper‑parameter search—that replace manual data‑science steps, each illustrated with concise code examples and performance comparisons.
This tutorial teaches how to perform feature selection using filter, wrapper, and embedded methods and how to construct new features such as interaction, non‑linear, binned, and binary features with Python's pandas and scikit‑learn libraries.
This article introduces eight Python libraries—including Optuna, ITMO_FS, shap‑hypetune, PyCaret, floWeaver, Gradio, Terality, and Torch‑Handle—that streamline data‑science tasks such as hyperparameter optimization, feature selection, model building, visualization, and deployment, helping users save coding time and improve productivity.
This article explains why selecting the right features is essential for machine learning, outlines the general workflow, compares filter, wrapper, and embedded methods, demonstrates statistical tests and Python code examples, and shows how PCA can synthesize features for dimensionality reduction.
The article presents a large‑scale study of SSD failure prediction using SMART logs from multiple vendors, introduces the Wear‑Updated Integrated Feature Ranking (WEFR) method to automatically and robustly select predictive features, and demonstrates its effectiveness through extensive experiments on real‑world data.
This article explains Python machine‑learning basics, covering data splitting, feature and label concepts, key factors for feature selection, and practical tips for building predictive models, while also offering code snippets and visual illustrations to help readers apply these techniques effectively.
Feature Recursive Elimination (RFE) is a powerful feature‑selection technique that iteratively trains a model, discards the weakest features, and repeats until a desired number of features remains, helping prevent overfitting and improve model performance, illustrated with a complete Python example using scikit‑learn.
This article explains why feature selection is crucial for machine learning, outlines the general workflow, compares filter, wrapper, embedded, and synthesis approaches, and provides practical Python examples—including Pearson correlation, chi‑square tests, mutual information, variance selection, recursive elimination, L1 regularization, and PCA—complete with code snippets and visualizations.
This article introduces genetic algorithms, explains their biological inspiration, details each step of the algorithm, demonstrates solving the knapsack problem, and provides a complete Python implementation using the TPOT library for feature selection and regression on the Big Mart Sales dataset.
This guide walks through a comprehensive set of feature‑selection strategies—from removing unused or missing columns to handling multicollinearity, low‑variance features, and using PCA—complete with Python code examples and visualizations to help you build leaner, more interpretable machine‑learning models.
This article introduces several Python libraries—including Optuna, ITMO_FS, shap‑hypertune, PyCaret, floWeaver, Gradio, Terality, and torch‑handle—that simplify hyperparameter tuning, feature selection, model explainability, visualization, and low‑code ML workflows, providing code examples and key advantages for each tool.
This article explains why feature selection is crucial for building robust machine‑learning models and walks through popular filter, wrapper, and embedded methods—including information gain, chi‑square, LASSO, random‑forest importance, and PCA—providing code examples and practical guidance.
This article explains the purpose and types of feature selection, compares supervised and unsupervised, wrapper, filter, and embedded methods, discusses choosing statistical metrics based on variable types, and provides scikit‑learn code examples for regression and classification tasks.
The article explains how high‑dimensional data causes the curse of dimensionality, reduces model performance, and surveys feature‑selection, matrix‑decomposition, manifold‑learning, and auto‑encoder techniques while advising systematic experiments and proper data scaling.
Meituan Search tackles the difficulty of ranking items from diverse business lines by introducing a five‑tower mixed architecture, group‑lasso and feature‑gate selection, a probabilistic graph model, and a joint block‑order/size predictor, achieving notable offline NDCG gains and online CTR and purchase‑rate improvements.
This article reviews the evolution of coarse‑ranking in large‑scale ad systems, explains the two main technical routes—set selection and precise value estimation—introduces the Computing‑Power‑Cost‑Aware Online Lightweight Deep (COLD) pre‑ranking framework, and presents experimental results and future directions for deeper integration with fine‑ranking.
This article describes how Alibaba's search advertising team transformed trillion‑parameter CTR models into lightweight, high‑precision systems by compressing embedding layers through feature‑space reduction, dimension quantization, and multi‑hash techniques, while also introducing graph‑based pre‑training and dropout‑driven feature selection to maintain accuracy.
Alibaba‑Mama’s advertising team shrank multi‑terabyte CTR models to just tens of gigabytes by applying row‑dimension embedding compression, multi‑hash embeddings, graph‑based relationship networks, PCF‑GNN pre‑training, and droprank feature selection, preserving accuracy while halving training time, doubling online QPS, and retiring hundreds of servers.
The authors introduce an interaction‑focused pre‑ranking model combined with a learnable, complexity‑aware feature‑selection technique (FSCD) that selects a compact feature set, enabling Alibaba’s search advertising system to boost offline AUC from 0.695 to 0.737, raise recall to 95 %, improve CTR and RPM, yet retain CPU usage and latency comparable to traditional vector‑dot models.
The article reviews recent Alibaba Mama advances in click‑through‑rate modeling, classifying optimizations across the three‑layer CTR architecture and highlighting three SIGIR papers—GIN’s graph‑based user intent modeling, PCF’s pre‑trained GNN for explicit cross‑feature semantics, and FSCD’s compute‑factor‑guided automatic feature selection—each boosting prediction accuracy and system efficiency.
The article reviews the most important additions in scikit‑learn 0.24, including faster hyper‑parameter search methods, ICE plots, histogram‑based boosting improvements, new feature‑selection tools, polynomial‑feature approximations, a semi‑supervised classifier, MAPE metric, enhanced OneHotEncoder and OrdinalEncoder handling, and a more flexible RFE interface.
This tutorial explains why and how to reduce the number of features in the Kaggle Mushroom Classification dataset with Python, covering preprocessing, various feature‑selection methods (filter, wrapper, embedded), code examples, model training, performance impact, and visualisation of results.
This article provides an extensive overview of feature engineering, covering feature understanding, cleaning, construction, selection, transformation, and dimensionality reduction techniques, illustrated with Python code using the Titanic dataset, and offers practical guidelines for improving data quality and model performance in machine learning projects.
The article introduces COLD, a computing‑power‑aware online and lightweight deep pre‑ranking system for Alibaba's targeted ads, detailing its evolution from static CTR models to vector‑inner‑product models, its flexible network architecture with feature‑selection via SE blocks, engineering optimizations such as parallelism, column‑wise computation, Float16 and MPS, and demonstrates superior offline and online performance through extensive experiments.
This article presents a machine‑learning approach to predict DRAM failures in large‑scale data centers by analyzing server logs, selecting state, log, and static features through statistical tests and mutual information, preprocessing the data, and employing a tree‑based ensemble classifier that outperforms industry baselines.
This article walks through a complete machine‑learning workflow on the UCI Census Income dataset, covering data exploration, preprocessing (including log‑transformation and scaling), model training with Naïve Bayes, Decision Tree and SVM, performance evaluation, hyper‑parameter tuning via grid search, feature importance analysis, and feature selection, providing code snippets and visualizations.
The article answers ten machine‑learning questions, explaining how to impute missing behavior data, extract and select features, describe Meituan‑Dianping’s recommendation pipeline, suggest a beginner learning path, clarify L1 sparsity, recommend TextCNN for text, discuss search‑ranking sample bias, label generation for wide‑deep models, the shift to deep‑learning video detection, and the use of factorization machines for CTR with open‑source examples.
This article presents a curated collection of insightful machine‑learning diagrams that illustrate key concepts such as test versus training error, under‑ and over‑fitting, Occam’s razor, feature interactions, irrelevant features, basis functions, discriminative versus generative models, loss functions, least‑squares geometry, and sparsity.
This article details a step‑by‑step machine‑learning pipeline that transforms over one million calibrated POI records into feature vectors, selects discriminative terms via information‑gain and domain rules, trains a Naive Bayes classifier, and achieves 91% accuracy with 84% coverage on unseen POI data.
