MIHT: A Hoeffding Tree for Time Series Classification using Multiple Instance Learning
MIHT: A Hoeffding Tree for Time Series Classification using Multiple Instance Learning explores A novel, interpretable algorithm for classifying complex time series data that significantly outperforms existing state-of-the-art models.. Commercial viability score: 7/10 in Time Series Classification.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Builds On ThisOn Imbalanced Regression with Hoeffding TreesViability: 5.0
- Builds On ThisMM-ISTS: Cooperating Irregularly Sampled Time Series Forecasting with Multimodal Vision-Text LLMsViability: 2.0
- Builds On ThisMoHETS: Long-term Time Series Forecasting with Mixture-of-Heterogeneous-ExpertsViability: 5.0
- Builds On ThisFrom Consistency to Complementarity: Aligned and Disentangled Multi-modal Learning for Time Series Understanding and ReasoningViability: 5.0
- Builds On ThisWhat-If Explanations Over Time: Counterfactuals for Time Series Classification