On the public citation graph

Efficient Mining of Large Maximal Bicliques from 3D Symmetric Adjacency Matrix

0 signed · 32 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-49257-7_25openalex-snapshot
Discovering Frequent Closed Itemsets for Association Rules
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_23openalex-snapshot
New Algorithms for Enumerating All Maximal Cliques
inferredcites →https://doi.org/10.1016/0020-0190(94)90121-xopenalex-snapshot
Arboricity and bipartite subgraph listing algorithms
inferredcites →https://doi.org/10.1016/j.dam.2003.09.004openalex-snapshot
Consensus algorithms for the generation of all maximal bicliques
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.014openalex-snapshot
Generating bicliques of a graph in lexicographic order
inferredcites →https://doi.org/10.1016/s0166-218x(03)00333-0openalex-snapshot
The maximum edge biclique problem is NP-complete
inferredcites →https://doi.org/10.1023/b:dami.0000005258.31418.83openalex-snapshot
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
inferredcites →https://doi.org/10.1109/icdm.2006.162openalex-snapshot
TRIAS--An Algorithm for Mining Iceberg Tri-Lattices
inferredcites →https://doi.org/10.1109/tkde.2005.166openalex-snapshot
Fast algorithms for frequent itemset mining using FP-trees
inferredcites →https://doi.org/10.1109/tkde.2005.60openalex-snapshot
Efficient algorithms for mining closed itemsets and their lattice structure
inferredcites →https://doi.org/10.1109/tkde.2006.10openalex-snapshot
Fast and memory efficient mining of frequent closed itemsets
inferredcites →https://doi.org/10.1109/tkde.2006.1599386openalex-snapshot
A transaction mapping algorithm for frequent itemsets mining
inferredcites →https://doi.org/10.1109/tkde.2006.52openalex-snapshot
A transaction mapping algorithm for frequent itemsets mining
inferredcites →https://doi.org/10.1109/tkde.2007.1047openalex-snapshot
Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
inferredcites →https://doi.org/10.1109/tkde.2007.190660openalex-snapshot
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms
inferredcites →https://doi.org/10.1145/1497577.1497580openalex-snapshot
Closed patterns meet n -ary relations
inferredcites →https://doi.org/10.3233/ida-2005-9105openalex-snapshot
Constraint-based concept mining and its application to microarray data analysis
inferredcites →https://doi.org/10.5555/1182635.1164197openalex-snapshot
Mining frequent closed cubes in 3D datasets

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-32591-6_1openalex-snapshot
Efficient Algorithm for Maximal Biclique Enumeration on Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-32591-6_35openalex-snapshot
An Efficient Algorithm for Enumerating Maximal Bicliques from a Dynamically Growing Graph
inferred← citeshttps://doi.org/10.1016/j.datak.2021.101927openalex-snapshot
Mining Closed High Utility Itemsets based on Propositional Satisfiability
inferred← citeshttps://doi.org/10.1016/j.eswa.2013.07.094openalex-snapshot
Sliding window based weighted maximal frequent pattern mining over data streams
inferred← citeshttps://doi.org/10.1016/j.knosys.2013.10.011openalex-snapshot
Mining maximal frequent patterns by considering weight conditions over data streams
inferred← citeshttps://doi.org/10.1109/eait.2012.6407897openalex-snapshot
A novel algorithm for enumerating maximal bicliques from a symmetric matrix
inferred← citeshttps://doi.org/10.1109/icccbda.2018.8386510openalex-snapshot
An algorithm for maximal bicliques searching in dynamic relationship graph
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00072openalex-snapshot
Maximum Biplex Search over Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icdm.2011.28openalex-snapshot
Boolean Tensor Factorizations
inferred← citeshttps://doi.org/10.1111/exsy.12158openalex-snapshot
Efficient representative pattern mining based on weight and maximality conditions
inferred← citeshttps://doi.org/10.1145/2660859.2660955openalex-snapshot
Removal of Mirror Bicliques from a Symmetric Matrix
inferred← citeshttps://doi.org/10.1145/3746252.3760927openalex-snapshot
From Bicliques to BiFlexi Cliques: A New Era of Bipartite Subgraph Discovery
inferred← citeshttps://doi.org/10.26599/tst.2024.9010009openalex-snapshot
Efficient Maximum Vertex (k,ℓ)-Biplex Computation on Bipartite Graphs
inferred← citeshttps://doi.org/10.3233/ida-130612openalex-snapshot
Efficient mining of maximal correlated weight frequent patterns
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.