Home ›
Entities
› academia
› An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets
An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets
Research article (Information Sciences, 2018) · cited 14× · AI/ML
An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets
Summary
An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets is a scholarly article[1].
Key Facts
An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets's instance of is recorded as scholarly article[2].
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.
APA4ort.xyz Knowledge Graph. (2026). An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-efficient-parallel-row-enumerated-algorithm-for-mining-frequent-colossal-closed-itemsets-from-high-dimensional-datase
MLA“An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-efficient-parallel-row-enumerated-algorithm-for-mining-frequent-colossal-closed-itemsets-from-high-dimensional-datase.
BibTeX@misc{4ortxyz_an-efficient-parallel-row-enumerated-algorithm-for-mining-frequent-colossal-closed-itemsets-from-high-dimensional-datase_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets}}, year = {2026}, url = {https://4ort.xyz/entity/an-efficient-parallel-row-enumerated-algorithm-for-mining-frequent-colossal-closed-itemsets-from-high-dimensional-datase}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets — https://4ort.xyz/entity/an-efficient-parallel-row-enumerated-algorithm-for-mining-frequent-colossal-closed-itemsets-from-high-dimensional-datase (retrieved 2026-05-24)
