On the public citation graph
Mining constrained gradients in large databases
0 signed · 67 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0100984openalex-snapshot
Discovery-driven exploration of OLAP data cubes
inferredcites →https://doi.org/10.1023/a:1009726021843openalex-snapshot
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
inferredcites →https://doi.org/10.1023/a:1015417610840openalex-snapshot
Cubegrades: Generalizing Association Rules
inferredcites →https://doi.org/10.1023/b:dami.0000023674.74932.4copenalex-snapshot
Pushing Convertible Constraints in Frequent Itemset Mining
inferredcites →https://doi.org/10.1109/icde.2000.839450openalex-snapshot
Efficient mining of constrained correlated sets
inferredcites →https://doi.org/10.1109/icde.2001.914856openalex-snapshot
Mining frequent itemsets with convertible constraints
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/233269.233333openalex-snapshot
Implementing data cubes efficiently
inferredcites →https://doi.org/10.1145/235968.233333openalex-snapshot
Implementing data cubes efficiently
inferredcites →https://doi.org/10.1145/248603.248616openalex-snapshot
An overview of data warehousing and OLAP technology
inferredcites →https://doi.org/10.1145/253260.253288openalex-snapshot
An array-based algorithm for simultaneous multidimensional aggregates
inferredcites →https://doi.org/10.1145/276304.276307openalex-snapshot
Exploratory mining and pruning optimizations of constrained associations rules
inferredcites →https://doi.org/10.1145/304181.304214openalex-snapshot
Bottom-up computation of sparse and Iceberg CUBE
inferredcites →https://doi.org/10.1145/304182.304214openalex-snapshot
Bottom-up computation of sparse and Iceberg CUBE
inferredcites →https://doi.org/10.1145/312129.312191openalex-snapshot
Efficient mining of emerging patterns
inferredcites →https://doi.org/10.1145/312129.312243openalex-snapshot
A statistical theory for quantitative association rules
inferredcites →https://doi.org/10.1145/335191.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/342009.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/375663.375664openalex-snapshot
Efficient computation of Iceberg cubes with complex measures
inferredcites →https://doi.org/10.7551/mitpress/4472.003.0029openalex-snapshot
Implementing Data Cubes Efficiently
inferredcites →https://doi.org/10.7551/mitpress/4472.003.0030openalex-snapshot
On the Computation of Multidimensional Aggregates
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/widm.10openalex-snapshot
Fundamentals of association rules in data mining and knowledge discovery
inferred← citeshttps://doi.org/10.1007/11811220_52openalex-snapshot
Efficient Computation of Multi-feature Data Cubes
inferred← citeshttps://doi.org/10.1007/978-3-540-71701-0_38openalex-snapshot
gPrune: A Constraint Pushing Framework for Graph Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-540-74553-2_35openalex-snapshot
Mining Top-K Multidimensional Gradients
inferred← citeshttps://doi.org/10.1007/978-3-642-25781-0_67openalex-snapshot
A Web Log Mining System Based on MDP Algorithm
inferred← citeshttps://doi.org/10.1007/s10489-008-0130-2openalex-snapshot
Strategies for complex data cube queries
inferred← citeshttps://doi.org/10.1007/s10618-006-0059-1openalex-snapshot
Frequent pattern mining: current status and future directions
inferred← citeshttps://doi.org/10.1007/s10844-024-00866-9openalex-snapshot
Heuristic approaches for non-exhaustive pattern-based change detection in dynamic networks
inferred← citeshttps://doi.org/10.1007/s41066-020-00245-zopenalex-snapshot
Rough approximation models via graphs based on neighborhood systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-811760-6.00015-1openalex-snapshot
Pattern mining: advanced methods
inferred← citeshttps://doi.org/10.1016/j.eswa.2010.09.033openalex-snapshot
Techniques for finding similarity knowledge in OLAP reports
inferred← citeshttps://doi.org/10.1016/j.ijar.2009.11.001openalex-snapshot
Reduction about approximation spaces of covering generalized rough sets
inferred← citeshttps://doi.org/10.1016/j.ins.2006.06.009openalex-snapshot
Topological approaches to covering rough sets
inferred← citeshttps://doi.org/10.1016/j.ins.2007.05.037openalex-snapshot
Generalized rough sets based on relations
inferred← citeshttps://doi.org/10.1016/j.ins.2010.05.012openalex-snapshot
Multidimensional cyclic graph approach: Representing a data cube without common sub-graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2010.12.022openalex-snapshot
Extracting semantics in OLAP databases using emerging cubes
inferred← citeshttps://doi.org/10.1016/j.ins.2012.11.005openalex-snapshot
Related family: A new method for attribute reduction of covering information systems
inferred← citeshttps://doi.org/10.1016/j.knosys.2011.06.010openalex-snapshot
Multi knowledge based rough approximations and applications
inferred← citeshttps://doi.org/10.1109/grc.2012.6468633openalex-snapshot
A new method of attribute reduction of covering rough sets
inferred← citeshttps://doi.org/10.1109/grc.2014.6982862openalex-snapshot
Dimensionality reduction of hypergraph information system
inferred← citeshttps://doi.org/10.1109/iccea.2010.204openalex-snapshot
Applying Multi-dimensional Scaling Analysis for Finding Similarity Knowledge in OLAP Reports
inferred← citeshttps://doi.org/10.1109/iccea.2010.231openalex-snapshot
Applying Clustering Analysis on Grouping Similar OLAP Reports
inferred← citeshttps://doi.org/10.1109/icdim.2011.6093354openalex-snapshot
Mining cyclic association rules from multidimensional knowledge
inferred← citeshttps://doi.org/10.1109/icoin.2019.8718147openalex-snapshot
Post-Mining of Generalized Association Rules from Data Cubes
inferred← citeshttps://doi.org/10.1109/tkde.2011.233openalex-snapshot
Discovering Temporal Change Patterns in the Presence of Taxonomies
inferred← citeshttps://doi.org/10.1145/1117454.1117460openalex-snapshot
The case for anomalous link discovery
inferred← citeshttps://doi.org/10.1145/1183512.1183517openalex-snapshot
Enhanced mining of association rules from data cubes
inferred← citeshttps://doi.org/10.1155/2012/970576openalex-snapshot
A Granular Reduction Algorithm Based on Covering Rough Sets
inferred← citeshttps://doi.org/10.1201/b12986-34openalex-snapshot
Mining Emerging Patterns for Activity Recognition
inferred← citeshttps://doi.org/10.1504/ijbidm.2009.029073openalex-snapshot
Mining significant change patterns in multidimensional spaces
inferred← citeshttps://doi.org/10.1504/ijbidm.2015.071324openalex-snapshot
High performance framework for mining association rules from hierarchical data cubes
inferred← citeshttps://doi.org/10.15623/ijret.2013.0202017openalex-snapshot
EVALUATION ON DIFFERENT APPROACHES OF CYCLIC ASSOCIATION RULES
inferred← citeshttps://doi.org/10.17148/ijarcce.2015.4365openalex-snapshot
Survey on a Trust-Aware System for Personalized User Recommendations in Social Networks
inferred← citeshttps://doi.org/10.3233/fi-2016-1418openalex-snapshot
Topological Structure of Relation-based Generalized Rough Sets
inferred← citeshttps://doi.org/10.4018/978-1-60566-748-5.ch011openalex-snapshot
Ranking Gradients in Multi-Dimensional Spaces
inferred← citeshttps://doi.org/10.4018/978-1-61350-474-1.ch012openalex-snapshot
Constrained Cube Lattices for Multidimensional Database Mining
inferred← citeshttps://doi.org/10.4018/jdwm.2010070104openalex-snapshot
Constrained Cube Lattices for Multidimensional Database Mining
inferred← citeshttps://doi.org/10.70675/6c404c54z5300z40e1z8f14z922bca288848openalex-snapshot
Recherche de motifs graduels et application aux données médicales
inferred← citeshttps://doi.org/10.9790/0661-1618101103openalex-snapshot
Finding Fast Changing Patterns In the presence of hierarchy
inferred← citeshttps://doi.org/10.9790/0661-16254953openalex-snapshot
Survey on Discovering rapid Changing Patterns In the presence of Hierarchy
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.