Home › Entities › academia › CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates

CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates

Research article (The Journal of Supercomputing, 2022) · cited 11× · AI/ML
academia openalex:W4311887507
Press Enter · cited answer in seconds

CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates

Summary

CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates is a scholarly article[1].

Key Facts

  • CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates'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). CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates. Retrieved May 24, 2026, from https://4ort.xyz/entity/cc-ifim-an-efficient-approach-for-incremental-frequent-itemset-mining-based-on-closed-candidates
MLA “CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/cc-ifim-an-efficient-approach-for-incremental-frequent-itemset-mining-based-on-closed-candidates.
BibTeX @misc{4ortxyz_cc-ifim-an-efficient-approach-for-incremental-frequent-itemset-mining-based-on-closed-candidates_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates}}, year = {2026}, url = {https://4ort.xyz/entity/cc-ifim-an-efficient-approach-for-incremental-frequent-itemset-mining-based-on-closed-candidates}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): CC-IFIM: an efficient approach for incremental frequent itemset mining based on closed candidates — https://4ort.xyz/entity/cc-ifim-an-efficient-approach-for-incremental-frequent-itemset-mining-based-on-closed-candidates (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/cc-ifim-an-efficient-approach-for-incremental-frequent-itemset-mining-based-on-closed-candidates · Last refreshed: