PulseAugur
实时 22:08:57
实体 decision tree

decision tree

PulseAugur coverage of decision tree — every cluster mentioning decision tree across labs, papers, and developer communities, ranked by signal.

Show in brief
总计 · 30天
12
90 天内 12
发布 · 30天
0
90 天内 0
论文 · 30天
11
90 天内 11
层级分布 · 90 天
关系
情绪 · 30 天

3 天有情绪数据

最近 · 第 1/1 页 · 共 12 条
  1. TOOL · CL_42140 ·

    Ensemble RL models enhance financial trading strategies

    Researchers have developed an ensemble reinforcement learning (RL) approach for financial trading, integrating RL algorithms like A2C, PPO, and SAC with traditional classifiers such as SVM, Decision Trees, and Logistic …

  2. RESEARCH · CL_42123 ·

    New measure rigorously quantifies model complexity

    Researchers have developed a new, mathematically sound, and computationally efficient method for measuring model complexity. This approach, based on analyzing similarities in model gradients across different inputs, is …

  3. TOOL · CL_25767 ·

    New vehicle classifier combines spatial awareness with explainability

    Researchers have developed an enhanced vehicle classification system that incorporates spatial awareness of vehicle parts. This new method builds upon a previous approach by constructing spatial probability maps for eac…

  4. RESEARCH · CL_22060 ·

    Machine learning effectively detects fake news using textual and linguistic features

    This research paper explores the effectiveness of textual and linguistic content features in detecting fake news, particularly during the COVID-19 pandemic. The study utilized traditional machine learning models like Ra…

  5. TOOL · CL_21103 ·

    Guide Explains Tree-Based Models From Decision Trees to Boosting

    This article provides a guide to tree-based models, explaining their effectiveness with tabular data and their evolution from simple decision trees to advanced boosting algorithms like XGBoost, LightGBM, and CatBoost. I…

  6. TOOL · CL_19132 ·

    AI education series covers k-Means, linear regression, and decision trees

    A new session of the KDAI2026 course, focusing on Basic Machine Learning II, was released today. This session covers three fundamental algorithms: k-Means Clustering for unsupervised learning, Linear Regression for find…

  7. RESEARCH · CL_21966 ·

    LLMs get boosting fine-tuning for tabular data and new defenses against adversarial agents

    Researchers have developed BoostLLM, a novel framework that adapts the boosting paradigm, traditionally used for decision trees, to fine-tune large language models (LLMs) for few-shot tabular classification tasks. This …

  8. TOOL · CL_15394 ·

    Anthropic's Claude Code boosts developer workflow; new research explores decision trees and diffusion models

    A user shared their positive experience transitioning their entire coding workflow to Anthropic's Claude Code, finding it highly effective and satisfying. Separately, new research proposes integrating decision trees and…

  9. RESEARCH · CL_15857 ·

    Indonesian sentiment analysis: ML models outperform deep learning on reviews

    Two recent papers benchmark traditional machine learning models against deep learning approaches for sentiment analysis on Indonesian text data. One study on Tokopedia reviews found that a Linear SVC model outperformed …

  10. RESEARCH · CL_10198 ·

    Researchers develop decision trees for explainable POMDP policies

    Researchers have developed a novel method to represent finite-memory policies for Partially Observable Markov Decision Processes (POMDPs) using a combination of decision trees and Mealy machines. This approach aims to m…

  11. RESEARCH · CL_14415 ·

    AI enhances transport security as IoT data traffic explosion looms

    A new research paper explores the use of machine learning models for intrusion detection in intelligent transport systems. The study proposes a federated hybrid intrusion detection framework that utilizes random forests…

  12. RESEARCH · CL_08689 ·

    Research on decision tree approximation withdrawn after submission

    A recently withdrawn arXiv paper proposed a polynomial-time algorithm for approximating the uniform decision tree problem. The algorithm achieved an approximation ratio of less than 11.57, improving upon previous greedy…