Jev is a non-generative AI model that returns structured decisions (choices, scores, probabilities) instead of text, enabling high-speed, low-cost classification and routing tasks when problems are decomposed into bounded micro-decisions with confidence thresholds.
The article examines AI’s true strengths and limits by applying five human cognitive perspectives—time, space, structure, classification, and provenance—showing that AI excels at data‑driven tasks like information organization, yet lacks lived temporal and spatial feeling and the deep provenance reasoning that remain uniquely human.
This article walks through eight fundamental data modeling methods—regression, classification, clustering, PCA, factor analysis, association rules, time‑series, and cluster analysis—detailing their typical use cases, core logic, key considerations, and practical tips for effective implementation.
This article dissects Claude Code's memory system, explains why unstructured memory degrades performance, introduces four distinct memory types with concrete examples and schema, shows how to handle expiration and retrieval strategies, and provides step‑by‑step implementation code to improve agent reliability.
This article presents a detailed case study of how a large‑scale API security team built an automated, self‑learning classification system that tags tens of thousands of APIs with business labels, improves model accuracy by five points, and maintains high precision through a confidence‑driven feedback loop.
This article details a real‑world case study of how a large logistics platform created an automated, self‑evolving API asset‑classification pipeline—covering data collection, feature engineering, model training with CatBoost, confidence‑based label feedback, and lessons learned—to improve API security monitoring and reduce manual labeling effort.
Anthropic’s new Auto Mode for Claude Code inserts a middle ground between manual approvals and unrestricted execution by letting the model approve low‑risk actions while blocking potentially dangerous ones, using a two‑stage classifier that evaluates intent and real‑world impact with concrete safety metrics.
The article analyzes Claude Code’s new automatic permission mode, detailing its three operation options, two‑layer classifier architecture, threat model, decision flow, rule customization, evaluation results, design trade‑offs, and future plans for improving AI‑driven security.
This article explains what loss functions are, outlines their three essential components, categorizes them for regression, classification, and generation tasks, reviews five classic loss functions with their noise resistance and gradient traits, and offers practical guidelines for selecting the right loss for AI models.
This comprehensive guide explores Support Vector Machines—from their historical roots and core mathematical principles to practical Python implementations, visualization techniques, and diverse applications such as image recognition, text classification, bioinformatics, and financial risk assessment—while also weighing their strengths and limitations.
This article provides a comprehensive guide to the K‑Nearest Neighbors algorithm, covering its intuitive principle, step‑by‑step workflow, distance metrics, strategies for selecting the optimal K via cross‑validation, Python implementation with scikit‑learn, advantages, limitations, and diverse application scenarios.
This article provides a comprehensive guide to decision tree algorithms, covering their theoretical foundations, key components, construction workflow—including data preprocessing, feature selection, tree growth, stopping criteria, and pruning—followed by an overview of popular variants like ID3, C4.5, CART, practical advantages, applications, and a complete Python implementation using scikit-learn.
This comprehensive guide explains logistic regression fundamentals, the role of the Sigmoid function, loss and optimization methods, step‑by‑step Python implementation with data preparation, model training, evaluation, hyper‑parameter tuning, handling over‑ and under‑fitting, multi‑class extensions, and diverse application scenarios across medicine, finance, e‑commerce, and text analysis.
This article provides a clear, illustrated overview of machine learning, explaining its place within artificial intelligence, the main sub‑fields such as supervised and unsupervised learning, classic algorithms, ensemble methods, and practical examples to help beginners grasp core concepts.
This article explains how loss functions evaluate model performance, contrasts regression’s mean squared error with classification’s cross‑entropy, describes one‑hot encoding and softmax outputs, and shows why higher predicted probabilities for the correct class yield lower loss, highlighting applications in image, language, and speech tasks.
This article presents a comprehensive case study that explains classification principles, shows the key formulas for logistic regression and SVM, and provides a full Python implementation that generates synthetic data, trains multiple classifiers, calibrates them, and visualizes calibration curves and probability histograms.
This article explains logistic regression as a classification algorithm, covering its definition, purpose, mathematical structure, data preparation, core functions such as sigmoid, cost, gradient descent, prediction, model evaluation, decision boundary visualization, feature mapping, and regularization techniques, all illustrated with Python code examples.
This beginner-friendly guide walks through loading the classic Iris dataset, performing exploratory data analysis, and implementing four fundamental classifiers—Decision Tree, Logistic Regression, Support Vector Machine, and K‑Nearest Neighbors—complete with training, visualization, and accuracy evaluation, illustrating a full machine‑learning workflow.
This article introduces ten widely used machine learning algorithms for data prediction, explains their core concepts, and provides complete Python code snippets using scikit‑learn and related libraries to help readers implement regression, classification, and time‑series forecasting tasks.
This article reviews common classification evaluation metrics—accuracy, precision, recall, and F1—explains their limitations on imbalanced data, and introduces the Matthews Correlation Coefficient (MCC) with Python implementations to provide a more reliable performance measure.
This tutorial demonstrates how to download the Fashion‑MNIST dataset, build a four‑layer fully connected neural network with PyTorch, and train it using loss functions, Adam optimizer, learning‑rate strategies, and Dropout to achieve high‑accuracy multi‑class image classification.
This article explains ten widely used loss functions for regression and classification tasks, describes their mathematical definitions, compares their purposes, and provides complete Python code examples for each, helping readers understand how to select and implement appropriate loss metrics in machine‑learning models.
This tutorial demonstrates how to load the wine dataset, train a Random Forest classifier, evaluate its accuracy and confusion matrix, and visualize decision boundaries and misclassifications using scikit‑learn and the dtreeviz library.
This tutorial explains how to prepare advertising click data, train a decision‑tree classifier, and generate clear visualizations using scikit‑learn and dtreeviz, while also showing how to inspect individual prediction paths and feature importance.
This article details a data‑mining project that uses historical World Cup match data, extensive feature engineering, and various machine‑learning algorithms—including neural networks, logistic regression, SVM, decision trees, and random forests—to predict the champion of the 2022 tournament, while analyzing model errors and proposing improvements.
The T‑LEAF framework introduces quantitative metrics for coverage, usefulness, and consistency to iteratively develop Airbnb’s unified Contact‑Reason taxonomy, enabling faster feedback loops, reducing “Other” classifications, and improving both human annotation agreement and machine‑learning prediction accuracy in production.
This article provides a comprehensive overview of the AdaBoost algorithm, explaining its boosting principles, how it computes error rates, determines weak learner weights, updates sample weights, and combines classifiers for both classification and regression tasks, while also covering loss‑function optimization, regularization, and practical advantages and drawbacks.
This article introduces LightGBM, a high‑performance gradient boosting framework, explains its advantages over XGBoost, and provides step‑by‑step Python code for building classification and regression models on the Iris dataset, including model training, evaluation, and visualizing feature importance and tree structures.
This article explains the core concepts of XGBoost as a boosting tree algorithm, describes how it builds ensembles of decision trees to predict outcomes, and provides complete Python implementations for classification and regression using the Scikit-learn interface, along with visualizations of trees and feature importance.
Support Vector Machines (SVM), introduced in 1992, are powerful data‑mining methods based on statistical learning theory that excel at handling small‑sample, nonlinear, and high‑dimensional regression and classification tasks, with distinct formulations for classification (SVC) and regression (SVR).
This article explains machine learning fundamentals using a house‑location classification example, illustrating how decision trees create split points from features like elevation and price, grow recursively, achieve high training accuracy, and reveal overfitting when evaluated on unseen test data.
This article explains how to evaluate classification models by moving beyond simple accuracy to using confusion matrices, precision, recall, and the F1 score, illustrating their trade‑offs and when each metric is most appropriate for different real‑world scenarios.
This article explains the fundamentals of Support Vector Machines, describes how they separate data with optimal hyperplanes, provides a 2‑D example with visualizations, and includes Python code using scikit‑learn to generate synthetic data, plot points, and illustrate possible decision boundaries.
The article explains classification as a data‑analysis task that builds models to assign new observations to predefined categories, outlines its implementation steps, describes various data types (boolean, nominal, ordinal, continuous, discrete), presents common machine‑learning classifiers such as decision trees and neural networks, and highlights practical applications like crime detection, disease risk prediction, and credit assessment.
This article explains the fundamentals of supervised machine learning, distinguishing between regression and classification, describing how algorithms learn mappings from inputs to outputs, and outlining common models such as linear regression, logistic regression, decision trees, SVMs, random forests, and neural networks.
This article explains the fundamentals of decision tree learning, describing its recursive construction, the criteria for splitting nodes using information gain based on entropy, and walks through a classic watermelon dataset example to illustrate how attributes are selected and the final tree is built.
This article introduces a practical, step‑by‑step tutorial on building machine learning models with scikit‑learn, covering problem types, dataset loading, splitting, and a series of reusable templates (V1.0, V2.0, V3.0) for classification, regression, clustering, cross‑validation, and hyper‑parameter tuning, complete with code examples.
This article explains why data mining matters, defines the discipline, outlines its five‑step workflow, and dives into core techniques such as association‑rule mining, classification, clustering, and regression, illustrated with practical examples and visual diagrams.
This article explains the methodology behind tag systems, defines their purpose and structure, introduces three key dimensions for constructing a tag framework, outlines the tag lifecycle and attributes, and provides a practical design template for implementation.
This article explains the SMOTE oversampling method for imbalanced classification, demonstrates how to generate synthetic minority samples, evaluates models with and without SMOTE using scikit‑learn pipelines, and explores advanced variants such as Borderline‑SMOTE, SVMSMOTE and ADASYN with concrete code examples and benchmark results.
This article introduces the ten classic data‑mining algorithms selected by IEEE ICDM—C4.5, k‑Means, SVM, Apriori, EM, PageRank, AdaBoost, k‑NN, Naive Bayes, and CART—explaining their main ideas, advantages, and typical applications for readers seeking a solid foundation in data analysis.
This notebook provides ready‑to‑use Python code templates for ten common machine‑learning algorithms—including linear regression, logistic regression, decision trees, Naïve Bayes, SVM, K‑Nearest Neighbors, K‑Means, Random Forest, PCA, and Gradient Boosting—showing how to import, train, evaluate, and predict with scikit‑learn.
iQIYI built an in‑house user‑feedback analysis system that automatically ingests multi‑channel data, classifies and clusters issues, assesses feedback quality, localizes problems, and streamlines repair closure, boosting recall accuracy, alarm precision, closure rates and reducing cycle time across business lines to enhance user experience.
This article explains the Bayesian theorem, introduces the Bayesian classifier, and details three Naive Bayes algorithms—Gaussian, Multinomial, and Bernoulli—along with their Scikit-learn implementations, key parameters, attributes, methods, and typical text‑classification applications for spam filtering.
This article explains how classification thinking—organizing software into modules, components, and packages—forms the foundation of application architecture, illustrates the COLA framework’s evolution, and shows how proper layering and domain‑oriented packaging improve maintainability and scalability.
This article presents a hand‑drawn, illustrated walkthrough of the entire machine‑learning pipeline—from dataset definition, exploratory data analysis, preprocessing, and data splitting to model building, algorithm selection, hyper‑parameter tuning, feature selection, and evaluation for both classification and regression tasks.
This article explains the fundamentals of ensemble learning and bagging, details the random forest algorithm, answers common questions, and provides a complete Python walkthrough—including data exploration, decision‑tree baseline, random‑forest modeling with grid‑search tuning, and practical insights for handling imbalanced and missing data.
The article explains why data security governance is essential for rapidly growing businesses, outlines technical goals across the data lifecycle, describes data classification and labeling methods, and details approval processes, network security zones, and management controls to protect data throughout its lifecycle.
This article introduces the concept and intuition behind the k-Nearest Neighbor (kNN) classification algorithm, explains its simple and full forms, discusses feature engineering and Euclidean distance calculations, and provides a complete Python implementation with example code.
This article describes how Gaode Map leverages machine‑learning techniques—such as word2vec embeddings, LSTM networks, fine‑tuning, and confidence‑threshold ensembles—to automatically classify and verify massive user‑feedback intelligence, streamlining the multi‑step workflow from data collection to road‑map updates and dramatically improving efficiency.
This article explains the k‑Nearest Neighbors classification method, discusses its advantages and drawbacks, describes data preparation and normalization, presents Python code for the algorithm and a full handwritten digit recognition project, and reports an error rate of about 1.2%.
This article introduces Zhang Jianfei’s golden three‑step problem‑solving framework—define, decompose, and classify—illustrates its application in everyday chores, work reporting, code development, and system design, and connects it to taxonomy, the MECE principle, and common thinking models to boost structured thinking.
This article presents a case study on building and deploying a lead‑quality classification model for a high‑value, low‑frequency real‑estate platform, covering business context, data challenges, sampling strategies, feature engineering, model selection, tuning, evaluation metrics, interpretability analysis, and observed performance improvements.
This article explains how Beike, China’s largest residential service platform, leverages its massive house, client, and text data to design a multi‑layered tag architecture, detailing data sources, tag construction methods—including classification, keyword, geographic, anonymous topic, and temporal tags—and their application to improve personalized house search and recommendation.
This article provides a detailed, English-language summary of key statistical learning concepts—including perceptron, k‑nearest neighbors, Naive Bayes, decision trees, logistic regression, support vector machines, boosting, EM, HMM, neural networks, K‑Means, bagging, Apriori and dimensionality reduction—complete with formulas, algorithm steps, and illustrative diagrams to aid interview preparation.
This article provides a comprehensive introduction to the Random Forest algorithm, covering its theoretical background, scikit-learn implementation details, practical coding example with the Iris dataset, and a discussion of its advantages, limitations, and typical use cases in machine learning.
This article introduces the Naive Bayes classification algorithm, explains its theoretical basis, demonstrates how to use scikit-learn's GaussianNB class with Python code, evaluates model performance, and discusses advantages, limitations, and practical examples of the method.
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 outlines the scope, terminology, classification levels, site selection principles, equipment layout, and subsystem requirements—including lighting, grounding, lightning protection, HVAC, monitoring, and cabling—for building and operating data center facilities in accordance with industry standards.
This article provides a comprehensive guide to decision tree algorithms, covering their theoretical background, classic use‑cases, scikit‑learn's DecisionTreeClassifier parameters, step‑by‑step Python examples for training, visualizing, and exporting trees, as well as a comparison of ID3, C4.5, and CART methods with their advantages and limitations.
The article mathematically demystifies neural networks by first illustrating a linear predictor for kilometre‑to‑mile conversion and a basic bug classifier, then exposing the limits of single linear boundaries (e.g., XOR), before introducing artificial neurons, activation functions, and multi‑layer weight‑adjustment training.
This article introduces logistic regression, explains its theoretical basis, details key scikit-learn parameters, and provides a complete Python example for breast cancer classification, covering data preprocessing, model training, prediction, and evaluation with classification reports.
This article introduces the most commonly used algorithms in engineering—recommendation, optimization, estimation, and classification—describes their typical application scenarios, and explores various testing methods and evaluation metrics such as offline experiments, user surveys, A/B testing, and performance indicators like accuracy, coverage, and robustness.
An in‑depth, visual guide walks readers through the fundamentals of machine learning—distinguishing supervised from unsupervised approaches, explaining dimensionality reduction with PCA, detailing clustering techniques such as hierarchical clustering, K‑Means and DBSCAN, and summarizing core regression and classification algorithms including linear regression, SVM, decision trees, logistic regression, Naïve Bayes, and KNN.
The author reflects on six months of learning machine learning, explains that the core techniques are simple while real difficulty lies in applying them to specific problems, and shows how scikit‑learn can quickly address classification, regression, clustering, and dimensionality‑reduction tasks before discussing the need for deeper model and hyper‑parameter tuning.
This article provides a concise overview of fifteen widely used machine learning models—including decision trees, random forests, k‑means, KNN, EM, linear and logistic regression, Naive Bayes, Apriori, Boosting, GBDT, SVM, neural networks, HMM, and CRF—detailing their features, strengths, weaknesses, and typical application scenarios.
The article uses a simple food‑taste classification scenario to illustrate core machine‑learning concepts such as labeled training data, feature representation, linear scoring models, decision boundaries, over‑fitting, generalisation, and decision‑tree reasoning in a way a child can understand.
This article introduces classification and decision‑tree algorithms, explains the Iris dataset, and provides step‑by‑step Python code using scikit‑learn to build, train, evaluate, and visualize decision‑tree models, including optimizations and practical tips for accurate predictions.
This article provides a comprehensive introduction to data mining, covering its definition, goal setting, data sampling, exploration, preprocessing, pattern discovery, model building, evaluation methods, and the main analytical techniques such as classification, regression, clustering, association rules, feature and deviation analysis, and web mining.
This article explains how recommendation systems can use item‑level features instead of user ratings, illustrating the approach with Pandora's music‑gene project, detailing feature selection, scoring, distance calculations, standardization, and classification techniques across music, athlete, Iris, and automobile datasets.
Classifying teaching environments helps simplify complex educational contexts, identify key variables, and build models—whether statistical, numerical, or mechanistic—to understand how factors like classroom dynamics, teacher‑student relationships, and colleague interactions influence a novice teacher’s development.
This article introduces the main types of data‑mining algorithms—classification, prediction, clustering, and association—explains supervised and unsupervised learning, and illustrates each with practical examples such as spam detection, tumor cell identification, wine quality assessment, fraud detection, recommendation systems, and more.
This article introduces the main types of data‑mining algorithms—classification, prediction, clustering, and association—explains supervised and unsupervised learning, and illustrates each with practical examples such as spam detection, tumor identification, wine quality assessment, fraud detection, recommendation systems, and authorship analysis.
This article walks through designing and implementing a full‑stack recommendation system for 58转转, covering product frameworks, user and item profiling, RFM modeling, personalized tagging, classification‑based and collaborative‑filtering approaches, and practical deployment tips.
After completing three years of university mathematics courses, the author visualises and explains a personal classification of major mathematical branches, discussing their relationships, cross‑disciplinary links, and reflections on ancient Chinese mathematics and future educational considerations.
This article explains how support vector machines work, how to handle non‑linear and multi‑class problems, and provides a complete R implementation using the e1071 package, including linear and radial kernels, model evaluation, parameter tuning, and visualisation with grid plots.
