Home › Entities › academia › An active sparse polynomial chaos expansion approach based on sequential relevance vector machine

An active sparse polynomial chaos expansion approach based on sequential relevance vector machine

Research article (Computer Methods in Applied Mechanics and Engineering, 2023) · cited 10× · AI/ML
academia openalex:W4387962840
Press Enter · cited answer in seconds

An active sparse polynomial chaos expansion approach based on sequential relevance vector machine

Summary

An active sparse polynomial chaos expansion approach based on sequential relevance vector machine is a scholarly article[1].

Key Facts

  • An active sparse polynomial chaos expansion approach based on sequential relevance vector machine's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). An active sparse polynomial chaos expansion approach based on sequential relevance vector machine. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-active-sparse-polynomial-chaos-expansion-approach-based-on-sequential-relevance-vector-machine
MLA “An active sparse polynomial chaos expansion approach based on sequential relevance vector machine.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-active-sparse-polynomial-chaos-expansion-approach-based-on-sequential-relevance-vector-machine.
BibTeX @misc{4ortxyz_an-active-sparse-polynomial-chaos-expansion-approach-based-on-sequential-relevance-vector-machine_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An active sparse polynomial chaos expansion approach based on sequential relevance vector machine}}, year = {2026}, url = {https://4ort.xyz/entity/an-active-sparse-polynomial-chaos-expansion-approach-based-on-sequential-relevance-vector-machine}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An active sparse polynomial chaos expansion approach based on sequential relevance vector machine — https://4ort.xyz/entity/an-active-sparse-polynomial-chaos-expansion-approach-based-on-sequential-relevance-vector-machine (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/an-active-sparse-polynomial-chaos-expansion-approach-based-on-sequential-relevance-vector-machine · Last refreshed: