On the public citation graph

Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases

https://doi.org/10.1007/pl00011672
0 signed · 43 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.1007/3-540-48912-6_10openalex-snapshot
An Efficient Approach for Incremental Association Rule Mining
inferredcites →https://doi.org/10.1007/3-540-48912-6_55openalex-snapshot
Efficient Graph-Based Algorithm for Discovering and Maintaining Knowledge in Large Databases
inferredcites →https://doi.org/10.1007/3-540-58495-1_17openalex-snapshot
Knowledge discovery in databases: A rule-based attribute-oriented approach
inferredcites →https://doi.org/10.1007/bf00125369openalex-snapshot
The analysis of relationships in databases for rule derivation
inferredcites →https://doi.org/10.1007/bfb0014140openalex-snapshot
Mining sequential patterns: Generalizations and performance improvements
inferredcites →https://doi.org/10.1016/s0167-739x(97)00019-8openalex-snapshot
Mining generalized association rules
inferredcites →https://doi.org/10.1109/69.204089openalex-snapshot
Data-driven discovery of quantitative rules in relational databases
inferredcites →https://doi.org/10.1109/69.250074openalex-snapshot
Database mining: a performance perspective
inferredcites →https://doi.org/10.1109/icde.1992.213146openalex-snapshot
Knowledge mining by imprecise querying: a classification-based approach
inferredcites →https://doi.org/10.1109/icde.1995.380413openalex-snapshot
Set-oriented mining for association rules in relational databases
inferredcites →https://doi.org/10.1109/icde.1995.380415openalex-snapshot
Mining sequential patterns
inferredcites →https://doi.org/10.1109/icde.1996.492094openalex-snapshot
Maintenance of discovered association rules in large databases: an incremental updating technique
inferredcites →https://doi.org/10.1109/pdis.1996.568663openalex-snapshot
An efficient approach to discovering knowledge from large databases
inferredcites →https://doi.org/10.1142/9789812819536_0020openalex-snapshot
A General Incremental Technique for Maintaining Discovered Association Rules
inferredcites →https://doi.org/10.1145/170035.170072openalex-snapshot
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.1145/191246.191314openalex-snapshot
Finding interesting rules from large sets of discovered association rules
inferredcites →https://doi.org/10.1145/191839.191863openalex-snapshot
Combinatorial pattern discovery for scientific data
inferredcites →https://doi.org/10.1145/223784.223813openalex-snapshot
An effective hash-based algorithm for mining association rules
inferredcites →https://doi.org/10.1145/233269.233311openalex-snapshot
Mining quantitative association rules in large relational tables
inferredcites →https://doi.org/10.1145/253260.253325openalex-snapshot
Dynamic itemset counting and implication rules for market basket data
inferredcites →https://doi.org/10.1145/274535.274537openalex-snapshot
Performance-driven soft-macro clustering and placement by preserving HDL design hierarchy
inferredcites →https://doi.org/10.1145/288627.288667openalex-snapshot
Using incremental pruning to increase the efficiency of dynamic itemset counting for mining association rules

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-32390-2_16openalex-snapshot
The Incremental Method for Discovery of Association Rules
inferred← citeshttps://doi.org/10.1007/3-540-36175-8_21openalex-snapshot
Mining Frequent Instances on Workflows
inferred← citeshttps://doi.org/10.1007/978-3-540-30133-2_154openalex-snapshot
Multi-agent Web Recommendation Method Based on Indirect Association Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-39964-3_48openalex-snapshot
Mining Association Rules from Relational Data – Average Distance Based Method
inferred← citeshttps://doi.org/10.1007/s10115-008-0178-7openalex-snapshot
Hiding sensitive knowledge without side effects
inferred← citeshttps://doi.org/10.1007/s10115-009-0223-1openalex-snapshot
Mining fuzzy association rules from uncertain data
inferred← citeshttps://doi.org/10.1016/j.ins.2009.08.022openalex-snapshot
RMAIN: Association rules maintenance without reruns through data
inferred← citeshttps://doi.org/10.1016/j.is.2006.04.002openalex-snapshot
Mining association rules in very large clustered domains
inferred← citeshttps://doi.org/10.1016/s0306-4379(03)00031-0openalex-snapshot
A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications
inferred← citeshttps://doi.org/10.1109/comswa.2008.4554520openalex-snapshot
A dynamic mining algorithm of association rules for alarm correlation in communication networks
inferred← citeshttps://doi.org/10.1109/icics.2007.4449696openalex-snapshot
Incremental association rule mining using promising frequent itemset algorithm
inferred← citeshttps://doi.org/10.1109/icsmc.2003.1244242openalex-snapshot
Maintenance of discovered informative rule sets: incremental insertion
inferred← citeshttps://doi.org/10.1109/icsmc.2005.1571140openalex-snapshot
Maintenance of Discovered Informative Rule Sets: Incremental Deletion
inferred← citeshttps://doi.org/10.1109/tkde.2003.1185839openalex-snapshot
Synthesizing high-frequency rules from different data sources
inferred← citeshttps://doi.org/10.1109/wkdd.2008.32openalex-snapshot
A Novel Algorithm for Dynamic Mining of Association Rules
inferred← citeshttps://doi.org/10.2478/s13537-011-0005-1openalex-snapshot
XML document-grammar comparison: related problems and applications
inferred← citeshttps://doi.org/10.2478/v10006-009-0015-5openalex-snapshot
Mining Indirect Association Rules for Web Recommendation
inferred← citeshttps://doi.org/10.3233/ida-2007-11305openalex-snapshot
Maintenance of informative ruler sets for predictions1
inferred← citeshttps://doi.org/10.4018/978-1-60960-497-4.ch018openalex-snapshot
Enhancing Service Quality in Hospitals
inferred← citeshttps://doi.org/10.4018/jicthd.2009091505openalex-snapshot
Enhancing Service Quality in Hospitals
inferred← citeshttps://doi.org/10.5120/7837-0773openalex-snapshot
Predicting Missing Items in Shopping Cart using Associative Classification 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.