On the public citation graph

Frequent Itemset Mining on Large-Scale Shared Memory Machines

https://doi.org/10.1109/cluster.2011.69

0 signed · 16 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0895-7177(03)90058-6openalex-snapshot

Trie: An alternative data structure for data mining algorithms

inferredcites →https://doi.org/10.1016/c2009-0-19715-5openalex-snapshot

Data Mining: Practical Machine Learning Tools and Techniques

inferredcites →https://doi.org/10.1109/tkde.2005.18openalex-snapshot

Shared memory parallelization of data mining algorithms: techniques, programming interface, and performance

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-06222-4_6openalex-snapshot

Frequent Itemset Mining

inferred← citeshttps://doi.org/10.1007/978-3-319-25393-0_26openalex-snapshot

Image Tag Completion by Local Learning

inferred← citeshttps://doi.org/10.1007/978-3-319-25393-0_41openalex-snapshot

Representing Data by Sparse Combination of Contextual Data Points for Classification

inferred← citeshttps://doi.org/10.1007/978-81-322-2250-7_58openalex-snapshot

Parallel Implementation of FP Growth Algorithm on XML Data Using Multiple GPU

inferred← citeshttps://doi.org/10.1109/i2ct51068.2021.9418139openalex-snapshot

Hybrid Algorithm on Semantic Web Crawler for Search Engine to Improve Memory Space and Time

inferred← citeshttps://doi.org/10.1109/ipdps.2015.101openalex-snapshot

Association Rule Mining with the Micron Automata Processor

inferred← citeshttps://doi.org/10.1109/smc.2015.329openalex-snapshot

Supervised Cross-Modal Factor Analysis for Multiple Modal Data Classification

inferred← citeshttps://doi.org/10.1117/12.2501692openalex-snapshot

Concurrent frequent itemsets mining in a shared prefix tree using the Apriori algorithm

inferred← citeshttps://doi.org/10.1117/12.2536934openalex-snapshot

Reliable frequent itemsets mining with actor-based Apriori algorithm

inferred← citeshttps://doi.org/10.1145/2457443.2457445openalex-snapshot

An FPGA-Based Accelerator for Frequent Itemset Mining

inferred← citeshttps://doi.org/10.13053/rcs-71-1-2openalex-snapshot

Hardware Acceleration of Frequent Itemsets Mining on Data Streams

inferred← citeshttps://doi.org/10.32628/cseit206247openalex-snapshot

ECLAT Algorithm for Frequent Item Set Generation with Association Rule Mining Algorithm

inferred← citeshttps://doi.org/10.7763/ijcce.2013.v2.178openalex-snapshot

Parallel Binary Approach for Frequent Itemsets Mining

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.