On the public citation graph

https://doi.org/10.2139/ssrn.4782229

0 signed · 33 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.1002/ett.4209openalex-extracted
An evolutionary computation‐based privacy‐preserving data mining model under a multithreshold constraint
inferredcites →https://doi.org/10.1002/wics.1549openalex-extracted
Challenges and opportunities beyond structured data in analysis of electronic health records
inferredcites →https://doi.org/10.1007/s12065-019-00277-8openalex-extracted
A multi-analysis on privacy preservation of association rules using hybridized approach
inferredcites →https://doi.org/10.1007/s12065-021-00576-zopenalex-extracted
GA-PPARM: constraint-based objective function and genetic algorithm for privacy preserved association rule mining
inferredcites →https://doi.org/10.1007/s13369-017-2834-2openalex-extracted
Particle Swarm Intelligence and Impact Factor-Based Privacy Preserving Association Rule Mining for Balancing Data Utility and Knowledge Privacy
inferredcites →https://doi.org/10.1016/j.engappai.2016.03.007openalex-extracted
A sanitization approach for hiding sensitive itemsets based on particle swarm optimization
inferredcites →https://doi.org/10.1016/j.eswa.2019.113097openalex-extracted
Privacy-preserving in association rule mining using an improved discrete binary artificial bee colony
inferredcites →https://doi.org/10.1016/j.future.2020.11.026openalex-extracted
Hiding sensitive information in eHealth datasets
inferredcites →https://doi.org/10.1016/j.jksuci.2022.12.012openalex-extracted
An improved competitive particle swarm optimization algorithm based on de-heterogeneous information
inferredcites →https://doi.org/10.1016/j.jksuci.2023.01.007openalex-extracted
Privacy-preserving association rule mining via multi-key fully homomorphic encryption
inferredcites →https://doi.org/10.1023/b:dami.0000005258.31418.83openalex-extracted
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
inferredcites →https://doi.org/10.1049/cim2.12026openalex-extracted
An integrated method for hiding sensitive association rules of the supply chains
inferredcites →https://doi.org/10.1080/00207543.2014.899721openalex-extracted
A review of discrete-time optimization models for tactical production planning
inferredcites →https://doi.org/10.1080/08839514.2016.1268038openalex-extracted
MOSAR: A Multi-Objective Strategy for Hiding Sensitive Association Rules Using Genetic Algorithm
inferredcites →https://doi.org/10.1109/4235.585892openalex-extracted
Ant colony system: a cooperative learning approach to the traveling salesman problem
inferredcites →https://doi.org/10.1109/69.846291openalex-extracted
Scalable algorithms for association mining
inferredcites →https://doi.org/10.1109/access.2019.2951195openalex-extracted
Particle Swarm Optimization-Based Association Rule Mining in Big Data Environment
inferredcites →https://doi.org/10.1109/access.2022.3158312openalex-extracted
Heap Bucketization Anonymity—An Efficient Privacy-Preserving Data Publishing Model for Multiple Sensitive Attributes
inferredcites →https://doi.org/10.1109/access.2022.3192447openalex-extracted
Privacy Preserving Data Mining Framework for Negative Association Rules: An Application to Healthcare Informatics
inferredcites →https://doi.org/10.1109/access.2024.3362907openalex-extracted
Preserving Privacy in Association Rule Mining Using Metaheuristic-Based Algorithms: A Systematic Literature Review
inferredcites →https://doi.org/10.1109/iadcc.2013.6514417openalex-extracted
Hiding sensitive association rules to maintain privacy and data quality in database
inferredcites →https://doi.org/10.1109/iceeot.2016.7755148openalex-extracted
Advance privacy preserving in association rule mining
inferredcites →https://doi.org/10.1109/icnn.1995.488968openalex-extracted
Particle swarm optimization
inferredcites →https://doi.org/10.1109/icsmc.2004.1400839openalex-extracted
Hiding sensitive items in privacy preserving association rule mining
inferredcites →https://doi.org/10.1109/iri-05.2005.1506477openalex-extracted
Using unknowns for hiding sensitive predictive association rules
inferredcites →https://doi.org/10.1109/kdex.1999.836532openalex-extracted
Disclosure limitation of sensitive rules
inferredcites →https://doi.org/10.1109/ride.2002.995109openalex-extracted
Privacy preserving association rule mining
inferredcites →https://doi.org/10.1109/soli.2008.4686377openalex-extracted
Hiding sensitive association rules efficiently by introducing new variable hiding counter
inferredcites →https://doi.org/10.1142/s0218213014500043openalex-extracted
Comprehensive Survey on Privacy Preserving Association Rule Mining: Models, Approaches, Techniques and Algorithms
inferredcites →https://doi.org/10.1145/170035.170072openalex-extracted
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.1145/170036.170072openalex-extracted
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.26599/bdma.2022.9020007openalex-extracted
An Optimized Sanitization Approach for Minable Data Publication

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-981-96-1525-4_15openalex-snapshot
PrivARM: Privacy-Preserving Association Rule Mining in the Cloud
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.