ArticleCommunications chemistry2024
Automatic feature engineering for catalyst design using small data without prior knowledge of target catalysis.
Article in Communications chemistry, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
7 citing papers in PubMed, 38 citations in OpenAlex.
- Rethinking catalysis: interpretable AI and description of real-world conditionsFaraday discussions · 2026Article
- Electronegativity-Inspired Multidimensional and Complex Representations for Modeling Chemical Environments in Materials.The journal of physical chemistry letters · 2026Article
- Fine-tuning large language models to generate single-atom catalyst synthesis procedures.Communications chemistry · 2026Article
- A machine learning perspective on three decades of methanol synthesis: research framework and experimental operation insights.Communications engineering · 2026Article
- Developing machine learning for heterogeneous catalysis with experimental and computational data.Nature reviews. Chemistry · 2025Review
- Modeling Time-On-Stream Catalyst Reactivity in the Selective Hydrogenation of Concentrated Acetylene Streams under Industrial Conditions via Experiments and AI.ACS catalysis · 2025Article
- Acquiring and transferring comprehensive catalyst knowledge through integrated high-throughput experimentation and automatic feature engineering.Science and technology of advanced materials · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors at 2 institutions in 1 country.
Funding
Abstract
The empirical aspect of descriptor design in catalyst informatics, particularly when confronted with limited data, necessitates adequate prior knowledge for delving into unknown territories, thus presenting a logical contradiction. This study introduces a technique for automatic feature engineering (AFE) that works on small catalyst datasets, without reliance on specific assumptions or pre-existing knowledge about the target catalysis when designing descriptors and building machine-learning models. This technique generates numerous features through mathematical operations on general physicochemical features of catalytic components and extracts relevant features for the desired catalysis, essentially screening numerous hypotheses on a machine. AFE yields reasonable regression results for three types of heterogeneous catalysis: oxidative coupling of methane (OCM), conversion of ethanol to butadiene, and three-way catalysis, where only the training set is swapped. Moreover, through the application of active learning that combines AFE and high-throughput experimentation for OCM, we successfully visualize the machine's process of acquiring precise recognition of the catalyst design. Thus, AFE is a versatile technique for data-driven catalysis research and a key step towards fully automated catalyst discoveries.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.